./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-send-receive.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/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_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-send-receive.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/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_458b726a-4dd6-4119-9c6e-1265f449307a/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 238e609d3671ff2de494998b0abc6a14651375b5eb423e7b66fc3d987b466268 --- 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 03:57:27,906 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 03:57:27,909 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 03:57:27,965 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 03:57:27,966 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 03:57:27,972 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 03:57:27,974 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 03:57:27,977 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 03:57:27,984 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 03:57:27,988 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 03:57:27,989 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 03:57:27,994 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 03:57:27,996 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 03:57:27,997 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 03:57:28,002 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 03:57:28,003 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 03:57:28,005 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 03:57:28,013 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 03:57:28,015 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 03:57:28,017 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 03:57:28,019 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 03:57:28,023 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 03:57:28,024 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 03:57:28,026 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 03:57:28,031 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 03:57:28,038 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 03:57:28,039 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 03:57:28,040 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 03:57:28,042 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 03:57:28,043 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 03:57:28,044 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 03:57:28,046 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 03:57:28,047 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 03:57:28,049 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 03:57:28,051 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 03:57:28,052 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 03:57:28,052 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 03:57:28,053 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 03:57:28,053 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 03:57:28,054 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 03:57:28,055 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 03:57:28,056 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 03:57:28,113 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 03:57:28,114 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 03:57:28,115 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 03:57:28,115 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 03:57:28,116 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 03:57:28,116 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 03:57:28,116 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 03:57:28,117 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 03:57:28,117 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 03:57:28,117 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 03:57:28,119 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 03:57:28,119 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 03:57:28,119 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 03:57:28,120 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 03:57:28,120 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 03:57:28,120 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 03:57:28,121 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 03:57:28,121 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 03:57:28,122 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 03:57:28,122 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 03:57:28,122 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 03:57:28,123 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 03:57:28,123 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 03:57:28,123 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 03:57:28,123 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 03:57:28,124 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 03:57:28,124 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 03:57:28,124 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 03:57:28,124 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 03:57:28,125 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 03:57:28,125 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 03:57:28,126 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 03:57:28,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:57:28,126 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 03:57:28,127 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 03:57:28,127 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 03:57:28,127 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 03:57:28,127 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 03:57:28,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 03:57:28,128 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 03:57:28,128 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 03:57:28,128 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_458b726a-4dd6-4119-9c6e-1265f449307a/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_458b726a-4dd6-4119-9c6e-1265f449307a/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 -> 238e609d3671ff2de494998b0abc6a14651375b5eb423e7b66fc3d987b466268 [2022-11-03 03:57:28,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 03:57:28,569 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 03:57:28,572 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 03:57:28,574 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 03:57:28,575 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 03:57:28,577 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/weaver/popl20-send-receive.wvr.c [2022-11-03 03:57:28,676 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/data/54734fff4/b2f3af59d75e46d5911b48ebb66a5a68/FLAG9aba03692 [2022-11-03 03:57:29,328 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 03:57:29,329 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/sv-benchmarks/c/weaver/popl20-send-receive.wvr.c [2022-11-03 03:57:29,339 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/data/54734fff4/b2f3af59d75e46d5911b48ebb66a5a68/FLAG9aba03692 [2022-11-03 03:57:29,671 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/data/54734fff4/b2f3af59d75e46d5911b48ebb66a5a68 [2022-11-03 03:57:29,674 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 03:57:29,676 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 03:57:29,678 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 03:57:29,678 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 03:57:29,683 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 03:57:29,683 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:57:29" (1/1) ... [2022-11-03 03:57:29,686 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c3e17d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:57:29, skipping insertion in model container [2022-11-03 03:57:29,687 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:57:29" (1/1) ... [2022-11-03 03:57:29,696 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 03:57:29,735 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 03:57:30,039 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_458b726a-4dd6-4119-9c6e-1265f449307a/sv-benchmarks/c/weaver/popl20-send-receive.wvr.c[3107,3120] [2022-11-03 03:57:30,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:57:30,056 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 03:57:30,086 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_458b726a-4dd6-4119-9c6e-1265f449307a/sv-benchmarks/c/weaver/popl20-send-receive.wvr.c[3107,3120] [2022-11-03 03:57:30,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 03:57:30,108 INFO L208 MainTranslator]: Completed translation [2022-11-03 03:57:30,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:57:30 WrapperNode [2022-11-03 03:57:30,108 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 03:57:30,109 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 03:57:30,109 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 03:57:30,109 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 03:57:30,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:57:30" (1/1) ... [2022-11-03 03:57:30,148 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:57:30" (1/1) ... [2022-11-03 03:57:30,184 INFO L138 Inliner]: procedures = 25, calls = 52, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 161 [2022-11-03 03:57:30,184 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 03:57:30,185 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 03:57:30,185 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 03:57:30,186 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 03:57:30,197 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:57:30" (1/1) ... [2022-11-03 03:57:30,197 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:57:30" (1/1) ... [2022-11-03 03:57:30,201 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:57:30" (1/1) ... [2022-11-03 03:57:30,201 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:57:30" (1/1) ... [2022-11-03 03:57:30,209 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:57:30" (1/1) ... [2022-11-03 03:57:30,214 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:57:30" (1/1) ... [2022-11-03 03:57:30,216 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:57:30" (1/1) ... [2022-11-03 03:57:30,217 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:57:30" (1/1) ... [2022-11-03 03:57:30,220 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 03:57:30,221 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 03:57:30,221 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 03:57:30,222 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 03:57:30,227 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:57:30" (1/1) ... [2022-11-03 03:57:30,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 03:57:30,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:57:30,285 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 03:57:30,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 03:57:30,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 03:57:30,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 03:57:30,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 03:57:30,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 03:57:30,340 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-03 03:57:30,340 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-03 03:57:30,341 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-03 03:57:30,341 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-03 03:57:30,341 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-03 03:57:30,341 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-03 03:57:30,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 03:57:30,342 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-03 03:57:30,342 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-03 03:57:30,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 03:57:30,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 03:57:30,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 03:57:30,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 03:57:30,345 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 03:57:30,505 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 03:57:30,507 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 03:57:31,032 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 03:57:31,199 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 03:57:31,199 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-03 03:57:31,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:57:31 BoogieIcfgContainer [2022-11-03 03:57:31,206 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 03:57:31,210 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 03:57:31,211 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 03:57:31,215 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 03:57:31,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 03:57:29" (1/3) ... [2022-11-03 03:57:31,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12ada92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:57:31, skipping insertion in model container [2022-11-03 03:57:31,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:57:30" (2/3) ... [2022-11-03 03:57:31,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12ada92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:57:31, skipping insertion in model container [2022-11-03 03:57:31,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:57:31" (3/3) ... [2022-11-03 03:57:31,219 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-send-receive.wvr.c [2022-11-03 03:57:31,230 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-03 03:57:31,243 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 03:57:31,243 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-03 03:57:31,243 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-03 03:57:31,312 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-03 03:57:31,375 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 03:57:31,390 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 142 transitions, 308 flow [2022-11-03 03:57:31,401 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 142 transitions, 308 flow [2022-11-03 03:57:31,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 142 transitions, 308 flow [2022-11-03 03:57:31,576 INFO L130 PetriNetUnfolder]: 10/139 cut-off events. [2022-11-03 03:57:31,577 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-03 03:57:31,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 10/139 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 96 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 116. Up to 2 conditions per place. [2022-11-03 03:57:31,586 INFO L118 LiptonReduction]: Number of co-enabled transitions 1308 [2022-11-03 03:57:39,792 INFO L133 LiptonReduction]: Checked pairs total: 2100 [2022-11-03 03:57:39,792 INFO L135 LiptonReduction]: Total number of compositions: 129 [2022-11-03 03:57:39,802 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 28 transitions, 80 flow [2022-11-03 03:57:39,834 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 129 states, 128 states have (on average 2.78125) internal successors, (356), 128 states have internal predecessors, (356), 0 states have call successors, (0), 0 states 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 03:57:39,857 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 03:57:39,865 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;@7499fbdb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 03:57:39,865 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-03 03:57:39,868 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 128 states have (on average 2.78125) internal successors, (356), 128 states have internal predecessors, (356), 0 states have call successors, (0), 0 states 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 03:57:39,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 03:57:39,877 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:57:39,878 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:57:39,878 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 03:57:39,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:57:39,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1446509100, now seen corresponding path program 1 times [2022-11-03 03:57:39,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:57:39,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962477738] [2022-11-03 03:57:39,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:57:39,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:57:40,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:57:40,549 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 03:57:40,550 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:57:40,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962477738] [2022-11-03 03:57:40,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962477738] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:57:40,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:57:40,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:57:40,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841908557] [2022-11-03 03:57:40,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:57:40,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:57:40,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:57:40,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:57:40,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:57:40,592 INFO L87 Difference]: Start difference. First operand has 129 states, 128 states have (on average 2.78125) internal successors, (356), 128 states have internal predecessors, (356), 0 states have call successors, (0), 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 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:57:40,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:57:40,801 INFO L93 Difference]: Finished difference Result 117 states and 312 transitions. [2022-11-03 03:57:40,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:57:40,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-03 03:57:40,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:57:40,825 INFO L225 Difference]: With dead ends: 117 [2022-11-03 03:57:40,825 INFO L226 Difference]: Without dead ends: 117 [2022-11-03 03:57:40,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 03:57:40,833 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 29 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:57:40,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 0 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:57:40,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-03 03:57:40,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 109. [2022-11-03 03:57:40,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 2.7037037037037037) internal successors, (292), 108 states have internal predecessors, (292), 0 states have call successors, (0), 0 states 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 03:57:40,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 292 transitions. [2022-11-03 03:57:40,910 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 292 transitions. Word has length 19 [2022-11-03 03:57:40,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:57:40,911 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 292 transitions. [2022-11-03 03:57:40,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:57:40,912 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 292 transitions. [2022-11-03 03:57:40,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 03:57:40,917 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:57:40,917 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:57:40,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 03:57:40,918 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 03:57:40,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:57:40,919 INFO L85 PathProgramCache]: Analyzing trace with hash 802365812, now seen corresponding path program 2 times [2022-11-03 03:57:40,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:57:40,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386659742] [2022-11-03 03:57:40,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:57:40,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:57:40,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:57:41,209 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 03:57:41,210 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:57:41,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386659742] [2022-11-03 03:57:41,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386659742] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:57:41,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:57:41,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:57:41,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399843290] [2022-11-03 03:57:41,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:57:41,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:57:41,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:57:41,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:57:41,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:57:41,219 INFO L87 Difference]: Start difference. First operand 109 states and 292 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:57:41,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:57:41,418 INFO L93 Difference]: Finished difference Result 121 states and 311 transitions. [2022-11-03 03:57:41,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 03:57:41,419 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-03 03:57:41,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:57:41,424 INFO L225 Difference]: With dead ends: 121 [2022-11-03 03:57:41,424 INFO L226 Difference]: Without dead ends: 121 [2022-11-03 03:57:41,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 03:57:41,427 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 25 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:57:41,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 0 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:57:41,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-11-03 03:57:41,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 109. [2022-11-03 03:57:41,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 2.611111111111111) internal successors, (282), 108 states have internal predecessors, (282), 0 states have call successors, (0), 0 states 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 03:57:41,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 282 transitions. [2022-11-03 03:57:41,443 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 282 transitions. Word has length 19 [2022-11-03 03:57:41,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:57:41,444 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 282 transitions. [2022-11-03 03:57:41,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:57:41,444 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 282 transitions. [2022-11-03 03:57:41,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 03:57:41,446 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:57:41,446 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:57:41,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 03:57:41,451 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 03:57:41,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:57:41,452 INFO L85 PathProgramCache]: Analyzing trace with hash 241621944, now seen corresponding path program 3 times [2022-11-03 03:57:41,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:57:41,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247708175] [2022-11-03 03:57:41,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:57:41,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:57:41,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:57:41,761 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 03:57:41,762 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:57:41,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247708175] [2022-11-03 03:57:41,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247708175] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:57:41,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:57:41,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 03:57:41,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900342356] [2022-11-03 03:57:41,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:57:41,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 03:57:41,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:57:41,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 03:57:41,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 03:57:41,765 INFO L87 Difference]: Start difference. First operand 109 states and 282 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:57:41,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:57:41,980 INFO L93 Difference]: Finished difference Result 195 states and 496 transitions. [2022-11-03 03:57:41,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 03:57:41,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-03 03:57:41,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:57:41,982 INFO L225 Difference]: With dead ends: 195 [2022-11-03 03:57:41,983 INFO L226 Difference]: Without dead ends: 123 [2022-11-03 03:57:41,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-03 03:57:41,984 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 56 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:57:41,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 0 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 03:57:41,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-03 03:57:41,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 113. [2022-11-03 03:57:41,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 2.5714285714285716) internal successors, (288), 112 states have internal predecessors, (288), 0 states have call successors, (0), 0 states 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 03:57:41,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 288 transitions. [2022-11-03 03:57:41,993 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 288 transitions. Word has length 19 [2022-11-03 03:57:41,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:57:41,993 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 288 transitions. [2022-11-03 03:57:41,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:57:41,994 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 288 transitions. [2022-11-03 03:57:41,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 03:57:41,995 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:57:41,995 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 03:57:41,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 03:57:41,996 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 03:57:41,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:57:41,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1786331947, now seen corresponding path program 1 times [2022-11-03 03:57:41,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:57:41,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760033788] [2022-11-03 03:57:41,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:57:41,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:57:42,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:57:42,118 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 03:57:42,118 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:57:42,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760033788] [2022-11-03 03:57:42,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760033788] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:57:42,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:57:42,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 03:57:42,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457764727] [2022-11-03 03:57:42,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:57:42,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 03:57:42,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:57:42,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 03:57:42,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:57:42,121 INFO L87 Difference]: Start difference. First operand 113 states and 288 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:57:42,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:57:42,180 INFO L93 Difference]: Finished difference Result 99 states and 242 transitions. [2022-11-03 03:57:42,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 03:57:42,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-03 03:57:42,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:57:42,182 INFO L225 Difference]: With dead ends: 99 [2022-11-03 03:57:42,182 INFO L226 Difference]: Without dead ends: 99 [2022-11-03 03:57:42,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 03:57:42,183 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 7 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:57:42,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 6 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:57:42,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-03 03:57:42,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-11-03 03:57:42,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 2.4693877551020407) internal successors, (242), 98 states have internal predecessors, (242), 0 states have call successors, (0), 0 states 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 03:57:42,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 242 transitions. [2022-11-03 03:57:42,194 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 242 transitions. Word has length 21 [2022-11-03 03:57:42,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:57:42,194 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 242 transitions. [2022-11-03 03:57:42,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:57:42,194 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 242 transitions. [2022-11-03 03:57:42,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 03:57:42,196 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:57:42,196 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:57:42,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 03:57:42,196 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 03:57:42,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:57:42,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1082920467, now seen corresponding path program 1 times [2022-11-03 03:57:42,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:57:42,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569544248] [2022-11-03 03:57:42,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:57:42,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:57:42,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:57:42,352 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 03:57:42,353 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:57:42,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569544248] [2022-11-03 03:57:42,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569544248] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 03:57:42,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 03:57:42,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 03:57:42,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823150423] [2022-11-03 03:57:42,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 03:57:42,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 03:57:42,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:57:42,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 03:57:42,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 03:57:42,360 INFO L87 Difference]: Start difference. First operand 99 states and 242 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:57:42,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:57:42,444 INFO L93 Difference]: Finished difference Result 121 states and 279 transitions. [2022-11-03 03:57:42,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 03:57:42,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-03 03:57:42,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:57:42,446 INFO L225 Difference]: With dead ends: 121 [2022-11-03 03:57:42,446 INFO L226 Difference]: Without dead ends: 100 [2022-11-03 03:57:42,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 03:57:42,449 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 12 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 03:57:42,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 9 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 03:57:42,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-03 03:57:42,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-11-03 03:57:42,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 2.4545454545454546) internal successors, (243), 99 states have internal predecessors, (243), 0 states have call successors, (0), 0 states 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 03:57:42,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 243 transitions. [2022-11-03 03:57:42,472 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 243 transitions. Word has length 23 [2022-11-03 03:57:42,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:57:42,472 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 243 transitions. [2022-11-03 03:57:42,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:57:42,473 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 243 transitions. [2022-11-03 03:57:42,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 03:57:42,474 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:57:42,474 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 03:57:42,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 03:57:42,474 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 03:57:42,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:57:42,475 INFO L85 PathProgramCache]: Analyzing trace with hash 489118338, now seen corresponding path program 1 times [2022-11-03 03:57:42,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:57:42,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749546708] [2022-11-03 03:57:42,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:57:42,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:57:42,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:57:44,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:57:44,270 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:57:44,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749546708] [2022-11-03 03:57:44,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749546708] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:57:44,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784257120] [2022-11-03 03:57:44,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:57:44,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:57:44,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:57:44,276 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:57:44,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 03:57:44,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:57:44,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-03 03:57:44,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:57:44,617 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 15 treesize of output 11 [2022-11-03 03:57:44,728 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 03:57:44,840 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 03:57:45,016 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 23 treesize of output 7 [2022-11-03 03:57:45,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:57:45,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:57:46,086 WARN L833 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (let ((.cse1 (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_148 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_147) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_148) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (<= 0 (+ (select .cse0 .cse1) c_~sum~0)) (not (= (select .cse0 .cse2) 1))))) (forall ((v_ArrVal_148 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_147) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_148) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (<= (+ (select .cse3 .cse1) c_~sum~0) 1) (not (= (select .cse3 .cse2) 1))))))) (< |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))) is different from false [2022-11-03 03:57:46,144 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:57:46,145 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 62 treesize of output 50 [2022-11-03 03:57:46,176 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:57:46,176 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 148 treesize of output 144 [2022-11-03 03:57:46,196 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:57:46,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 120 [2022-11-03 03:57:46,225 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:57:46,226 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 83 treesize of output 83 [2022-11-03 03:57:46,689 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:57:46,689 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 62 treesize of output 50 [2022-11-03 03:57:46,713 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-03 03:57:46,713 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 316 treesize of output 288 [2022-11-03 03:57:46,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:46,733 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 212 treesize of output 188 [2022-11-03 03:57:46,753 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-03 03:57:46,754 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 260 treesize of output 216 [2022-11-03 03:57:46,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-03 03:57:46,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784257120] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:57:46,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1324263919] [2022-11-03 03:57:46,982 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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 03:57:46,989 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:57:46,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 28 [2022-11-03 03:57:46,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756875150] [2022-11-03 03:57:46,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:57:46,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-03 03:57:46,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:57:46,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-03 03:57:46,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=624, Unknown=4, NotChecked=52, Total=812 [2022-11-03 03:57:46,994 INFO L87 Difference]: Start difference. First operand 100 states and 243 transitions. Second operand has 29 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 28 states have internal predecessors, (51), 0 states have call successors, (0), 0 states 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 03:57:48,564 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse4 (+ c_~queue~0.offset (* c_~front~0 4))) (.cse5 (+ c_~queue~0.offset (* c_~back~0 4)))) (and (forall ((v_ArrVal_148 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_148) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse3 .cse4))) (not (= (select .cse3 .cse5) 1))))) (forall ((v_ArrVal_148 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_148) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse6 .cse4)) 1) (not (= (select .cse6 .cse5) 1)))))))) (.cse1 (not (< c_~back~0 c_~n~0))) (.cse2 (not (<= 0 c_~back~0)))) (and (or (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) .cse0 .cse1 .cse2) (or (= (mod c_~v_assert~0 256) 0) .cse0 .cse1 .cse2))) is different from false [2022-11-03 03:57:50,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:57:50,404 INFO L93 Difference]: Finished difference Result 318 states and 815 transitions. [2022-11-03 03:57:50,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-03 03:57:50,405 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 28 states have internal predecessors, (51), 0 states have call successors, (0), 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 03:57:50,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:57:50,406 INFO L225 Difference]: With dead ends: 318 [2022-11-03 03:57:50,406 INFO L226 Difference]: Without dead ends: 246 [2022-11-03 03:57:50,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=504, Invalid=1922, Unknown=32, NotChecked=194, Total=2652 [2022-11-03 03:57:50,408 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 191 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 1080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 239 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-03 03:57:50,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 17 Invalid, 1080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 783 Invalid, 0 Unknown, 239 Unchecked, 1.0s Time] [2022-11-03 03:57:50,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-11-03 03:57:50,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 154. [2022-11-03 03:57:50,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 2.3986928104575163) internal successors, (367), 153 states have internal predecessors, (367), 0 states have call successors, (0), 0 states 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 03:57:50,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 367 transitions. [2022-11-03 03:57:50,434 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 367 transitions. Word has length 24 [2022-11-03 03:57:50,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:57:50,435 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 367 transitions. [2022-11-03 03:57:50,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 28 states have internal predecessors, (51), 0 states have call successors, (0), 0 states 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 03:57:50,435 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 367 transitions. [2022-11-03 03:57:50,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 03:57:50,439 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:57:50,440 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 03:57:50,483 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 03:57:50,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-03 03:57:50,647 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 03:57:50,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:57:50,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1554152946, now seen corresponding path program 2 times [2022-11-03 03:57:50,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:57:50,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416172856] [2022-11-03 03:57:50,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:57:50,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:57:50,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:57:51,839 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:57:51,839 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:57:51,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416172856] [2022-11-03 03:57:51,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416172856] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:57:51,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197710983] [2022-11-03 03:57:51,840 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:57:51,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:57:51,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:57:51,843 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:57:51,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 03:57:52,046 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 03:57:52,047 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:57:52,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-03 03:57:52,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:57:52,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:57:52,430 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 18 treesize of output 20 [2022-11-03 03:57:52,497 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 23 treesize of output 7 [2022-11-03 03:57:52,583 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 03:57:52,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:57:52,780 WARN L833 $PredicateComparison]: unable to prove that (or (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_193 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_193 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) c_~queue~0.base) .cse0))))))) is different from false [2022-11-03 03:57:52,831 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:57:52,832 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 110 treesize of output 90 [2022-11-03 03:57:52,841 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 53 treesize of output 47 [2022-11-03 03:57:52,848 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 47 treesize of output 41 [2022-11-03 03:57:53,497 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 03:57:53,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197710983] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:57:53,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [671477408] [2022-11-03 03:57:53,497 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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 03:57:53,498 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:57:53,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 28 [2022-11-03 03:57:53,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5327519] [2022-11-03 03:57:53,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:57:53,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-03 03:57:53,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:57:53,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-03 03:57:53,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=650, Unknown=1, NotChecked=52, Total=812 [2022-11-03 03:57:53,500 INFO L87 Difference]: Start difference. First operand 154 states and 367 transitions. Second operand has 29 states, 29 states have (on average 1.9310344827586208) internal successors, (56), 28 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:58:12,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:58:12,532 INFO L93 Difference]: Finished difference Result 1414 states and 3727 transitions. [2022-11-03 03:58:12,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2022-11-03 03:58:12,533 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.9310344827586208) internal successors, (56), 28 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-03 03:58:12,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:58:12,542 INFO L225 Difference]: With dead ends: 1414 [2022-11-03 03:58:12,542 INFO L226 Difference]: Without dead ends: 1414 [2022-11-03 03:58:12,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 28 SyntacticMatches, 7 SemanticMatches, 174 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 12338 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=3438, Invalid=26942, Unknown=74, NotChecked=346, Total=30800 [2022-11-03 03:58:12,550 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 676 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 1650 mSolverCounterSat, 431 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 2855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 431 IncrementalHoareTripleChecker+Valid, 1650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 774 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-03 03:58:12,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 69 Invalid, 2855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [431 Valid, 1650 Invalid, 0 Unknown, 774 Unchecked, 2.6s Time] [2022-11-03 03:58:12,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2022-11-03 03:58:12,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 583. [2022-11-03 03:58:12,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 582 states have (on average 2.695876288659794) internal successors, (1569), 582 states have internal predecessors, (1569), 0 states have call successors, (0), 0 states 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 03:58:12,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 1569 transitions. [2022-11-03 03:58:12,587 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 1569 transitions. Word has length 24 [2022-11-03 03:58:12,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:58:12,588 INFO L495 AbstractCegarLoop]: Abstraction has 583 states and 1569 transitions. [2022-11-03 03:58:12,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.9310344827586208) internal successors, (56), 28 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:58:12,589 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 1569 transitions. [2022-11-03 03:58:12,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 03:58:12,591 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:58:12,591 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 03:58:12,639 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 03:58:12,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-03 03:58:12,803 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 03:58:12,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:58:12,804 INFO L85 PathProgramCache]: Analyzing trace with hash 649607107, now seen corresponding path program 3 times [2022-11-03 03:58:12,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:58:12,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834845386] [2022-11-03 03:58:12,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:58:12,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:58:12,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:58:14,395 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:58:14,396 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:58:14,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834845386] [2022-11-03 03:58:14,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834845386] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:58:14,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936827185] [2022-11-03 03:58:14,396 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:58:14,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:58:14,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:58:14,403 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:58:14,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 03:58:14,533 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:58:14,533 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:58:14,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-03 03:58:14,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:58:14,713 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 23 treesize of output 7 [2022-11-03 03:58:14,785 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 03:58:14,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:58:14,994 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:58:14,995 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 68 treesize of output 48 [2022-11-03 03:58:15,241 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 03:58:15,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936827185] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:58:15,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [575344159] [2022-11-03 03:58:15,242 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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 03:58:15,243 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:58:15,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 7] total 22 [2022-11-03 03:58:15,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673602585] [2022-11-03 03:58:15,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:58:15,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-03 03:58:15,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:58:15,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-03 03:58:15,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2022-11-03 03:58:15,246 INFO L87 Difference]: Start difference. First operand 583 states and 1569 transitions. Second operand has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 22 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 03:58:17,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:58:17,335 INFO L93 Difference]: Finished difference Result 850 states and 2262 transitions. [2022-11-03 03:58:17,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-03 03:58:17,335 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 22 states have internal predecessors, (53), 0 states have call successors, (0), 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 03:58:17,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:58:17,340 INFO L225 Difference]: With dead ends: 850 [2022-11-03 03:58:17,340 INFO L226 Difference]: Without dead ends: 752 [2022-11-03 03:58:17,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=433, Invalid=1823, Unknown=0, NotChecked=0, Total=2256 [2022-11-03 03:58:17,342 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 210 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-03 03:58:17,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 3 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-03 03:58:17,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2022-11-03 03:58:17,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 563. [2022-11-03 03:58:17,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 562 states have (on average 2.7081850533807827) internal successors, (1522), 562 states have internal predecessors, (1522), 0 states have call successors, (0), 0 states 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 03:58:17,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 1522 transitions. [2022-11-03 03:58:17,367 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 1522 transitions. Word has length 25 [2022-11-03 03:58:17,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:58:17,368 INFO L495 AbstractCegarLoop]: Abstraction has 563 states and 1522 transitions. [2022-11-03 03:58:17,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 22 states have internal predecessors, (53), 0 states have call successors, (0), 0 states 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 03:58:17,368 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 1522 transitions. [2022-11-03 03:58:17,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 03:58:17,371 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:58:17,371 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 03:58:17,399 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 03:58:17,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:58:17,583 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 03:58:17,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:58:17,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1714641715, now seen corresponding path program 4 times [2022-11-03 03:58:17,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:58:17,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930406791] [2022-11-03 03:58:17,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:58:17,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:58:17,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:58:18,960 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:58:18,961 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:58:18,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930406791] [2022-11-03 03:58:18,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930406791] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:58:18,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612215688] [2022-11-03 03:58:18,961 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 03:58:18,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:58:18,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:58:18,963 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:58:18,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 03:58:19,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:58:19,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-03 03:58:19,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:58:19,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:19,390 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 18 treesize of output 20 [2022-11-03 03:58:19,427 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 23 treesize of output 7 [2022-11-03 03:58:19,517 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 03:58:19,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:58:19,670 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_290 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_290) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_290 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_290) c_~queue~0.base) .cse0)) 1)))) is different from false [2022-11-03 03:58:19,730 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:58:19,730 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 110 treesize of output 90 [2022-11-03 03:58:19,738 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 53 treesize of output 47 [2022-11-03 03:58:19,746 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 47 treesize of output 41 [2022-11-03 03:58:20,057 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 03:58:20,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612215688] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:58:20,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [311260198] [2022-11-03 03:58:20,058 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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 03:58:20,058 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:58:20,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 26 [2022-11-03 03:58:20,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243100407] [2022-11-03 03:58:20,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:58:20,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-03 03:58:20,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:58:20,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-03 03:58:20,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=560, Unknown=1, NotChecked=48, Total=702 [2022-11-03 03:58:20,060 INFO L87 Difference]: Start difference. First operand 563 states and 1522 transitions. Second operand has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 26 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 03:58:22,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:58:22,631 INFO L93 Difference]: Finished difference Result 843 states and 2237 transitions. [2022-11-03 03:58:22,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-03 03:58:22,632 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 26 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 03:58:22,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:58:22,635 INFO L225 Difference]: With dead ends: 843 [2022-11-03 03:58:22,636 INFO L226 Difference]: Without dead ends: 673 [2022-11-03 03:58:22,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=438, Invalid=1917, Unknown=1, NotChecked=94, Total=2450 [2022-11-03 03:58:22,637 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 259 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-03 03:58:22,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 16 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 926 Invalid, 0 Unknown, 104 Unchecked, 1.0s Time] [2022-11-03 03:58:22,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2022-11-03 03:58:22,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 391. [2022-11-03 03:58:22,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 390 states have (on average 2.6846153846153844) internal successors, (1047), 390 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states 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 03:58:22,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 1047 transitions. [2022-11-03 03:58:22,657 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 1047 transitions. Word has length 25 [2022-11-03 03:58:22,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:58:22,657 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 1047 transitions. [2022-11-03 03:58:22,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 26 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 03:58:22,658 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 1047 transitions. [2022-11-03 03:58:22,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-03 03:58:22,659 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:58:22,659 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 03:58:22,693 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 03:58:22,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:58:22,883 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 03:58:22,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:58:22,883 INFO L85 PathProgramCache]: Analyzing trace with hash 807666805, now seen corresponding path program 5 times [2022-11-03 03:58:22,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:58:22,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868316111] [2022-11-03 03:58:22,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:58:22,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:58:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:58:23,129 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 03:58:23,130 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:58:23,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868316111] [2022-11-03 03:58:23,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868316111] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:58:23,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499023124] [2022-11-03 03:58:23,131 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:58:23,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:58:23,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:58:23,132 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:58:23,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 03:58:23,330 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-03 03:58:23,330 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:58:23,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-03 03:58:23,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:58:23,404 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 12 treesize of output 3 [2022-11-03 03:58:23,436 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 03:58:23,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:58:23,618 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 136 treesize of output 104 [2022-11-03 03:58:23,729 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 03:58:23,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499023124] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:58:23,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1740706241] [2022-11-03 03:58:23,730 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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 03:58:23,731 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:58:23,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2022-11-03 03:58:23,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569778787] [2022-11-03 03:58:23,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:58:23,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 03:58:23,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:58:23,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 03:58:23,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2022-11-03 03:58:23,734 INFO L87 Difference]: Start difference. First operand 391 states and 1047 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:58:24,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:58:24,129 INFO L93 Difference]: Finished difference Result 624 states and 1510 transitions. [2022-11-03 03:58:24,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 03:58:24,130 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-03 03:58:24,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:58:24,133 INFO L225 Difference]: With dead ends: 624 [2022-11-03 03:58:24,134 INFO L226 Difference]: Without dead ends: 606 [2022-11-03 03:58:24,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=165, Unknown=0, NotChecked=0, Total=272 [2022-11-03 03:58:24,135 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 160 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:58:24,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 3 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:58:24,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2022-11-03 03:58:24,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 528. [2022-11-03 03:58:24,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 2.5502846299810247) internal successors, (1344), 527 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states 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 03:58:24,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 1344 transitions. [2022-11-03 03:58:24,156 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 1344 transitions. Word has length 26 [2022-11-03 03:58:24,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:58:24,156 INFO L495 AbstractCegarLoop]: Abstraction has 528 states and 1344 transitions. [2022-11-03 03:58:24,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:58:24,157 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 1344 transitions. [2022-11-03 03:58:24,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 03:58:24,159 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:58:24,159 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 03:58:24,170 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 03:58:24,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-03 03:58:24,365 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 03:58:24,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:58:24,365 INFO L85 PathProgramCache]: Analyzing trace with hash 579499377, now seen corresponding path program 6 times [2022-11-03 03:58:24,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:58:24,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621619116] [2022-11-03 03:58:24,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:58:24,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:58:24,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:58:24,549 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 03:58:24,549 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:58:24,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621619116] [2022-11-03 03:58:24,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621619116] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:58:24,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597192024] [2022-11-03 03:58:24,550 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:58:24,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:58:24,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:58:24,552 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:58:24,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 03:58:24,722 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:58:24,722 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:58:24,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-03 03:58:24,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:58:24,842 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 12 treesize of output 3 [2022-11-03 03:58:24,877 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 03:58:24,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:58:25,028 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 136 treesize of output 104 [2022-11-03 03:58:25,175 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 03:58:25,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597192024] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:58:25,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1127520334] [2022-11-03 03:58:25,176 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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 03:58:25,177 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:58:25,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 17 [2022-11-03 03:58:25,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832806400] [2022-11-03 03:58:25,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:58:25,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-03 03:58:25,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:58:25,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-03 03:58:25,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-11-03 03:58:25,183 INFO L87 Difference]: Start difference. First operand 528 states and 1344 transitions. Second operand has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 17 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:58:25,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:58:25,650 INFO L93 Difference]: Finished difference Result 302 states and 728 transitions. [2022-11-03 03:58:25,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 03:58:25,651 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 17 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-03 03:58:25,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:58:25,653 INFO L225 Difference]: With dead ends: 302 [2022-11-03 03:58:25,653 INFO L226 Difference]: Without dead ends: 241 [2022-11-03 03:58:25,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2022-11-03 03:58:25,654 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 91 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 03:58:25,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 5 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 03:58:25,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-11-03 03:58:25,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2022-11-03 03:58:25,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 240 states have (on average 2.591666666666667) internal successors, (622), 240 states have internal predecessors, (622), 0 states have call successors, (0), 0 states 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 03:58:25,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 622 transitions. [2022-11-03 03:58:25,668 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 622 transitions. Word has length 28 [2022-11-03 03:58:25,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:58:25,669 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 622 transitions. [2022-11-03 03:58:25,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 17 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:58:25,669 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 622 transitions. [2022-11-03 03:58:25,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-03 03:58:25,671 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:58:25,672 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:58:25,724 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 03:58:25,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-03 03:58:25,893 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 03:58:25,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:58:25,894 INFO L85 PathProgramCache]: Analyzing trace with hash -140118878, now seen corresponding path program 7 times [2022-11-03 03:58:25,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:58:25,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691405028] [2022-11-03 03:58:25,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:58:25,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:58:25,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:58:28,149 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:58:28,150 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:58:28,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691405028] [2022-11-03 03:58:28,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691405028] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:58:28,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111250944] [2022-11-03 03:58:28,151 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 03:58:28,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:58:28,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:58:28,152 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:58:28,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 03:58:28,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:58:28,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-03 03:58:28,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:58:28,896 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:58:28,896 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 48 treesize of output 14 [2022-11-03 03:58:29,004 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:58:29,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:58:29,643 INFO L356 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-03 03:58:29,643 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 224 treesize of output 194 [2022-11-03 03:58:31,019 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:58:31,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111250944] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:58:31,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1436440885] [2022-11-03 03:58:31,020 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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 03:58:31,022 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:58:31,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 34 [2022-11-03 03:58:31,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075706712] [2022-11-03 03:58:31,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:58:31,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-03 03:58:31,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:58:31,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-03 03:58:31,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1008, Unknown=0, NotChecked=0, Total=1190 [2022-11-03 03:58:31,024 INFO L87 Difference]: Start difference. First operand 241 states and 622 transitions. Second operand has 35 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 34 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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 03:58:43,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:58:43,141 INFO L93 Difference]: Finished difference Result 2357 states and 5918 transitions. [2022-11-03 03:58:43,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-11-03 03:58:43,141 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 34 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-03 03:58:43,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:58:43,152 INFO L225 Difference]: With dead ends: 2357 [2022-11-03 03:58:43,152 INFO L226 Difference]: Without dead ends: 1817 [2022-11-03 03:58:43,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5289 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=2220, Invalid=13032, Unknown=0, NotChecked=0, Total=15252 [2022-11-03 03:58:43,157 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 712 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 2125 mSolverCounterSat, 287 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 2412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 287 IncrementalHoareTripleChecker+Valid, 2125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-03 03:58:43,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 10 Invalid, 2412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [287 Valid, 2125 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-11-03 03:58:43,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1817 states. [2022-11-03 03:58:43,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1817 to 656. [2022-11-03 03:58:43,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 655 states have (on average 2.6717557251908395) internal successors, (1750), 655 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states 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 03:58:43,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1750 transitions. [2022-11-03 03:58:43,199 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1750 transitions. Word has length 29 [2022-11-03 03:58:43,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:58:43,200 INFO L495 AbstractCegarLoop]: Abstraction has 656 states and 1750 transitions. [2022-11-03 03:58:43,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 34 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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 03:58:43,200 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1750 transitions. [2022-11-03 03:58:43,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-03 03:58:43,202 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:58:43,202 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:58:43,255 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 03:58:43,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-03 03:58:43,423 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 03:58:43,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:58:43,424 INFO L85 PathProgramCache]: Analyzing trace with hash 924915730, now seen corresponding path program 8 times [2022-11-03 03:58:43,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:58:43,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933574344] [2022-11-03 03:58:43,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:58:43,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:58:43,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:58:45,831 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:58:45,832 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:58:45,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933574344] [2022-11-03 03:58:45,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933574344] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:58:45,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371358641] [2022-11-03 03:58:45,833 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:58:45,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:58:45,833 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:58:45,835 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:58:45,840 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 03:58:46,033 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-03 03:58:46,033 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:58:46,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-03 03:58:46,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:58:46,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:58:46,886 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 44 treesize of output 42 [2022-11-03 03:58:46,963 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:58:46,963 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 42 treesize of output 14 [2022-11-03 03:58:47,059 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:58:47,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:58:47,266 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_475 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_475 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse0)) 1)))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-11-03 03:58:47,326 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_475 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_475 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse0)) 1)))) (let ((.cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse2 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse1) (not (= (+ .cse2 1) 0))) (or .cse1 (not (= .cse2 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))) is different from false [2022-11-03 03:58:47,580 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod c_~v_assert~0 256) 0) (not (< c_~back~0 c_~n~0)) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse5 4)) (.cse4 (select .cse2 (+ c_~queue~0.offset .cse5)))) (and (forall ((v_ArrVal_475 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse3) .cse4) 1)) (forall ((v_ArrVal_475 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse3) .cse4)))))) (not (<= 0 c_~back~0)))) is different from false [2022-11-03 03:58:47,740 INFO L356 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-03 03:58:47,741 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 286 treesize of output 240 [2022-11-03 03:58:47,759 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 59 treesize of output 52 [2022-11-03 03:58:47,775 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 52 treesize of output 45 [2022-11-03 03:58:48,870 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-03 03:58:48,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371358641] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:58:48,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [700913322] [2022-11-03 03:58:48,871 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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 03:58:48,872 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:58:48,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13] total 37 [2022-11-03 03:58:48,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8994657] [2022-11-03 03:58:48,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:58:48,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-03 03:58:48,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:58:48,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-03 03:58:48,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1007, Unknown=10, NotChecked=204, Total=1406 [2022-11-03 03:58:48,875 INFO L87 Difference]: Start difference. First operand 656 states and 1750 transitions. Second operand has 38 states, 38 states have (on average 1.868421052631579) internal successors, (71), 37 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 03:58:50,495 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= c_~sum~0 0) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod c_~v_assert~0 256) 0) (not (< c_~back~0 c_~n~0)) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse5 4)) (.cse4 (select .cse2 (+ c_~queue~0.offset .cse5)))) (and (forall ((v_ArrVal_475 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse3) .cse4) 1)) (forall ((v_ArrVal_475 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse3) .cse4)))))) (not (<= 0 c_~back~0)))) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0)) is different from false [2022-11-03 03:58:50,720 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= c_~sum~0 0) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod c_~v_assert~0 256) 0) (not (< c_~back~0 c_~n~0)) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse5 4)) (.cse4 (select .cse2 (+ c_~queue~0.offset .cse5)))) (and (forall ((v_ArrVal_475 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse3) .cse4) 1)) (forall ((v_ArrVal_475 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse3) .cse4)))))) (not (<= 0 c_~back~0)))) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-11-03 03:58:53,761 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= 0 c_~sum~0) (<= c_~sum~0 1) (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_475 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_475 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse0)) 1)))) (let ((.cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse2 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse1) (not (= (+ .cse2 1) 0))) (or .cse1 (not (= .cse2 1))))) (= (mod c_~v_assert~0 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)))) is different from false [2022-11-03 03:58:54,722 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_475 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_475 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse0)) 1)))) (let ((.cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse2 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse1) (not (= (+ .cse2 1) 0))) (or .cse1 (not (= .cse2 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= 1 c_~v_assert~0) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-11-03 03:58:54,914 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod c_~v_assert~0 256) 0) (not (< c_~back~0 c_~n~0)) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse5 4)) (.cse4 (select .cse2 (+ c_~queue~0.offset .cse5)))) (and (forall ((v_ArrVal_475 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse3) .cse4) 1)) (forall ((v_ArrVal_475 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse3) .cse4)))))) (not (<= 0 c_~back~0)))) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-11-03 03:58:56,480 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= 1 c_~v_assert~0) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_475 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_475 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse0)) 1)))) (let ((.cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse2 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse1) (not (= (+ .cse2 1) 0))) (or .cse1 (not (= .cse2 1))))) (= (mod c_~v_assert~0 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)))) is different from false [2022-11-03 03:58:56,587 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_475 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_475 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse0)) 1)))) (let ((.cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse2 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse1) (not (= (+ .cse2 1) 0))) (or .cse1 (not (= .cse2 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)))) is different from false [2022-11-03 03:58:57,206 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod c_~v_assert~0 256) 0) (not (< c_~back~0 c_~n~0)) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse5 4)) (.cse4 (select .cse2 (+ c_~queue~0.offset .cse5)))) (and (forall ((v_ArrVal_475 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse3) .cse4) 1)) (forall ((v_ArrVal_475 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse3) .cse4)))))) (not (<= 0 c_~back~0)))) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= 1 c_~v_assert~0) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-11-03 03:58:58,620 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_475 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_475 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse0)) 1)))) (let ((.cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse2 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse1) (not (= (+ .cse2 1) 0))) (or .cse1 (not (= .cse2 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-11-03 03:58:59,831 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_~front~0 4))) (let ((.cse5 (+ c_~queue~0.offset .cse6))) (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod c_~v_assert~0 256) 0) (not (< c_~back~0 c_~n~0)) (let ((.cse3 (+ c_~queue~0.offset .cse6 4)) (.cse4 (select .cse2 .cse5))) (and (forall ((v_ArrVal_475 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse3) .cse4) 1)) (forall ((v_ArrVal_475 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse3) .cse4))))) (not (<= 0 c_~back~0)))) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= 1 c_~v_assert~0) (or (and (forall ((v_ArrVal_475 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse5)))) (forall ((v_ArrVal_475 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse5)) 1))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)))) is different from false [2022-11-03 03:59:01,416 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_~front~0 4))) (let ((.cse5 (+ c_~queue~0.offset .cse6))) (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod c_~v_assert~0 256) 0) (not (< c_~back~0 c_~n~0)) (let ((.cse3 (+ c_~queue~0.offset .cse6 4)) (.cse4 (select .cse2 .cse5))) (and (forall ((v_ArrVal_475 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse3) .cse4) 1)) (forall ((v_ArrVal_475 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse3) .cse4))))) (not (<= 0 c_~back~0)))) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1) (or (and (forall ((v_ArrVal_475 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse5)))) (forall ((v_ArrVal_475 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse5)) 1))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)))) is different from false [2022-11-03 03:59:02,470 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| c_~queue~0.base)) (.cse5 (* c_~front~0 4))) (let ((.cse0 (select .cse3 (+ c_~queue~0.offset .cse5))) (.cse6 (select .cse3 (+ c_~queue~0.offset .cse5 (- 4))))) (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (= (+ .cse0 1) 0) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (or (let ((.cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse2 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse1) (not (= (+ .cse2 1) 0))) (or .cse1 (not (= .cse2 1))))) (= (mod c_~v_assert~0 256) 0) (not (< c_~back~0 c_~n~0)) (let ((.cse4 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_475 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse4) .cse0) 1)) (forall ((v_ArrVal_475 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse4) .cse0))))) (not (<= 0 c_~back~0))) (= |c_thread1Thread1of1ForFork1_~cond~0#1| 1) (= c_~sum~0 .cse6) (= c_~queue~0.offset 0) (<= 1 c_~v_assert~0) (= .cse6 1) (<= c_~front~0 1) (<= 1 c_~front~0)))) is different from false [2022-11-03 03:59:04,030 WARN L833 $PredicateComparison]: unable to prove that (and (<= c_~sum~0 0) (<= 0 c_~sum~0) (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_475 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_475 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse0)) 1)))) (let ((.cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse2 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse1) (not (= (+ .cse2 1) 0))) (or .cse1 (not (= .cse2 1))))) (= (mod c_~v_assert~0 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)))) is different from false [2022-11-03 03:59:04,607 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_475 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_475 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse0)) 1)))) (let ((.cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse2 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse1) (not (= (+ .cse2 1) 0))) (or .cse1 (not (= .cse2 1))))) (= (mod c_~v_assert~0 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)))) is different from false [2022-11-03 03:59:04,830 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod c_~v_assert~0 256) 0) (not (< c_~back~0 c_~n~0)) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse5 4)) (.cse4 (select .cse2 (+ c_~queue~0.offset .cse5)))) (and (forall ((v_ArrVal_475 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse3) .cse4) 1)) (forall ((v_ArrVal_475 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse3) .cse4)))))) (not (<= 0 c_~back~0)))) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-11-03 03:59:05,271 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod c_~v_assert~0 256) 0) (not (< c_~back~0 c_~n~0)) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse5 4)) (.cse4 (select .cse2 (+ c_~queue~0.offset .cse5)))) (and (forall ((v_ArrVal_475 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse3) .cse4) 1)) (forall ((v_ArrVal_475 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse3) .cse4)))))) (not (<= 0 c_~back~0)))) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-11-03 03:59:05,488 WARN L833 $PredicateComparison]: unable to prove that (and (<= c_~v_assert~0 1) (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_475 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_475 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse0)) 1)))) (let ((.cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse2 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse1) (not (= (+ .cse2 1) 0))) (or .cse1 (not (= .cse2 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= 1 c_~v_assert~0) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-11-03 03:59:05,536 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod c_~v_assert~0 256) 0) (not (< c_~back~0 c_~n~0)) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse5 4)) (.cse4 (select .cse2 (+ c_~queue~0.offset .cse5)))) (and (forall ((v_ArrVal_475 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse3) .cse4) 1)) (forall ((v_ArrVal_475 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse3) .cse4)))))) (not (<= 0 c_~back~0))))) is different from false [2022-11-03 03:59:05,726 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod c_~v_assert~0 256) 0) (not (< c_~back~0 c_~n~0)) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse5 4)) (.cse4 (select .cse2 (+ c_~queue~0.offset .cse5)))) (and (forall ((v_ArrVal_475 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse3) .cse4) 1)) (forall ((v_ArrVal_475 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse3) .cse4)))))) (not (<= 0 c_~back~0)))) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0))) is different from false [2022-11-03 03:59:06,198 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= c_~sum~0 0) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_475 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_475 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse0)) 1)))) (let ((.cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse2 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse1) (not (= (+ .cse2 1) 0))) (or .cse1 (not (= .cse2 1))))) (= (mod c_~v_assert~0 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)))) is different from false [2022-11-03 03:59:06,211 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~queue~0.base)) (.cse5 (* c_~front~0 4))) (let ((.cse4 (select .cse2 (+ c_~queue~0.offset .cse5)))) (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod c_~v_assert~0 256) 0) (not (< c_~back~0 c_~n~0)) (let ((.cse3 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_475 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse3) .cse4) 1)) (forall ((v_ArrVal_475 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse3) .cse4))))) (not (<= 0 c_~back~0))) (or (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (let ((.cse6 (+ c_~sum~0 .cse4))) (and (<= .cse6 1) (<= 0 .cse6))))))) is different from false [2022-11-03 03:59:06,285 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~queue~0.base)) (.cse5 (* c_~front~0 4))) (let ((.cse4 (select .cse2 (+ c_~queue~0.offset .cse5)))) (and (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod c_~v_assert~0 256) 0) (not (< c_~back~0 c_~n~0)) (let ((.cse3 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_475 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse3) .cse4) 1)) (forall ((v_ArrVal_475 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse3) .cse4))))) (not (<= 0 c_~back~0))) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (or (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (let ((.cse6 (+ c_~sum~0 .cse4))) (and (<= .cse6 1) (<= 0 .cse6))))))) is different from false [2022-11-03 03:59:07,896 WARN L833 $PredicateComparison]: unable to prove that (and (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_475 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_475 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse0)) 1)))) (let ((.cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse2 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse1) (not (= (+ .cse2 1) 0))) (or .cse1 (not (= .cse2 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-11-03 03:59:08,405 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_475 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_475 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse0)) 1)))) (let ((.cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse2 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse1) (not (= (+ .cse2 1) 0))) (or .cse1 (not (= .cse2 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-11-03 03:59:08,568 WARN L833 $PredicateComparison]: unable to prove that (and (<= c_~sum~0 0) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (<= 0 c_~sum~0) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_475 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_475 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse0)) 1)))) (let ((.cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse2 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse1) (not (= (+ .cse2 1) 0))) (or .cse1 (not (= .cse2 1))))) (= (mod c_~v_assert~0 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)))) is different from false [2022-11-03 03:59:08,575 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= c_~sum~0 0) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= 0 c_~sum~0) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_475 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_475 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse0)) 1)))) (let ((.cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse2 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse1) (not (= (+ .cse2 1) 0))) (or .cse1 (not (= .cse2 1))))) (= (mod c_~v_assert~0 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)))) is different from false [2022-11-03 03:59:08,636 WARN L833 $PredicateComparison]: unable to prove that (and (<= c_~sum~0 0) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (<= 0 c_~sum~0) (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_475 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_475 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse0)) 1)))) (let ((.cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse2 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse1) (not (= (+ .cse2 1) 0))) (or .cse1 (not (= .cse2 1))))) (= (mod c_~v_assert~0 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)))) is different from false [2022-11-03 03:59:08,854 WARN L833 $PredicateComparison]: unable to prove that (and (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_475 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_475 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse0)) 1)))) (let ((.cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse2 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse1) (not (= (+ .cse2 1) 0))) (or .cse1 (not (= .cse2 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-11-03 03:59:09,111 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= c_~sum~0 0) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= 0 c_~sum~0) (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_475 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_475 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_475) c_~queue~0.base) .cse0)) 1)))) (let ((.cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse2 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse1) (not (= (+ .cse2 1) 0))) (or .cse1 (not (= .cse2 1))))) (= (mod c_~v_assert~0 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)))) is different from false [2022-11-03 03:59:10,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:59:10,857 INFO L93 Difference]: Finished difference Result 4033 states and 10591 transitions. [2022-11-03 03:59:10,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2022-11-03 03:59:10,858 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.868421052631579) internal successors, (71), 37 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-03 03:59:10,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:59:10,875 INFO L225 Difference]: With dead ends: 4033 [2022-11-03 03:59:10,875 INFO L226 Difference]: Without dead ends: 3693 [2022-11-03 03:59:10,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 47 SyntacticMatches, 19 SemanticMatches, 188 ConstructedPredicates, 32 IntricatePredicates, 3 DeprecatedPredicates, 11341 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=3794, Invalid=21020, Unknown=120, NotChecked=10976, Total=35910 [2022-11-03 03:59:10,879 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 507 mSDsluCounter, 1226 mSDsCounter, 0 mSdLazyCounter, 2418 mSolverCounterSat, 297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 4959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 297 IncrementalHoareTripleChecker+Valid, 2418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2244 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-03 03:59:10,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 37 Invalid, 4959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [297 Valid, 2418 Invalid, 0 Unknown, 2244 Unchecked, 2.9s Time] [2022-11-03 03:59:10,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3693 states. [2022-11-03 03:59:10,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3693 to 926. [2022-11-03 03:59:10,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 925 states have (on average 2.6432432432432433) internal successors, (2445), 925 states have internal predecessors, (2445), 0 states have call successors, (0), 0 states 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 03:59:10,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 2445 transitions. [2022-11-03 03:59:10,948 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 2445 transitions. Word has length 29 [2022-11-03 03:59:10,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:59:10,948 INFO L495 AbstractCegarLoop]: Abstraction has 926 states and 2445 transitions. [2022-11-03 03:59:10,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.868421052631579) internal successors, (71), 37 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 03:59:10,949 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 2445 transitions. [2022-11-03 03:59:10,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-03 03:59:10,952 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:59:10,952 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:59:10,989 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 03:59:11,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-03 03:59:11,175 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 03:59:11,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:59:11,176 INFO L85 PathProgramCache]: Analyzing trace with hash 511804122, now seen corresponding path program 9 times [2022-11-03 03:59:11,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:59:11,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082962848] [2022-11-03 03:59:11,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:59:11,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:59:11,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:59:13,031 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:59:13,031 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:59:13,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082962848] [2022-11-03 03:59:13,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082962848] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:59:13,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899594433] [2022-11-03 03:59:13,032 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:59:13,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:59:13,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:59:13,035 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:59:13,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 03:59:13,175 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:59:13,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:59:13,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-03 03:59:13,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:59:13,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:13,775 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 44 treesize of output 42 [2022-11-03 03:59:13,835 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:59:13,835 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 48 treesize of output 14 [2022-11-03 03:59:13,920 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:59:13,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:59:14,046 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_524 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_524) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_524 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_524) c_~queue~0.base) .cse0)) 1)))) is different from false [2022-11-03 03:59:14,112 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_524 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_524) c_~queue~0.base) .cse2)))) (forall ((v_ArrVal_524 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_524) c_~queue~0.base) .cse2)) 1)))) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))) is different from false [2022-11-03 03:59:14,188 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (select .cse2 (+ c_~queue~0.offset .cse5))) (.cse4 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_524 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_524) c_~queue~0.base) .cse4)) 1)) (forall ((v_ArrVal_524 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_524) c_~queue~0.base) .cse4))))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)))) is different from false [2022-11-03 03:59:14,342 INFO L356 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-03 03:59:14,342 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 286 treesize of output 240 [2022-11-03 03:59:14,364 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 59 treesize of output 52 [2022-11-03 03:59:14,380 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 52 treesize of output 45 [2022-11-03 03:59:15,555 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-03 03:59:15,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899594433] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:59:15,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [255852267] [2022-11-03 03:59:15,556 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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 03:59:15,556 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:59:15,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13] total 37 [2022-11-03 03:59:15,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642095419] [2022-11-03 03:59:15,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:59:15,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-03 03:59:15,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:59:15,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-03 03:59:15,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1021, Unknown=3, NotChecked=204, Total=1406 [2022-11-03 03:59:15,559 INFO L87 Difference]: Start difference. First operand 926 states and 2445 transitions. Second operand has 38 states, 38 states have (on average 1.7894736842105263) internal successors, (68), 37 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:59:17,453 WARN L833 $PredicateComparison]: unable to prove that (and (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (select .cse2 (+ c_~queue~0.offset .cse5))) (.cse4 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_524 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_524) c_~queue~0.base) .cse4)) 1)) (forall ((v_ArrVal_524 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_524) c_~queue~0.base) .cse4))))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)))) (= c_~sum~0 0)) is different from false [2022-11-03 03:59:17,874 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (select .cse2 (+ c_~queue~0.offset .cse5))) (.cse4 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_524 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_524) c_~queue~0.base) .cse4)) 1)) (forall ((v_ArrVal_524 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_524) c_~queue~0.base) .cse4))))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)))) (= c_~sum~0 0)) is different from false [2022-11-03 03:59:20,087 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (select .cse2 (+ c_~queue~0.offset .cse5))) (.cse4 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_524 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_524) c_~queue~0.base) .cse4)) 1)) (forall ((v_ArrVal_524 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_524) c_~queue~0.base) .cse4))))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))))) is different from false [2022-11-03 03:59:20,179 WARN L833 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (<= 0 c_~sum~0) (<= c_~sum~0 1) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_524 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_524) c_~queue~0.base) .cse2)))) (forall ((v_ArrVal_524 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_524) c_~queue~0.base) .cse2)) 1)))) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)))) is different from false [2022-11-03 03:59:20,579 WARN L833 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_524 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_524) c_~queue~0.base) .cse2)))) (forall ((v_ArrVal_524 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_524) c_~queue~0.base) .cse2)) 1)))) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)))) is different from false [2022-11-03 03:59:22,380 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (select .cse2 (+ c_~queue~0.offset .cse5))) (.cse4 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_524 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_524) c_~queue~0.base) .cse4)) 1)) (forall ((v_ArrVal_524 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_524) c_~queue~0.base) .cse4))))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)))) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-11-03 03:59:22,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:59:22,605 INFO L93 Difference]: Finished difference Result 2830 states and 7422 transitions. [2022-11-03 03:59:22,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-11-03 03:59:22,606 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.7894736842105263) internal successors, (68), 37 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-03 03:59:22,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:59:22,620 INFO L225 Difference]: With dead ends: 2830 [2022-11-03 03:59:22,620 INFO L226 Difference]: Without dead ends: 2360 [2022-11-03 03:59:22,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 38 SyntacticMatches, 11 SemanticMatches, 91 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 2228 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1096, Invalid=5903, Unknown=9, NotChecked=1548, Total=8556 [2022-11-03 03:59:22,622 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 532 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 1743 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 2501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 1743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 536 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-03 03:59:22,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 18 Invalid, 2501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 1743 Invalid, 0 Unknown, 536 Unchecked, 1.9s Time] [2022-11-03 03:59:22,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2360 states. [2022-11-03 03:59:22,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2360 to 1046. [2022-11-03 03:59:22,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 1045 states have (on average 2.661244019138756) internal successors, (2781), 1045 states have internal predecessors, (2781), 0 states have call successors, (0), 0 states 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 03:59:22,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 2781 transitions. [2022-11-03 03:59:22,679 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 2781 transitions. Word has length 29 [2022-11-03 03:59:22,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:59:22,680 INFO L495 AbstractCegarLoop]: Abstraction has 1046 states and 2781 transitions. [2022-11-03 03:59:22,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.7894736842105263) internal successors, (68), 37 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 03:59:22,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 2781 transitions. [2022-11-03 03:59:22,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-03 03:59:22,683 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:59:22,684 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:59:22,730 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-03 03:59:22,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-03 03:59:22,899 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 03:59:22,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:59:22,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1552455266, now seen corresponding path program 10 times [2022-11-03 03:59:22,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:59:22,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325026088] [2022-11-03 03:59:22,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:59:22,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:59:22,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:59:24,309 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:59:24,309 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:59:24,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325026088] [2022-11-03 03:59:24,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325026088] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:59:24,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034111489] [2022-11-03 03:59:24,309 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 03:59:24,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:59:24,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:59:24,311 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:59:24,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-03 03:59:24,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:59:24,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-03 03:59:24,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:59:24,956 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:59:24,957 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 42 treesize of output 14 [2022-11-03 03:59:25,034 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:59:25,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:59:25,523 INFO L356 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-03 03:59:25,523 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 224 treesize of output 194 [2022-11-03 03:59:26,822 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:59:26,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034111489] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:59:26,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [989247280] [2022-11-03 03:59:26,822 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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 03:59:26,824 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:59:26,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 34 [2022-11-03 03:59:26,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335975255] [2022-11-03 03:59:26,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:59:26,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-03 03:59:26,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:59:26,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-03 03:59:26,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=980, Unknown=0, NotChecked=0, Total=1190 [2022-11-03 03:59:26,829 INFO L87 Difference]: Start difference. First operand 1046 states and 2781 transitions. Second operand has 35 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 34 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 03:59:32,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:59:32,629 INFO L93 Difference]: Finished difference Result 2150 states and 5691 transitions. [2022-11-03 03:59:32,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-11-03 03:59:32,629 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 34 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 29 [2022-11-03 03:59:32,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:59:32,640 INFO L225 Difference]: With dead ends: 2150 [2022-11-03 03:59:32,640 INFO L226 Difference]: Without dead ends: 1950 [2022-11-03 03:59:32,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2316 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1129, Invalid=6011, Unknown=0, NotChecked=0, Total=7140 [2022-11-03 03:59:32,645 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 496 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 1913 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 2095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 1913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-03 03:59:32,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 9 Invalid, 2095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 1913 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-03 03:59:32,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2022-11-03 03:59:32,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1132. [2022-11-03 03:59:32,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1132 states, 1131 states have (on average 2.6710875331564985) internal successors, (3021), 1131 states have internal predecessors, (3021), 0 states have call successors, (0), 0 states 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 03:59:32,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 3021 transitions. [2022-11-03 03:59:32,695 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 3021 transitions. Word has length 29 [2022-11-03 03:59:32,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:59:32,696 INFO L495 AbstractCegarLoop]: Abstraction has 1132 states and 3021 transitions. [2022-11-03 03:59:32,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 34 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 03:59:32,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 3021 transitions. [2022-11-03 03:59:32,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-03 03:59:32,700 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:59:32,700 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:59:32,744 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-03 03:59:32,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:59:32,918 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 03:59:32,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:59:32,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1677477422, now seen corresponding path program 11 times [2022-11-03 03:59:32,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:59:32,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246559681] [2022-11-03 03:59:32,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:59:32,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:59:32,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:59:34,305 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:59:34,306 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:59:34,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246559681] [2022-11-03 03:59:34,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246559681] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:59:34,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150869330] [2022-11-03 03:59:34,306 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 03:59:34,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:59:34,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:59:34,308 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:59:34,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-03 03:59:34,591 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-03 03:59:34,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:59:34,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-03 03:59:34,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:59:35,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:35,160 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 44 treesize of output 42 [2022-11-03 03:59:35,224 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:59:35,225 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 48 treesize of output 14 [2022-11-03 03:59:35,302 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:59:35,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:59:35,453 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_621 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_621) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_621 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_621) c_~queue~0.base) .cse0)) 1)))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-11-03 03:59:35,465 WARN L833 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_621 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_621) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_621 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_621) c_~queue~0.base) .cse0)) 1))))) is different from false [2022-11-03 03:59:35,493 WARN L833 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse2))) (.cse1 (+ c_~queue~0.offset .cse2 4))) (and (forall ((v_ArrVal_621 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_621) c_~queue~0.base) .cse1)))) (forall ((v_ArrVal_621 (Array Int Int))) (<= (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_621) c_~queue~0.base) .cse1)) 1)))))) is different from false [2022-11-03 03:59:35,541 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod c_~v_assert~0 256) 0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (select .cse2 (+ c_~queue~0.offset .cse5))) (.cse4 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_621 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_621) c_~queue~0.base) .cse4)))) (forall ((v_ArrVal_621 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_621) c_~queue~0.base) .cse4)) 1))))) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)))) is different from false [2022-11-03 03:59:35,709 INFO L356 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-03 03:59:35,710 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 286 treesize of output 240 [2022-11-03 03:59:35,727 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 59 treesize of output 52 [2022-11-03 03:59:35,742 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 52 treesize of output 45 [2022-11-03 03:59:37,147 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-03 03:59:37,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150869330] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:59:37,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1799069936] [2022-11-03 03:59:37,148 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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 03:59:37,149 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:59:37,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 36 [2022-11-03 03:59:37,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346679287] [2022-11-03 03:59:37,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:59:37,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-03 03:59:37,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:59:37,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-03 03:59:37,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=897, Unknown=4, NotChecked=260, Total=1332 [2022-11-03 03:59:37,152 INFO L87 Difference]: Start difference. First operand 1132 states and 3021 transitions. Second operand has 37 states, 37 states have (on average 1.945945945945946) internal successors, (72), 36 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 03:59:38,857 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod c_~v_assert~0 256) 0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (select .cse2 (+ c_~queue~0.offset .cse5))) (.cse4 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_621 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_621) c_~queue~0.base) .cse4)))) (forall ((v_ArrVal_621 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_621) c_~queue~0.base) .cse4)) 1))))) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)))) (= c_~sum~0 0)) is different from false [2022-11-03 03:59:39,163 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= 1 c_~v_assert~0) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod c_~v_assert~0 256) 0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (select .cse2 (+ c_~queue~0.offset .cse5))) (.cse4 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_621 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_621) c_~queue~0.base) .cse4)))) (forall ((v_ArrVal_621 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_621) c_~queue~0.base) .cse4)) 1))))) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)))) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (= c_~sum~0 0)) is different from false [2022-11-03 03:59:39,177 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod c_~v_assert~0 256) 0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (select .cse2 (+ c_~queue~0.offset .cse5))) (.cse4 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_621 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_621) c_~queue~0.base) .cse4)))) (forall ((v_ArrVal_621 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_621) c_~queue~0.base) .cse4)) 1))))) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))))) is different from false [2022-11-03 03:59:40,325 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod c_~v_assert~0 256) 0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (select .cse2 (+ c_~queue~0.offset .cse5))) (.cse4 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_621 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_621) c_~queue~0.base) .cse4)))) (forall ((v_ArrVal_621 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_621) c_~queue~0.base) .cse4)) 1))))) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)))) (<= c_~sum~0 1) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-11-03 03:59:44,077 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (= (mod c_~v_assert~0 256) 0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_621 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_621) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_621 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_621) c_~queue~0.base) .cse0)) 1)))))) is different from false [2022-11-03 03:59:44,509 WARN L833 $PredicateComparison]: unable to prove that (and (<= c_~v_assert~0 1) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= 1 c_~v_assert~0) (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_621 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_621) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_621 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_621) c_~queue~0.base) .cse0)) 1)))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-11-03 03:59:44,549 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= 1 c_~v_assert~0) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (= c_~sum~0 0) (or (= (mod c_~v_assert~0 256) 0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_621 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_621) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_621 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_621) c_~queue~0.base) .cse0)) 1)))))) is different from false [2022-11-03 03:59:45,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:59:45,070 INFO L93 Difference]: Finished difference Result 3889 states and 10744 transitions. [2022-11-03 03:59:45,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2022-11-03 03:59:45,070 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.945945945945946) internal successors, (72), 36 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 29 [2022-11-03 03:59:45,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:59:45,087 INFO L225 Difference]: With dead ends: 3889 [2022-11-03 03:59:45,088 INFO L226 Difference]: Without dead ends: 3735 [2022-11-03 03:59:45,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 40 SyntacticMatches, 20 SemanticMatches, 107 ConstructedPredicates, 11 IntricatePredicates, 1 DeprecatedPredicates, 3605 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=1592, Invalid=7944, Unknown=14, NotChecked=2222, Total=11772 [2022-11-03 03:59:45,089 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 379 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 1923 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 3117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 1923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1018 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-03 03:59:45,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 29 Invalid, 3117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 1923 Invalid, 0 Unknown, 1018 Unchecked, 1.6s Time] [2022-11-03 03:59:45,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3735 states. [2022-11-03 03:59:45,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3735 to 1185. [2022-11-03 03:59:45,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1185 states, 1184 states have (on average 2.6596283783783785) internal successors, (3149), 1184 states have internal predecessors, (3149), 0 states have call successors, (0), 0 states 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 03:59:45,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 3149 transitions. [2022-11-03 03:59:45,150 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 3149 transitions. Word has length 29 [2022-11-03 03:59:45,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:59:45,151 INFO L495 AbstractCegarLoop]: Abstraction has 1185 states and 3149 transitions. [2022-11-03 03:59:45,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.945945945945946) internal successors, (72), 36 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 03:59:45,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 3149 transitions. [2022-11-03 03:59:45,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-03 03:59:45,155 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:59:45,155 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:59:45,198 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-03 03:59:45,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-03 03:59:45,383 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 03:59:45,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:59:45,383 INFO L85 PathProgramCache]: Analyzing trace with hash 656692608, now seen corresponding path program 12 times [2022-11-03 03:59:45,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:59:45,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654231534] [2022-11-03 03:59:45,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:59:45,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:59:45,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 03:59:47,493 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:59:47,493 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 03:59:47,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654231534] [2022-11-03 03:59:47,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654231534] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 03:59:47,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084776127] [2022-11-03 03:59:47,493 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 03:59:47,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 03:59:47,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 03:59:47,495 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 03:59:47,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-03 03:59:47,630 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 03:59:47,630 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 03:59:47,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-03 03:59:47,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 03:59:48,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 03:59:48,240 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 44 treesize of output 42 [2022-11-03 03:59:48,327 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 03:59:48,327 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 42 treesize of output 14 [2022-11-03 03:59:48,426 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 03:59:48,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 03:59:48,620 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_670 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_670) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_670 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_670) c_~queue~0.base) .cse0)))))) is different from false [2022-11-03 03:59:48,661 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_670 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_670) c_~queue~0.base) .cse2)) 1)) (forall ((v_ArrVal_670 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_670) c_~queue~0.base) .cse2)))))) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))) is different from false [2022-11-03 03:59:48,696 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse3 (* c_~front~0 4))) (let ((.cse0 (+ c_~queue~0.offset .cse3 4)) (.cse1 (select .cse2 (+ c_~queue~0.offset .cse3)))) (and (forall ((v_ArrVal_670 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_670) c_~queue~0.base) .cse0) c_~sum~0 .cse1) 1)) (forall ((v_ArrVal_670 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_670) c_~queue~0.base) .cse0) c_~sum~0 .cse1)))))) (let ((.cse4 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse5 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse4) (not (= (+ .cse5 1) 0))) (or .cse4 (not (= .cse5 1))))) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)))) is different from false [2022-11-03 03:59:48,887 INFO L356 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-03 03:59:48,888 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 286 treesize of output 240 [2022-11-03 03:59:48,905 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 59 treesize of output 52 [2022-11-03 03:59:48,921 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 52 treesize of output 45 [2022-11-03 03:59:50,262 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-03 03:59:50,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084776127] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 03:59:50,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [573791631] [2022-11-03 03:59:50,262 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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 03:59:50,263 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 03:59:50,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 36 [2022-11-03 03:59:50,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204082741] [2022-11-03 03:59:50,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 03:59:50,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-03 03:59:50,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 03:59:50,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-03 03:59:50,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=963, Unknown=3, NotChecked=198, Total=1332 [2022-11-03 03:59:50,265 INFO L87 Difference]: Start difference. First operand 1185 states and 3149 transitions. Second operand has 37 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 36 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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 03:59:52,114 WARN L833 $PredicateComparison]: unable to prove that (and (<= c_~sum~0 0) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse3 (* c_~front~0 4))) (let ((.cse0 (+ c_~queue~0.offset .cse3 4)) (.cse1 (select .cse2 (+ c_~queue~0.offset .cse3)))) (and (forall ((v_ArrVal_670 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_670) c_~queue~0.base) .cse0) c_~sum~0 .cse1) 1)) (forall ((v_ArrVal_670 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_670) c_~queue~0.base) .cse0) c_~sum~0 .cse1)))))) (let ((.cse4 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse5 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse4) (not (= (+ .cse5 1) 0))) (or .cse4 (not (= .cse5 1))))) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)))) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0)) is different from false [2022-11-03 03:59:52,373 WARN L833 $PredicateComparison]: unable to prove that (and (<= c_~sum~0 0) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse3 (* c_~front~0 4))) (let ((.cse0 (+ c_~queue~0.offset .cse3 4)) (.cse1 (select .cse2 (+ c_~queue~0.offset .cse3)))) (and (forall ((v_ArrVal_670 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_670) c_~queue~0.base) .cse0) c_~sum~0 .cse1) 1)) (forall ((v_ArrVal_670 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_670) c_~queue~0.base) .cse0) c_~sum~0 .cse1)))))) (let ((.cse4 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse5 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse4) (not (= (+ .cse5 1) 0))) (or .cse4 (not (= .cse5 1))))) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)))) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0)) is different from false [2022-11-03 03:59:56,154 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse12 (<= c_~n~0 (+ c_~back~0 1))) (.cse15 (* c_~front~0 4)) (.cse4 (select |c_#memory_int| c_~queue~0.base)) (.cse0 (* c_~back~0 4))) (let ((.cse14 (select .cse4 (+ c_~queue~0.offset .cse0))) (.cse9 (or .cse12 (= .cse15 .cse0))) (.cse10 (<= 0 c_~sum~0)) (.cse11 (<= c_~sum~0 1)) (.cse3 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|)))) (let ((.cse7 (= (mod c_~v_assert~0 256) 0)) (.cse6 (and .cse9 (or .cse12 (and .cse10 .cse11 .cse3)))) (.cse2 (+ .cse14 1)) (.cse5 (+ c_~queue~0.offset .cse15)) (.cse8 (not (<= 0 c_~back~0)))) (and (<= c_~sum~0 0) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (or (<= (* c_~n~0 4) (+ c_~queue~0.offset 3 .cse0)) (let ((.cse1 (+ c_~sum~0 (select .cse4 .cse5)))) (and (<= .cse1 .cse2) (<= .cse2 .cse1) (= |c_thread2Thread1of1ForFork2_~b~0#1| 0) .cse3))) (or .cse6 .cse7 .cse8) (or .cse7 (and .cse9 (or (and (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t3~0#1.base|) .cse10 .cse11) .cse12)) .cse8 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (or .cse6 (= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) .cse8) (= c_~queue~0.offset 0) (<= 1 c_~v_assert~0) .cse10 (or (let ((.cse13 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0))) (and (or (not .cse13) (not (= .cse2 0))) (or .cse13 (not (= .cse14 1))))) (and (forall ((v_ArrVal_670 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_670) c_~queue~0.base) .cse5)) 1)) (forall ((v_ArrVal_670 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_670) c_~queue~0.base) .cse5))))) (not (< c_~back~0 c_~n~0)) .cse8))))) is different from false [2022-11-03 03:59:56,629 WARN L833 $PredicateComparison]: unable to prove that (and (<= c_~sum~0 0) (<= 0 c_~sum~0) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_670 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_670) c_~queue~0.base) .cse2)) 1)) (forall ((v_ArrVal_670 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_670) c_~queue~0.base) .cse2)))))) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)))) is different from false [2022-11-03 03:59:56,863 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse3 (* c_~front~0 4))) (let ((.cse0 (+ c_~queue~0.offset .cse3 4)) (.cse1 (select .cse2 (+ c_~queue~0.offset .cse3)))) (and (forall ((v_ArrVal_670 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_670) c_~queue~0.base) .cse0) c_~sum~0 .cse1) 1)) (forall ((v_ArrVal_670 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_670) c_~queue~0.base) .cse0) c_~sum~0 .cse1)))))) (let ((.cse4 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse5 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse4) (not (= (+ .cse5 1) 0))) (or .cse4 (not (= .cse5 1))))) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)))) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0)) is different from false [2022-11-03 03:59:56,869 WARN L833 $PredicateComparison]: unable to prove that (and (<= c_~sum~0 0) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_670 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_670) c_~queue~0.base) .cse2)) 1)) (forall ((v_ArrVal_670 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_670) c_~queue~0.base) .cse2)))))) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)))) is different from false [2022-11-03 03:59:57,526 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse3 (* c_~front~0 4))) (let ((.cse0 (+ c_~queue~0.offset .cse3 4)) (.cse1 (select .cse2 (+ c_~queue~0.offset .cse3)))) (and (forall ((v_ArrVal_670 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_670) c_~queue~0.base) .cse0) c_~sum~0 .cse1) 1)) (forall ((v_ArrVal_670 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_670) c_~queue~0.base) .cse0) c_~sum~0 .cse1)))))) (let ((.cse4 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse5 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse4) (not (= (+ .cse5 1) 0))) (or .cse4 (not (= .cse5 1))))) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)))) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-11-03 03:59:58,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 03:59:58,421 INFO L93 Difference]: Finished difference Result 3342 states and 8683 transitions. [2022-11-03 03:59:58,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-11-03 03:59:58,422 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 36 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-03 03:59:58,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 03:59:58,431 INFO L225 Difference]: With dead ends: 3342 [2022-11-03 03:59:58,432 INFO L226 Difference]: Without dead ends: 2940 [2022-11-03 03:59:58,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 34 SyntacticMatches, 18 SemanticMatches, 93 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 2744 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=1227, Invalid=5939, Unknown=14, NotChecked=1750, Total=8930 [2022-11-03 03:59:58,433 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 568 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 1997 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 3117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 1997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 887 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-03 03:59:58,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 38 Invalid, 3117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 1997 Invalid, 0 Unknown, 887 Unchecked, 2.0s Time] [2022-11-03 03:59:58,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2022-11-03 03:59:58,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 1249. [2022-11-03 03:59:58,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 1248 states have (on average 2.6378205128205128) internal successors, (3292), 1248 states have internal predecessors, (3292), 0 states have call successors, (0), 0 states 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 03:59:58,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 3292 transitions. [2022-11-03 03:59:58,487 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 3292 transitions. Word has length 29 [2022-11-03 03:59:58,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 03:59:58,488 INFO L495 AbstractCegarLoop]: Abstraction has 1249 states and 3292 transitions. [2022-11-03 03:59:58,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 36 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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 03:59:58,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 3292 transitions. [2022-11-03 03:59:58,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-03 03:59:58,492 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 03:59:58,492 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 03:59:58,538 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-03 03:59:58,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-03 03:59:58,707 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 03:59:58,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 03:59:58,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1424660858, now seen corresponding path program 13 times [2022-11-03 03:59:58,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 03:59:58,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38296105] [2022-11-03 03:59:58,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 03:59:58,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 03:59:58,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:00,072 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:00:00,072 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:00:00,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38296105] [2022-11-03 04:00:00,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38296105] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:00:00,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381524670] [2022-11-03 04:00:00,073 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 04:00:00,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:00:00,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:00:00,074 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:00:00,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-03 04:00:00,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:00,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-03 04:00:00,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:00,547 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 25 treesize of output 7 [2022-11-03 04:00:00,705 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 23 treesize of output 11 [2022-11-03 04:00:00,775 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:00:00,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:00:00,934 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:00:00,934 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 68 treesize of output 48 [2022-11-03 04:00:01,390 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:00:01,390 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 224 treesize of output 172 [2022-11-03 04:00:02,013 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:00:02,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381524670] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:00:02,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1470432024] [2022-11-03 04:00:02,013 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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:00:02,014 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:00:02,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 34 [2022-11-03 04:00:02,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498442646] [2022-11-03 04:00:02,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:00:02,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-03 04:00:02,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:00:02,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-03 04:00:02,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=977, Unknown=0, NotChecked=0, Total=1190 [2022-11-03 04:00:02,016 INFO L87 Difference]: Start difference. First operand 1249 states and 3292 transitions. Second operand has 35 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states 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:00:08,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:08,094 INFO L93 Difference]: Finished difference Result 1878 states and 4437 transitions. [2022-11-03 04:00:08,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-11-03 04:00:08,095 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-03 04:00:08,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:08,099 INFO L225 Difference]: With dead ends: 1878 [2022-11-03 04:00:08,099 INFO L226 Difference]: Without dead ends: 1377 [2022-11-03 04:00:08,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3072 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1360, Invalid=8146, Unknown=0, NotChecked=0, Total=9506 [2022-11-03 04:00:08,101 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 461 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 1941 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 2094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:08,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 25 Invalid, 2094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1941 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-03 04:00:08,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2022-11-03 04:00:08,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 671. [2022-11-03 04:00:08,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 670 states have (on average 2.485074626865672) internal successors, (1665), 670 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states 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:00:08,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 1665 transitions. [2022-11-03 04:00:08,128 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 1665 transitions. Word has length 29 [2022-11-03 04:00:08,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:08,128 INFO L495 AbstractCegarLoop]: Abstraction has 671 states and 1665 transitions. [2022-11-03 04:00:08,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states 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:00:08,129 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 1665 transitions. [2022-11-03 04:00:08,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-03 04:00:08,130 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:08,131 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:00:08,178 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:08,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-03 04:00:08,355 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:00:08,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:08,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1562408856, now seen corresponding path program 14 times [2022-11-03 04:00:08,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:00:08,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216948384] [2022-11-03 04:00:08,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:08,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:00:08,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:09,724 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:00:09,724 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:00:09,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216948384] [2022-11-03 04:00:09,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216948384] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:00:09,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351188221] [2022-11-03 04:00:09,725 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:00:09,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:00:09,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:00:09,726 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:00:09,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-03 04:00:09,994 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-03 04:00:09,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:00:09,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-03 04:00:09,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:10,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:00:10,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:00:10,029 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 04:00:10,030 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 48 treesize of output 44 [2022-11-03 04:00:10,543 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 44 treesize of output 42 [2022-11-03 04:00:10,666 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:00:10,667 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 48 treesize of output 14 [2022-11-03 04:00:10,744 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:00:10,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:00:10,928 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_772 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_772) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_772 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_772) c_~queue~0.base) .cse0)))))) (= (mod c_~v_assert~0 256) 0)) is different from false [2022-11-03 04:00:10,974 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_772 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_772) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_772 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_772) c_~queue~0.base) .cse0)))))) (let ((.cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse2 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse1) (not (= (+ .cse2 1) 0))) (or .cse1 (not (= .cse2 1))))) (= (mod c_~v_assert~0 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))) is different from false [2022-11-03 04:00:11,054 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod c_~v_assert~0 256) 0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (select .cse2 (+ c_~queue~0.offset .cse5))) (.cse4 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_772 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_772) c_~queue~0.base) .cse4)))) (forall ((v_ArrVal_772 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_772) c_~queue~0.base) .cse4)) 1))))) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)))) is different from false [2022-11-03 04:00:11,243 INFO L356 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-03 04:00:11,244 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 286 treesize of output 240 [2022-11-03 04:00:11,263 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 59 treesize of output 52 [2022-11-03 04:00:11,278 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 52 treesize of output 45 [2022-11-03 04:00:12,153 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-03 04:00:12,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351188221] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:00:12,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [415719024] [2022-11-03 04:00:12,154 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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:00:12,154 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:00:12,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13] total 37 [2022-11-03 04:00:12,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214744471] [2022-11-03 04:00:12,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:00:12,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-03 04:00:12,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:00:12,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-03 04:00:12,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1023, Unknown=3, NotChecked=204, Total=1406 [2022-11-03 04:00:12,156 INFO L87 Difference]: Start difference. First operand 671 states and 1665 transitions. Second operand has 38 states, 38 states have (on average 2.0) internal successors, (76), 37 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:00:13,746 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod c_~v_assert~0 256) 0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (select .cse2 (+ c_~queue~0.offset .cse5))) (.cse4 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_772 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_772) c_~queue~0.base) .cse4)))) (forall ((v_ArrVal_772 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_772) c_~queue~0.base) .cse4)) 1))))) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)))) (<= 1 c_~v_assert~0) (= c_~sum~0 0)) is different from false [2022-11-03 04:00:14,040 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod c_~v_assert~0 256) 0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (select .cse2 (+ c_~queue~0.offset .cse5))) (.cse4 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_772 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_772) c_~queue~0.base) .cse4)))) (forall ((v_ArrVal_772 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_772) c_~queue~0.base) .cse4)) 1))))) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)))) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= 1 c_~v_assert~0) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (= c_~sum~0 0)) is different from false [2022-11-03 04:00:15,434 WARN L833 $PredicateComparison]: unable to prove that (and (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_772 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_772) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_772 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_772) c_~queue~0.base) .cse0)))))) (= (mod c_~v_assert~0 256) 0)) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0))) is different from false [2022-11-03 04:00:16,727 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod c_~v_assert~0 256) 0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (select .cse2 (+ c_~queue~0.offset .cse5))) (.cse4 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_772 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_772) c_~queue~0.base) .cse4)))) (forall ((v_ArrVal_772 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_772) c_~queue~0.base) .cse4)) 1))))) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)))) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-11-03 04:00:19,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:19,374 INFO L93 Difference]: Finished difference Result 1496 states and 3665 transitions. [2022-11-03 04:00:19,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-11-03 04:00:19,375 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.0) internal successors, (76), 37 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-03 04:00:19,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:19,378 INFO L225 Difference]: With dead ends: 1496 [2022-11-03 04:00:19,378 INFO L226 Difference]: Without dead ends: 1237 [2022-11-03 04:00:19,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 33 SyntacticMatches, 9 SemanticMatches, 107 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 3475 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=1609, Invalid=8714, Unknown=7, NotChecked=1442, Total=11772 [2022-11-03 04:00:19,380 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 363 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 2042 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 2698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 2042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 432 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:19,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 9 Invalid, 2698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 2042 Invalid, 0 Unknown, 432 Unchecked, 1.8s Time] [2022-11-03 04:00:19,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2022-11-03 04:00:19,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 533. [2022-11-03 04:00:19,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 532 states have (on average 2.4962406015037595) internal successors, (1328), 532 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states 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:00:19,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 1328 transitions. [2022-11-03 04:00:19,400 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 1328 transitions. Word has length 29 [2022-11-03 04:00:19,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:19,400 INFO L495 AbstractCegarLoop]: Abstraction has 533 states and 1328 transitions. [2022-11-03 04:00:19,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.0) internal successors, (76), 37 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:00:19,401 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 1328 transitions. [2022-11-03 04:00:19,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 04:00:19,402 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:19,402 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:00:19,415 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:19,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:00:19,615 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:00:19,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:19,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1962900869, now seen corresponding path program 15 times [2022-11-03 04:00:19,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:00:19,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151547396] [2022-11-03 04:00:19,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:19,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:00:19,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:22,194 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:00:22,195 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:00:22,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151547396] [2022-11-03 04:00:22,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151547396] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:00:22,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594975828] [2022-11-03 04:00:22,195 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 04:00:22,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:00:22,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:00:22,196 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:00:22,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-03 04:00:22,326 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 04:00:22,326 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:00:22,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-03 04:00:22,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:22,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:00:22,781 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 44 treesize of output 42 [2022-11-03 04:00:22,830 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:00:22,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 48 treesize of output 14 [2022-11-03 04:00:22,912 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:00:22,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:00:23,134 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_825 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_825) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_825 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_825) c_~queue~0.base) .cse0)))))) is different from false [2022-11-03 04:00:23,303 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (select .cse2 (+ c_~queue~0.offset .cse5))) (.cse4 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_825 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_825) c_~queue~0.base) .cse4)))) (forall ((v_ArrVal_825 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_825) c_~queue~0.base) .cse4)) 1))))))) is different from false [2022-11-03 04:00:23,421 INFO L356 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-03 04:00:23,422 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 286 treesize of output 240 [2022-11-03 04:00:23,444 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 59 treesize of output 52 [2022-11-03 04:00:23,455 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 52 treesize of output 45 [2022-11-03 04:00:24,158 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 3 not checked. [2022-11-03 04:00:24,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594975828] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:00:24,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [919437203] [2022-11-03 04:00:24,159 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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:00:24,159 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:00:24,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 12] total 37 [2022-11-03 04:00:24,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217996671] [2022-11-03 04:00:24,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:00:24,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-03 04:00:24,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:00:24,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-03 04:00:24,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1102, Unknown=2, NotChecked=138, Total=1406 [2022-11-03 04:00:24,161 INFO L87 Difference]: Start difference. First operand 533 states and 1328 transitions. Second operand has 38 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 37 states have internal predecessors, (70), 0 states have call successors, (0), 0 states 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:00:27,124 WARN L833 $PredicateComparison]: unable to prove that (and (<= c_~sum~0 0) (<= c_~v_assert~0 1) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (select .cse2 (+ c_~queue~0.offset .cse5))) (.cse4 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_825 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_825) c_~queue~0.base) .cse4)))) (forall ((v_ArrVal_825 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_825) c_~queue~0.base) .cse4)) 1))))))) (<= 1 c_~v_assert~0) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (<= 0 c_~sum~0)) is different from false [2022-11-03 04:00:27,583 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (select .cse2 (+ c_~queue~0.offset .cse5))) (.cse4 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_825 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_825) c_~queue~0.base) .cse4)))) (forall ((v_ArrVal_825 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_825) c_~queue~0.base) .cse4)) 1))))))) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0))) is different from false [2022-11-03 04:00:27,592 WARN L833 $PredicateComparison]: unable to prove that (and (<= c_~sum~0 0) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (select .cse2 (+ c_~queue~0.offset .cse5))) (.cse4 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_825 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_825) c_~queue~0.base) .cse4)))) (forall ((v_ArrVal_825 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_825) c_~queue~0.base) .cse4)) 1))))))) (<= 1 c_~v_assert~0) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (<= 0 c_~sum~0)) is different from false [2022-11-03 04:00:28,277 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (<= c_~sum~0 0) (forall ((v_ArrVal_825 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_825) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_825 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_825) c_~queue~0.base) .cse0)))) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (<= 0 c_~sum~0))) is different from false [2022-11-03 04:00:28,927 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_825 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_825) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_825 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_825) c_~queue~0.base) .cse0)))) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)))) is different from false [2022-11-03 04:00:30,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:30,539 INFO L93 Difference]: Finished difference Result 1138 states and 2779 transitions. [2022-11-03 04:00:30,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-11-03 04:00:30,540 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 37 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-03 04:00:30,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:30,543 INFO L225 Difference]: With dead ends: 1138 [2022-11-03 04:00:30,543 INFO L226 Difference]: Without dead ends: 1138 [2022-11-03 04:00:30,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 51 SyntacticMatches, 5 SemanticMatches, 99 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2451 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=1250, Invalid=7513, Unknown=7, NotChecked=1330, Total=10100 [2022-11-03 04:00:30,544 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 397 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 1950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 657 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:30,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 14 Invalid, 1950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 1082 Invalid, 0 Unknown, 657 Unchecked, 1.1s Time] [2022-11-03 04:00:30,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2022-11-03 04:00:30,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 573. [2022-11-03 04:00:30,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 572 states have (on average 2.506993006993007) internal successors, (1434), 572 states have internal predecessors, (1434), 0 states have call successors, (0), 0 states 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:00:30,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 1434 transitions. [2022-11-03 04:00:30,564 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 1434 transitions. Word has length 30 [2022-11-03 04:00:30,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:30,564 INFO L495 AbstractCegarLoop]: Abstraction has 573 states and 1434 transitions. [2022-11-03 04:00:30,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 37 states have internal predecessors, (70), 0 states have call successors, (0), 0 states 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:00:30,565 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 1434 transitions. [2022-11-03 04:00:30,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 04:00:30,566 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:30,566 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:00:30,602 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:30,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:00:30,795 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:00:30,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:30,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1373273547, now seen corresponding path program 16 times [2022-11-03 04:00:30,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:00:30,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692631950] [2022-11-03 04:00:30,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:30,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:00:30,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:32,785 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:00:32,785 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:00:32,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692631950] [2022-11-03 04:00:32,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692631950] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:00:32,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126996561] [2022-11-03 04:00:32,786 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 04:00:32,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:00:32,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:00:32,787 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:00:32,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-03 04:00:32,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:32,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-03 04:00:32,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:33,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:00:33,343 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 44 treesize of output 42 [2022-11-03 04:00:33,395 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:00:33,395 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 48 treesize of output 14 [2022-11-03 04:00:33,467 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:00:33,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:00:33,618 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_878 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_878) c_~queue~0.base) .cse0) c_~sum~0))) (forall ((v_ArrVal_878 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_878) c_~queue~0.base) .cse0) c_~sum~0) 1)))) is different from false [2022-11-03 04:00:33,642 WARN L833 $PredicateComparison]: unable to prove that (or (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (+ c_~queue~0.offset .cse2 4)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse2)))) (and (forall ((v_ArrVal_878 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_878) c_~queue~0.base) .cse0) c_~sum~0 .cse1) 1)) (forall ((v_ArrVal_878 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_878) c_~queue~0.base) .cse0) c_~sum~0 .cse1))))))) is different from false [2022-11-03 04:00:33,683 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse5 4)) (.cse4 (select .cse2 (+ c_~queue~0.offset .cse5)))) (and (forall ((v_ArrVal_878 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_878) c_~queue~0.base) .cse3) c_~sum~0 .cse4) 1)) (forall ((v_ArrVal_878 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_878) c_~queue~0.base) .cse3) c_~sum~0 .cse4)))))))) is different from false [2022-11-03 04:00:33,827 INFO L356 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-03 04:00:33,828 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 286 treesize of output 240 [2022-11-03 04:00:33,840 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 59 treesize of output 52 [2022-11-03 04:00:33,852 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 52 treesize of output 45 [2022-11-03 04:00:34,606 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 3 not checked. [2022-11-03 04:00:34,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126996561] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:00:34,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1592241134] [2022-11-03 04:00:34,607 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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:00:34,607 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:00:34,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 11] total 36 [2022-11-03 04:00:34,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347437246] [2022-11-03 04:00:34,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:00:34,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-03 04:00:34,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:00:34,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-03 04:00:34,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=972, Unknown=3, NotChecked=198, Total=1332 [2022-11-03 04:00:34,609 INFO L87 Difference]: Start difference. First operand 573 states and 1434 transitions. Second operand has 37 states, 37 states have (on average 1.837837837837838) internal successors, (68), 36 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:00:36,858 WARN L833 $PredicateComparison]: unable to prove that (and (<= c_~sum~0 0) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse5 4)) (.cse4 (select .cse2 (+ c_~queue~0.offset .cse5)))) (and (forall ((v_ArrVal_878 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_878) c_~queue~0.base) .cse3) c_~sum~0 .cse4) 1)) (forall ((v_ArrVal_878 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_878) c_~queue~0.base) .cse3) c_~sum~0 .cse4)))))))) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0)) is different from false [2022-11-03 04:00:37,123 WARN L833 $PredicateComparison]: unable to prove that (and (<= c_~sum~0 0) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse5 4)) (.cse4 (select .cse2 (+ c_~queue~0.offset .cse5)))) (and (forall ((v_ArrVal_878 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_878) c_~queue~0.base) .cse3) c_~sum~0 .cse4) 1)) (forall ((v_ArrVal_878 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_878) c_~queue~0.base) .cse3) c_~sum~0 .cse4)))))))) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0)) is different from false [2022-11-03 04:00:37,841 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse5 4)) (.cse4 (select .cse2 (+ c_~queue~0.offset .cse5)))) (and (forall ((v_ArrVal_878 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_878) c_~queue~0.base) .cse3) c_~sum~0 .cse4) 1)) (forall ((v_ArrVal_878 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_878) c_~queue~0.base) .cse3) c_~sum~0 .cse4)))))))) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= 0 c_~sum~0) (<= c_~sum~0 1) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-11-03 04:00:38,153 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (forall ((v_ArrVal_878 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_878) c_~queue~0.base) .cse0) c_~sum~0))) (forall ((v_ArrVal_878 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_878) c_~queue~0.base) .cse0) c_~sum~0) 1)))) is different from false [2022-11-03 04:00:38,163 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse5 4)) (.cse4 (select .cse2 (+ c_~queue~0.offset .cse5)))) (and (forall ((v_ArrVal_878 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_878) c_~queue~0.base) .cse3) c_~sum~0 .cse4) 1)) (forall ((v_ArrVal_878 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_878) c_~queue~0.base) .cse3) c_~sum~0 .cse4)))))))) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-11-03 04:00:38,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:38,744 INFO L93 Difference]: Finished difference Result 1038 states and 2579 transitions. [2022-11-03 04:00:38,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-11-03 04:00:38,745 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.837837837837838) internal successors, (68), 36 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-03 04:00:38,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:38,755 INFO L225 Difference]: With dead ends: 1038 [2022-11-03 04:00:38,755 INFO L226 Difference]: Without dead ends: 1038 [2022-11-03 04:00:38,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 37 SyntacticMatches, 10 SemanticMatches, 80 ConstructedPredicates, 8 IntricatePredicates, 1 DeprecatedPredicates, 1702 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=847, Invalid=4579, Unknown=8, NotChecked=1208, Total=6642 [2022-11-03 04:00:38,760 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 335 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 1682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 483 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:38,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 37 Invalid, 1682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 1040 Invalid, 0 Unknown, 483 Unchecked, 1.0s Time] [2022-11-03 04:00:38,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2022-11-03 04:00:38,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 637. [2022-11-03 04:00:38,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 636 states have (on average 2.529874213836478) internal successors, (1609), 636 states have internal predecessors, (1609), 0 states have call successors, (0), 0 states 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:00:38,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 1609 transitions. [2022-11-03 04:00:38,773 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 1609 transitions. Word has length 30 [2022-11-03 04:00:38,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:38,773 INFO L495 AbstractCegarLoop]: Abstraction has 637 states and 1609 transitions. [2022-11-03 04:00:38,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.837837837837838) internal successors, (68), 36 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:00:38,774 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 1609 transitions. [2022-11-03 04:00:38,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 04:00:38,777 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:38,777 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:00:38,813 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:38,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-03 04:00:38,999 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:00:38,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:39,000 INFO L85 PathProgramCache]: Analyzing trace with hash 943557121, now seen corresponding path program 17 times [2022-11-03 04:00:39,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:00:39,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026997347] [2022-11-03 04:00:39,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:39,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:00:39,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:41,064 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:00:41,065 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:00:41,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026997347] [2022-11-03 04:00:41,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026997347] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:00:41,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685555098] [2022-11-03 04:00:41,065 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:00:41,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:00:41,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:00:41,067 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:00:41,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-03 04:00:41,333 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-03 04:00:41,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:00:41,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-03 04:00:41,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:41,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:00:41,702 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 44 treesize of output 42 [2022-11-03 04:00:41,786 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:00:41,787 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 48 treesize of output 14 [2022-11-03 04:00:41,859 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 04:00:41,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:00:42,068 WARN L833 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_931 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_931) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_931 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_931) c_~queue~0.base) .cse0))))))) is different from false [2022-11-03 04:00:42,083 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse2))) (.cse1 (+ c_~queue~0.offset .cse2 4))) (and (forall ((v_ArrVal_931 (Array Int Int))) (<= (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_931) c_~queue~0.base) .cse1)) 1)) (forall ((v_ArrVal_931 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_931) c_~queue~0.base) .cse1))))))) (= (mod c_~v_assert~0 256) 0)) is different from false [2022-11-03 04:00:42,133 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (select .cse3 (+ c_~queue~0.offset .cse2))) (.cse1 (+ c_~queue~0.offset .cse2 4))) (and (forall ((v_ArrVal_931 (Array Int Int))) (<= (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_931) c_~queue~0.base) .cse1)) 1)) (forall ((v_ArrVal_931 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_931) c_~queue~0.base) .cse1))))))) (let ((.cse4 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse5 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse4) (not (= (+ .cse5 1) 0))) (or .cse4 (not (= .cse5 1))))) (= (mod c_~v_assert~0 256) 0))) is different from false [2022-11-03 04:00:42,275 INFO L356 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-03 04:00:42,275 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 286 treesize of output 240 [2022-11-03 04:00:42,287 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 59 treesize of output 52 [2022-11-03 04:00:42,300 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 52 treesize of output 45 [2022-11-03 04:00:43,018 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 5 not checked. [2022-11-03 04:00:43,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685555098] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:00:43,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1322303739] [2022-11-03 04:00:43,018 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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:00:43,019 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:00:43,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 11] total 35 [2022-11-03 04:00:43,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098745539] [2022-11-03 04:00:43,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:00:43,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-03 04:00:43,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:00:43,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-03 04:00:43,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=916, Unknown=3, NotChecked=192, Total=1260 [2022-11-03 04:00:43,021 INFO L87 Difference]: Start difference. First operand 637 states and 1609 transitions. Second operand has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 35 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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:00:46,073 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse3 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (select .cse3 (+ c_~queue~0.offset .cse2))) (.cse1 (+ c_~queue~0.offset .cse2 4))) (and (forall ((v_ArrVal_931 (Array Int Int))) (<= (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_931) c_~queue~0.base) .cse1)) 1)) (forall ((v_ArrVal_931 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_931) c_~queue~0.base) .cse1))))))) (let ((.cse4 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse5 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse4) (not (= (+ .cse5 1) 0))) (or .cse4 (not (= .cse5 1))))) (= (mod c_~v_assert~0 256) 0))) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-11-03 04:00:46,264 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse3 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (select .cse3 (+ c_~queue~0.offset .cse2))) (.cse1 (+ c_~queue~0.offset .cse2 4))) (and (forall ((v_ArrVal_931 (Array Int Int))) (<= (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_931) c_~queue~0.base) .cse1)) 1)) (forall ((v_ArrVal_931 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_931) c_~queue~0.base) .cse1))))))) (let ((.cse4 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse5 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse4) (not (= (+ .cse5 1) 0))) (or .cse4 (not (= .cse5 1))))) (= (mod c_~v_assert~0 256) 0))) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1)) is different from false [2022-11-03 04:00:47,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:00:47,472 INFO L93 Difference]: Finished difference Result 1318 states and 3436 transitions. [2022-11-03 04:00:47,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-11-03 04:00:47,473 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 35 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-03 04:00:47,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:00:47,476 INFO L225 Difference]: With dead ends: 1318 [2022-11-03 04:00:47,476 INFO L226 Difference]: Without dead ends: 1226 [2022-11-03 04:00:47,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 43 SyntacticMatches, 7 SemanticMatches, 81 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1645 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=962, Invalid=5055, Unknown=9, NotChecked=780, Total=6806 [2022-11-03 04:00:47,477 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 465 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 1214 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 1911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 1214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 485 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:00:47,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 8 Invalid, 1911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 1214 Invalid, 0 Unknown, 485 Unchecked, 1.2s Time] [2022-11-03 04:00:47,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2022-11-03 04:00:47,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 577. [2022-11-03 04:00:47,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 576 states have (on average 2.5104166666666665) internal successors, (1446), 576 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states 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:00:47,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 1446 transitions. [2022-11-03 04:00:47,495 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 1446 transitions. Word has length 30 [2022-11-03 04:00:47,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:00:47,496 INFO L495 AbstractCegarLoop]: Abstraction has 577 states and 1446 transitions. [2022-11-03 04:00:47,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 35 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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:00:47,496 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 1446 transitions. [2022-11-03 04:00:47,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 04:00:47,500 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:00:47,501 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:00:47,534 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-03 04:00:47,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:00:47,715 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:00:47,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:00:47,715 INFO L85 PathProgramCache]: Analyzing trace with hash -875616035, now seen corresponding path program 18 times [2022-11-03 04:00:47,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:00:47,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279443972] [2022-11-03 04:00:47,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:00:47,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:00:47,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:00:49,914 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:00:49,914 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:00:49,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279443972] [2022-11-03 04:00:49,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279443972] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:00:49,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763435529] [2022-11-03 04:00:49,915 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 04:00:49,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:00:49,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:00:49,916 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:00:49,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-03 04:00:50,047 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 04:00:50,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:00:50,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-03 04:00:50,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:00:50,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:00:50,366 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 18 treesize of output 20 [2022-11-03 04:00:50,533 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:00:50,534 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 48 treesize of output 14 [2022-11-03 04:00:50,621 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:00:50,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:00:51,048 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse6 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse9 (* c_~front~0 4))) (let ((.cse1 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse2 (+ c_~queue~0.offset .cse9)) (.cse3 (+ c_~queue~0.offset .cse9 4)) (.cse4 (not .cse6))) (and (or (forall ((v_ArrVal_984 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_984) c_~queue~0.base))) (or (not (= (+ (select .cse0 .cse1) 1) 0)) (<= (+ c_~sum~0 (select .cse0 .cse2) (select .cse0 .cse3)) 1)))) .cse4) (or (forall ((v_ArrVal_984 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_984) c_~queue~0.base))) (or (not (= (select .cse5 .cse1) 1)) (<= 0 (+ c_~sum~0 (select .cse5 .cse2) (select .cse5 .cse3)))))) .cse6) (or (forall ((v_ArrVal_984 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_984) c_~queue~0.base))) (or (not (= (select .cse7 .cse1) 1)) (<= (+ c_~sum~0 (select .cse7 .cse2) (select .cse7 .cse3)) 1)))) .cse6) (or (forall ((v_ArrVal_984 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_984) c_~queue~0.base))) (or (not (= (+ (select .cse8 .cse1) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse8 .cse2) (select .cse8 .cse3)))))) .cse4)))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-11-03 04:00:51,286 INFO L356 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-03 04:00:51,286 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 504 treesize of output 424 [2022-11-03 04:00:51,320 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:00:51,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 267 treesize of output 275 [2022-11-03 04:00:51,355 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:00:51,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 248 treesize of output 256 [2022-11-03 04:00:51,390 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:00:51,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 229 treesize of output 237 [2022-11-03 04:00:51,426 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:00:51,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 210 treesize of output 218 [2022-11-03 04:00:53,782 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 1 not checked. [2022-11-03 04:00:53,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763435529] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:00:53,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [247933306] [2022-11-03 04:00:53,782 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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:00:53,782 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:00:53,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 12] total 37 [2022-11-03 04:00:53,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764374733] [2022-11-03 04:00:53,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:00:53,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-03 04:00:53,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:00:53,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-03 04:00:53,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1172, Unknown=1, NotChecked=70, Total=1406 [2022-11-03 04:00:53,784 INFO L87 Difference]: Start difference. First operand 577 states and 1446 transitions. Second operand has 38 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 37 states have internal predecessors, (70), 0 states have call successors, (0), 0 states 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:00:55,964 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (* c_~front~0 4)) (.cse12 (* c_~back~0 4))) (let ((.cse1 (+ c_~queue~0.offset .cse12)) (.cse2 (+ c_~queue~0.offset .cse9)) (.cse10 (div |c_thread2Thread1of1ForFork2_~b~0#1| 256))) (and (or (let ((.cse6 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0))) (let ((.cse3 (+ c_~queue~0.offset .cse9 4)) (.cse4 (not .cse6))) (and (or (forall ((v_ArrVal_984 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_984) c_~queue~0.base))) (or (not (= (+ (select .cse0 .cse1) 1) 0)) (<= (+ c_~sum~0 (select .cse0 .cse2) (select .cse0 .cse3)) 1)))) .cse4) (or (forall ((v_ArrVal_984 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_984) c_~queue~0.base))) (or (not (= (select .cse5 .cse1) 1)) (<= 0 (+ c_~sum~0 (select .cse5 .cse2) (select .cse5 .cse3)))))) .cse6) (or (forall ((v_ArrVal_984 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_984) c_~queue~0.base))) (or (not (= (select .cse7 .cse1) 1)) (<= (+ c_~sum~0 (select .cse7 .cse2) (select .cse7 .cse3)) 1)))) .cse6) (or (forall ((v_ArrVal_984 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_984) c_~queue~0.base))) (or (not (= (+ (select .cse8 .cse1) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse8 .cse2) (select .cse8 .cse3)))))) .cse4)))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (<= |c_thread2Thread1of1ForFork2_~b~0#1| (* .cse10 256)) (= c_~queue~0.offset 0) (let ((.cse11 (* c_~n~0 4))) (or (<= .cse11 (+ c_~queue~0.offset 3 .cse12)) (let ((.cse15 (select |c_#memory_int| c_~queue~0.base))) (and (or (< 0 .cse9) (= (+ .cse9 4) .cse1)) (or (let ((.cse14 (select .cse15 8)) (.cse13 (select .cse15 .cse1))) (and (<= .cse13 .cse14) (<= (+ .cse9 .cse11) (+ .cse12 8)) (<= .cse14 .cse13))) (<= .cse2 3)) (<= 0 c_~front~0) (= (select .cse15 .cse2) 1) (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|)) (= c_~sum~0 0))))) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (not (<= (+ .cse10 1) 0))))) is different from false [2022-11-03 04:00:57,135 WARN L833 $PredicateComparison]: unable to prove that (and (or (let ((.cse6 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse9 (* c_~front~0 4))) (let ((.cse1 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse2 (+ c_~queue~0.offset .cse9)) (.cse3 (+ c_~queue~0.offset .cse9 4)) (.cse4 (not .cse6))) (and (or (forall ((v_ArrVal_984 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_984) c_~queue~0.base))) (or (not (= (+ (select .cse0 .cse1) 1) 0)) (<= (+ c_~sum~0 (select .cse0 .cse2) (select .cse0 .cse3)) 1)))) .cse4) (or (forall ((v_ArrVal_984 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_984) c_~queue~0.base))) (or (not (= (select .cse5 .cse1) 1)) (<= 0 (+ c_~sum~0 (select .cse5 .cse2) (select .cse5 .cse3)))))) .cse6) (or (forall ((v_ArrVal_984 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_984) c_~queue~0.base))) (or (not (= (select .cse7 .cse1) 1)) (<= (+ c_~sum~0 (select .cse7 .cse2) (select .cse7 .cse3)) 1)))) .cse6) (or (forall ((v_ArrVal_984 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_984) c_~queue~0.base))) (or (not (= (+ (select .cse8 .cse1) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse8 .cse2) (select .cse8 .cse3)))))) .cse4)))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0))) is different from false [2022-11-03 04:01:05,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:01:05,453 INFO L93 Difference]: Finished difference Result 1307 states and 3198 transitions. [2022-11-03 04:01:05,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2022-11-03 04:01:05,454 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 37 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-03 04:01:05,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:01:05,457 INFO L225 Difference]: With dead ends: 1307 [2022-11-03 04:01:05,457 INFO L226 Difference]: Without dead ends: 1307 [2022-11-03 04:01:05,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 132 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 5755 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=2071, Invalid=14968, Unknown=3, NotChecked=780, Total=17822 [2022-11-03 04:01:05,458 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 458 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 1462 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 2373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 1462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 658 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-03 04:01:05,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 24 Invalid, 2373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 1462 Invalid, 0 Unknown, 658 Unchecked, 1.6s Time] [2022-11-03 04:01:05,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1307 states. [2022-11-03 04:01:05,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1307 to 614. [2022-11-03 04:01:05,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 613 states have (on average 2.5187601957585644) internal successors, (1544), 613 states have internal predecessors, (1544), 0 states have call successors, (0), 0 states 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:01:05,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 1544 transitions. [2022-11-03 04:01:05,471 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 1544 transitions. Word has length 30 [2022-11-03 04:01:05,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:01:05,471 INFO L495 AbstractCegarLoop]: Abstraction has 614 states and 1544 transitions. [2022-11-03 04:01:05,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 37 states have internal predecessors, (70), 0 states have call successors, (0), 0 states 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:01:05,471 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 1544 transitions. [2022-11-03 04:01:05,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 04:01:05,472 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:01:05,473 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:01:05,497 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-03 04:01:05,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-03 04:01:05,683 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:01:05,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:01:05,683 INFO L85 PathProgramCache]: Analyzing trace with hash -395894511, now seen corresponding path program 19 times [2022-11-03 04:01:05,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:01:05,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548688761] [2022-11-03 04:01:05,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:01:05,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:01:05,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:01:07,563 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:01:07,563 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:01:07,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548688761] [2022-11-03 04:01:07,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548688761] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:01:07,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611677221] [2022-11-03 04:01:07,564 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 04:01:07,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:01:07,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:01:07,567 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:01:07,577 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-03 04:01:07,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:01:07,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-03 04:01:07,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:01:08,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:01:08,045 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 18 treesize of output 20 [2022-11-03 04:01:08,181 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:01:08,181 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 48 treesize of output 14 [2022-11-03 04:01:08,248 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 04:01:08,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:01:08,601 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse9 (* c_~front~0 4)) (.cse6 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0))) (let ((.cse4 (not .cse6)) (.cse1 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse2 (+ c_~queue~0.offset .cse9 4)) (.cse3 (+ c_~queue~0.offset .cse9))) (and (or (forall ((v_ArrVal_1037 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1037) c_~queue~0.base))) (or (not (= (+ (select .cse0 .cse1) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse0 .cse2) (select .cse0 .cse3)))))) .cse4) (or (forall ((v_ArrVal_1037 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1037) c_~queue~0.base))) (or (not (= (select .cse5 .cse1) 1)) (<= 0 (+ c_~sum~0 (select .cse5 .cse2) (select .cse5 .cse3)))))) .cse6) (or (forall ((v_ArrVal_1037 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1037) c_~queue~0.base))) (or (not (= (select .cse7 .cse1) 1)) (<= (+ c_~sum~0 (select .cse7 .cse2) (select .cse7 .cse3)) 1)))) .cse6) (or .cse4 (forall ((v_ArrVal_1037 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1037) c_~queue~0.base))) (or (not (= (+ (select .cse8 .cse1) 1) 0)) (<= (+ c_~sum~0 (select .cse8 .cse2) (select .cse8 .cse3)) 1)))))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-11-03 04:01:08,754 INFO L356 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-03 04:01:08,755 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 504 treesize of output 424 [2022-11-03 04:01:08,783 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:01:08,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 267 treesize of output 275 [2022-11-03 04:01:08,829 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:01:08,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 248 treesize of output 256 [2022-11-03 04:01:08,865 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:01:08,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 229 treesize of output 237 [2022-11-03 04:01:08,898 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:01:08,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 210 treesize of output 218 [2022-11-03 04:01:11,912 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 04:01:11,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611677221] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:01:11,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1246737565] [2022-11-03 04:01:11,913 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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:01:11,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:01:11,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 11] total 34 [2022-11-03 04:01:11,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635980930] [2022-11-03 04:01:11,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:01:11,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-03 04:01:11,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:01:11,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-03 04:01:11,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=975, Unknown=1, NotChecked=64, Total=1190 [2022-11-03 04:01:11,915 INFO L87 Difference]: Start difference. First operand 614 states and 1544 transitions. Second operand has 35 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 34 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:01:20,535 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse13 (* c_~front~0 4)) (.cse6 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0))) (let ((.cse4 (not .cse6)) (.cse7 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse3 (+ c_~queue~0.offset .cse13 4)) (.cse2 (+ c_~queue~0.offset .cse13)) (.cse8 (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0))) (and (let ((.cse1 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (+ c_~sum~0 (select .cse1 .cse2) (select .cse1 .cse3)))) (and (<= .cse0 1) (<= 0 .cse0))) (let ((.cse5 (select .cse1 .cse7))) (and (or .cse4 (not (= (+ .cse5 1) 0))) (or .cse6 (not (= .cse5 1))))) .cse8)) (or (and (or (forall ((v_ArrVal_1037 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1037) c_~queue~0.base))) (or (not (= (+ (select .cse9 .cse7) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse9 .cse3) (select .cse9 .cse2)))))) .cse4) (or (forall ((v_ArrVal_1037 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1037) c_~queue~0.base))) (or (not (= (select .cse10 .cse7) 1)) (<= 0 (+ c_~sum~0 (select .cse10 .cse3) (select .cse10 .cse2)))))) .cse6) (or (forall ((v_ArrVal_1037 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1037) c_~queue~0.base))) (or (not (= (select .cse11 .cse7) 1)) (<= (+ c_~sum~0 (select .cse11 .cse3) (select .cse11 .cse2)) 1)))) .cse6) (or .cse4 (forall ((v_ArrVal_1037 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1037) c_~queue~0.base))) (or (not (= (+ (select .cse12 .cse7) 1) 0)) (<= (+ c_~sum~0 (select .cse12 .cse3) (select .cse12 .cse2)) 1)))))) .cse8)))) is different from false [2022-11-03 04:01:21,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:01:21,230 INFO L93 Difference]: Finished difference Result 1159 states and 2848 transitions. [2022-11-03 04:01:21,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2022-11-03 04:01:21,231 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 34 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-03 04:01:21,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:01:21,233 INFO L225 Difference]: With dead ends: 1159 [2022-11-03 04:01:21,233 INFO L226 Difference]: Without dead ends: 1159 [2022-11-03 04:01:21,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 39 SyntacticMatches, 7 SemanticMatches, 115 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 4451 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=1585, Invalid=11531, Unknown=2, NotChecked=454, Total=13572 [2022-11-03 04:01:21,234 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 485 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 1896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 540 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:01:21,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 31 Invalid, 1896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 1118 Invalid, 0 Unknown, 540 Unchecked, 1.2s Time] [2022-11-03 04:01:21,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2022-11-03 04:01:21,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 624. [2022-11-03 04:01:21,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 623 states have (on average 2.518459069020867) internal successors, (1569), 623 states have internal predecessors, (1569), 0 states have call successors, (0), 0 states 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:01:21,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 1569 transitions. [2022-11-03 04:01:21,249 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 1569 transitions. Word has length 30 [2022-11-03 04:01:21,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:01:21,249 INFO L495 AbstractCegarLoop]: Abstraction has 624 states and 1569 transitions. [2022-11-03 04:01:21,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 34 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:01:21,249 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 1569 transitions. [2022-11-03 04:01:21,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 04:01:21,251 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:01:21,251 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:01:21,275 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-03 04:01:21,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-03 04:01:21,451 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:01:21,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:01:21,452 INFO L85 PathProgramCache]: Analyzing trace with hash -825610937, now seen corresponding path program 20 times [2022-11-03 04:01:21,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:01:21,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422511250] [2022-11-03 04:01:21,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:01:21,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:01:21,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:01:23,696 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:01:23,697 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:01:23,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422511250] [2022-11-03 04:01:23,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422511250] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:01:23,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697695516] [2022-11-03 04:01:23,697 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:01:23,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:01:23,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:01:23,698 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:01:23,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-03 04:01:24,027 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-03 04:01:24,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:01:24,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-03 04:01:24,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:01:24,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:01:24,348 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 18 treesize of output 20 [2022-11-03 04:01:24,535 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:01:24,535 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 48 treesize of output 14 [2022-11-03 04:01:24,631 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 04:01:24,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:01:25,080 WARN L833 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (let ((.cse8 (* c_~front~0 4))) (let ((.cse2 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse3 (+ c_~queue~0.offset .cse8 4)) (.cse4 (+ c_~queue~0.offset .cse8)) (.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0))) (and (or (not .cse0) (and (forall ((v_ArrVal_1090 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1090) c_~queue~0.base))) (or (not (= (+ (select .cse1 .cse2) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse1 .cse3) (select .cse1 .cse4)))))) (forall ((v_ArrVal_1090 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1090) c_~queue~0.base))) (or (not (= (+ (select .cse5 .cse2) 1) 0)) (<= (+ c_~sum~0 (select .cse5 .cse3) (select .cse5 .cse4)) 1)))))) (or (and (forall ((v_ArrVal_1090 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1090) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse6 .cse3) (select .cse6 .cse4))) (not (= (select .cse6 .cse2) 1))))) (forall ((v_ArrVal_1090 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1090) c_~queue~0.base))) (or (not (= (select .cse7 .cse2) 1)) (<= (+ c_~sum~0 (select .cse7 .cse3) (select .cse7 .cse4)) 1))))) .cse0))))) is different from false [2022-11-03 04:01:25,227 INFO L356 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-03 04:01:25,228 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 497 treesize of output 417 [2022-11-03 04:01:25,257 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:01:25,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 260 treesize of output 268 [2022-11-03 04:01:25,286 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:01:25,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 241 treesize of output 249 [2022-11-03 04:01:25,318 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:01:25,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 222 treesize of output 230 [2022-11-03 04:01:25,353 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:01:25,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 203 treesize of output 211 [2022-11-03 04:01:28,040 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 1 not checked. [2022-11-03 04:01:28,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697695516] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:01:28,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [75779190] [2022-11-03 04:01:28,041 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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:01:28,041 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:01:28,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 11] total 34 [2022-11-03 04:01:28,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12558216] [2022-11-03 04:01:28,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:01:28,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-03 04:01:28,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:01:28,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-03 04:01:28,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=971, Unknown=1, NotChecked=64, Total=1190 [2022-11-03 04:01:28,043 INFO L87 Difference]: Start difference. First operand 624 states and 1569 transitions. Second operand has 35 states, 35 states have (on average 2.057142857142857) 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:01:36,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:01:36,442 INFO L93 Difference]: Finished difference Result 2483 states and 6408 transitions. [2022-11-03 04:01:36,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-11-03 04:01:36,442 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.057142857142857) 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 30 [2022-11-03 04:01:36,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:01:36,450 INFO L225 Difference]: With dead ends: 2483 [2022-11-03 04:01:36,450 INFO L226 Difference]: Without dead ends: 2151 [2022-11-03 04:01:36,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 39 SyntacticMatches, 7 SemanticMatches, 109 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4136 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=1952, Invalid=10035, Unknown=7, NotChecked=216, Total=12210 [2022-11-03 04:01:36,452 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 518 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 1722 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 2344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 1722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 333 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-03 04:01:36,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 8 Invalid, 2344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 1722 Invalid, 0 Unknown, 333 Unchecked, 1.9s Time] [2022-11-03 04:01:36,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2151 states. [2022-11-03 04:01:36,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2151 to 870. [2022-11-03 04:01:36,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 869 states have (on average 2.5799769850402763) internal successors, (2242), 869 states have internal predecessors, (2242), 0 states have call successors, (0), 0 states 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:01:36,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 2242 transitions. [2022-11-03 04:01:36,496 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 2242 transitions. Word has length 30 [2022-11-03 04:01:36,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:01:36,496 INFO L495 AbstractCegarLoop]: Abstraction has 870 states and 2242 transitions. [2022-11-03 04:01:36,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.057142857142857) 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:01:36,497 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 2242 transitions. [2022-11-03 04:01:36,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 04:01:36,499 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:01:36,499 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:01:36,543 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-11-03 04:01:36,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-03 04:01:36,715 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:01:36,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:01:36,715 INFO L85 PathProgramCache]: Analyzing trace with hash 394360723, now seen corresponding path program 21 times [2022-11-03 04:01:36,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:01:36,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361534189] [2022-11-03 04:01:36,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:01:36,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:01:36,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:01:38,672 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:01:38,672 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:01:38,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361534189] [2022-11-03 04:01:38,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361534189] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:01:38,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503225920] [2022-11-03 04:01:38,674 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 04:01:38,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:01:38,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:01:38,675 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:01:38,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-03 04:01:38,820 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 04:01:38,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:01:38,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-03 04:01:38,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:01:39,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:01:39,250 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 44 treesize of output 42 [2022-11-03 04:01:39,297 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:01:39,298 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 48 treesize of output 14 [2022-11-03 04:01:39,379 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:01:39,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:01:39,577 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1143 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1143) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_1143 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1143) c_~queue~0.base) .cse0)))))) is different from false [2022-11-03 04:01:39,959 INFO L356 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-03 04:01:39,960 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 286 treesize of output 240 [2022-11-03 04:01:39,971 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 59 treesize of output 52 [2022-11-03 04:01:39,983 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 52 treesize of output 45 [2022-11-03 04:01:40,790 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 04:01:40,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503225920] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:01:40,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1505732807] [2022-11-03 04:01:40,790 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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:01:40,791 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:01:40,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 12] total 36 [2022-11-03 04:01:40,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359953203] [2022-11-03 04:01:40,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:01:40,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-03 04:01:40,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:01:40,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-03 04:01:40,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1115, Unknown=1, NotChecked=68, Total=1332 [2022-11-03 04:01:40,793 INFO L87 Difference]: Start difference. First operand 870 states and 2242 transitions. Second operand has 37 states, 37 states have (on average 1.8918918918918919) internal successors, (70), 36 states have internal predecessors, (70), 0 states have call successors, (0), 0 states 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:01:48,783 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1143 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1143) c_~queue~0.base) .cse0)) 1)) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (forall ((v_ArrVal_1143 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1143) c_~queue~0.base) .cse0)))))) is different from false [2022-11-03 04:01:48,984 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1143 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1143) c_~queue~0.base) .cse0)) 1)) (or (not (<= (mod c_~v_assert~0 256) 0)) (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0))) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (<= 0 c_~sum~0) (<= c_~sum~0 1) (forall ((v_ArrVal_1143 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1143) c_~queue~0.base) .cse0)))))) is different from false [2022-11-03 04:01:49,151 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1143 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1143) c_~queue~0.base) .cse0)) 1)) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (<= 0 c_~sum~0) (<= c_~sum~0 1) (forall ((v_ArrVal_1143 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1143) c_~queue~0.base) .cse0)))))) is different from false [2022-11-03 04:01:49,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:01:49,965 INFO L93 Difference]: Finished difference Result 2990 states and 7754 transitions. [2022-11-03 04:01:49,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2022-11-03 04:01:49,966 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.8918918918918919) internal successors, (70), 36 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-03 04:01:49,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:01:49,974 INFO L225 Difference]: With dead ends: 2990 [2022-11-03 04:01:49,974 INFO L226 Difference]: Without dead ends: 2758 [2022-11-03 04:01:49,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 51 SyntacticMatches, 17 SemanticMatches, 116 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 4485 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=2041, Invalid=10833, Unknown=24, NotChecked=908, Total=13806 [2022-11-03 04:01:49,976 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 562 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 1624 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 2963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 1624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1069 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-03 04:01:49,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 95 Invalid, 2963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 1624 Invalid, 0 Unknown, 1069 Unchecked, 1.7s Time] [2022-11-03 04:01:49,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2758 states. [2022-11-03 04:01:50,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2758 to 939. [2022-11-03 04:01:50,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 939 states, 938 states have (on average 2.5863539445629) internal successors, (2426), 938 states have internal predecessors, (2426), 0 states have call successors, (0), 0 states 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:01:50,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 2426 transitions. [2022-11-03 04:01:50,016 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 2426 transitions. Word has length 30 [2022-11-03 04:01:50,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:01:50,016 INFO L495 AbstractCegarLoop]: Abstraction has 939 states and 2426 transitions. [2022-11-03 04:01:50,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.8918918918918919) internal successors, (70), 36 states have internal predecessors, (70), 0 states have call successors, (0), 0 states 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:01:50,017 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 2426 transitions. [2022-11-03 04:01:50,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 04:01:50,018 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:01:50,019 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:01:50,055 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-03 04:01:50,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:01:50,231 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:01:50,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:01:50,231 INFO L85 PathProgramCache]: Analyzing trace with hash 2094631909, now seen corresponding path program 22 times [2022-11-03 04:01:50,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:01:50,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924405876] [2022-11-03 04:01:50,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:01:50,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:01:50,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:01:53,070 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:01:53,071 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:01:53,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924405876] [2022-11-03 04:01:53,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924405876] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:01:53,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057113492] [2022-11-03 04:01:53,071 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 04:01:53,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:01:53,071 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:01:53,072 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:01:53,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-03 04:01:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:01:53,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-03 04:01:53,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:01:53,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:01:53,668 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 44 treesize of output 42 [2022-11-03 04:01:53,716 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:01:53,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 48 treesize of output 14 [2022-11-03 04:01:53,801 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:01:53,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:01:53,974 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1196 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1196) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_1196 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1196) c_~queue~0.base) .cse0)) 1)))) is different from false [2022-11-03 04:01:54,379 INFO L356 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-03 04:01:54,380 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 286 treesize of output 240 [2022-11-03 04:01:54,393 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 59 treesize of output 52 [2022-11-03 04:01:54,415 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 52 treesize of output 45 [2022-11-03 04:01:55,063 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 1 not checked. [2022-11-03 04:01:55,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057113492] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:01:55,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [578332211] [2022-11-03 04:01:55,063 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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:01:55,064 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:01:55,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 11] total 35 [2022-11-03 04:01:55,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502171224] [2022-11-03 04:01:55,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:01:55,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-03 04:01:55,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:01:55,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-03 04:01:55,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1046, Unknown=1, NotChecked=66, Total=1260 [2022-11-03 04:01:55,065 INFO L87 Difference]: Start difference. First operand 939 states and 2426 transitions. Second operand has 36 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 35 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:02:00,109 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (forall ((v_ArrVal_1196 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1196) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_1196 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1196) c_~queue~0.base) .cse0)) 1)) (<= 0 c_~sum~0) (<= c_~sum~0 1))) is different from false [2022-11-03 04:02:00,174 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1196 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1196) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_1196 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1196) c_~queue~0.base) .cse0)) 1)) (<= 0 c_~sum~0) (<= c_~sum~0 1))) is different from false [2022-11-03 04:02:01,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:02:01,320 INFO L93 Difference]: Finished difference Result 2508 states and 6496 transitions. [2022-11-03 04:02:01,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-11-03 04:02:01,322 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 35 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-03 04:02:01,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:02:01,325 INFO L225 Difference]: With dead ends: 2508 [2022-11-03 04:02:01,325 INFO L226 Difference]: Without dead ends: 2230 [2022-11-03 04:02:01,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 50 SyntacticMatches, 11 SemanticMatches, 98 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2982 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1359, Invalid=7948, Unknown=17, NotChecked=576, Total=9900 [2022-11-03 04:02:01,326 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 482 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 1258 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 2135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 1258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 655 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-03 04:02:01,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 49 Invalid, 2135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 1258 Invalid, 0 Unknown, 655 Unchecked, 1.3s Time] [2022-11-03 04:02:01,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2230 states. [2022-11-03 04:02:01,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2230 to 821. [2022-11-03 04:02:01,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 820 states have (on average 2.5902439024390245) internal successors, (2124), 820 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states 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:02:01,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 2124 transitions. [2022-11-03 04:02:01,349 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 2124 transitions. Word has length 30 [2022-11-03 04:02:01,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:02:01,350 INFO L495 AbstractCegarLoop]: Abstraction has 821 states and 2124 transitions. [2022-11-03 04:02:01,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.8888888888888888) internal successors, (68), 35 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:02:01,350 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 2124 transitions. [2022-11-03 04:02:01,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-03 04:02:01,352 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:02:01,352 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:02:01,381 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-11-03 04:02:01,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-03 04:02:01,569 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:02:01,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:02:01,570 INFO L85 PathProgramCache]: Analyzing trace with hash 472238165, now seen corresponding path program 23 times [2022-11-03 04:02:01,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:02:01,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56663996] [2022-11-03 04:02:01,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:02:01,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:02:01,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:02:01,796 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:02:01,796 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:02:01,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56663996] [2022-11-03 04:02:01,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56663996] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:02:01,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482193962] [2022-11-03 04:02:01,797 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:02:01,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:02:01,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:02:01,799 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:02:01,826 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-03 04:02:02,164 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-03 04:02:02,164 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:02:02,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-03 04:02:02,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:02:02,362 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:02:02,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:02:02,585 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:02:02,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482193962] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:02:02,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1739117612] [2022-11-03 04:02:02,585 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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:02:02,585 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:02:02,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2022-11-03 04:02:02,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269935377] [2022-11-03 04:02:02,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:02:02,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-03 04:02:02,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:02:02,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-03 04:02:02,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2022-11-03 04:02:02,587 INFO L87 Difference]: Start difference. First operand 821 states and 2124 transitions. Second operand has 23 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 22 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:02:02,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:02:02,815 INFO L93 Difference]: Finished difference Result 829 states and 2138 transitions. [2022-11-03 04:02:02,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 04:02:02,816 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 22 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-03 04:02:02,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:02:02,817 INFO L225 Difference]: With dead ends: 829 [2022-11-03 04:02:02,817 INFO L226 Difference]: Without dead ends: 696 [2022-11-03 04:02:02,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=476, Unknown=0, NotChecked=0, Total=650 [2022-11-03 04:02:02,818 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 91 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:02:02,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 60 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 04:02:02,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2022-11-03 04:02:02,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 696. [2022-11-03 04:02:02,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 695 states have (on average 2.6690647482014387) internal successors, (1855), 695 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states 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:02:02,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1855 transitions. [2022-11-03 04:02:02,833 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1855 transitions. Word has length 31 [2022-11-03 04:02:02,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:02:02,834 INFO L495 AbstractCegarLoop]: Abstraction has 696 states and 1855 transitions. [2022-11-03 04:02:02,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 22 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:02:02,834 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1855 transitions. [2022-11-03 04:02:02,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-03 04:02:02,835 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:02:02,835 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:02:02,862 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-11-03 04:02:03,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-03 04:02:03,036 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:02:03,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:02:03,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1742406275, now seen corresponding path program 24 times [2022-11-03 04:02:03,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:02:03,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879299816] [2022-11-03 04:02:03,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:02:03,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:02:03,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:02:04,525 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:02:04,525 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:02:04,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879299816] [2022-11-03 04:02:04,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879299816] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:02:04,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83861389] [2022-11-03 04:02:04,526 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 04:02:04,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:02:04,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:02:04,527 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:02:04,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-03 04:02:04,685 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 04:02:04,685 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:02:04,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-03 04:02:04,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:02:04,701 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 202 treesize of output 198 [2022-11-03 04:02:05,078 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 44 treesize of output 42 [2022-11-03 04:02:05,121 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:02:05,121 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 48 treesize of output 14 [2022-11-03 04:02:05,189 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 04:02:05,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:02:05,338 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1300 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1300) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_1300 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1300) c_~queue~0.base) .cse0)) 1)))) is different from false [2022-11-03 04:02:05,518 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (select .cse3 (+ c_~queue~0.offset .cse2))) (.cse1 (+ c_~queue~0.offset .cse2 4))) (and (forall ((v_ArrVal_1300 (Array Int Int))) (<= (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1300) c_~queue~0.base) .cse1)) 1)) (forall ((v_ArrVal_1300 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1300) c_~queue~0.base) .cse1))))))) (let ((.cse4 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse5 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse4) (not (= (+ .cse5 1) 0))) (or .cse4 (not (= .cse5 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0))) is different from false [2022-11-03 04:02:05,609 INFO L356 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-03 04:02:05,610 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 286 treesize of output 240 [2022-11-03 04:02:05,622 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 59 treesize of output 52 [2022-11-03 04:02:05,634 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 52 treesize of output 45 [2022-11-03 04:02:06,458 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 5 not checked. [2022-11-03 04:02:06,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83861389] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:02:06,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [781697947] [2022-11-03 04:02:06,458 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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:02:06,458 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:02:06,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 11] total 34 [2022-11-03 04:02:06,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091433479] [2022-11-03 04:02:06,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:02:06,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-03 04:02:06,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:02:06,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-03 04:02:06,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=921, Unknown=2, NotChecked=126, Total=1190 [2022-11-03 04:02:06,464 INFO L87 Difference]: Start difference. First operand 696 states and 1855 transitions. Second operand has 35 states, 35 states have (on average 2.057142857142857) 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:02:07,453 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse3 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (select .cse3 (+ c_~queue~0.offset .cse2))) (.cse1 (+ c_~queue~0.offset .cse2 4))) (and (forall ((v_ArrVal_1300 (Array Int Int))) (<= (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1300) c_~queue~0.base) .cse1)) 1)) (forall ((v_ArrVal_1300 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1300) c_~queue~0.base) .cse1))))))) (let ((.cse4 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse5 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse4) (not (= (+ .cse5 1) 0))) (or .cse4 (not (= .cse5 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0))) (<= c_~sum~0 0) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0)) is different from false [2022-11-03 04:02:07,613 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~queue~0.offset (* c_~front~0 4)))) (let ((.cse0 (forall ((v_ArrVal_1300 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1300) c_~queue~0.base) .cse4))))) (.cse1 (forall ((v_ArrVal_1300 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1300) c_~queue~0.base) .cse4)) 1)))) (and (or (and .cse0 .cse1) (let ((.cse2 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse3 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse2) (not (= (+ .cse3 1) 0))) (or .cse2 (not (= .cse3 1)))))) .cse0 .cse1))) is different from false [2022-11-03 04:02:07,764 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse3 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (select .cse3 (+ c_~queue~0.offset .cse2))) (.cse1 (+ c_~queue~0.offset .cse2 4))) (and (forall ((v_ArrVal_1300 (Array Int Int))) (<= (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1300) c_~queue~0.base) .cse1)) 1)) (forall ((v_ArrVal_1300 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1300) c_~queue~0.base) .cse1))))))) (let ((.cse4 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse5 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse4) (not (= (+ .cse5 1) 0))) (or .cse4 (not (= .cse5 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0))) (<= c_~sum~0 0) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0)) is different from false [2022-11-03 04:02:09,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:02:09,997 INFO L93 Difference]: Finished difference Result 1640 states and 4339 transitions. [2022-11-03 04:02:09,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-11-03 04:02:09,998 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.057142857142857) 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 32 [2022-11-03 04:02:09,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:02:10,000 INFO L225 Difference]: With dead ends: 1640 [2022-11-03 04:02:10,000 INFO L226 Difference]: Without dead ends: 1640 [2022-11-03 04:02:10,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 50 SyntacticMatches, 8 SemanticMatches, 73 ConstructedPredicates, 5 IntricatePredicates, 2 DeprecatedPredicates, 1392 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=713, Invalid=4131, Unknown=6, NotChecked=700, Total=5550 [2022-11-03 04:02:10,001 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 283 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 1924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 725 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-03 04:02:10,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 63 Invalid, 1924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1090 Invalid, 0 Unknown, 725 Unchecked, 0.9s Time] [2022-11-03 04:02:10,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2022-11-03 04:02:10,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 842. [2022-11-03 04:02:10,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 841 states have (on average 2.6956004756242566) internal successors, (2267), 841 states have internal predecessors, (2267), 0 states have call successors, (0), 0 states 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:02:10,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 2267 transitions. [2022-11-03 04:02:10,024 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 2267 transitions. Word has length 32 [2022-11-03 04:02:10,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:02:10,024 INFO L495 AbstractCegarLoop]: Abstraction has 842 states and 2267 transitions. [2022-11-03 04:02:10,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.057142857142857) 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:02:10,025 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 2267 transitions. [2022-11-03 04:02:10,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-03 04:02:10,027 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:02:10,027 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:02:10,055 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-11-03 04:02:10,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-03 04:02:10,234 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:02:10,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:02:10,234 INFO L85 PathProgramCache]: Analyzing trace with hash 2122844595, now seen corresponding path program 25 times [2022-11-03 04:02:10,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:02:10,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19692499] [2022-11-03 04:02:10,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:02:10,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:02:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:02:11,969 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:02:11,969 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:02:11,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19692499] [2022-11-03 04:02:11,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19692499] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:02:11,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916696942] [2022-11-03 04:02:11,970 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 04:02:11,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:02:11,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:02:11,971 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:02:11,972 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-11-03 04:02:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:02:12,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-03 04:02:12,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:02:12,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:12,546 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 44 treesize of output 42 [2022-11-03 04:02:12,594 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:02:12,595 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 48 treesize of output 14 [2022-11-03 04:02:12,711 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 04:02:12,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:02:12,841 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1353 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1353) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_1353 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1353) c_~queue~0.base) .cse0)) 1)))) is different from false [2022-11-03 04:02:13,023 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse3 (* c_~front~0 4))) (let ((.cse0 (+ c_~queue~0.offset .cse3 4)) (.cse1 (select .cse2 (+ c_~queue~0.offset .cse3)))) (and (forall ((v_ArrVal_1353 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1353) c_~queue~0.base) .cse0) .cse1))) (forall ((v_ArrVal_1353 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1353) c_~queue~0.base) .cse0) .cse1) 1))))) (let ((.cse4 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse5 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse4) (not (= (+ .cse5 1) 0))) (or .cse4 (not (= .cse5 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0))) is different from false [2022-11-03 04:02:13,137 INFO L356 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-03 04:02:13,137 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 286 treesize of output 240 [2022-11-03 04:02:13,151 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 59 treesize of output 52 [2022-11-03 04:02:13,162 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 52 treesize of output 45 [2022-11-03 04:02:13,766 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 7 not checked. [2022-11-03 04:02:13,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916696942] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:02:13,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [780678725] [2022-11-03 04:02:13,767 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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:02:13,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:02:13,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 11] total 37 [2022-11-03 04:02:13,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725482035] [2022-11-03 04:02:13,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:02:13,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-03 04:02:13,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:02:13,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-03 04:02:13,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1116, Unknown=2, NotChecked=138, Total=1406 [2022-11-03 04:02:13,769 INFO L87 Difference]: Start difference. First operand 842 states and 2267 transitions. Second operand has 38 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 37 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:02:15,200 WARN L833 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 c_~v_assert~0) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse3 (* c_~front~0 4))) (let ((.cse0 (+ c_~queue~0.offset .cse3 4)) (.cse1 (select .cse2 (+ c_~queue~0.offset .cse3)))) (and (forall ((v_ArrVal_1353 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1353) c_~queue~0.base) .cse0) .cse1))) (forall ((v_ArrVal_1353 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1353) c_~queue~0.base) .cse0) .cse1) 1))))) (let ((.cse4 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse5 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse4) (not (= (+ .cse5 1) 0))) (or .cse4 (not (= .cse5 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0))) (= c_~sum~0 0)) is different from false [2022-11-03 04:02:15,449 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~queue~0.offset (* c_~front~0 4)))) (let ((.cse0 (forall ((v_ArrVal_1353 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1353) c_~queue~0.base) .cse4))))) (.cse1 (forall ((v_ArrVal_1353 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1353) c_~queue~0.base) .cse4)) 1)))) (and .cse0 .cse1 (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (or (let ((.cse2 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse3 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse2) (not (= (+ .cse3 1) 0))) (or .cse2 (not (= .cse3 1))))) (and .cse0 .cse1)) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)))) is different from false [2022-11-03 04:02:15,585 WARN L833 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 c_~v_assert~0) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse3 (* c_~front~0 4))) (let ((.cse0 (+ c_~queue~0.offset .cse3 4)) (.cse1 (select .cse2 (+ c_~queue~0.offset .cse3)))) (and (forall ((v_ArrVal_1353 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1353) c_~queue~0.base) .cse0) .cse1))) (forall ((v_ArrVal_1353 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1353) c_~queue~0.base) .cse0) .cse1) 1))))) (let ((.cse4 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse5 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse4) (not (= (+ .cse5 1) 0))) (or .cse4 (not (= .cse5 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0))) (= c_~sum~0 0)) is different from false [2022-11-03 04:02:15,689 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~queue~0.offset (* c_~front~0 4)))) (let ((.cse0 (forall ((v_ArrVal_1353 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1353) c_~queue~0.base) .cse4))))) (.cse1 (forall ((v_ArrVal_1353 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1353) c_~queue~0.base) .cse4)) 1)))) (and .cse0 .cse1 (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (or (let ((.cse2 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse3 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse2) (not (= (+ .cse3 1) 0))) (or .cse2 (not (= .cse3 1))))) (and .cse0 .cse1)) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1)))) is different from false [2022-11-03 04:02:16,926 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1353 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1353) c_~queue~0.base) .cse0)))) (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (forall ((v_ArrVal_1353 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1353) c_~queue~0.base) .cse0)) 1)))) is different from false [2022-11-03 04:02:19,440 WARN L833 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse3 (* c_~front~0 4))) (let ((.cse0 (+ c_~queue~0.offset .cse3 4)) (.cse1 (select .cse2 (+ c_~queue~0.offset .cse3)))) (and (forall ((v_ArrVal_1353 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1353) c_~queue~0.base) .cse0) .cse1))) (forall ((v_ArrVal_1353 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1353) c_~queue~0.base) .cse0) .cse1) 1))))) (let ((.cse4 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse5 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse4) (not (= (+ .cse5 1) 0))) (or .cse4 (not (= .cse5 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)))) is different from false [2022-11-03 04:02:19,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:02:19,616 INFO L93 Difference]: Finished difference Result 1961 states and 5143 transitions. [2022-11-03 04:02:19,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-11-03 04:02:19,616 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 37 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-03 04:02:19,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:02:19,619 INFO L225 Difference]: With dead ends: 1961 [2022-11-03 04:02:19,619 INFO L226 Difference]: Without dead ends: 1961 [2022-11-03 04:02:19,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 62 SyntacticMatches, 12 SemanticMatches, 102 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 3013 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1124, Invalid=8018, Unknown=10, NotChecked=1560, Total=10712 [2022-11-03 04:02:19,621 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 364 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 2508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1071 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:02:19,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 54 Invalid, 2508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1309 Invalid, 0 Unknown, 1071 Unchecked, 1.2s Time] [2022-11-03 04:02:19,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2022-11-03 04:02:19,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 864. [2022-11-03 04:02:19,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 864 states, 863 states have (on average 2.709154113557358) internal successors, (2338), 863 states have internal predecessors, (2338), 0 states have call successors, (0), 0 states 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:02:19,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 2338 transitions. [2022-11-03 04:02:19,646 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 2338 transitions. Word has length 32 [2022-11-03 04:02:19,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:02:19,646 INFO L495 AbstractCegarLoop]: Abstraction has 864 states and 2338 transitions. [2022-11-03 04:02:19,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 37 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:02:19,647 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 2338 transitions. [2022-11-03 04:02:19,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-03 04:02:19,649 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:02:19,649 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:02:19,677 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-11-03 04:02:19,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:02:19,850 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:02:19,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:02:19,850 INFO L85 PathProgramCache]: Analyzing trace with hash -979893193, now seen corresponding path program 26 times [2022-11-03 04:02:19,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:02:19,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562662208] [2022-11-03 04:02:19,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:02:19,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:02:19,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:02:22,045 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:02:22,045 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:02:22,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562662208] [2022-11-03 04:02:22,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562662208] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:02:22,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165644206] [2022-11-03 04:02:22,045 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:02:22,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:02:22,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:02:22,047 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:02:22,048 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-03 04:02:22,320 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-03 04:02:22,320 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:02:22,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-03 04:02:22,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:02:23,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:02:23,174 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 44 treesize of output 42 [2022-11-03 04:02:23,235 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:02:23,236 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 42 treesize of output 14 [2022-11-03 04:02:23,317 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:02:23,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:02:23,478 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse0)))))) is different from false [2022-11-03 04:02:23,494 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse0)))))) (= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))) is different from false [2022-11-03 04:02:23,514 WARN L833 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse0)))))) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))) is different from false [2022-11-03 04:02:23,799 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| c_~queue~0.base))) (or (= (mod c_~v_assert~0 256) 0) (let ((.cse5 (+ c_~back~0 1))) (let ((.cse1 (not (<= 0 .cse5))) (.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse3 (not (< .cse5 c_~n~0))) (.cse2 (select .cse4 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) .cse1 (not (= (+ .cse2 1) 0)) .cse3) (or .cse1 .cse0 .cse3 (not (= .cse2 1)))))) (let ((.cse8 (* c_~front~0 4))) (let ((.cse6 (+ c_~queue~0.offset .cse8 4)) (.cse7 (select .cse4 (+ c_~queue~0.offset .cse8)))) (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse6) .cse7))) (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse6) .cse7) 1))))))) is different from false [2022-11-03 04:02:23,944 INFO L356 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-03 04:02:23,945 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 310 treesize of output 264 [2022-11-03 04:02:23,959 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 59 treesize of output 52 [2022-11-03 04:02:23,972 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 52 treesize of output 45 [2022-11-03 04:02:25,005 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-11-03 04:02:25,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165644206] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:02:25,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [908360223] [2022-11-03 04:02:25,005 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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:02:25,005 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:02:25,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 15] total 43 [2022-11-03 04:02:25,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699038572] [2022-11-03 04:02:25,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:02:25,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-03 04:02:25,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:02:25,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-03 04:02:25,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1324, Unknown=14, NotChecked=316, Total=1892 [2022-11-03 04:02:25,008 INFO L87 Difference]: Start difference. First operand 864 states and 2338 transitions. Second operand has 44 states, 44 states have (on average 1.8181818181818181) internal successors, (80), 43 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:02:27,109 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= c_~sum~0 0) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (let ((.cse4 (select |c_#memory_int| c_~queue~0.base))) (or (= (mod c_~v_assert~0 256) 0) (let ((.cse5 (+ c_~back~0 1))) (let ((.cse1 (not (<= 0 .cse5))) (.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse3 (not (< .cse5 c_~n~0))) (.cse2 (select .cse4 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) .cse1 (not (= (+ .cse2 1) 0)) .cse3) (or .cse1 .cse0 .cse3 (not (= .cse2 1)))))) (let ((.cse8 (* c_~front~0 4))) (let ((.cse6 (+ c_~queue~0.offset .cse8 4)) (.cse7 (select .cse4 (+ c_~queue~0.offset .cse8)))) (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse6) .cse7))) (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse6) .cse7) 1))))))) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0)) is different from false [2022-11-03 04:02:27,539 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= c_~sum~0 0) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (let ((.cse4 (select |c_#memory_int| c_~queue~0.base))) (or (= (mod c_~v_assert~0 256) 0) (let ((.cse5 (+ c_~back~0 1))) (let ((.cse1 (not (<= 0 .cse5))) (.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse3 (not (< .cse5 c_~n~0))) (.cse2 (select .cse4 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) .cse1 (not (= (+ .cse2 1) 0)) .cse3) (or .cse1 .cse0 .cse3 (not (= .cse2 1)))))) (let ((.cse8 (* c_~front~0 4))) (let ((.cse6 (+ c_~queue~0.offset .cse8 4)) (.cse7 (select .cse4 (+ c_~queue~0.offset .cse8)))) (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse6) .cse7))) (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse6) .cse7) 1))))))) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-11-03 04:02:30,279 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse11 (* c_~front~0 4))) (let ((.cse10 (+ c_~queue~0.offset .cse11))) (let ((.cse1 (= (mod c_~v_assert~0 256) 0)) (.cse0 (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse10)) 1))) (.cse12 (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse10)))))) (and .cse0 (let ((.cse6 (select |c_#memory_int| c_~queue~0.base))) (or .cse1 (let ((.cse7 (+ c_~back~0 1))) (let ((.cse3 (not (<= 0 .cse7))) (.cse2 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse5 (not (< .cse7 c_~n~0))) (.cse4 (select .cse6 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse2) .cse3 (not (= (+ .cse4 1) 0)) .cse5) (or .cse3 .cse2 .cse5 (not (= .cse4 1)))))) (let ((.cse8 (+ c_~queue~0.offset .cse11 4)) (.cse9 (select .cse6 .cse10))) (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse8) .cse9))) (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse8) .cse9) 1)))))) (or .cse1 (and .cse0 .cse12) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))) .cse12)))) is different from false [2022-11-03 04:02:31,434 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse11 (* c_~front~0 4))) (let ((.cse10 (+ c_~queue~0.offset .cse11))) (let ((.cse1 (= (mod c_~v_assert~0 256) 0)) (.cse0 (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse10)) 1))) (.cse12 (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse10)))))) (and (<= c_~sum~0 0) .cse0 (let ((.cse6 (select |c_#memory_int| c_~queue~0.base))) (or .cse1 (let ((.cse7 (+ c_~back~0 1))) (let ((.cse3 (not (<= 0 .cse7))) (.cse2 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse5 (not (< .cse7 c_~n~0))) (.cse4 (select .cse6 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse2) .cse3 (not (= (+ .cse4 1) 0)) .cse5) (or .cse3 .cse2 .cse5 (not (= .cse4 1)))))) (let ((.cse8 (+ c_~queue~0.offset .cse11 4)) (.cse9 (select .cse6 .cse10))) (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse8) .cse9))) (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse8) .cse9) 1)))))) (or .cse1 (and .cse0 .cse12) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (<= 0 c_~sum~0) .cse12)))) is different from false [2022-11-03 04:02:31,655 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (* c_~front~0 4))) (let ((.cse0 (+ c_~queue~0.offset .cse9))) (and (or (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse0))))) (= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))) (let ((.cse5 (select |c_#memory_int| c_~queue~0.base))) (or (= (mod c_~v_assert~0 256) 0) (let ((.cse6 (+ c_~back~0 1))) (let ((.cse2 (not (<= 0 .cse6))) (.cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse4 (not (< .cse6 c_~n~0))) (.cse3 (select .cse5 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse1) .cse2 (not (= (+ .cse3 1) 0)) .cse4) (or .cse2 .cse1 .cse4 (not (= .cse3 1)))))) (let ((.cse7 (+ c_~queue~0.offset .cse9 4)) (.cse8 (select .cse5 .cse0))) (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse7) .cse8))) (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse7) .cse8) 1))))))))) is different from false [2022-11-03 04:02:31,794 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse16 (* c_~front~0 4))) (let ((.cse12 (select |c_#memory_int| c_~queue~0.base)) (.cse2 (+ c_~queue~0.offset .cse16)) (.cse18 (div |c_thread2Thread1of1ForFork2_~b~0#1| 256)) (.cse17 (* c_~back~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse17)) (.cse7 (= (mod c_~v_assert~0 256) 0)) (.cse0 (<= |c_thread2Thread1of1ForFork2_~b~0#1| (* .cse18 256))) (.cse1 (<= 1 c_~back~0)) (.cse15 (select .cse12 .cse2)) (.cse4 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))) (.cse5 (not (<= (+ .cse18 1) 0))) (.cse6 (<= (* c_~n~0 4) (+ c_~queue~0.offset 7 .cse17)))) (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (or (and (<= 1 c_~sum~0) .cse0 .cse1 (< 3 .cse2) (<= .cse3 4) (<= c_~sum~0 1) (<= .cse2 4) .cse4 .cse5) .cse6) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (or .cse7 (let ((.cse13 (+ c_~back~0 1))) (let ((.cse9 (not (<= 0 .cse13))) (.cse8 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse11 (not (< .cse13 c_~n~0))) (.cse10 (select .cse12 .cse3))) (and (or (not .cse8) .cse9 (not (= (+ .cse10 1) 0)) .cse11) (or .cse9 .cse8 .cse11 (not (= .cse10 1)))))) (let ((.cse14 (+ c_~queue~0.offset .cse16 4))) (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse14) .cse15))) (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse14) .cse15) 1))))) (or .cse7 (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse2)) 1)) (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse2))))) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))) (= c_~queue~0.offset 0) (or (and (<= .cse15 1) .cse0 (<= (+ c_~front~0 c_~n~0) (+ c_~back~0 2)) .cse1 (<= 1 .cse15) (<= 0 c_~front~0) (<= c_~n~0 3) .cse4 (= c_~sum~0 0) .cse5) .cse6))))) is different from false [2022-11-03 04:02:35,480 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse19 (* c_~front~0 4))) (let ((.cse7 (* c_~n~0 4)) (.cse16 (select |c_#memory_int| c_~queue~0.base)) (.cse2 (+ c_~queue~0.offset .cse19)) (.cse20 (div |c_thread2Thread1of1ForFork2_~b~0#1| 256)) (.cse8 (* c_~back~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse8)) (.cse11 (= (mod c_~v_assert~0 256) 0)) (.cse0 (<= |c_thread2Thread1of1ForFork2_~b~0#1| (* .cse20 256))) (.cse1 (<= 1 c_~back~0)) (.cse10 (select .cse16 .cse2)) (.cse4 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))) (.cse5 (not (<= (+ .cse20 1) 0))) (.cse6 (<= .cse7 (+ c_~queue~0.offset 7 .cse8)))) (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= c_~sum~0 0) (or (and (<= 1 c_~sum~0) .cse0 .cse1 (< 3 .cse2) (<= .cse3 4) (<= c_~sum~0 1) (<= .cse2 4) .cse4 .cse5) .cse6) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (or (<= .cse7 (+ c_~queue~0.offset 3 .cse8)) (let ((.cse9 (+ c_~sum~0 .cse10))) (and (= .cse2 4) (<= .cse9 0) (<= 0 .cse9) .cse4))) (or .cse11 (let ((.cse17 (+ c_~back~0 1))) (let ((.cse13 (not (<= 0 .cse17))) (.cse12 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse15 (not (< .cse17 c_~n~0))) (.cse14 (select .cse16 .cse3))) (and (or (not .cse12) .cse13 (not (= (+ .cse14 1) 0)) .cse15) (or .cse13 .cse12 .cse15 (not (= .cse14 1)))))) (let ((.cse18 (+ c_~queue~0.offset .cse19 4))) (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse18) .cse10))) (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse18) .cse10) 1))))) (or .cse11 (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse2)) 1)) (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse2))))) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))) (= c_~queue~0.offset 0) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (or (and (<= .cse10 1) .cse0 (<= (+ c_~front~0 c_~n~0) (+ c_~back~0 2)) .cse1 (<= 1 .cse10) (<= 0 c_~front~0) (<= c_~n~0 3) .cse4 (= c_~sum~0 0) .cse5) .cse6))))) is different from false [2022-11-03 04:02:36,383 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (let ((.cse4 (select |c_#memory_int| c_~queue~0.base))) (or (= (mod c_~v_assert~0 256) 0) (let ((.cse5 (+ c_~back~0 1))) (let ((.cse1 (not (<= 0 .cse5))) (.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse3 (not (< .cse5 c_~n~0))) (.cse2 (select .cse4 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) .cse1 (not (= (+ .cse2 1) 0)) .cse3) (or .cse1 .cse0 .cse3 (not (= .cse2 1)))))) (let ((.cse8 (* c_~front~0 4))) (let ((.cse6 (+ c_~queue~0.offset .cse8 4)) (.cse7 (select .cse4 (+ c_~queue~0.offset .cse8)))) (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse6) .cse7))) (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse6) .cse7) 1))))))) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-11-03 04:02:37,954 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse13 (* c_~front~0 4))) (let ((.cse10 (select |c_#memory_int| c_~queue~0.base)) (.cse0 (+ c_~queue~0.offset .cse13))) (let ((.cse5 (select .cse10 .cse0)) (.cse4 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))) (.cse1 (* c_~n~0 4)) (.cse2 (* c_~back~0 4))) (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (or (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse0))))) (= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (or (<= .cse1 (+ c_~queue~0.offset 3 .cse2)) (let ((.cse3 (+ c_~sum~0 .cse5))) (and (= .cse0 4) (<= .cse3 0) (<= 0 .cse3) .cse4))) (or (= (mod c_~v_assert~0 256) 0) (let ((.cse11 (+ c_~back~0 1))) (let ((.cse7 (not (<= 0 .cse11))) (.cse6 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse9 (not (< .cse11 c_~n~0))) (.cse8 (select .cse10 (+ c_~queue~0.offset .cse2)))) (and (or (not .cse6) .cse7 (not (= (+ .cse8 1) 0)) .cse9) (or .cse7 .cse6 .cse9 (not (= .cse8 1)))))) (let ((.cse12 (+ c_~queue~0.offset .cse13 4))) (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse12) .cse5))) (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse12) .cse5) 1))))) (= c_~queue~0.offset 0) (or (let ((.cse14 (div |c_thread2Thread1of1ForFork2_~b~0#1| 256))) (and (<= .cse5 1) (<= |c_thread2Thread1of1ForFork2_~b~0#1| (* .cse14 256)) (<= (+ c_~front~0 c_~n~0) (+ c_~back~0 2)) (<= 1 c_~back~0) (<= 1 .cse5) (<= 0 c_~front~0) (<= c_~n~0 3) .cse4 (= c_~sum~0 0) (not (<= (+ .cse14 1) 0)))) (<= .cse1 (+ c_~queue~0.offset 7 .cse2))))))) is different from false [2022-11-03 04:02:39,438 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse15 (* c_~front~0 4))) (let ((.cse11 (select |c_#memory_int| c_~queue~0.base)) (.cse0 (+ c_~queue~0.offset .cse15)) (.cse17 (div |c_thread2Thread1of1ForFork2_~b~0#1| 256)) (.cse16 (* c_~back~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse16)) (.cse1 (<= |c_thread2Thread1of1ForFork2_~b~0#1| (* .cse17 256))) (.cse2 (<= 1 c_~back~0)) (.cse14 (select .cse11 .cse0)) (.cse4 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))) (.cse5 (not (<= (+ .cse17 1) 0))) (.cse6 (<= (* c_~n~0 4) (+ c_~queue~0.offset 7 .cse16)))) (and (or (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse0))))) (= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))) (<= c_~sum~0 0) (or (and (<= 1 c_~sum~0) .cse1 .cse2 (< 3 .cse0) (<= .cse3 4) (<= c_~sum~0 1) (<= .cse0 4) .cse4 .cse5) .cse6) (or (= (mod c_~v_assert~0 256) 0) (let ((.cse12 (+ c_~back~0 1))) (let ((.cse8 (not (<= 0 .cse12))) (.cse7 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse10 (not (< .cse12 c_~n~0))) (.cse9 (select .cse11 .cse3))) (and (or (not .cse7) .cse8 (not (= (+ .cse9 1) 0)) .cse10) (or .cse8 .cse7 .cse10 (not (= .cse9 1)))))) (let ((.cse13 (+ c_~queue~0.offset .cse15 4))) (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse13) .cse14))) (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse13) .cse14) 1))))) (= c_~queue~0.offset 0) (<= 0 c_~sum~0) (or (and (<= .cse14 1) .cse1 (<= (+ c_~front~0 c_~n~0) (+ c_~back~0 2)) .cse2 (<= 1 .cse14) (<= 0 c_~front~0) (<= c_~n~0 3) .cse4 (= c_~sum~0 0) .cse5) .cse6))))) is different from false [2022-11-03 04:02:39,552 WARN L833 $PredicateComparison]: unable to prove that (and (or (= (mod c_~v_assert~0 256) 0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse0)))))) (let ((.cse5 (+ c_~back~0 1))) (let ((.cse2 (not (<= 0 .cse5))) (.cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse4 (not (< .cse5 c_~n~0))) (.cse3 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse1) .cse2 (not (= (+ .cse3 1) 0)) .cse4) (or .cse2 .cse1 .cse4 (not (= .cse3 1))))))) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0))) is different from false [2022-11-03 04:02:43,355 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (let ((.cse4 (select |c_#memory_int| c_~queue~0.base))) (or (= (mod c_~v_assert~0 256) 0) (let ((.cse5 (+ c_~back~0 1))) (let ((.cse1 (not (<= 0 .cse5))) (.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse3 (not (< .cse5 c_~n~0))) (.cse2 (select .cse4 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) .cse1 (not (= (+ .cse2 1) 0)) .cse3) (or .cse1 .cse0 .cse3 (not (= .cse2 1)))))) (let ((.cse8 (* c_~front~0 4))) (let ((.cse6 (+ c_~queue~0.offset .cse8 4)) (.cse7 (select .cse4 (+ c_~queue~0.offset .cse8)))) (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse6) .cse7))) (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse6) .cse7) 1))))))) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= 1 c_~v_assert~0) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-11-03 04:02:45,369 WARN L833 $PredicateComparison]: unable to prove that (and (or (= (mod c_~v_assert~0 256) 0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse0)))))) (let ((.cse5 (+ c_~back~0 1))) (let ((.cse2 (not (<= 0 .cse5))) (.cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse4 (not (< .cse5 c_~n~0))) (.cse3 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse1) .cse2 (not (= (+ .cse3 1) 0)) .cse4) (or .cse2 .cse1 .cse4 (not (= .cse3 1))))))) (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= 1 c_~v_assert~0) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-11-03 04:02:45,625 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse4 (select |c_#memory_int| c_~queue~0.base))) (or (= (mod c_~v_assert~0 256) 0) (let ((.cse5 (+ c_~back~0 1))) (let ((.cse1 (not (<= 0 .cse5))) (.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse3 (not (< .cse5 c_~n~0))) (.cse2 (select .cse4 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) .cse1 (not (= (+ .cse2 1) 0)) .cse3) (or .cse1 .cse0 .cse3 (not (= .cse2 1)))))) (let ((.cse8 (* c_~front~0 4))) (let ((.cse6 (+ c_~queue~0.offset .cse8 4)) (.cse7 (select .cse4 (+ c_~queue~0.offset .cse8)))) (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse6) .cse7))) (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse6) .cse7) 1))))))) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0))) is different from false [2022-11-03 04:02:47,559 WARN L833 $PredicateComparison]: unable to prove that (and (or (= (mod c_~v_assert~0 256) 0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse0)))))) (let ((.cse5 (+ c_~back~0 1))) (let ((.cse2 (not (<= 0 .cse5))) (.cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse4 (not (< .cse5 c_~n~0))) (.cse3 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse1) .cse2 (not (= (+ .cse3 1) 0)) .cse4) (or .cse2 .cse1 .cse4 (not (= .cse3 1))))))) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-11-03 04:02:47,924 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse19 (* c_~front~0 4))) (let ((.cse7 (* c_~n~0 4)) (.cse16 (select |c_#memory_int| c_~queue~0.base)) (.cse2 (+ c_~queue~0.offset .cse19)) (.cse20 (div |c_thread2Thread1of1ForFork2_~b~0#1| 256)) (.cse8 (* c_~back~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse8)) (.cse11 (= (mod c_~v_assert~0 256) 0)) (.cse0 (<= |c_thread2Thread1of1ForFork2_~b~0#1| (* .cse20 256))) (.cse1 (<= 1 c_~back~0)) (.cse10 (select .cse16 .cse2)) (.cse4 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))) (.cse5 (not (<= (+ .cse20 1) 0))) (.cse6 (<= .cse7 (+ c_~queue~0.offset 7 .cse8)))) (and (<= c_~sum~0 0) (or (and (<= 1 c_~sum~0) .cse0 .cse1 (< 3 .cse2) (<= .cse3 4) (<= c_~sum~0 1) (<= .cse2 4) .cse4 .cse5) .cse6) (or (<= .cse7 (+ c_~queue~0.offset 3 .cse8)) (let ((.cse9 (+ c_~sum~0 .cse10))) (and (= .cse2 4) (<= .cse9 0) (<= 0 .cse9) .cse4))) (or .cse11 (let ((.cse17 (+ c_~back~0 1))) (let ((.cse13 (not (<= 0 .cse17))) (.cse12 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse15 (not (< .cse17 c_~n~0))) (.cse14 (select .cse16 .cse3))) (and (or (not .cse12) .cse13 (not (= (+ .cse14 1) 0)) .cse15) (or .cse13 .cse12 .cse15 (not (= .cse14 1)))))) (let ((.cse18 (+ c_~queue~0.offset .cse19 4))) (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse18) .cse10))) (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse18) .cse10) 1))))) (or .cse11 (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse2)) 1)) (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse2))))) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))) (= c_~queue~0.offset 0) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (<= 0 c_~sum~0) (or (and (<= .cse10 1) .cse0 (<= (+ c_~front~0 c_~n~0) (+ c_~back~0 2)) .cse1 (<= 1 .cse10) (<= 0 c_~front~0) (<= c_~n~0 3) .cse4 (= c_~sum~0 0) .cse5) .cse6))))) is different from false [2022-11-03 04:02:48,865 WARN L833 $PredicateComparison]: unable to prove that (and (or (= (mod c_~v_assert~0 256) 0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse0)))))) (let ((.cse5 (+ c_~back~0 1))) (let ((.cse2 (not (<= 0 .cse5))) (.cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse4 (not (< .cse5 c_~n~0))) (.cse3 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse1) .cse2 (not (= (+ .cse3 1) 0)) .cse4) (or .cse2 .cse1 .cse4 (not (= .cse3 1))))))) (<= c_~sum~0 0) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (<= 0 c_~sum~0)) is different from false [2022-11-03 04:02:49,126 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse15 (* c_~front~0 4))) (let ((.cse11 (select |c_#memory_int| c_~queue~0.base)) (.cse0 (+ c_~queue~0.offset .cse15)) (.cse17 (div |c_thread2Thread1of1ForFork2_~b~0#1| 256)) (.cse16 (* c_~back~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse16)) (.cse1 (<= |c_thread2Thread1of1ForFork2_~b~0#1| (* .cse17 256))) (.cse2 (<= 1 c_~back~0)) (.cse14 (select .cse11 .cse0)) (.cse4 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))) (.cse5 (not (<= (+ .cse17 1) 0))) (.cse6 (<= (* c_~n~0 4) (+ c_~queue~0.offset 7 .cse16)))) (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (or (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse0))))) (= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))) (or (and (<= 1 c_~sum~0) .cse1 .cse2 (< 3 .cse0) (<= .cse3 4) (<= c_~sum~0 1) (<= .cse0 4) .cse4 .cse5) .cse6) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (or (= (mod c_~v_assert~0 256) 0) (let ((.cse12 (+ c_~back~0 1))) (let ((.cse8 (not (<= 0 .cse12))) (.cse7 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse10 (not (< .cse12 c_~n~0))) (.cse9 (select .cse11 .cse3))) (and (or (not .cse7) .cse8 (not (= (+ .cse9 1) 0)) .cse10) (or .cse8 .cse7 .cse10 (not (= .cse9 1)))))) (let ((.cse13 (+ c_~queue~0.offset .cse15 4))) (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse13) .cse14))) (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse13) .cse14) 1))))) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (= c_~queue~0.offset 0) (<= 1 c_~v_assert~0) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (and (<= .cse14 1) .cse1 (<= (+ c_~front~0 c_~n~0) (+ c_~back~0 2)) .cse2 (<= 1 .cse14) (<= 0 c_~front~0) (<= c_~n~0 3) .cse4 (= c_~sum~0 0) .cse5) .cse6))))) is different from false [2022-11-03 04:02:49,133 WARN L833 $PredicateComparison]: unable to prove that (and (or (= (mod c_~v_assert~0 256) 0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse0)))))) (let ((.cse5 (+ c_~back~0 1))) (let ((.cse2 (not (<= 0 .cse5))) (.cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse4 (not (< .cse5 c_~n~0))) (.cse3 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse1) .cse2 (not (= (+ .cse3 1) 0)) .cse4) (or .cse2 .cse1 .cse4 (not (= .cse3 1))))))) (<= c_~v_assert~0 1) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= 1 c_~v_assert~0) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-11-03 04:02:49,139 WARN L833 $PredicateComparison]: unable to prove that (and (or (= (mod c_~v_assert~0 256) 0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse0)))))) (let ((.cse5 (+ c_~back~0 1))) (let ((.cse2 (not (<= 0 .cse5))) (.cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse4 (not (< .cse5 c_~n~0))) (.cse3 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse1) .cse2 (not (= (+ .cse3 1) 0)) .cse4) (or .cse2 .cse1 .cse4 (not (= .cse3 1))))))) (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-11-03 04:02:51,352 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse13 (* c_~front~0 4))) (let ((.cse10 (select |c_#memory_int| c_~queue~0.base)) (.cse0 (+ c_~queue~0.offset .cse13))) (let ((.cse5 (select .cse10 .cse0)) (.cse4 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))) (.cse1 (* c_~n~0 4)) (.cse2 (* c_~back~0 4))) (and (or (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse0))))) (= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))) (or (<= .cse1 (+ c_~queue~0.offset 3 .cse2)) (let ((.cse3 (+ c_~sum~0 .cse5))) (and (= .cse0 4) (<= .cse3 0) (<= 0 .cse3) .cse4))) (or (= (mod c_~v_assert~0 256) 0) (let ((.cse11 (+ c_~back~0 1))) (let ((.cse7 (not (<= 0 .cse11))) (.cse6 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse9 (not (< .cse11 c_~n~0))) (.cse8 (select .cse10 (+ c_~queue~0.offset .cse2)))) (and (or (not .cse6) .cse7 (not (= (+ .cse8 1) 0)) .cse9) (or .cse7 .cse6 .cse9 (not (= .cse8 1)))))) (let ((.cse12 (+ c_~queue~0.offset .cse13 4))) (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse12) .cse5))) (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse12) .cse5) 1))))) (= c_~queue~0.offset 0) (or (let ((.cse14 (div |c_thread2Thread1of1ForFork2_~b~0#1| 256))) (and (<= .cse5 1) (<= |c_thread2Thread1of1ForFork2_~b~0#1| (* .cse14 256)) (<= (+ c_~front~0 c_~n~0) (+ c_~back~0 2)) (<= 1 c_~back~0) (<= 1 .cse5) (<= 0 c_~front~0) (<= c_~n~0 3) .cse4 (= c_~sum~0 0) (not (<= (+ .cse14 1) 0)))) (<= .cse1 (+ c_~queue~0.offset 7 .cse2))))))) is different from false [2022-11-03 04:02:51,370 WARN L833 $PredicateComparison]: unable to prove that (and (or (= (mod c_~v_assert~0 256) 0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse0)))))) (let ((.cse5 (+ c_~back~0 1))) (let ((.cse2 (not (<= 0 .cse5))) (.cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse4 (not (< .cse5 c_~n~0))) (.cse3 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse1) .cse2 (not (= (+ .cse3 1) 0)) .cse4) (or .cse2 .cse1 .cse4 (not (= .cse3 1))))))) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-11-03 04:02:52,030 WARN L833 $PredicateComparison]: unable to prove that (and (or (= (mod c_~v_assert~0 256) 0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse0)))))) (let ((.cse5 (+ c_~back~0 1))) (let ((.cse2 (not (<= 0 .cse5))) (.cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse4 (not (< .cse5 c_~n~0))) (.cse3 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse1) .cse2 (not (= (+ .cse3 1) 0)) .cse4) (or .cse2 .cse1 .cse4 (not (= .cse3 1))))))) (<= c_~sum~0 0) (<= 0 c_~sum~0)) is different from false [2022-11-03 04:02:57,909 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (let ((.cse4 (select |c_#memory_int| c_~queue~0.base))) (or (= (mod c_~v_assert~0 256) 0) (let ((.cse5 (+ c_~back~0 1))) (let ((.cse1 (not (<= 0 .cse5))) (.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse3 (not (< .cse5 c_~n~0))) (.cse2 (select .cse4 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) .cse1 (not (= (+ .cse2 1) 0)) .cse3) (or .cse1 .cse0 .cse3 (not (= .cse2 1)))))) (let ((.cse8 (* c_~front~0 4))) (let ((.cse6 (+ c_~queue~0.offset .cse8 4)) (.cse7 (select .cse4 (+ c_~queue~0.offset .cse8)))) (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse6) .cse7))) (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse6) .cse7) 1))))))) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-11-03 04:02:57,943 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse4 (select |c_#memory_int| c_~queue~0.base))) (or (= (mod c_~v_assert~0 256) 0) (let ((.cse5 (+ c_~back~0 1))) (let ((.cse1 (not (<= 0 .cse5))) (.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse3 (not (< .cse5 c_~n~0))) (.cse2 (select .cse4 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) .cse1 (not (= (+ .cse2 1) 0)) .cse3) (or .cse1 .cse0 .cse3 (not (= .cse2 1)))))) (let ((.cse8 (* c_~front~0 4))) (let ((.cse6 (+ c_~queue~0.offset .cse8 4)) (.cse7 (select .cse4 (+ c_~queue~0.offset .cse8)))) (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse6) .cse7))) (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse6) .cse7) 1))))))) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-11-03 04:02:58,378 WARN L833 $PredicateComparison]: unable to prove that (and (or (= (mod c_~v_assert~0 256) 0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse0)))))) (let ((.cse5 (+ c_~back~0 1))) (let ((.cse2 (not (<= 0 .cse5))) (.cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse4 (not (< .cse5 c_~n~0))) (.cse3 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse1) .cse2 (not (= (+ .cse3 1) 0)) .cse4) (or .cse2 .cse1 .cse4 (not (= .cse3 1))))))) (<= c_~v_assert~0 1) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= 1 c_~v_assert~0) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-11-03 04:03:02,573 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse15 (* c_~front~0 4))) (let ((.cse11 (select |c_#memory_int| c_~queue~0.base)) (.cse0 (+ c_~queue~0.offset .cse15)) (.cse17 (div |c_thread2Thread1of1ForFork2_~b~0#1| 256)) (.cse16 (* c_~back~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse16)) (.cse1 (<= |c_thread2Thread1of1ForFork2_~b~0#1| (* .cse17 256))) (.cse2 (<= 1 c_~back~0)) (.cse14 (select .cse11 .cse0)) (.cse4 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))) (.cse5 (not (<= (+ .cse17 1) 0))) (.cse6 (<= (* c_~n~0 4) (+ c_~queue~0.offset 7 .cse16)))) (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (or (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse0))))) (= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))) (or (and (<= 1 c_~sum~0) .cse1 .cse2 (< 3 .cse0) (<= .cse3 4) (<= c_~sum~0 1) (<= .cse0 4) .cse4 .cse5) .cse6) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (or (= (mod c_~v_assert~0 256) 0) (let ((.cse12 (+ c_~back~0 1))) (let ((.cse8 (not (<= 0 .cse12))) (.cse7 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse10 (not (< .cse12 c_~n~0))) (.cse9 (select .cse11 .cse3))) (and (or (not .cse7) .cse8 (not (= (+ .cse9 1) 0)) .cse10) (or .cse8 .cse7 .cse10 (not (= .cse9 1)))))) (let ((.cse13 (+ c_~queue~0.offset .cse15 4))) (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse13) .cse14))) (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse13) .cse14) 1))))) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (= c_~queue~0.offset 0) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (and (<= .cse14 1) .cse1 (<= (+ c_~front~0 c_~n~0) (+ c_~back~0 2)) .cse2 (<= 1 .cse14) (<= 0 c_~front~0) (<= c_~n~0 3) .cse4 (= c_~sum~0 0) .cse5) .cse6))))) is different from false [2022-11-03 04:03:05,113 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse19 (* c_~front~0 4))) (let ((.cse7 (* c_~n~0 4)) (.cse16 (select |c_#memory_int| c_~queue~0.base)) (.cse2 (+ c_~queue~0.offset .cse19)) (.cse20 (div |c_thread2Thread1of1ForFork2_~b~0#1| 256)) (.cse8 (* c_~back~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse8)) (.cse11 (= (mod c_~v_assert~0 256) 0)) (.cse0 (<= |c_thread2Thread1of1ForFork2_~b~0#1| (* .cse20 256))) (.cse1 (<= 1 c_~back~0)) (.cse10 (select .cse16 .cse2)) (.cse4 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))) (.cse5 (not (<= (+ .cse20 1) 0))) (.cse6 (<= .cse7 (+ c_~queue~0.offset 7 .cse8)))) (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (or (and (<= 1 c_~sum~0) .cse0 .cse1 (< 3 .cse2) (<= .cse3 4) (<= c_~sum~0 1) (<= .cse2 4) .cse4 .cse5) .cse6) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (or (<= .cse7 (+ c_~queue~0.offset 3 .cse8)) (let ((.cse9 (+ c_~sum~0 .cse10))) (and (= .cse2 4) (<= .cse9 0) (<= 0 .cse9) .cse4))) (or .cse11 (let ((.cse17 (+ c_~back~0 1))) (let ((.cse13 (not (<= 0 .cse17))) (.cse12 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse15 (not (< .cse17 c_~n~0))) (.cse14 (select .cse16 .cse3))) (and (or (not .cse12) .cse13 (not (= (+ .cse14 1) 0)) .cse15) (or .cse13 .cse12 .cse15 (not (= .cse14 1)))))) (let ((.cse18 (+ c_~queue~0.offset .cse19 4))) (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse18) .cse10))) (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse18) .cse10) 1))))) (or .cse11 (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse2)) 1)) (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse2))))) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (= c_~queue~0.offset 0) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (and (<= .cse10 1) .cse0 (<= (+ c_~front~0 c_~n~0) (+ c_~back~0 2)) .cse1 (<= 1 .cse10) (<= 0 c_~front~0) (<= c_~n~0 3) .cse4 (= c_~sum~0 0) .cse5) .cse6))))) is different from false [2022-11-03 04:03:05,137 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse19 (* c_~front~0 4))) (let ((.cse7 (* c_~n~0 4)) (.cse16 (select |c_#memory_int| c_~queue~0.base)) (.cse2 (+ c_~queue~0.offset .cse19)) (.cse20 (div |c_thread2Thread1of1ForFork2_~b~0#1| 256)) (.cse8 (* c_~back~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse8)) (.cse11 (= (mod c_~v_assert~0 256) 0)) (.cse0 (<= |c_thread2Thread1of1ForFork2_~b~0#1| (* .cse20 256))) (.cse1 (<= 1 c_~back~0)) (.cse10 (select .cse16 .cse2)) (.cse4 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))) (.cse5 (not (<= (+ .cse20 1) 0))) (.cse6 (<= .cse7 (+ c_~queue~0.offset 7 .cse8)))) (and (or (and (<= 1 c_~sum~0) .cse0 .cse1 (< 3 .cse2) (<= .cse3 4) (<= c_~sum~0 1) (<= .cse2 4) .cse4 .cse5) .cse6) (or (<= .cse7 (+ c_~queue~0.offset 3 .cse8)) (let ((.cse9 (+ c_~sum~0 .cse10))) (and (= .cse2 4) (<= .cse9 0) (<= 0 .cse9) .cse4))) (or .cse11 (let ((.cse17 (+ c_~back~0 1))) (let ((.cse13 (not (<= 0 .cse17))) (.cse12 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse15 (not (< .cse17 c_~n~0))) (.cse14 (select .cse16 .cse3))) (and (or (not .cse12) .cse13 (not (= (+ .cse14 1) 0)) .cse15) (or .cse13 .cse12 .cse15 (not (= .cse14 1)))))) (let ((.cse18 (+ c_~queue~0.offset .cse19 4))) (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse18) .cse10))) (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse18) .cse10) 1))))) (or .cse11 (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse2)) 1)) (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse2))))) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (= c_~queue~0.offset 0) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (and (<= .cse10 1) .cse0 (<= (+ c_~front~0 c_~n~0) (+ c_~back~0 2)) .cse1 (<= 1 .cse10) (<= 0 c_~front~0) (<= c_~n~0 3) .cse4 (= c_~sum~0 0) .cse5) .cse6))))) is different from false [2022-11-03 04:03:05,897 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse16 (* c_~front~0 4))) (let ((.cse12 (select |c_#memory_int| c_~queue~0.base)) (.cse2 (+ c_~queue~0.offset .cse16)) (.cse18 (div |c_thread2Thread1of1ForFork2_~b~0#1| 256)) (.cse17 (* c_~back~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse17)) (.cse7 (= (mod c_~v_assert~0 256) 0)) (.cse0 (<= |c_thread2Thread1of1ForFork2_~b~0#1| (* .cse18 256))) (.cse1 (<= 1 c_~back~0)) (.cse15 (select .cse12 .cse2)) (.cse4 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))) (.cse5 (not (<= (+ .cse18 1) 0))) (.cse6 (<= (* c_~n~0 4) (+ c_~queue~0.offset 7 .cse17)))) (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (or (and (<= 1 c_~sum~0) .cse0 .cse1 (< 3 .cse2) (<= .cse3 4) (<= c_~sum~0 1) (<= .cse2 4) .cse4 .cse5) .cse6) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (or .cse7 (let ((.cse13 (+ c_~back~0 1))) (let ((.cse9 (not (<= 0 .cse13))) (.cse8 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse11 (not (< .cse13 c_~n~0))) (.cse10 (select .cse12 .cse3))) (and (or (not .cse8) .cse9 (not (= (+ .cse10 1) 0)) .cse11) (or .cse9 .cse8 .cse11 (not (= .cse10 1)))))) (let ((.cse14 (+ c_~queue~0.offset .cse16 4))) (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse14) .cse15))) (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse14) .cse15) 1))))) (or .cse7 (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse2)) 1)) (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse2))))) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (= c_~queue~0.offset 0) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (and (<= .cse15 1) .cse0 (<= (+ c_~front~0 c_~n~0) (+ c_~back~0 2)) .cse1 (<= 1 .cse15) (<= 0 c_~front~0) (<= c_~n~0 3) .cse4 (= c_~sum~0 0) .cse5) .cse6))))) is different from false [2022-11-03 04:03:06,479 WARN L833 $PredicateComparison]: unable to prove that (and (or (= (mod c_~v_assert~0 256) 0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse0)))))) (let ((.cse5 (+ c_~back~0 1))) (let ((.cse2 (not (<= 0 .cse5))) (.cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse4 (not (< .cse5 c_~n~0))) (.cse3 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse1) .cse2 (not (= (+ .cse3 1) 0)) .cse4) (or .cse2 .cse1 .cse4 (not (= .cse3 1))))))) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-11-03 04:03:08,619 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse19 (* c_~front~0 4))) (let ((.cse7 (* c_~n~0 4)) (.cse16 (select |c_#memory_int| c_~queue~0.base)) (.cse2 (+ c_~queue~0.offset .cse19)) (.cse20 (div |c_thread2Thread1of1ForFork2_~b~0#1| 256)) (.cse8 (* c_~back~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse8)) (.cse11 (= (mod c_~v_assert~0 256) 0)) (.cse0 (<= |c_thread2Thread1of1ForFork2_~b~0#1| (* .cse20 256))) (.cse1 (<= 1 c_~back~0)) (.cse10 (select .cse16 .cse2)) (.cse4 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))) (.cse5 (not (<= (+ .cse20 1) 0))) (.cse6 (<= .cse7 (+ c_~queue~0.offset 7 .cse8)))) (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (or (and (<= 1 c_~sum~0) .cse0 .cse1 (< 3 .cse2) (<= .cse3 4) (<= c_~sum~0 1) (<= .cse2 4) .cse4 .cse5) .cse6) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (or (<= .cse7 (+ c_~queue~0.offset 3 .cse8)) (let ((.cse9 (+ c_~sum~0 .cse10))) (and (= .cse2 4) (<= .cse9 0) (<= 0 .cse9) .cse4))) (or .cse11 (let ((.cse17 (+ c_~back~0 1))) (let ((.cse13 (not (<= 0 .cse17))) (.cse12 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse15 (not (< .cse17 c_~n~0))) (.cse14 (select .cse16 .cse3))) (and (or (not .cse12) .cse13 (not (= (+ .cse14 1) 0)) .cse15) (or .cse13 .cse12 .cse15 (not (= .cse14 1)))))) (let ((.cse18 (+ c_~queue~0.offset .cse19 4))) (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse18) .cse10))) (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse18) .cse10) 1))))) (or .cse11 (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse2)) 1)) (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse2))))) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))) (= c_~queue~0.offset 0) (or (and (<= .cse10 1) .cse0 (<= (+ c_~front~0 c_~n~0) (+ c_~back~0 2)) .cse1 (<= 1 .cse10) (<= 0 c_~front~0) (<= c_~n~0 3) .cse4 (= c_~sum~0 0) .cse5) .cse6))))) is different from false [2022-11-03 04:03:09,754 WARN L833 $PredicateComparison]: unable to prove that (and (or (= (mod c_~v_assert~0 256) 0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse0)))))) (let ((.cse5 (+ c_~back~0 1))) (let ((.cse2 (not (<= 0 .cse5))) (.cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse4 (not (< .cse5 c_~n~0))) (.cse3 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse1) .cse2 (not (= (+ .cse3 1) 0)) .cse4) (or .cse2 .cse1 .cse4 (not (= .cse3 1))))))) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-11-03 04:03:09,778 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse12 (* c_~front~0 4)) (.cse3 (* c_~back~0 4))) (let ((.cse2 (+ c_~queue~0.offset .cse3)) (.cse0 (+ c_~queue~0.offset .cse12))) (and (or (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse0))))) (= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))) (or (let ((.cse1 (div |c_thread2Thread1of1ForFork2_~b~0#1| 256))) (and (<= 1 c_~sum~0) (<= |c_thread2Thread1of1ForFork2_~b~0#1| (* .cse1 256)) (<= 1 c_~back~0) (< 3 .cse0) (<= .cse2 4) (<= c_~sum~0 1) (<= .cse0 4) (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|)) (not (<= (+ .cse1 1) 0)))) (<= (* c_~n~0 4) (+ c_~queue~0.offset 7 .cse3))) (let ((.cse8 (select |c_#memory_int| c_~queue~0.base))) (or (= (mod c_~v_assert~0 256) 0) (let ((.cse9 (+ c_~back~0 1))) (let ((.cse5 (not (<= 0 .cse9))) (.cse4 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse7 (not (< .cse9 c_~n~0))) (.cse6 (select .cse8 .cse2))) (and (or (not .cse4) .cse5 (not (= (+ .cse6 1) 0)) .cse7) (or .cse5 .cse4 .cse7 (not (= .cse6 1)))))) (let ((.cse10 (+ c_~queue~0.offset .cse12 4)) (.cse11 (select .cse8 .cse0))) (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse10) .cse11))) (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse10) .cse11) 1)))))) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (= c_~queue~0.offset 0) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)))) is different from false [2022-11-03 04:03:13,657 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse19 (* c_~front~0 4))) (let ((.cse7 (* c_~n~0 4)) (.cse16 (select |c_#memory_int| c_~queue~0.base)) (.cse2 (+ c_~queue~0.offset .cse19)) (.cse20 (div |c_thread2Thread1of1ForFork2_~b~0#1| 256)) (.cse8 (* c_~back~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse8)) (.cse11 (= (mod c_~v_assert~0 256) 0)) (.cse0 (<= |c_thread2Thread1of1ForFork2_~b~0#1| (* .cse20 256))) (.cse1 (<= 1 c_~back~0)) (.cse10 (select .cse16 .cse2)) (.cse4 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))) (.cse5 (not (<= (+ .cse20 1) 0))) (.cse6 (<= .cse7 (+ c_~queue~0.offset 7 .cse8)))) (and (<= c_~sum~0 0) (or (and (<= 1 c_~sum~0) .cse0 .cse1 (< 3 .cse2) (<= .cse3 4) (<= c_~sum~0 1) (<= .cse2 4) .cse4 .cse5) .cse6) (<= c_~v_assert~0 1) (or (<= .cse7 (+ c_~queue~0.offset 3 .cse8)) (let ((.cse9 (+ c_~sum~0 .cse10))) (and (= .cse2 4) (<= .cse9 0) (<= 0 .cse9) .cse4))) (or .cse11 (let ((.cse17 (+ c_~back~0 1))) (let ((.cse13 (not (<= 0 .cse17))) (.cse12 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse15 (not (< .cse17 c_~n~0))) (.cse14 (select .cse16 .cse3))) (and (or (not .cse12) .cse13 (not (= (+ .cse14 1) 0)) .cse15) (or .cse13 .cse12 .cse15 (not (= .cse14 1)))))) (let ((.cse18 (+ c_~queue~0.offset .cse19 4))) (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse18) .cse10))) (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse18) .cse10) 1))))) (or .cse11 (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse2)) 1)) (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse2))))) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))) (= c_~queue~0.offset 0) (<= 1 c_~v_assert~0) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (<= 0 c_~sum~0) (or (and (<= .cse10 1) .cse0 (<= (+ c_~front~0 c_~n~0) (+ c_~back~0 2)) .cse1 (<= 1 .cse10) (<= 0 c_~front~0) (<= c_~n~0 3) .cse4 (= c_~sum~0 0) .cse5) .cse6))))) is different from false [2022-11-03 04:03:18,220 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse19 (* c_~front~0 4))) (let ((.cse7 (* c_~n~0 4)) (.cse16 (select |c_#memory_int| c_~queue~0.base)) (.cse2 (+ c_~queue~0.offset .cse19)) (.cse20 (div |c_thread2Thread1of1ForFork2_~b~0#1| 256)) (.cse8 (* c_~back~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse8)) (.cse11 (= (mod c_~v_assert~0 256) 0)) (.cse0 (<= |c_thread2Thread1of1ForFork2_~b~0#1| (* .cse20 256))) (.cse1 (<= 1 c_~back~0)) (.cse10 (select .cse16 .cse2)) (.cse4 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))) (.cse5 (not (<= (+ .cse20 1) 0))) (.cse6 (<= .cse7 (+ c_~queue~0.offset 7 .cse8)))) (and (<= c_~sum~0 0) (or (and (<= 1 c_~sum~0) .cse0 .cse1 (< 3 .cse2) (<= .cse3 4) (<= c_~sum~0 1) (<= .cse2 4) .cse4 .cse5) .cse6) (<= c_~v_assert~0 1) (or (<= .cse7 (+ c_~queue~0.offset 3 .cse8)) (let ((.cse9 (+ c_~sum~0 .cse10))) (and (= .cse2 4) (<= .cse9 0) (<= 0 .cse9) .cse4))) (or .cse11 (let ((.cse17 (+ c_~back~0 1))) (let ((.cse13 (not (<= 0 .cse17))) (.cse12 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse15 (not (< .cse17 c_~n~0))) (.cse14 (select .cse16 .cse3))) (and (or (not .cse12) .cse13 (not (= (+ .cse14 1) 0)) .cse15) (or .cse13 .cse12 .cse15 (not (= .cse14 1)))))) (let ((.cse18 (+ c_~queue~0.offset .cse19 4))) (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse18) .cse10))) (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse18) .cse10) 1))))) (or .cse11 (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse2)) 1)) (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse2))))) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (= c_~queue~0.offset 0) (<= 1 c_~v_assert~0) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (<= 0 c_~sum~0) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (and (<= .cse10 1) .cse0 (<= (+ c_~front~0 c_~n~0) (+ c_~back~0 2)) .cse1 (<= 1 .cse10) (<= 0 c_~front~0) (<= c_~n~0 3) .cse4 (= c_~sum~0 0) .cse5) .cse6))))) is different from false [2022-11-03 04:03:21,877 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse19 (* c_~front~0 4))) (let ((.cse7 (* c_~n~0 4)) (.cse16 (select |c_#memory_int| c_~queue~0.base)) (.cse2 (+ c_~queue~0.offset .cse19)) (.cse20 (div |c_thread2Thread1of1ForFork2_~b~0#1| 256)) (.cse8 (* c_~back~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse8)) (.cse11 (= (mod c_~v_assert~0 256) 0)) (.cse0 (<= |c_thread2Thread1of1ForFork2_~b~0#1| (* .cse20 256))) (.cse1 (<= 1 c_~back~0)) (.cse10 (select .cse16 .cse2)) (.cse4 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))) (.cse5 (not (<= (+ .cse20 1) 0))) (.cse6 (<= .cse7 (+ c_~queue~0.offset 7 .cse8)))) (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (or (and (<= 1 c_~sum~0) .cse0 .cse1 (< 3 .cse2) (<= .cse3 4) (<= c_~sum~0 1) (<= .cse2 4) .cse4 .cse5) .cse6) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (or (<= .cse7 (+ c_~queue~0.offset 3 .cse8)) (let ((.cse9 (+ c_~sum~0 .cse10))) (and (= .cse2 4) (<= .cse9 0) (<= 0 .cse9) .cse4))) (or .cse11 (let ((.cse17 (+ c_~back~0 1))) (let ((.cse13 (not (<= 0 .cse17))) (.cse12 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse15 (not (< .cse17 c_~n~0))) (.cse14 (select .cse16 .cse3))) (and (or (not .cse12) .cse13 (not (= (+ .cse14 1) 0)) .cse15) (or .cse13 .cse12 .cse15 (not (= .cse14 1)))))) (let ((.cse18 (+ c_~queue~0.offset .cse19 4))) (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse18) .cse10))) (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse18) .cse10) 1))))) (or .cse11 (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse2)) 1)) (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse2))))) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))) (= c_~queue~0.offset 0) (<= 1 c_~v_assert~0) (or (and (<= .cse10 1) .cse0 (<= (+ c_~front~0 c_~n~0) (+ c_~back~0 2)) .cse1 (<= 1 .cse10) (<= 0 c_~front~0) (<= c_~n~0 3) .cse4 (= c_~sum~0 0) .cse5) .cse6))))) is different from false [2022-11-03 04:03:21,892 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse19 (* c_~front~0 4))) (let ((.cse7 (* c_~n~0 4)) (.cse16 (select |c_#memory_int| c_~queue~0.base)) (.cse2 (+ c_~queue~0.offset .cse19)) (.cse20 (div |c_thread2Thread1of1ForFork2_~b~0#1| 256)) (.cse8 (* c_~back~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse8)) (.cse11 (= (mod c_~v_assert~0 256) 0)) (.cse0 (<= |c_thread2Thread1of1ForFork2_~b~0#1| (* .cse20 256))) (.cse1 (<= 1 c_~back~0)) (.cse10 (select .cse16 .cse2)) (.cse4 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))) (.cse5 (not (<= (+ .cse20 1) 0))) (.cse6 (<= .cse7 (+ c_~queue~0.offset 7 .cse8)))) (and (or (and (<= 1 c_~sum~0) .cse0 .cse1 (< 3 .cse2) (<= .cse3 4) (<= c_~sum~0 1) (<= .cse2 4) .cse4 .cse5) .cse6) (<= c_~v_assert~0 1) (or (<= .cse7 (+ c_~queue~0.offset 3 .cse8)) (let ((.cse9 (+ c_~sum~0 .cse10))) (and (= .cse2 4) (<= .cse9 0) (<= 0 .cse9) .cse4))) (or .cse11 (let ((.cse17 (+ c_~back~0 1))) (let ((.cse13 (not (<= 0 .cse17))) (.cse12 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse15 (not (< .cse17 c_~n~0))) (.cse14 (select .cse16 .cse3))) (and (or (not .cse12) .cse13 (not (= (+ .cse14 1) 0)) .cse15) (or .cse13 .cse12 .cse15 (not (= .cse14 1)))))) (let ((.cse18 (+ c_~queue~0.offset .cse19 4))) (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse18) .cse10))) (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse18) .cse10) 1))))) (or .cse11 (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse2)) 1)) (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse2))))) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))) (= c_~queue~0.offset 0) (<= 1 c_~v_assert~0) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (or (and (<= .cse10 1) .cse0 (<= (+ c_~front~0 c_~n~0) (+ c_~back~0 2)) .cse1 (<= 1 .cse10) (<= 0 c_~front~0) (<= c_~n~0 3) .cse4 (= c_~sum~0 0) .cse5) .cse6))))) is different from false [2022-11-03 04:03:21,909 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse19 (* c_~front~0 4))) (let ((.cse7 (* c_~n~0 4)) (.cse16 (select |c_#memory_int| c_~queue~0.base)) (.cse2 (+ c_~queue~0.offset .cse19)) (.cse20 (div |c_thread2Thread1of1ForFork2_~b~0#1| 256)) (.cse8 (* c_~back~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse8)) (.cse11 (= (mod c_~v_assert~0 256) 0)) (.cse0 (<= |c_thread2Thread1of1ForFork2_~b~0#1| (* .cse20 256))) (.cse1 (<= 1 c_~back~0)) (.cse10 (select .cse16 .cse2)) (.cse4 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))) (.cse5 (not (<= (+ .cse20 1) 0))) (.cse6 (<= .cse7 (+ c_~queue~0.offset 7 .cse8)))) (and (or (and (<= 1 c_~sum~0) .cse0 .cse1 (< 3 .cse2) (<= .cse3 4) (<= c_~sum~0 1) (<= .cse2 4) .cse4 .cse5) .cse6) (<= c_~v_assert~0 1) (or (<= .cse7 (+ c_~queue~0.offset 3 .cse8)) (let ((.cse9 (+ c_~sum~0 .cse10))) (and (= .cse2 4) (<= .cse9 0) (<= 0 .cse9) .cse4))) (or .cse11 (let ((.cse17 (+ c_~back~0 1))) (let ((.cse13 (not (<= 0 .cse17))) (.cse12 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse15 (not (< .cse17 c_~n~0))) (.cse14 (select .cse16 .cse3))) (and (or (not .cse12) .cse13 (not (= (+ .cse14 1) 0)) .cse15) (or .cse13 .cse12 .cse15 (not (= .cse14 1)))))) (let ((.cse18 (+ c_~queue~0.offset .cse19 4))) (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse18) .cse10))) (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse18) .cse10) 1))))) (or .cse11 (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse2)) 1)) (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse2))))) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (= c_~queue~0.offset 0) (<= 1 c_~v_assert~0) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (and (<= .cse10 1) .cse0 (<= (+ c_~front~0 c_~n~0) (+ c_~back~0 2)) .cse1 (<= 1 .cse10) (<= 0 c_~front~0) (<= c_~n~0 3) .cse4 (= c_~sum~0 0) .cse5) .cse6))))) is different from false [2022-11-03 04:03:29,484 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse19 (* c_~front~0 4))) (let ((.cse7 (* c_~n~0 4)) (.cse16 (select |c_#memory_int| c_~queue~0.base)) (.cse2 (+ c_~queue~0.offset .cse19)) (.cse20 (div |c_thread2Thread1of1ForFork2_~b~0#1| 256)) (.cse8 (* c_~back~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse8)) (.cse11 (= (mod c_~v_assert~0 256) 0)) (.cse0 (<= |c_thread2Thread1of1ForFork2_~b~0#1| (* .cse20 256))) (.cse1 (<= 1 c_~back~0)) (.cse10 (select .cse16 .cse2)) (.cse4 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))) (.cse5 (not (<= (+ .cse20 1) 0))) (.cse6 (<= .cse7 (+ c_~queue~0.offset 7 .cse8)))) (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= c_~sum~0 0) (or (and (<= 1 c_~sum~0) .cse0 .cse1 (< 3 .cse2) (<= .cse3 4) (<= c_~sum~0 1) (<= .cse2 4) .cse4 .cse5) .cse6) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (or (<= .cse7 (+ c_~queue~0.offset 3 .cse8)) (let ((.cse9 (+ c_~sum~0 .cse10))) (and (= .cse2 4) (<= .cse9 0) (<= 0 .cse9) .cse4))) (or .cse11 (let ((.cse17 (+ c_~back~0 1))) (let ((.cse13 (not (<= 0 .cse17))) (.cse12 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse15 (not (< .cse17 c_~n~0))) (.cse14 (select .cse16 .cse3))) (and (or (not .cse12) .cse13 (not (= (+ .cse14 1) 0)) .cse15) (or .cse13 .cse12 .cse15 (not (= .cse14 1)))))) (let ((.cse18 (+ c_~queue~0.offset .cse19 4))) (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse18) .cse10))) (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse18) .cse10) 1))))) (or .cse11 (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse2)) 1)) (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse2))))) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (= c_~queue~0.offset 0) (<= 0 c_~sum~0) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (and (<= .cse10 1) .cse0 (<= (+ c_~front~0 c_~n~0) (+ c_~back~0 2)) .cse1 (<= 1 .cse10) (<= 0 c_~front~0) (<= c_~n~0 3) .cse4 (= c_~sum~0 0) .cse5) .cse6))))) is different from false [2022-11-03 04:03:29,502 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse19 (* c_~front~0 4))) (let ((.cse7 (* c_~n~0 4)) (.cse16 (select |c_#memory_int| c_~queue~0.base)) (.cse2 (+ c_~queue~0.offset .cse19)) (.cse20 (div |c_thread2Thread1of1ForFork2_~b~0#1| 256)) (.cse8 (* c_~back~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse8)) (.cse11 (= (mod c_~v_assert~0 256) 0)) (.cse0 (<= |c_thread2Thread1of1ForFork2_~b~0#1| (* .cse20 256))) (.cse1 (<= 1 c_~back~0)) (.cse10 (select .cse16 .cse2)) (.cse4 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))) (.cse5 (not (<= (+ .cse20 1) 0))) (.cse6 (<= .cse7 (+ c_~queue~0.offset 7 .cse8)))) (and (<= c_~sum~0 0) (or (and (<= 1 c_~sum~0) .cse0 .cse1 (< 3 .cse2) (<= .cse3 4) (<= c_~sum~0 1) (<= .cse2 4) .cse4 .cse5) .cse6) (or (<= .cse7 (+ c_~queue~0.offset 3 .cse8)) (let ((.cse9 (+ c_~sum~0 .cse10))) (and (= .cse2 4) (<= .cse9 0) (<= 0 .cse9) .cse4))) (or .cse11 (let ((.cse17 (+ c_~back~0 1))) (let ((.cse13 (not (<= 0 .cse17))) (.cse12 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse15 (not (< .cse17 c_~n~0))) (.cse14 (select .cse16 .cse3))) (and (or (not .cse12) .cse13 (not (= (+ .cse14 1) 0)) .cse15) (or .cse13 .cse12 .cse15 (not (= .cse14 1)))))) (let ((.cse18 (+ c_~queue~0.offset .cse19 4))) (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse18) .cse10))) (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse18) .cse10) 1))))) (or .cse11 (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse2)) 1)) (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse2))))) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (= c_~queue~0.offset 0) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (<= 0 c_~sum~0) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (and (<= .cse10 1) .cse0 (<= (+ c_~front~0 c_~n~0) (+ c_~back~0 2)) .cse1 (<= 1 .cse10) (<= 0 c_~front~0) (<= c_~n~0 3) .cse4 (= c_~sum~0 0) .cse5) .cse6))))) is different from false [2022-11-03 04:03:29,514 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse19 (* c_~front~0 4))) (let ((.cse7 (* c_~n~0 4)) (.cse16 (select |c_#memory_int| c_~queue~0.base)) (.cse2 (+ c_~queue~0.offset .cse19)) (.cse20 (div |c_thread2Thread1of1ForFork2_~b~0#1| 256)) (.cse8 (* c_~back~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse8)) (.cse11 (= (mod c_~v_assert~0 256) 0)) (.cse0 (<= |c_thread2Thread1of1ForFork2_~b~0#1| (* .cse20 256))) (.cse1 (<= 1 c_~back~0)) (.cse10 (select .cse16 .cse2)) (.cse4 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|))) (.cse5 (not (<= (+ .cse20 1) 0))) (.cse6 (<= .cse7 (+ c_~queue~0.offset 7 .cse8)))) (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= c_~sum~0 0) (or (and (<= 1 c_~sum~0) .cse0 .cse1 (< 3 .cse2) (<= .cse3 4) (<= c_~sum~0 1) (<= .cse2 4) .cse4 .cse5) .cse6) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (or (<= .cse7 (+ c_~queue~0.offset 3 .cse8)) (let ((.cse9 (+ c_~sum~0 .cse10))) (and (= .cse2 4) (<= .cse9 0) (<= 0 .cse9) .cse4))) (or .cse11 (let ((.cse17 (+ c_~back~0 1))) (let ((.cse13 (not (<= 0 .cse17))) (.cse12 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse15 (not (< .cse17 c_~n~0))) (.cse14 (select .cse16 .cse3))) (and (or (not .cse12) .cse13 (not (= (+ .cse14 1) 0)) .cse15) (or .cse13 .cse12 .cse15 (not (= .cse14 1)))))) (let ((.cse18 (+ c_~queue~0.offset .cse19 4))) (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse18) .cse10))) (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse18) .cse10) 1))))) (or .cse11 (and (forall ((v_ArrVal_1407 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse2)) 1)) (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1407) c_~queue~0.base) .cse2))))) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))) (= c_~queue~0.offset 0) (<= 0 c_~sum~0) (or (and (<= .cse10 1) .cse0 (<= (+ c_~front~0 c_~n~0) (+ c_~back~0 2)) .cse1 (<= 1 .cse10) (<= 0 c_~front~0) (<= c_~n~0 3) .cse4 (= c_~sum~0 0) .cse5) .cse6))))) is different from false [2022-11-03 04:03:39,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:03:39,824 INFO L93 Difference]: Finished difference Result 8760 states and 23252 transitions. [2022-11-03 04:03:39,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 377 states. [2022-11-03 04:03:39,825 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.8181818181818181) internal successors, (80), 43 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-03 04:03:39,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:03:39,843 INFO L225 Difference]: With dead ends: 8760 [2022-11-03 04:03:39,844 INFO L226 Difference]: Without dead ends: 8444 [2022-11-03 04:03:39,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 615 GetRequests, 70 SyntacticMatches, 146 SemanticMatches, 399 ConstructedPredicates, 46 IntricatePredicates, 0 DeprecatedPredicates, 80910 ImplicationChecksByTransitivity, 67.9s TimeCoverageRelationStatistics Valid=17269, Invalid=108436, Unknown=149, NotChecked=34546, Total=160400 [2022-11-03 04:03:39,855 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 958 mSDsluCounter, 3382 mSDsCounter, 0 mSdLazyCounter, 6485 mSolverCounterSat, 604 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 958 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 12421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 604 IncrementalHoareTripleChecker+Valid, 6485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5332 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-11-03 04:03:39,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [958 Valid, 156 Invalid, 12421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [604 Valid, 6485 Invalid, 0 Unknown, 5332 Unchecked, 7.0s Time] [2022-11-03 04:03:39,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8444 states. [2022-11-03 04:03:39,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8444 to 3385. [2022-11-03 04:03:40,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3385 states, 3384 states have (on average 2.797872340425532) internal successors, (9468), 3384 states have internal predecessors, (9468), 0 states have call successors, (0), 0 states 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:03:40,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3385 states to 3385 states and 9468 transitions. [2022-11-03 04:03:40,015 INFO L78 Accepts]: Start accepts. Automaton has 3385 states and 9468 transitions. Word has length 32 [2022-11-03 04:03:40,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:03:40,016 INFO L495 AbstractCegarLoop]: Abstraction has 3385 states and 9468 transitions. [2022-11-03 04:03:40,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.8181818181818181) internal successors, (80), 43 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:03:40,016 INFO L276 IsEmpty]: Start isEmpty. Operand 3385 states and 9468 transitions. [2022-11-03 04:03:40,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-03 04:03:40,024 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:03:40,024 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:03:40,031 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-11-03 04:03:40,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:03:40,231 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:03:40,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:03:40,231 INFO L85 PathProgramCache]: Analyzing trace with hash -933153340, now seen corresponding path program 27 times [2022-11-03 04:03:40,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:03:40,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337071741] [2022-11-03 04:03:40,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:03:40,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:03:40,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:03:40,406 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 04:03:40,406 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:03:40,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337071741] [2022-11-03 04:03:40,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337071741] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:03:40,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956340235] [2022-11-03 04:03:40,407 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 04:03:40,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:03:40,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:03:40,411 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:03:40,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-11-03 04:03:40,625 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 04:03:40,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:03:40,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-03 04:03:40,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:03:40,758 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:03:40,759 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 27 treesize of output 9 [2022-11-03 04:03:40,784 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 04:03:40,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:03:41,094 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-03 04:03:41,095 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 193 treesize of output 145 [2022-11-03 04:03:41,252 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 04:03:41,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956340235] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:03:41,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1402160788] [2022-11-03 04:03:41,252 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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:03:41,253 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:03:41,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 7] total 16 [2022-11-03 04:03:41,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517362776] [2022-11-03 04:03:41,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:03:41,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-03 04:03:41,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:03:41,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-03 04:03:41,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2022-11-03 04:03:41,254 INFO L87 Difference]: Start difference. First operand 3385 states and 9468 transitions. Second operand has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 16 states have internal predecessors, (61), 0 states have call successors, (0), 0 states 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:03:41,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:03:41,838 INFO L93 Difference]: Finished difference Result 6256 states and 17325 transitions. [2022-11-03 04:03:41,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-03 04:03:41,840 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 16 states have internal predecessors, (61), 0 states have call successors, (0), 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 32 [2022-11-03 04:03:41,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:03:41,851 INFO L225 Difference]: With dead ends: 6256 [2022-11-03 04:03:41,851 INFO L226 Difference]: Without dead ends: 6254 [2022-11-03 04:03:41,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=215, Invalid=385, Unknown=0, NotChecked=0, Total=600 [2022-11-03 04:03:41,852 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 323 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 04:03:41,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 32 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 04:03:41,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6254 states. [2022-11-03 04:03:41,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6254 to 5605. [2022-11-03 04:03:41,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5605 states, 5604 states have (on average 2.8163811563169165) internal successors, (15783), 5604 states have internal predecessors, (15783), 0 states have call successors, (0), 0 states 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:03:42,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5605 states to 5605 states and 15783 transitions. [2022-11-03 04:03:42,001 INFO L78 Accepts]: Start accepts. Automaton has 5605 states and 15783 transitions. Word has length 32 [2022-11-03 04:03:42,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:03:42,002 INFO L495 AbstractCegarLoop]: Abstraction has 5605 states and 15783 transitions. [2022-11-03 04:03:42,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 16 states have internal predecessors, (61), 0 states have call successors, (0), 0 states 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:03:42,002 INFO L276 IsEmpty]: Start isEmpty. Operand 5605 states and 15783 transitions. [2022-11-03 04:03:42,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-03 04:03:42,015 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:03:42,015 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:03:42,058 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-11-03 04:03:42,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-11-03 04:03:42,231 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:03:42,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:03:42,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1702233528, now seen corresponding path program 28 times [2022-11-03 04:03:42,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:03:42,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560638019] [2022-11-03 04:03:42,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:03:42,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:03:42,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:03:44,866 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:03:44,867 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:03:44,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560638019] [2022-11-03 04:03:44,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560638019] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:03:44,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178662849] [2022-11-03 04:03:44,867 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 04:03:44,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:03:44,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:03:44,868 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:03:44,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-11-03 04:03:45,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:03:45,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-03 04:03:45,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:03:45,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:03:45,466 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 44 treesize of output 42 [2022-11-03 04:03:45,513 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:03:45,514 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 48 treesize of output 14 [2022-11-03 04:03:45,589 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 04:03:45,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:03:45,774 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1516 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1516) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_1516 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1516) c_~queue~0.base) .cse0)) 1)))) is different from false [2022-11-03 04:03:45,937 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse5 4)) (.cse4 (select .cse2 (+ c_~queue~0.offset .cse5)))) (and (forall ((v_ArrVal_1516 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1516) c_~queue~0.base) .cse3) .cse4))) (forall ((v_ArrVal_1516 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1516) c_~queue~0.base) .cse3) .cse4) 1))))))) is different from false [2022-11-03 04:03:46,122 INFO L356 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-03 04:03:46,123 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 286 treesize of output 240 [2022-11-03 04:03:46,137 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 59 treesize of output 52 [2022-11-03 04:03:46,152 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 52 treesize of output 45 [2022-11-03 04:03:46,974 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 3 not checked. [2022-11-03 04:03:46,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178662849] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:03:46,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [763127955] [2022-11-03 04:03:46,975 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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:03:46,975 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:03:46,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 11] total 36 [2022-11-03 04:03:46,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548235329] [2022-11-03 04:03:46,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:03:46,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-03 04:03:46,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:03:46,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-03 04:03:46,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1040, Unknown=2, NotChecked=134, Total=1332 [2022-11-03 04:03:46,977 INFO L87 Difference]: Start difference. First operand 5605 states and 15783 transitions. Second operand has 37 states, 37 states have (on average 2.0) internal successors, (74), 36 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:03:49,416 WARN L833 $PredicateComparison]: unable to prove that (and (<= c_~sum~0 0) (<= c_~v_assert~0 1) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse5 4)) (.cse4 (select .cse2 (+ c_~queue~0.offset .cse5)))) (and (forall ((v_ArrVal_1516 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1516) c_~queue~0.base) .cse3) .cse4))) (forall ((v_ArrVal_1516 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1516) c_~queue~0.base) .cse3) .cse4) 1))))))) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0)) is different from false [2022-11-03 04:03:49,652 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (<= c_~sum~0 0) (forall ((v_ArrVal_1516 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1516) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_1516 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1516) c_~queue~0.base) .cse0)) 1)) (<= 0 c_~sum~0))) is different from false [2022-11-03 04:03:49,977 WARN L833 $PredicateComparison]: unable to prove that (and (<= c_~sum~0 0) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse5 4)) (.cse4 (select .cse2 (+ c_~queue~0.offset .cse5)))) (and (forall ((v_ArrVal_1516 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1516) c_~queue~0.base) .cse3) .cse4))) (forall ((v_ArrVal_1516 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1516) c_~queue~0.base) .cse3) .cse4) 1))))))) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0)) is different from false [2022-11-03 04:03:51,111 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (<= c_~sum~0 0) (forall ((v_ArrVal_1516 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1516) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_1516 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1516) c_~queue~0.base) .cse0)) 1)) (<= 0 c_~sum~0))) is different from false [2022-11-03 04:03:51,779 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (forall ((v_ArrVal_1516 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1516) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_1516 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1516) c_~queue~0.base) .cse0)) 1)))) is different from false [2022-11-03 04:03:51,991 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1516 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1516) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_1516 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1516) c_~queue~0.base) .cse0)) 1)) (<= 0 c_~sum~0) (<= c_~sum~0 1))) is different from false [2022-11-03 04:03:53,857 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (<= c_~sum~0 0)) (.cse1 (* c_~back~0 4)) (.cse2 (<= 0 c_~sum~0))) (and .cse0 (or (<= (* c_~n~0 4) (+ c_~queue~0.offset 3 .cse1)) (and .cse0 .cse2)) (let ((.cse5 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse3 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse4 (select .cse5 (+ c_~queue~0.offset .cse1)))) (and (or (not .cse3) (not (= (+ .cse4 1) 0))) (or .cse3 (not (= .cse4 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (let ((.cse8 (* c_~front~0 4))) (let ((.cse6 (+ c_~queue~0.offset .cse8 4)) (.cse7 (select .cse5 (+ c_~queue~0.offset .cse8)))) (and (forall ((v_ArrVal_1516 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1516) c_~queue~0.base) .cse6) .cse7))) (forall ((v_ArrVal_1516 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1516) c_~queue~0.base) .cse6) .cse7) 1))))))) (= c_~queue~0.offset 0) .cse2)) is different from false [2022-11-03 04:03:54,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:03:54,201 INFO L93 Difference]: Finished difference Result 8157 states and 22557 transitions. [2022-11-03 04:03:54,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-11-03 04:03:54,202 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.0) internal successors, (74), 36 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-03 04:03:54,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:03:54,218 INFO L225 Difference]: With dead ends: 8157 [2022-11-03 04:03:54,218 INFO L226 Difference]: Without dead ends: 8157 [2022-11-03 04:03:54,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 59 SyntacticMatches, 8 SemanticMatches, 117 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 3891 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=1398, Invalid=10605, Unknown=23, NotChecked=2016, Total=14042 [2022-11-03 04:03:54,220 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 520 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 2091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 1161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 764 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:03:54,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 53 Invalid, 2091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 1161 Invalid, 0 Unknown, 764 Unchecked, 1.1s Time] [2022-11-03 04:03:54,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8157 states. [2022-11-03 04:03:54,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8157 to 5791. [2022-11-03 04:03:54,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5791 states, 5790 states have (on average 2.816062176165803) internal successors, (16305), 5790 states have internal predecessors, (16305), 0 states have call successors, (0), 0 states 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:03:54,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5791 states to 5791 states and 16305 transitions. [2022-11-03 04:03:54,356 INFO L78 Accepts]: Start accepts. Automaton has 5791 states and 16305 transitions. Word has length 33 [2022-11-03 04:03:54,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:03:54,357 INFO L495 AbstractCegarLoop]: Abstraction has 5791 states and 16305 transitions. [2022-11-03 04:03:54,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.0) internal successors, (74), 36 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:03:54,357 INFO L276 IsEmpty]: Start isEmpty. Operand 5791 states and 16305 transitions. [2022-11-03 04:03:54,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-03 04:03:54,371 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:03:54,371 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:03:54,420 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-11-03 04:03:54,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:03:54,599 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:03:54,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:03:54,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1272517102, now seen corresponding path program 29 times [2022-11-03 04:03:54,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:03:54,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686373113] [2022-11-03 04:03:54,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:03:54,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:03:54,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:03:57,235 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:03:57,235 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:03:57,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686373113] [2022-11-03 04:03:57,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686373113] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:03:57,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947833469] [2022-11-03 04:03:57,236 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:03:57,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:03:57,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:03:57,237 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:03:57,238 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-11-03 04:03:57,486 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-03 04:03:57,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:03:57,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-03 04:03:57,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:03:57,498 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 838 treesize of output 822 [2022-11-03 04:03:57,961 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 44 treesize of output 42 [2022-11-03 04:03:58,020 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:03:58,021 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 48 treesize of output 14 [2022-11-03 04:03:58,164 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 04:03:58,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:03:58,396 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1576 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_1576 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) c_~queue~0.base) .cse0)) 1)))) (= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) is different from false [2022-11-03 04:03:58,407 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1576 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_1576 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) c_~queue~0.base) .cse0)) 1)))) (= (mod c_~v_assert~0 256) 0)) is different from false [2022-11-03 04:03:58,441 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1576 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_1576 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) c_~queue~0.base) .cse0)) 1)))) (let ((.cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse2 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse1) (not (= (+ .cse2 1) 0))) (or .cse1 (not (= .cse2 1))))) (= (mod c_~v_assert~0 256) 0)) is different from false [2022-11-03 04:03:58,490 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod c_~v_assert~0 256) 0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse5 4)) (.cse4 (select .cse2 (+ c_~queue~0.offset .cse5)))) (and (forall ((v_ArrVal_1576 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) c_~queue~0.base) .cse3) c_~sum~0 .cse4))) (forall ((v_ArrVal_1576 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) c_~queue~0.base) .cse3) c_~sum~0 .cse4) 1))))))) is different from false [2022-11-03 04:03:58,610 INFO L356 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-03 04:03:58,610 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 286 treesize of output 240 [2022-11-03 04:03:58,626 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 59 treesize of output 52 [2022-11-03 04:03:58,639 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 52 treesize of output 45 [2022-11-03 04:03:59,317 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 8 not checked. [2022-11-03 04:03:59,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947833469] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:03:59,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [17562479] [2022-11-03 04:03:59,318 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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:03:59,318 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:03:59,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 12] total 39 [2022-11-03 04:03:59,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346238567] [2022-11-03 04:03:59,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:03:59,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-03 04:03:59,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:03:59,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-03 04:03:59,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1080, Unknown=4, NotChecked=284, Total=1560 [2022-11-03 04:03:59,321 INFO L87 Difference]: Start difference. First operand 5791 states and 16305 transitions. Second operand has 40 states, 40 states have (on average 1.875) internal successors, (75), 39 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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:04:01,863 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_~back~0 4))) (and (or (<= (* c_~n~0 4) (+ c_~queue~0.offset 3 .cse0)) (and (<= c_~sum~0 0) (<= 0 c_~sum~0))) (or (let ((.cse1 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1576 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) c_~queue~0.base) .cse1)))) (forall ((v_ArrVal_1576 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) c_~queue~0.base) .cse1)) 1)))) (let ((.cse2 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse3 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) (and (or (not .cse2) (not (= (+ .cse3 1) 0))) (or .cse2 (not (= .cse3 1))))) (= (mod c_~v_assert~0 256) 0)) (= c_~queue~0.offset 0) (= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (= c_~sum~0 0))) is different from false [2022-11-03 04:04:02,071 WARN L833 $PredicateComparison]: unable to prove that (and (<= c_~v_assert~0 1) (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1576 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_1576 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) c_~queue~0.base) .cse0)) 1)))) (let ((.cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse2 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse1) (not (= (+ .cse2 1) 0))) (or .cse1 (not (= .cse2 1))))) (= (mod c_~v_assert~0 256) 0)) (<= 1 c_~v_assert~0) (= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (= c_~sum~0 0)) is different from false [2022-11-03 04:04:02,263 WARN L833 $PredicateComparison]: unable to prove that (and (<= c_~v_assert~0 1) (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1576 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_1576 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) c_~queue~0.base) .cse0)) 1)))) (let ((.cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse2 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse1) (not (= (+ .cse2 1) 0))) (or .cse1 (not (= .cse2 1))))) (= (mod c_~v_assert~0 256) 0)) (<= 1 c_~v_assert~0)) is different from false [2022-11-03 04:04:02,328 WARN L833 $PredicateComparison]: unable to prove that (and (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1576 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_1576 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1576) c_~queue~0.base) .cse0)) 1)))) (= (mod c_~v_assert~0 256) 0)) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0))) is different from false [2022-11-03 04:04:03,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:04:03,526 INFO L93 Difference]: Finished difference Result 11611 states and 32213 transitions. [2022-11-03 04:04:03,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-11-03 04:04:03,526 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.875) internal successors, (75), 39 states have internal predecessors, (75), 0 states have call successors, (0), 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 33 [2022-11-03 04:04:03,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:04:03,547 INFO L225 Difference]: With dead ends: 11611 [2022-11-03 04:04:03,547 INFO L226 Difference]: Without dead ends: 10590 [2022-11-03 04:04:03,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 88 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1944 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1066, Invalid=5595, Unknown=13, NotChecked=1336, Total=8010 [2022-11-03 04:04:03,548 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 584 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 1251 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 2144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 1251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 691 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:04:03,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 23 Invalid, 2144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 1251 Invalid, 0 Unknown, 691 Unchecked, 1.2s Time] [2022-11-03 04:04:03,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10590 states. [2022-11-03 04:04:03,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10590 to 5888. [2022-11-03 04:04:03,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5888 states, 5887 states have (on average 2.8133174791914386) internal successors, (16562), 5887 states have internal predecessors, (16562), 0 states have call successors, (0), 0 states 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:04:03,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5888 states to 5888 states and 16562 transitions. [2022-11-03 04:04:03,756 INFO L78 Accepts]: Start accepts. Automaton has 5888 states and 16562 transitions. Word has length 33 [2022-11-03 04:04:03,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:04:03,756 INFO L495 AbstractCegarLoop]: Abstraction has 5888 states and 16562 transitions. [2022-11-03 04:04:03,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.875) internal successors, (75), 39 states have internal predecessors, (75), 0 states have call successors, (0), 0 states 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:04:03,756 INFO L276 IsEmpty]: Start isEmpty. Operand 5888 states and 16562 transitions. [2022-11-03 04:04:03,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-03 04:04:03,770 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:04:03,770 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:04:03,816 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-11-03 04:04:03,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:04:03,983 INFO L420 AbstractCegarLoop]: === Iteration 35 === 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:04:03,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:04:03,984 INFO L85 PathProgramCache]: Analyzing trace with hash 886043140, now seen corresponding path program 30 times [2022-11-03 04:04:03,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:04:03,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814375247] [2022-11-03 04:04:03,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:04:03,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:04:04,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:04:06,190 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:04:06,190 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:04:06,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814375247] [2022-11-03 04:04:06,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814375247] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:04:06,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280797689] [2022-11-03 04:04:06,191 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 04:04:06,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:04:06,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:04:06,192 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:04:06,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-11-03 04:04:06,362 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 04:04:06,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:04:06,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-03 04:04:06,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:04:06,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:06,906 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 44 treesize of output 42 [2022-11-03 04:04:06,964 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:04:06,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 48 treesize of output 14 [2022-11-03 04:04:07,049 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:04:07,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:04:07,222 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1633 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1633) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_1633 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1633) c_~queue~0.base) .cse0)) 1)))) is different from false [2022-11-03 04:04:07,412 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (select .cse3 (+ c_~queue~0.offset .cse2))) (.cse1 (+ c_~queue~0.offset .cse2 4))) (and (forall ((v_ArrVal_1633 (Array Int Int))) (<= (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1633) c_~queue~0.base) .cse1)) 1)) (forall ((v_ArrVal_1633 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1633) c_~queue~0.base) .cse1))))))) (let ((.cse4 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse5 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse4) (not (= (+ .cse5 1) 0))) (or .cse4 (not (= .cse5 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0))) is different from false [2022-11-03 04:04:07,571 INFO L356 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-03 04:04:07,571 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 286 treesize of output 240 [2022-11-03 04:04:07,585 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 59 treesize of output 52 [2022-11-03 04:04:07,597 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 52 treesize of output 45 [2022-11-03 04:04:08,255 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 3 not checked. [2022-11-03 04:04:08,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280797689] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:04:08,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [14827998] [2022-11-03 04:04:08,256 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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:04:08,256 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:04:08,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 11] total 38 [2022-11-03 04:04:08,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889410305] [2022-11-03 04:04:08,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:04:08,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-03 04:04:08,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:04:08,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-03 04:04:08,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1173, Unknown=2, NotChecked=142, Total=1482 [2022-11-03 04:04:08,258 INFO L87 Difference]: Start difference. First operand 5888 states and 16562 transitions. Second operand has 39 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 38 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:04:10,636 WARN L833 $PredicateComparison]: unable to prove that (and (<= c_~sum~0 0) (<= c_~v_assert~0 1) (let ((.cse3 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (select .cse3 (+ c_~queue~0.offset .cse2))) (.cse1 (+ c_~queue~0.offset .cse2 4))) (and (forall ((v_ArrVal_1633 (Array Int Int))) (<= (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1633) c_~queue~0.base) .cse1)) 1)) (forall ((v_ArrVal_1633 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1633) c_~queue~0.base) .cse1))))))) (let ((.cse4 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse5 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse4) (not (= (+ .cse5 1) 0))) (or .cse4 (not (= .cse5 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0))) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0)) is different from false [2022-11-03 04:04:11,165 WARN L833 $PredicateComparison]: unable to prove that (and (<= c_~sum~0 0) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (let ((.cse3 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (select .cse3 (+ c_~queue~0.offset .cse2))) (.cse1 (+ c_~queue~0.offset .cse2 4))) (and (forall ((v_ArrVal_1633 (Array Int Int))) (<= (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1633) c_~queue~0.base) .cse1)) 1)) (forall ((v_ArrVal_1633 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1633) c_~queue~0.base) .cse1))))))) (let ((.cse4 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse5 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse4) (not (= (+ .cse5 1) 0))) (or .cse4 (not (= .cse5 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0))) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0)) is different from false [2022-11-03 04:04:12,967 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (forall ((v_ArrVal_1633 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1633) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_1633 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1633) c_~queue~0.base) .cse0)) 1)))) is different from false [2022-11-03 04:04:14,278 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (<= 0 c_~sum~0) (<= c_~sum~0 1) (forall ((v_ArrVal_1633 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1633) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_1633 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1633) c_~queue~0.base) .cse0)) 1)))) is different from false [2022-11-03 04:04:14,702 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (<= 0 c_~sum~0) (<= c_~sum~0 1) (forall ((v_ArrVal_1633 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1633) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_1633 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1633) c_~queue~0.base) .cse0)) 1)))) is different from false [2022-11-03 04:04:15,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:04:15,394 INFO L93 Difference]: Finished difference Result 8995 states and 24896 transitions. [2022-11-03 04:04:15,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-11-03 04:04:15,394 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 38 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-03 04:04:15,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:04:15,410 INFO L225 Difference]: With dead ends: 8995 [2022-11-03 04:04:15,410 INFO L226 Difference]: Without dead ends: 8995 [2022-11-03 04:04:15,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 48 SyntacticMatches, 14 SemanticMatches, 108 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 3677 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=1273, Invalid=9237, Unknown=24, NotChecked=1456, Total=11990 [2022-11-03 04:04:15,412 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 409 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 1302 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 2094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 1302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 637 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-03 04:04:15,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 48 Invalid, 2094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 1302 Invalid, 0 Unknown, 637 Unchecked, 1.3s Time] [2022-11-03 04:04:15,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8995 states. [2022-11-03 04:04:15,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8995 to 5983. [2022-11-03 04:04:15,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5983 states, 5982 states have (on average 2.813607489134069) internal successors, (16831), 5982 states have internal predecessors, (16831), 0 states have call successors, (0), 0 states 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:04:15,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5983 states to 5983 states and 16831 transitions. [2022-11-03 04:04:15,634 INFO L78 Accepts]: Start accepts. Automaton has 5983 states and 16831 transitions. Word has length 33 [2022-11-03 04:04:15,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:04:15,634 INFO L495 AbstractCegarLoop]: Abstraction has 5983 states and 16831 transitions. [2022-11-03 04:04:15,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 38 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:04:15,634 INFO L276 IsEmpty]: Start isEmpty. Operand 5983 states and 16831 transitions. [2022-11-03 04:04:15,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-03 04:04:15,645 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:04:15,646 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:04:15,671 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-11-03 04:04:15,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-11-03 04:04:15,846 INFO L420 AbstractCegarLoop]: === Iteration 36 === 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:04:15,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:04:15,847 INFO L85 PathProgramCache]: Analyzing trace with hash 456326714, now seen corresponding path program 31 times [2022-11-03 04:04:15,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:04:15,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138087059] [2022-11-03 04:04:15,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:04:15,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:04:15,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:04:17,619 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:04:17,619 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:04:17,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138087059] [2022-11-03 04:04:17,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138087059] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:04:17,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780805759] [2022-11-03 04:04:17,620 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 04:04:17,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:04:17,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:04:17,623 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:04:17,625 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-11-03 04:04:17,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:04:17,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-03 04:04:17,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:04:18,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:18,222 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 44 treesize of output 42 [2022-11-03 04:04:18,273 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:04:18,274 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 48 treesize of output 14 [2022-11-03 04:04:18,382 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 04:04:18,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:04:18,594 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1690 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1690) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_1690 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1690) c_~queue~0.base) .cse0)))))) is different from false [2022-11-03 04:04:18,747 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (select .cse3 (+ c_~queue~0.offset .cse2))) (.cse1 (+ c_~queue~0.offset .cse2 4))) (and (forall ((v_ArrVal_1690 (Array Int Int))) (<= (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1690) c_~queue~0.base) .cse1)) 1)) (forall ((v_ArrVal_1690 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1690) c_~queue~0.base) .cse1))))))) (let ((.cse4 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse5 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse4) (not (= (+ .cse5 1) 0))) (or .cse4 (not (= .cse5 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0))) is different from false [2022-11-03 04:04:18,872 INFO L356 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-03 04:04:18,872 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 286 treesize of output 240 [2022-11-03 04:04:18,886 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 59 treesize of output 52 [2022-11-03 04:04:18,898 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 52 treesize of output 45 [2022-11-03 04:04:19,507 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 5 not checked. [2022-11-03 04:04:19,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780805759] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:04:19,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [691826358] [2022-11-03 04:04:19,508 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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:04:19,508 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:04:19,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 11] total 37 [2022-11-03 04:04:19,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004221340] [2022-11-03 04:04:19,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:04:19,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-03 04:04:19,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:04:19,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-03 04:04:19,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1109, Unknown=2, NotChecked=138, Total=1406 [2022-11-03 04:04:19,510 INFO L87 Difference]: Start difference. First operand 5983 states and 16831 transitions. Second operand has 38 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 37 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:04:22,138 WARN L833 $PredicateComparison]: unable to prove that (and (<= c_~sum~0 0) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (let ((.cse3 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (select .cse3 (+ c_~queue~0.offset .cse2))) (.cse1 (+ c_~queue~0.offset .cse2 4))) (and (forall ((v_ArrVal_1690 (Array Int Int))) (<= (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1690) c_~queue~0.base) .cse1)) 1)) (forall ((v_ArrVal_1690 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1690) c_~queue~0.base) .cse1))))))) (let ((.cse4 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse5 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse4) (not (= (+ .cse5 1) 0))) (or .cse4 (not (= .cse5 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0))) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0)) is different from false [2022-11-03 04:04:22,693 WARN L833 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (let ((.cse3 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (select .cse3 (+ c_~queue~0.offset .cse2))) (.cse1 (+ c_~queue~0.offset .cse2 4))) (and (forall ((v_ArrVal_1690 (Array Int Int))) (<= (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1690) c_~queue~0.base) .cse1)) 1)) (forall ((v_ArrVal_1690 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1690) c_~queue~0.base) .cse1))))))) (let ((.cse4 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse5 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse4) (not (= (+ .cse5 1) 0))) (or .cse4 (not (= .cse5 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0))) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) is different from false [2022-11-03 04:04:22,701 WARN L833 $PredicateComparison]: unable to prove that (and (<= c_~sum~0 0) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (let ((.cse3 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (select .cse3 (+ c_~queue~0.offset .cse2))) (.cse1 (+ c_~queue~0.offset .cse2 4))) (and (forall ((v_ArrVal_1690 (Array Int Int))) (<= (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1690) c_~queue~0.base) .cse1)) 1)) (forall ((v_ArrVal_1690 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1690) c_~queue~0.base) .cse1))))))) (let ((.cse4 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse5 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse4) (not (= (+ .cse5 1) 0))) (or .cse4 (not (= .cse5 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0))) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0)) is different from false [2022-11-03 04:04:23,188 WARN L833 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (let ((.cse3 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (select .cse3 (+ c_~queue~0.offset .cse2))) (.cse1 (+ c_~queue~0.offset .cse2 4))) (and (forall ((v_ArrVal_1690 (Array Int Int))) (<= (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1690) c_~queue~0.base) .cse1)) 1)) (forall ((v_ArrVal_1690 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1690) c_~queue~0.base) .cse1))))))) (let ((.cse4 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse5 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse4) (not (= (+ .cse5 1) 0))) (or .cse4 (not (= .cse5 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0))) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1)) is different from false [2022-11-03 04:04:24,778 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (forall ((v_ArrVal_1690 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1690) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_1690 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1690) c_~queue~0.base) .cse0)))))) is different from false [2022-11-03 04:04:30,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:04:30,407 INFO L93 Difference]: Finished difference Result 8926 states and 24305 transitions. [2022-11-03 04:04:30,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2022-11-03 04:04:30,407 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 37 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-03 04:04:30,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:04:30,424 INFO L225 Difference]: With dead ends: 8926 [2022-11-03 04:04:30,424 INFO L226 Difference]: Without dead ends: 8926 [2022-11-03 04:04:30,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 61 SyntacticMatches, 26 SemanticMatches, 147 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 8698 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=2088, Invalid=17918, Unknown=44, NotChecked=2002, Total=22052 [2022-11-03 04:04:30,426 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 482 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 1419 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 2606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 1419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1001 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-03 04:04:30,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 62 Invalid, 2606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 1419 Invalid, 0 Unknown, 1001 Unchecked, 1.3s Time] [2022-11-03 04:04:30,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8926 states. [2022-11-03 04:04:30,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8926 to 6031. [2022-11-03 04:04:30,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6031 states, 6030 states have (on average 2.816915422885572) internal successors, (16986), 6030 states have internal predecessors, (16986), 0 states have call successors, (0), 0 states 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:04:30,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6031 states to 6031 states and 16986 transitions. [2022-11-03 04:04:30,583 INFO L78 Accepts]: Start accepts. Automaton has 6031 states and 16986 transitions. Word has length 33 [2022-11-03 04:04:30,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:04:30,584 INFO L495 AbstractCegarLoop]: Abstraction has 6031 states and 16986 transitions. [2022-11-03 04:04:30,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 37 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:04:30,584 INFO L276 IsEmpty]: Start isEmpty. Operand 6031 states and 16986 transitions. [2022-11-03 04:04:30,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-03 04:04:30,604 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:04:30,604 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:04:30,650 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-11-03 04:04:30,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-11-03 04:04:30,819 INFO L420 AbstractCegarLoop]: === Iteration 37 === 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:04:30,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:04:30,820 INFO L85 PathProgramCache]: Analyzing trace with hash -70275954, now seen corresponding path program 32 times [2022-11-03 04:04:30,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:04:30,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467902319] [2022-11-03 04:04:30,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:04:30,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:04:30,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:04:32,837 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:04:32,837 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:04:32,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467902319] [2022-11-03 04:04:32,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467902319] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:04:32,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188336063] [2022-11-03 04:04:32,837 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:04:32,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:04:32,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:04:32,838 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:04:32,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-11-03 04:04:33,180 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-03 04:04:33,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:04:33,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-03 04:04:33,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:04:33,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:33,727 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 44 treesize of output 42 [2022-11-03 04:04:33,831 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:04:33,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 48 treesize of output 14 [2022-11-03 04:04:33,921 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:04:33,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:04:34,611 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod c_~v_assert~0 256) 0) (< (+ c_~front~0 1) 0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (select .cse2 (+ c_~queue~0.offset .cse5))) (.cse4 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_1747 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1747) c_~queue~0.base) .cse4)) 1)) (forall ((v_ArrVal_1747 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1747) c_~queue~0.base) .cse4))))))))) is different from false [2022-11-03 04:04:34,752 INFO L356 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-03 04:04:34,752 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 286 treesize of output 240 [2022-11-03 04:04:34,766 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 59 treesize of output 52 [2022-11-03 04:04:34,778 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 52 treesize of output 45 [2022-11-03 04:04:35,450 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 3 not checked. [2022-11-03 04:04:35,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188336063] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:04:35,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [345507019] [2022-11-03 04:04:35,450 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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:04:35,451 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:04:35,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 12] total 41 [2022-11-03 04:04:35,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551567924] [2022-11-03 04:04:35,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:04:35,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-03 04:04:35,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:04:35,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-03 04:04:35,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1436, Unknown=7, NotChecked=78, Total=1722 [2022-11-03 04:04:35,453 INFO L87 Difference]: Start difference. First operand 6031 states and 16986 transitions. Second operand has 42 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 41 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:04:37,879 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1747 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1747) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_1747 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1747) c_~queue~0.base) .cse0)))))) (= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (< c_~front~0 0))) is different from false [2022-11-03 04:04:38,570 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1747 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1747) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_1747 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1747) c_~queue~0.base) .cse0)))))) (= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (< c_~front~0 0)) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-11-03 04:04:38,824 WARN L833 $PredicateComparison]: unable to prove that (and (<= c_~v_assert~0 1) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod c_~v_assert~0 256) 0) (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1747 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1747) c_~queue~0.base) .cse2)) 1)) (forall ((v_ArrVal_1747 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1747) c_~queue~0.base) .cse2)))))) (< c_~front~0 0)) (<= 1 c_~v_assert~0)) is different from false [2022-11-03 04:04:39,063 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod c_~v_assert~0 256) 0) (< (+ c_~front~0 1) 0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (select .cse2 (+ c_~queue~0.offset .cse5))) (.cse4 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_1747 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1747) c_~queue~0.base) .cse4)) 1)) (forall ((v_ArrVal_1747 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1747) c_~queue~0.base) .cse4)))))))))) is different from false [2022-11-03 04:04:39,257 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod c_~v_assert~0 256) 0) (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1747 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1747) c_~queue~0.base) .cse2)) 1)) (forall ((v_ArrVal_1747 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1747) c_~queue~0.base) .cse2)))))) (< c_~front~0 0)) (<= 1 c_~v_assert~0)) is different from false [2022-11-03 04:04:39,314 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= c_~sum~0 0) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod c_~v_assert~0 256) 0) (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1747 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1747) c_~queue~0.base) .cse2)) 1)) (forall ((v_ArrVal_1747 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1747) c_~queue~0.base) .cse2)))))) (< c_~front~0 0)) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0)) is different from false [2022-11-03 04:04:39,678 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod c_~v_assert~0 256) 0) (< (+ c_~front~0 1) 0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (select .cse2 (+ c_~queue~0.offset .cse5))) (.cse4 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_1747 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1747) c_~queue~0.base) .cse4)) 1)) (forall ((v_ArrVal_1747 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1747) c_~queue~0.base) .cse4)))))))))) is different from false [2022-11-03 04:04:40,030 WARN L833 $PredicateComparison]: unable to prove that (and (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) (or (= (mod c_~v_assert~0 256) 0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1747 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1747) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_1747 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1747) c_~queue~0.base) .cse0)))))) (< c_~front~0 0))) is different from false [2022-11-03 04:04:40,424 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod c_~v_assert~0 256) 0) (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1747 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1747) c_~queue~0.base) .cse2)) 1)) (forall ((v_ArrVal_1747 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1747) c_~queue~0.base) .cse2)))))) (< c_~front~0 0)) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-11-03 04:04:43,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:04:43,258 INFO L93 Difference]: Finished difference Result 13919 states and 38139 transitions. [2022-11-03 04:04:43,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2022-11-03 04:04:43,258 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 41 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-03 04:04:43,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:04:43,288 INFO L225 Difference]: With dead ends: 13919 [2022-11-03 04:04:43,288 INFO L226 Difference]: Without dead ends: 13833 [2022-11-03 04:04:43,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 52 SyntacticMatches, 18 SemanticMatches, 114 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 4019 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=1624, Invalid=9494, Unknown=52, NotChecked=2170, Total=13340 [2022-11-03 04:04:43,290 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 440 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 1787 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 3322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1398 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-03 04:04:43,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 63 Invalid, 3322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1787 Invalid, 0 Unknown, 1398 Unchecked, 1.7s Time] [2022-11-03 04:04:43,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13833 states. [2022-11-03 04:04:43,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13833 to 7010. [2022-11-03 04:04:43,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7010 states, 7009 states have (on average 2.810529319446426) internal successors, (19699), 7009 states have internal predecessors, (19699), 0 states have call successors, (0), 0 states 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:04:43,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7010 states to 7010 states and 19699 transitions. [2022-11-03 04:04:43,530 INFO L78 Accepts]: Start accepts. Automaton has 7010 states and 19699 transitions. Word has length 33 [2022-11-03 04:04:43,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:04:43,530 INFO L495 AbstractCegarLoop]: Abstraction has 7010 states and 19699 transitions. [2022-11-03 04:04:43,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 41 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:04:43,531 INFO L276 IsEmpty]: Start isEmpty. Operand 7010 states and 19699 transitions. [2022-11-03 04:04:43,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-03 04:04:43,549 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:04:43,549 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:04:43,559 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-11-03 04:04:43,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-11-03 04:04:43,756 INFO L420 AbstractCegarLoop]: === Iteration 38 === 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:04:43,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:04:43,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1500945786, now seen corresponding path program 33 times [2022-11-03 04:04:43,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:04:43,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164340163] [2022-11-03 04:04:43,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:04:43,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:04:43,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:04:45,729 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:04:45,730 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:04:45,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164340163] [2022-11-03 04:04:45,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164340163] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:04:45,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793568430] [2022-11-03 04:04:45,730 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 04:04:45,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:04:45,730 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:04:45,731 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:04:45,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-11-03 04:04:45,908 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 04:04:45,908 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:04:45,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-03 04:04:45,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:04:46,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:04:46,437 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 44 treesize of output 42 [2022-11-03 04:04:46,490 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:04:46,491 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 48 treesize of output 14 [2022-11-03 04:04:46,615 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 04:04:46,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:04:46,800 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1804 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1804) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_1804 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1804) c_~queue~0.base) .cse0)) 1)))) is different from false [2022-11-03 04:04:46,979 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (select .cse3 (+ c_~queue~0.offset .cse2))) (.cse1 (+ c_~queue~0.offset .cse2 4))) (and (forall ((v_ArrVal_1804 (Array Int Int))) (<= (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1804) c_~queue~0.base) .cse1)) 1)) (forall ((v_ArrVal_1804 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1804) c_~queue~0.base) .cse1))))))) (let ((.cse4 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse5 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse4) (not (= (+ .cse5 1) 0))) (or .cse4 (not (= .cse5 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0))) is different from false [2022-11-03 04:04:47,160 INFO L356 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-03 04:04:47,160 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 286 treesize of output 240 [2022-11-03 04:04:47,175 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 59 treesize of output 52 [2022-11-03 04:04:47,189 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 52 treesize of output 45 [2022-11-03 04:04:48,049 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 9 not checked. [2022-11-03 04:04:48,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793568430] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:04:48,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1241506518] [2022-11-03 04:04:48,050 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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:04:48,050 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:04:48,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 11] total 39 [2022-11-03 04:04:48,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694856546] [2022-11-03 04:04:48,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:04:48,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-03 04:04:48,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:04:48,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-03 04:04:48,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1258, Unknown=2, NotChecked=146, Total=1560 [2022-11-03 04:04:48,052 INFO L87 Difference]: Start difference. First operand 7010 states and 19699 transitions. Second operand has 40 states, 40 states have (on average 2.0) internal successors, (80), 39 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:04:50,928 WARN L833 $PredicateComparison]: unable to prove that (and (<= c_~sum~0 0) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (let ((.cse3 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (select .cse3 (+ c_~queue~0.offset .cse2))) (.cse1 (+ c_~queue~0.offset .cse2 4))) (and (forall ((v_ArrVal_1804 (Array Int Int))) (<= (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1804) c_~queue~0.base) .cse1)) 1)) (forall ((v_ArrVal_1804 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1804) c_~queue~0.base) .cse1))))))) (let ((.cse4 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse5 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse4) (not (= (+ .cse5 1) 0))) (or .cse4 (not (= .cse5 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0))) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0)) is different from false [2022-11-03 04:04:51,743 WARN L833 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (let ((.cse3 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (select .cse3 (+ c_~queue~0.offset .cse2))) (.cse1 (+ c_~queue~0.offset .cse2 4))) (and (forall ((v_ArrVal_1804 (Array Int Int))) (<= (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1804) c_~queue~0.base) .cse1)) 1)) (forall ((v_ArrVal_1804 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1804) c_~queue~0.base) .cse1))))))) (let ((.cse4 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse5 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse4) (not (= (+ .cse5 1) 0))) (or .cse4 (not (= .cse5 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)))) is different from false [2022-11-03 04:04:51,751 WARN L833 $PredicateComparison]: unable to prove that (and (<= c_~sum~0 0) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (let ((.cse3 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (select .cse3 (+ c_~queue~0.offset .cse2))) (.cse1 (+ c_~queue~0.offset .cse2 4))) (and (forall ((v_ArrVal_1804 (Array Int Int))) (<= (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1804) c_~queue~0.base) .cse1)) 1)) (forall ((v_ArrVal_1804 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1804) c_~queue~0.base) .cse1))))))) (let ((.cse4 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse5 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse4) (not (= (+ .cse5 1) 0))) (or .cse4 (not (= .cse5 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0))) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0)) is different from false [2022-11-03 04:04:53,098 WARN L833 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (let ((.cse3 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (select .cse3 (+ c_~queue~0.offset .cse2))) (.cse1 (+ c_~queue~0.offset .cse2 4))) (and (forall ((v_ArrVal_1804 (Array Int Int))) (<= (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1804) c_~queue~0.base) .cse1)) 1)) (forall ((v_ArrVal_1804 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1804) c_~queue~0.base) .cse1))))))) (let ((.cse4 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse5 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse4) (not (= (+ .cse5 1) 0))) (or .cse4 (not (= .cse5 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0))) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1)) is different from false [2022-11-03 04:04:53,727 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1804 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1804) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_1804 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1804) c_~queue~0.base) .cse0)) 1)) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1))) is different from false [2022-11-03 04:04:55,357 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (forall ((v_ArrVal_1804 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1804) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_1804 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1804) c_~queue~0.base) .cse0)) 1)))) is different from false [2022-11-03 04:04:58,701 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (<= c_~sum~0 0) (<= c_~v_assert~0 1) (forall ((v_ArrVal_1804 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1804) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_1804 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1804) c_~queue~0.base) .cse0)) 1)) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0))) is different from false [2022-11-03 04:04:58,807 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (<= c_~sum~0 0) (<= c_~v_assert~0 1) (forall ((v_ArrVal_1804 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1804) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_1804 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1804) c_~queue~0.base) .cse0)) 1)) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0))) is different from false [2022-11-03 04:04:58,812 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (<= c_~sum~0 0) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (forall ((v_ArrVal_1804 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1804) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_1804 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1804) c_~queue~0.base) .cse0)) 1)) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0))) is different from false [2022-11-03 04:04:58,816 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (forall ((v_ArrVal_1804 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1804) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_1804 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1804) c_~queue~0.base) .cse0)) 1)) (<= 1 c_~v_assert~0))) is different from false [2022-11-03 04:04:58,820 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (forall ((v_ArrVal_1804 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1804) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_1804 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1804) c_~queue~0.base) .cse0)) 1)) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0))) is different from false [2022-11-03 04:04:58,853 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (forall ((v_ArrVal_1804 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1804) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_1804 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1804) c_~queue~0.base) .cse0)) 1)) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0))) is different from false [2022-11-03 04:04:58,858 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (forall ((v_ArrVal_1804 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1804) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_1804 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1804) c_~queue~0.base) .cse0)) 1)) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1))) is different from false [2022-11-03 04:04:59,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:04:59,172 INFO L93 Difference]: Finished difference Result 11552 states and 31435 transitions. [2022-11-03 04:04:59,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2022-11-03 04:04:59,172 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.0) internal successors, (80), 39 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-03 04:04:59,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:04:59,195 INFO L225 Difference]: With dead ends: 11552 [2022-11-03 04:04:59,195 INFO L226 Difference]: Without dead ends: 11548 [2022-11-03 04:04:59,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 61 SyntacticMatches, 19 SemanticMatches, 142 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 6284 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=1718, Invalid=14828, Unknown=26, NotChecked=4020, Total=20592 [2022-11-03 04:04:59,197 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 456 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 1295 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 3249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1819 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:04:59,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 66 Invalid, 3249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1295 Invalid, 0 Unknown, 1819 Unchecked, 1.2s Time] [2022-11-03 04:04:59,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11548 states. [2022-11-03 04:04:59,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11548 to 7263. [2022-11-03 04:04:59,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7263 states, 7262 states have (on average 2.8121729551087853) internal successors, (20422), 7262 states have internal predecessors, (20422), 0 states have call successors, (0), 0 states 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:04:59,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7263 states to 7263 states and 20422 transitions. [2022-11-03 04:04:59,428 INFO L78 Accepts]: Start accepts. Automaton has 7263 states and 20422 transitions. Word has length 33 [2022-11-03 04:04:59,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:04:59,429 INFO L495 AbstractCegarLoop]: Abstraction has 7263 states and 20422 transitions. [2022-11-03 04:04:59,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.0) internal successors, (80), 39 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:04:59,429 INFO L276 IsEmpty]: Start isEmpty. Operand 7263 states and 20422 transitions. [2022-11-03 04:04:59,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-03 04:04:59,446 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:04:59,446 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:04:59,482 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-11-03 04:04:59,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-11-03 04:04:59,661 INFO L420 AbstractCegarLoop]: === Iteration 39 === 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:04:59,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:04:59,662 INFO L85 PathProgramCache]: Analyzing trace with hash -310621482, now seen corresponding path program 34 times [2022-11-03 04:04:59,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:04:59,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269393258] [2022-11-03 04:04:59,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:04:59,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:04:59,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:01,399 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:01,399 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:05:01,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269393258] [2022-11-03 04:05:01,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269393258] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:05:01,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960919471] [2022-11-03 04:05:01,400 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 04:05:01,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:05:01,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:05:01,403 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:05:01,404 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-11-03 04:05:01,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:01,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-03 04:05:01,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:05:02,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:05:02,098 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 44 treesize of output 42 [2022-11-03 04:05:02,151 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:05:02,152 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 48 treesize of output 14 [2022-11-03 04:05:02,261 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 04:05:02,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:05:02,423 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1861 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1861) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_1861 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1861) c_~queue~0.base) .cse0)))))) is different from false [2022-11-03 04:05:02,567 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse5 4)) (.cse4 (select .cse2 (+ c_~queue~0.offset .cse5)))) (and (forall ((v_ArrVal_1861 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1861) c_~queue~0.base) .cse3) .cse4) 1)) (forall ((v_ArrVal_1861 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1861) c_~queue~0.base) .cse3) .cse4)))))))) is different from false [2022-11-03 04:05:02,728 INFO L356 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-03 04:05:02,729 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 286 treesize of output 240 [2022-11-03 04:05:02,743 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 59 treesize of output 52 [2022-11-03 04:05:02,756 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 52 treesize of output 45 [2022-11-03 04:05:03,657 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 6 not checked. [2022-11-03 04:05:03,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960919471] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:05:03,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [252961529] [2022-11-03 04:05:03,657 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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:05:03,658 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:05:03,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 11] total 38 [2022-11-03 04:05:03,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594544489] [2022-11-03 04:05:03,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:05:03,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-03 04:05:03,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:05:03,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-03 04:05:03,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1168, Unknown=2, NotChecked=142, Total=1482 [2022-11-03 04:05:03,661 INFO L87 Difference]: Start difference. First operand 7263 states and 20422 transitions. Second operand has 39 states, 39 states have (on average 2.051282051282051) internal successors, (80), 38 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:06,349 WARN L833 $PredicateComparison]: unable to prove that (and (<= c_~sum~0 0) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse5 4)) (.cse4 (select .cse2 (+ c_~queue~0.offset .cse5)))) (and (forall ((v_ArrVal_1861 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1861) c_~queue~0.base) .cse3) .cse4) 1)) (forall ((v_ArrVal_1861 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1861) c_~queue~0.base) .cse3) .cse4)))))))) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0)) is different from false [2022-11-03 04:05:07,097 WARN L833 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse5 4)) (.cse4 (select .cse2 (+ c_~queue~0.offset .cse5)))) (and (forall ((v_ArrVal_1861 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1861) c_~queue~0.base) .cse3) .cse4) 1)) (forall ((v_ArrVal_1861 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1861) c_~queue~0.base) .cse3) .cse4)))))))) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) is different from false [2022-11-03 04:05:07,106 WARN L833 $PredicateComparison]: unable to prove that (and (<= c_~sum~0 0) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse5 4)) (.cse4 (select .cse2 (+ c_~queue~0.offset .cse5)))) (and (forall ((v_ArrVal_1861 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1861) c_~queue~0.base) .cse3) .cse4) 1)) (forall ((v_ArrVal_1861 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1861) c_~queue~0.base) .cse3) .cse4)))))))) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0)) is different from false [2022-11-03 04:05:07,706 WARN L833 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse5 4)) (.cse4 (select .cse2 (+ c_~queue~0.offset .cse5)))) (and (forall ((v_ArrVal_1861 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1861) c_~queue~0.base) .cse3) .cse4) 1)) (forall ((v_ArrVal_1861 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1861) c_~queue~0.base) .cse3) .cse4)))))))) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1)) is different from false [2022-11-03 04:05:13,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:05:13,914 INFO L93 Difference]: Finished difference Result 10652 states and 29182 transitions. [2022-11-03 04:05:13,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2022-11-03 04:05:13,915 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.051282051282051) internal successors, (80), 38 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-03 04:05:13,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:05:13,935 INFO L225 Difference]: With dead ends: 10652 [2022-11-03 04:05:13,935 INFO L226 Difference]: Without dead ends: 10649 [2022-11-03 04:05:13,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 51 SyntacticMatches, 20 SemanticMatches, 129 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 6059 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=1716, Invalid=13780, Unknown=28, NotChecked=1506, Total=17030 [2022-11-03 04:05:13,937 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 387 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 1358 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 2285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 1358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 767 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:05:13,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 79 Invalid, 2285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 1358 Invalid, 0 Unknown, 767 Unchecked, 1.2s Time] [2022-11-03 04:05:13,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10649 states. [2022-11-03 04:05:14,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10649 to 7297. [2022-11-03 04:05:14,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7297 states, 7296 states have (on average 2.81140350877193) internal successors, (20512), 7296 states have internal predecessors, (20512), 0 states have call successors, (0), 0 states 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:05:14,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7297 states to 7297 states and 20512 transitions. [2022-11-03 04:05:14,139 INFO L78 Accepts]: Start accepts. Automaton has 7297 states and 20512 transitions. Word has length 33 [2022-11-03 04:05:14,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:05:14,139 INFO L495 AbstractCegarLoop]: Abstraction has 7297 states and 20512 transitions. [2022-11-03 04:05:14,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.051282051282051) internal successors, (80), 38 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:14,140 INFO L276 IsEmpty]: Start isEmpty. Operand 7297 states and 20512 transitions. [2022-11-03 04:05:14,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-03 04:05:14,150 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:05:14,150 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:05:14,179 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-11-03 04:05:14,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-11-03 04:05:14,351 INFO L420 AbstractCegarLoop]: === Iteration 40 === 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:05:14,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:05:14,352 INFO L85 PathProgramCache]: Analyzing trace with hash -872032256, now seen corresponding path program 35 times [2022-11-03 04:05:14,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:05:14,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553416528] [2022-11-03 04:05:14,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:14,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:05:14,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:16,426 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:16,426 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:05:16,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553416528] [2022-11-03 04:05:16,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553416528] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:05:16,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669298143] [2022-11-03 04:05:16,427 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:05:16,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:05:16,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:05:16,428 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:05:16,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-11-03 04:05:16,949 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-03 04:05:16,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:05:16,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-03 04:05:16,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:05:17,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:05:17,252 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 18 treesize of output 20 [2022-11-03 04:05:17,481 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:05:17,481 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 48 treesize of output 14 [2022-11-03 04:05:17,623 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 04:05:17,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:05:18,255 WARN L833 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (let ((.cse8 (* c_~front~0 4))) (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse2 (+ c_~queue~0.offset .cse8)) (.cse3 (+ c_~queue~0.offset .cse8 4)) (.cse4 (+ c_~queue~0.offset (* c_~back~0 4)))) (and (or .cse0 (and (forall ((v_ArrVal_1918 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1918) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse1 .cse2) (select .cse1 .cse3))) (not (= (select .cse1 .cse4) 1))))) (forall ((v_ArrVal_1918 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1918) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse5 .cse2) (select .cse5 .cse3)) 1) (not (= (select .cse5 .cse4) 1))))))) (or (not .cse0) (and (forall ((v_ArrVal_1918 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1918) c_~queue~0.base))) (or (not (= (+ (select .cse6 .cse4) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse6 .cse2) (select .cse6 .cse3)))))) (forall ((v_ArrVal_1918 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1918) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse7 .cse2) (select .cse7 .cse3)) 1) (not (= (+ (select .cse7 .cse4) 1) 0))))))))))) is different from false [2022-11-03 04:05:18,422 INFO L356 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-03 04:05:18,422 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 497 treesize of output 417 [2022-11-03 04:05:18,454 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:05:18,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 260 treesize of output 268 [2022-11-03 04:05:18,487 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:05:18,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 241 treesize of output 249 [2022-11-03 04:05:18,523 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:05:18,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 222 treesize of output 230 [2022-11-03 04:05:18,560 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:05:18,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 203 treesize of output 211 [2022-11-03 04:05:23,075 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 2 not checked. [2022-11-03 04:05:23,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669298143] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:05:23,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1845032459] [2022-11-03 04:05:23,075 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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:05:23,076 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:05:23,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 12] total 40 [2022-11-03 04:05:23,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272007343] [2022-11-03 04:05:23,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:05:23,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-03 04:05:23,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:05:23,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-03 04:05:23,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1384, Unknown=1, NotChecked=76, Total=1640 [2022-11-03 04:05:23,077 INFO L87 Difference]: Start difference. First operand 7297 states and 20512 transitions. Second operand has 41 states, 41 states have (on average 1.951219512195122) internal successors, (80), 40 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:36,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:05:36,099 INFO L93 Difference]: Finished difference Result 18391 states and 50117 transitions. [2022-11-03 04:05:36,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2022-11-03 04:05:36,099 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.951219512195122) internal successors, (80), 40 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-03 04:05:36,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:05:36,137 INFO L225 Difference]: With dead ends: 18391 [2022-11-03 04:05:36,137 INFO L226 Difference]: Without dead ends: 13875 [2022-11-03 04:05:36,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 46 SyntacticMatches, 6 SemanticMatches, 150 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7376 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=3312, Invalid=19339, Unknown=3, NotChecked=298, Total=22952 [2022-11-03 04:05:36,140 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 767 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 2239 mSolverCounterSat, 497 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 497 IncrementalHoareTripleChecker+Valid, 2239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 360 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-03 04:05:36,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 0 Invalid, 3096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [497 Valid, 2239 Invalid, 0 Unknown, 360 Unchecked, 2.4s Time] [2022-11-03 04:05:36,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13875 states. [2022-11-03 04:05:36,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13875 to 5999. [2022-11-03 04:05:36,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5999 states, 5998 states have (on average 2.7815938646215406) internal successors, (16684), 5998 states have internal predecessors, (16684), 0 states have call successors, (0), 0 states 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:05:36,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5999 states to 5999 states and 16684 transitions. [2022-11-03 04:05:36,375 INFO L78 Accepts]: Start accepts. Automaton has 5999 states and 16684 transitions. Word has length 33 [2022-11-03 04:05:36,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:05:36,375 INFO L495 AbstractCegarLoop]: Abstraction has 5999 states and 16684 transitions. [2022-11-03 04:05:36,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.951219512195122) internal successors, (80), 40 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:36,375 INFO L276 IsEmpty]: Start isEmpty. Operand 5999 states and 16684 transitions. [2022-11-03 04:05:36,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-03 04:05:36,383 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:05:36,383 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:05:36,407 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-11-03 04:05:36,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:05:36,584 INFO L420 AbstractCegarLoop]: === Iteration 41 === 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:05:36,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:05:36,585 INFO L85 PathProgramCache]: Analyzing trace with hash 669983028, now seen corresponding path program 36 times [2022-11-03 04:05:36,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:05:36,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089748635] [2022-11-03 04:05:36,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:36,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:05:36,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:38,722 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:38,722 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:05:38,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089748635] [2022-11-03 04:05:38,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089748635] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:05:38,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722683489] [2022-11-03 04:05:38,722 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 04:05:38,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:05:38,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:05:38,723 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:05:38,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-11-03 04:05:38,903 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 04:05:38,903 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:05:38,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-03 04:05:38,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:05:39,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:05:39,290 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 18 treesize of output 20 [2022-11-03 04:05:39,444 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:05:39,444 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 48 treesize of output 14 [2022-11-03 04:05:39,539 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:05:39,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:05:39,932 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse8 (* c_~front~0 4))) (let ((.cse4 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse2 (+ c_~queue~0.offset .cse8)) (.cse3 (+ c_~queue~0.offset .cse8 4)) (.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0))) (and (or (not .cse0) (and (forall ((v_ArrVal_1975 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1975) c_~queue~0.base))) (or (<= (+ (select .cse1 .cse2) c_~sum~0 (select .cse1 .cse3)) 1) (not (= (+ (select .cse1 .cse4) 1) 0))))) (forall ((v_ArrVal_1975 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1975) c_~queue~0.base))) (or (not (= (+ (select .cse5 .cse4) 1) 0)) (<= 0 (+ (select .cse5 .cse2) c_~sum~0 (select .cse5 .cse3)))))))) (or (and (forall ((v_ArrVal_1975 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1975) c_~queue~0.base))) (or (not (= (select .cse6 .cse4) 1)) (<= (+ (select .cse6 .cse2) c_~sum~0 (select .cse6 .cse3)) 1)))) (forall ((v_ArrVal_1975 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1975) c_~queue~0.base))) (or (not (= (select .cse7 .cse4) 1)) (<= 0 (+ (select .cse7 .cse2) c_~sum~0 (select .cse7 .cse3))))))) .cse0)))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-11-03 04:05:40,077 INFO L356 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-03 04:05:40,078 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 497 treesize of output 417 [2022-11-03 04:05:40,109 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:05:40,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 260 treesize of output 268 [2022-11-03 04:05:40,142 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:05:40,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 241 treesize of output 249 [2022-11-03 04:05:40,181 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:05:40,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 222 treesize of output 230 [2022-11-03 04:05:40,215 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:05:40,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 203 treesize of output 211 [2022-11-03 04:05:44,239 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 1 not checked. [2022-11-03 04:05:44,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722683489] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:05:44,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [245299933] [2022-11-03 04:05:44,240 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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:05:44,240 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:05:44,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 11] total 38 [2022-11-03 04:05:44,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891868552] [2022-11-03 04:05:44,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:05:44,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-03 04:05:44,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:05:44,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-03 04:05:44,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1232, Unknown=1, NotChecked=72, Total=1482 [2022-11-03 04:05:44,242 INFO L87 Difference]: Start difference. First operand 5999 states and 16684 transitions. Second operand has 39 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 38 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:54,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:05:54,475 INFO L93 Difference]: Finished difference Result 8757 states and 23918 transitions. [2022-11-03 04:05:54,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-11-03 04:05:54,475 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 38 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-03 04:05:54,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:05:54,492 INFO L225 Difference]: With dead ends: 8757 [2022-11-03 04:05:54,492 INFO L226 Difference]: Without dead ends: 8757 [2022-11-03 04:05:54,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 48 SyntacticMatches, 6 SemanticMatches, 128 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5638 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=1853, Invalid=14640, Unknown=23, NotChecked=254, Total=16770 [2022-11-03 04:05:54,493 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 492 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 1327 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 2118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 1327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 584 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-03 04:05:54,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 36 Invalid, 2118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 1327 Invalid, 0 Unknown, 584 Unchecked, 1.3s Time] [2022-11-03 04:05:54,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8757 states. [2022-11-03 04:05:54,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8757 to 6300. [2022-11-03 04:05:54,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6300 states, 6299 states have (on average 2.7790125416732816) internal successors, (17505), 6299 states have internal predecessors, (17505), 0 states have call successors, (0), 0 states 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:05:54,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6300 states to 6300 states and 17505 transitions. [2022-11-03 04:05:54,622 INFO L78 Accepts]: Start accepts. Automaton has 6300 states and 17505 transitions. Word has length 33 [2022-11-03 04:05:54,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:05:54,622 INFO L495 AbstractCegarLoop]: Abstraction has 6300 states and 17505 transitions. [2022-11-03 04:05:54,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 38 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:05:54,622 INFO L276 IsEmpty]: Start isEmpty. Operand 6300 states and 17505 transitions. [2022-11-03 04:05:54,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-03 04:05:54,632 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:05:54,632 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:05:54,662 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-11-03 04:05:54,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-11-03 04:05:54,847 INFO L420 AbstractCegarLoop]: === Iteration 42 === 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:05:54,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:05:54,847 INFO L85 PathProgramCache]: Analyzing trace with hash 240266602, now seen corresponding path program 37 times [2022-11-03 04:05:54,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:05:54,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152940866] [2022-11-03 04:05:54,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:05:54,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:05:54,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:56,442 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:05:56,442 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:05:56,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152940866] [2022-11-03 04:05:56,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152940866] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:05:56,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036437689] [2022-11-03 04:05:56,443 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 04:05:56,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:05:56,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:05:56,444 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:05:56,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-11-03 04:05:56,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:05:56,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-03 04:05:56,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:05:56,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:05:56,968 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 18 treesize of output 20 [2022-11-03 04:05:57,110 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:05:57,111 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 48 treesize of output 14 [2022-11-03 04:05:57,226 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 04:05:57,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:05:57,614 WARN L833 $PredicateComparison]: unable to prove that (or (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (let ((.cse9 (* c_~front~0 4)) (.cse4 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0))) (let ((.cse6 (not .cse4)) (.cse1 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse2 (+ c_~queue~0.offset .cse9 4)) (.cse3 (+ c_~queue~0.offset .cse9))) (and (or (forall ((v_ArrVal_2032 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2032) c_~queue~0.base))) (or (not (= (select .cse0 .cse1) 1)) (<= (+ (select .cse0 .cse2) c_~sum~0 (select .cse0 .cse3)) 1)))) .cse4) (or (forall ((v_ArrVal_2032 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2032) c_~queue~0.base))) (or (not (= (+ (select .cse5 .cse1) 1) 0)) (<= 0 (+ (select .cse5 .cse2) c_~sum~0 (select .cse5 .cse3)))))) .cse6) (or (forall ((v_ArrVal_2032 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2032) c_~queue~0.base))) (or (not (= (+ (select .cse7 .cse1) 1) 0)) (<= (+ (select .cse7 .cse2) c_~sum~0 (select .cse7 .cse3)) 1)))) .cse6) (or (forall ((v_ArrVal_2032 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2032) c_~queue~0.base))) (or (not (= (select .cse8 .cse1) 1)) (<= 0 (+ (select .cse8 .cse2) c_~sum~0 (select .cse8 .cse3)))))) .cse4))))) is different from false [2022-11-03 04:05:57,777 INFO L356 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-03 04:05:57,777 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 504 treesize of output 424 [2022-11-03 04:05:57,807 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:05:57,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 267 treesize of output 275 [2022-11-03 04:05:57,838 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:05:57,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 248 treesize of output 256 [2022-11-03 04:05:57,869 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:05:57,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 229 treesize of output 237 [2022-11-03 04:05:57,905 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:05:57,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 210 treesize of output 218 [2022-11-03 04:06:00,667 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 2 not checked. [2022-11-03 04:06:00,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036437689] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:06:00,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1213164909] [2022-11-03 04:06:00,668 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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:06:00,668 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:06:00,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 11] total 38 [2022-11-03 04:06:00,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249513277] [2022-11-03 04:06:00,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:06:00,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-03 04:06:00,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:06:00,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-03 04:06:00,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1235, Unknown=1, NotChecked=72, Total=1482 [2022-11-03 04:06:00,670 INFO L87 Difference]: Start difference. First operand 6300 states and 17505 transitions. Second operand has 39 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 38 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:06:13,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:06:13,790 INFO L93 Difference]: Finished difference Result 8891 states and 24007 transitions. [2022-11-03 04:06:13,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2022-11-03 04:06:13,790 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 38 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-03 04:06:13,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:06:13,806 INFO L225 Difference]: With dead ends: 8891 [2022-11-03 04:06:13,806 INFO L226 Difference]: Without dead ends: 8576 [2022-11-03 04:06:13,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 154 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 8367 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=2533, Invalid=21315, Unknown=26, NotChecked=306, Total=24180 [2022-11-03 04:06:13,809 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 506 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 1354 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 2105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 1354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 554 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-03 04:06:13,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 47 Invalid, 2105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 1354 Invalid, 0 Unknown, 554 Unchecked, 1.3s Time] [2022-11-03 04:06:13,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8576 states. [2022-11-03 04:06:13,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8576 to 6286. [2022-11-03 04:06:13,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6286 states, 6285 states have (on average 2.775338106603023) internal successors, (17443), 6285 states have internal predecessors, (17443), 0 states have call successors, (0), 0 states 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:06:13,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6286 states to 6286 states and 17443 transitions. [2022-11-03 04:06:13,930 INFO L78 Accepts]: Start accepts. Automaton has 6286 states and 17443 transitions. Word has length 33 [2022-11-03 04:06:13,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:06:13,930 INFO L495 AbstractCegarLoop]: Abstraction has 6286 states and 17443 transitions. [2022-11-03 04:06:13,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 38 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:06:13,931 INFO L276 IsEmpty]: Start isEmpty. Operand 6286 states and 17443 transitions. [2022-11-03 04:06:13,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-03 04:06:13,939 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:06:13,939 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:06:13,975 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-11-03 04:06:14,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-11-03 04:06:14,163 INFO L420 AbstractCegarLoop]: === Iteration 43 === 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:06:14,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:06:14,163 INFO L85 PathProgramCache]: Analyzing trace with hash 2076555556, now seen corresponding path program 38 times [2022-11-03 04:06:14,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:06:14,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327807621] [2022-11-03 04:06:14,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:06:14,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:06:14,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:06:15,903 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:06:15,903 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:06:15,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327807621] [2022-11-03 04:06:15,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327807621] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:06:15,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725396851] [2022-11-03 04:06:15,904 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:06:15,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:06:15,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:06:15,906 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:06:15,907 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-11-03 04:06:16,243 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-03 04:06:16,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:06:16,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-03 04:06:16,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:06:16,259 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 202 treesize of output 198 [2022-11-03 04:06:16,487 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 18 treesize of output 20 [2022-11-03 04:06:16,695 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:06:16,695 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 48 treesize of output 14 [2022-11-03 04:06:16,775 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 04:06:16,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:06:17,278 WARN L833 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (let ((.cse6 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse9 (* c_~front~0 4))) (let ((.cse1 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse2 (+ c_~queue~0.offset .cse9)) (.cse3 (+ c_~queue~0.offset .cse9 4)) (.cse4 (not .cse6))) (and (or (forall ((v_ArrVal_2092 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2092) c_~queue~0.base))) (or (not (= (+ (select .cse0 .cse1) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse0 .cse2) (select .cse0 .cse3)))))) .cse4) (or (forall ((v_ArrVal_2092 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2092) c_~queue~0.base))) (or (not (= (select .cse5 .cse1) 1)) (<= (+ c_~sum~0 (select .cse5 .cse2) (select .cse5 .cse3)) 1)))) .cse6) (or (forall ((v_ArrVal_2092 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2092) c_~queue~0.base))) (or (not (= (select .cse7 .cse1) 1)) (<= 0 (+ c_~sum~0 (select .cse7 .cse2) (select .cse7 .cse3)))))) .cse6) (or (forall ((v_ArrVal_2092 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2092) c_~queue~0.base))) (or (not (= (+ (select .cse8 .cse1) 1) 0)) (<= (+ c_~sum~0 (select .cse8 .cse2) (select .cse8 .cse3)) 1)))) .cse4))))) is different from false [2022-11-03 04:06:17,387 INFO L356 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-03 04:06:17,387 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 504 treesize of output 424 [2022-11-03 04:06:17,417 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:06:17,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 267 treesize of output 275 [2022-11-03 04:06:17,447 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:06:17,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 248 treesize of output 256 [2022-11-03 04:06:17,479 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:06:17,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 229 treesize of output 237 [2022-11-03 04:06:17,513 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:06:17,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 210 treesize of output 218 [2022-11-03 04:06:20,462 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 04:06:20,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725396851] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:06:20,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1406050320] [2022-11-03 04:06:20,462 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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:06:20,463 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:06:20,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 11] total 35 [2022-11-03 04:06:20,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567188120] [2022-11-03 04:06:20,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:06:20,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-03 04:06:20,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:06:20,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-03 04:06:20,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1037, Unknown=1, NotChecked=66, Total=1260 [2022-11-03 04:06:20,465 INFO L87 Difference]: Start difference. First operand 6286 states and 17443 transitions. Second operand has 36 states, 36 states have (on average 2.138888888888889) internal successors, (77), 35 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:06:30,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:06:30,988 INFO L93 Difference]: Finished difference Result 17512 states and 48070 transitions. [2022-11-03 04:06:30,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2022-11-03 04:06:30,989 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.138888888888889) internal successors, (77), 35 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-03 04:06:30,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:06:31,081 INFO L225 Difference]: With dead ends: 17512 [2022-11-03 04:06:31,081 INFO L226 Difference]: Without dead ends: 16895 [2022-11-03 04:06:31,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 46 SyntacticMatches, 10 SemanticMatches, 138 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7053 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=2551, Invalid=16634, Unknown=1, NotChecked=274, Total=19460 [2022-11-03 04:06:31,083 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 524 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 1950 mSolverCounterSat, 290 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 2501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 290 IncrementalHoareTripleChecker+Valid, 1950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 261 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-03 04:06:31,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 1 Invalid, 2501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [290 Valid, 1950 Invalid, 0 Unknown, 261 Unchecked, 2.0s Time] [2022-11-03 04:06:31,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16895 states. [2022-11-03 04:06:31,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16895 to 6419. [2022-11-03 04:06:31,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6419 states, 6418 states have (on average 2.7792147086319727) internal successors, (17837), 6418 states have internal predecessors, (17837), 0 states have call successors, (0), 0 states 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:06:31,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6419 states to 6419 states and 17837 transitions. [2022-11-03 04:06:31,271 INFO L78 Accepts]: Start accepts. Automaton has 6419 states and 17837 transitions. Word has length 33 [2022-11-03 04:06:31,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:06:31,271 INFO L495 AbstractCegarLoop]: Abstraction has 6419 states and 17837 transitions. [2022-11-03 04:06:31,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.138888888888889) internal successors, (77), 35 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:06:31,272 INFO L276 IsEmpty]: Start isEmpty. Operand 6419 states and 17837 transitions. [2022-11-03 04:06:31,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-03 04:06:31,281 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:06:31,281 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:06:31,310 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-11-03 04:06:31,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:06:31,482 INFO L420 AbstractCegarLoop]: === Iteration 44 === 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:06:31,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:06:31,483 INFO L85 PathProgramCache]: Analyzing trace with hash -2105612120, now seen corresponding path program 39 times [2022-11-03 04:06:31,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:06:31,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985164990] [2022-11-03 04:06:31,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:06:31,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:06:31,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:06:33,352 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:06:33,352 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:06:33,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985164990] [2022-11-03 04:06:33,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985164990] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:06:33,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290521664] [2022-11-03 04:06:33,353 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 04:06:33,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:06:33,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:06:33,354 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:06:33,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-11-03 04:06:33,545 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 04:06:33,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:06:33,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-03 04:06:33,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:06:33,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:33,890 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 18 treesize of output 20 [2022-11-03 04:06:34,069 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:06:34,069 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 48 treesize of output 14 [2022-11-03 04:06:34,173 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 04:06:34,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:06:34,632 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse8 (* c_~front~0 4))) (let ((.cse1 (+ c_~queue~0.offset .cse8)) (.cse2 (+ c_~queue~0.offset .cse8 4)) (.cse3 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse5 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0))) (and (or (and (forall ((v_ArrVal_2149 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2149) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse0 .cse1) (select .cse0 .cse2)) 1) (not (= (select .cse0 .cse3) 1))))) (forall ((v_ArrVal_2149 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2149) c_~queue~0.base))) (or (not (= (select .cse4 .cse3) 1)) (<= 0 (+ c_~sum~0 (select .cse4 .cse1) (select .cse4 .cse2))))))) .cse5) (or (and (forall ((v_ArrVal_2149 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2149) c_~queue~0.base))) (or (not (= 0 (+ (select .cse6 .cse3) 1))) (<= 0 (+ c_~sum~0 (select .cse6 .cse1) (select .cse6 .cse2)))))) (forall ((v_ArrVal_2149 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2149) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse7 .cse1) (select .cse7 .cse2)) 1) (not (= 0 (+ (select .cse7 .cse3) 1))))))) (not .cse5))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-11-03 04:06:34,744 INFO L356 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-03 04:06:34,745 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 497 treesize of output 417 [2022-11-03 04:06:34,775 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:06:34,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 260 treesize of output 268 [2022-11-03 04:06:34,811 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:06:34,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 241 treesize of output 249 [2022-11-03 04:06:34,845 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:06:34,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 222 treesize of output 230 [2022-11-03 04:06:34,884 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:06:34,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 203 treesize of output 211 [2022-11-03 04:06:38,773 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-03 04:06:38,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290521664] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:06:38,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [363924192] [2022-11-03 04:06:38,774 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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:06:38,774 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:06:38,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 11] total 39 [2022-11-03 04:06:38,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218259308] [2022-11-03 04:06:38,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:06:38,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-03 04:06:38,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:06:38,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-03 04:06:38,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1324, Unknown=1, NotChecked=74, Total=1560 [2022-11-03 04:06:38,781 INFO L87 Difference]: Start difference. First operand 6419 states and 17837 transitions. Second operand has 40 states, 40 states have (on average 1.9) internal successors, (76), 39 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:06:46,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:06:46,174 INFO L93 Difference]: Finished difference Result 9959 states and 27248 transitions. [2022-11-03 04:06:46,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-11-03 04:06:46,174 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.9) internal successors, (76), 39 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-03 04:06:46,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:06:46,193 INFO L225 Difference]: With dead ends: 9959 [2022-11-03 04:06:46,194 INFO L226 Difference]: Without dead ends: 9959 [2022-11-03 04:06:46,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 97 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 2368 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=1177, Invalid=8332, Unknown=1, NotChecked=192, Total=9702 [2022-11-03 04:06:46,195 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 470 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 1414 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 1744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 1414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-03 04:06:46,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 36 Invalid, 1744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 1414 Invalid, 0 Unknown, 150 Unchecked, 1.5s Time] [2022-11-03 04:06:46,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9959 states. [2022-11-03 04:06:46,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9959 to 6736. [2022-11-03 04:06:46,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6736 states, 6735 states have (on average 2.778619153674833) internal successors, (18714), 6735 states have internal predecessors, (18714), 0 states have call successors, (0), 0 states 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:06:46,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6736 states to 6736 states and 18714 transitions. [2022-11-03 04:06:46,389 INFO L78 Accepts]: Start accepts. Automaton has 6736 states and 18714 transitions. Word has length 33 [2022-11-03 04:06:46,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:06:46,390 INFO L495 AbstractCegarLoop]: Abstraction has 6736 states and 18714 transitions. [2022-11-03 04:06:46,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.9) internal successors, (76), 39 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:06:46,390 INFO L276 IsEmpty]: Start isEmpty. Operand 6736 states and 18714 transitions. [2022-11-03 04:06:46,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-03 04:06:46,401 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:06:46,401 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:06:46,442 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-11-03 04:06:46,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:06:46,627 INFO L420 AbstractCegarLoop]: === Iteration 45 === 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:06:46,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:06:46,628 INFO L85 PathProgramCache]: Analyzing trace with hash -21549146, now seen corresponding path program 40 times [2022-11-03 04:06:46,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:06:46,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301616699] [2022-11-03 04:06:46,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:06:46,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:06:46,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:06:48,447 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:06:48,447 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:06:48,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301616699] [2022-11-03 04:06:48,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301616699] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:06:48,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841871658] [2022-11-03 04:06:48,447 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 04:06:48,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:06:48,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:06:48,448 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:06:48,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-11-03 04:06:48,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:06:48,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-03 04:06:48,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:06:49,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:06:49,052 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 18 treesize of output 20 [2022-11-03 04:06:49,233 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:06:49,234 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 48 treesize of output 14 [2022-11-03 04:06:49,393 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:06:49,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:06:49,846 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse8 (* c_~front~0 4))) (let ((.cse1 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse2 (+ c_~queue~0.offset .cse8)) (.cse3 (+ c_~queue~0.offset .cse8 4)) (.cse5 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0))) (and (or (and (forall ((v_ArrVal_2206 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2206) c_~queue~0.base))) (or (not (= (select .cse0 .cse1) 1)) (<= 0 (+ c_~sum~0 (select .cse0 .cse2) (select .cse0 .cse3)))))) (forall ((v_ArrVal_2206 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2206) c_~queue~0.base))) (or (not (= (select .cse4 .cse1) 1)) (<= (+ c_~sum~0 (select .cse4 .cse2) (select .cse4 .cse3)) 1))))) .cse5) (or (and (forall ((v_ArrVal_2206 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2206) c_~queue~0.base))) (or (not (= (+ (select .cse6 .cse1) 1) 0)) (<= (+ c_~sum~0 (select .cse6 .cse2) (select .cse6 .cse3)) 1)))) (forall ((v_ArrVal_2206 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2206) c_~queue~0.base))) (or (not (= (+ (select .cse7 .cse1) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse7 .cse2) (select .cse7 .cse3))))))) (not .cse5))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-11-03 04:06:49,961 INFO L356 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-03 04:06:49,962 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 497 treesize of output 417 [2022-11-03 04:06:49,994 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:06:49,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 260 treesize of output 268 [2022-11-03 04:06:50,027 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:06:50,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 241 treesize of output 249 [2022-11-03 04:06:50,065 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:06:50,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 222 treesize of output 230 [2022-11-03 04:06:50,102 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:06:50,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 203 treesize of output 211 [2022-11-03 04:06:52,771 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-03 04:06:52,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841871658] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:06:52,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [680525292] [2022-11-03 04:06:52,772 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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:06:52,772 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:06:52,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 11] total 40 [2022-11-03 04:06:52,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528211509] [2022-11-03 04:06:52,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:06:52,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-03 04:06:52,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:06:52,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-03 04:06:52,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1385, Unknown=1, NotChecked=76, Total=1640 [2022-11-03 04:06:52,774 INFO L87 Difference]: Start difference. First operand 6736 states and 18714 transitions. Second operand has 41 states, 41 states have (on average 2.0) internal successors, (82), 40 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:07:02,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:07:02,320 INFO L93 Difference]: Finished difference Result 10690 states and 29011 transitions. [2022-11-03 04:07:02,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2022-11-03 04:07:02,320 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.0) internal successors, (82), 40 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-03 04:07:02,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:07:02,336 INFO L225 Difference]: With dead ends: 10690 [2022-11-03 04:07:02,336 INFO L226 Difference]: Without dead ends: 10377 [2022-11-03 04:07:02,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 144 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 6733 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=2134, Invalid=18749, Unknown=1, NotChecked=286, Total=21170 [2022-11-03 04:07:02,337 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 626 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 1487 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 1920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 1487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 203 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-03 04:07:02,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 37 Invalid, 1920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 1487 Invalid, 0 Unknown, 203 Unchecked, 1.4s Time] [2022-11-03 04:07:02,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10377 states. [2022-11-03 04:07:02,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10377 to 6534. [2022-11-03 04:07:02,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6534 states, 6533 states have (on average 2.7775906934027246) internal successors, (18146), 6533 states have internal predecessors, (18146), 0 states have call successors, (0), 0 states 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:07:02,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6534 states to 6534 states and 18146 transitions. [2022-11-03 04:07:02,484 INFO L78 Accepts]: Start accepts. Automaton has 6534 states and 18146 transitions. Word has length 33 [2022-11-03 04:07:02,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:07:02,484 INFO L495 AbstractCegarLoop]: Abstraction has 6534 states and 18146 transitions. [2022-11-03 04:07:02,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.0) internal successors, (82), 40 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:07:02,485 INFO L276 IsEmpty]: Start isEmpty. Operand 6534 states and 18146 transitions. [2022-11-03 04:07:02,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-03 04:07:02,493 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:07:02,493 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:07:02,535 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2022-11-03 04:07:02,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:07:02,719 INFO L420 AbstractCegarLoop]: === Iteration 46 === 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:07:02,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:07:02,719 INFO L85 PathProgramCache]: Analyzing trace with hash 949004900, now seen corresponding path program 41 times [2022-11-03 04:07:02,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:07:02,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142164245] [2022-11-03 04:07:02,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:07:02,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:07:02,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:07:04,714 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:07:04,714 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:07:04,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142164245] [2022-11-03 04:07:04,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142164245] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:07:04,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457171171] [2022-11-03 04:07:04,714 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:07:04,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:07:04,715 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:07:04,715 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:07:04,717 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-11-03 04:07:05,032 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-11-03 04:07:05,033 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:07:05,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-03 04:07:05,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:07:05,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:05,331 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 18 treesize of output 20 [2022-11-03 04:07:05,542 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:07:05,542 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 48 treesize of output 14 [2022-11-03 04:07:05,637 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 04:07:05,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:07:06,167 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse4 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse9 (* c_~front~0 4))) (let ((.cse1 (+ c_~queue~0.offset .cse9 4)) (.cse2 (+ c_~queue~0.offset .cse9)) (.cse3 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse6 (not .cse4))) (and (or (forall ((v_ArrVal_2263 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2263) c_~queue~0.base))) (or (<= 0 (+ (select .cse0 .cse1) c_~sum~0 (select .cse0 .cse2))) (not (= (select .cse0 .cse3) 1))))) .cse4) (or (forall ((v_ArrVal_2263 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2263) c_~queue~0.base))) (or (<= (+ (select .cse5 .cse1) c_~sum~0 (select .cse5 .cse2)) 1) (not (= (select .cse5 .cse3) 1))))) .cse4) (or .cse6 (forall ((v_ArrVal_2263 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2263) c_~queue~0.base))) (or (<= (+ (select .cse7 .cse1) c_~sum~0 (select .cse7 .cse2)) 1) (not (= (+ (select .cse7 .cse3) 1) 0)))))) (or (forall ((v_ArrVal_2263 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2263) c_~queue~0.base))) (or (<= 0 (+ (select .cse8 .cse1) c_~sum~0 (select .cse8 .cse2))) (not (= (+ (select .cse8 .cse3) 1) 0))))) .cse6)))) (= (mod c_~v_assert~0 256) 0)) is different from false [2022-11-03 04:07:06,294 INFO L356 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-03 04:07:06,294 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 504 treesize of output 424 [2022-11-03 04:07:06,323 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:07:06,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 267 treesize of output 275 [2022-11-03 04:07:06,354 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:07:06,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 248 treesize of output 256 [2022-11-03 04:07:06,388 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:07:06,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 229 treesize of output 237 [2022-11-03 04:07:06,425 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:07:06,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 210 treesize of output 218 [2022-11-03 04:07:09,166 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 04:07:09,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457171171] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:07:09,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1176785253] [2022-11-03 04:07:09,167 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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:07:09,171 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:07:09,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 11] total 39 [2022-11-03 04:07:09,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597073332] [2022-11-03 04:07:09,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:07:09,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-03 04:07:09,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:07:09,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-03 04:07:09,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1304, Unknown=1, NotChecked=74, Total=1560 [2022-11-03 04:07:09,173 INFO L87 Difference]: Start difference. First operand 6534 states and 18146 transitions. Second operand has 40 states, 40 states have (on average 2.025) internal successors, (81), 39 states have internal predecessors, (81), 0 states have call successors, (0), 0 states 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:07:19,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:07:19,525 INFO L93 Difference]: Finished difference Result 15398 states and 41821 transitions. [2022-11-03 04:07:19,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2022-11-03 04:07:19,526 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.025) internal successors, (81), 39 states have internal predecessors, (81), 0 states have call successors, (0), 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 33 [2022-11-03 04:07:19,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:07:19,554 INFO L225 Difference]: With dead ends: 15398 [2022-11-03 04:07:19,554 INFO L226 Difference]: Without dead ends: 14481 [2022-11-03 04:07:19,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 150 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7416 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=3276, Invalid=19377, Unknown=1, NotChecked=298, Total=22952 [2022-11-03 04:07:19,556 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 722 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 2061 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 2653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 2061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 196 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-03 04:07:19,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 2 Invalid, 2653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 2061 Invalid, 0 Unknown, 196 Unchecked, 2.0s Time] [2022-11-03 04:07:19,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14481 states. [2022-11-03 04:07:19,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14481 to 6022. [2022-11-03 04:07:19,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6022 states, 6021 states have (on average 2.785583790068095) internal successors, (16772), 6021 states have internal predecessors, (16772), 0 states have call successors, (0), 0 states 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:07:19,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6022 states to 6022 states and 16772 transitions. [2022-11-03 04:07:19,806 INFO L78 Accepts]: Start accepts. Automaton has 6022 states and 16772 transitions. Word has length 33 [2022-11-03 04:07:19,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:07:19,806 INFO L495 AbstractCegarLoop]: Abstraction has 6022 states and 16772 transitions. [2022-11-03 04:07:19,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.025) internal successors, (81), 39 states have internal predecessors, (81), 0 states have call successors, (0), 0 states 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:07:19,807 INFO L276 IsEmpty]: Start isEmpty. Operand 6022 states and 16772 transitions. [2022-11-03 04:07:19,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-03 04:07:19,813 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:07:19,813 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:07:19,819 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-11-03 04:07:20,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-11-03 04:07:20,014 INFO L420 AbstractCegarLoop]: === Iteration 47 === 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:07:20,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:07:20,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1382170802, now seen corresponding path program 42 times [2022-11-03 04:07:20,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:07:20,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499644640] [2022-11-03 04:07:20,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:07:20,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:07:20,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:07:22,024 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:07:22,025 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:07:22,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499644640] [2022-11-03 04:07:22,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499644640] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:07:22,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768159415] [2022-11-03 04:07:22,025 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 04:07:22,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:07:22,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:07:22,026 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:07:22,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-11-03 04:07:22,222 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 04:07:22,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:07:22,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-03 04:07:22,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:07:22,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:07:22,960 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 44 treesize of output 42 [2022-11-03 04:07:23,029 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:07:23,030 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 46 treesize of output 14 [2022-11-03 04:07:23,191 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:07:23,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:07:24,005 INFO L356 Elim1Store]: treesize reduction 24, result has 63.1 percent of original size [2022-11-03 04:07:24,005 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 304 treesize of output 246 [2022-11-03 04:07:24,018 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 59 treesize of output 52 [2022-11-03 04:07:24,030 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 52 treesize of output 45 [2022-11-03 04:07:25,137 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:07:25,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768159415] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:07:25,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1079292637] [2022-11-03 04:07:25,138 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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:07:25,138 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:07:25,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 16] total 46 [2022-11-03 04:07:25,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937661216] [2022-11-03 04:07:25,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:07:25,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-03 04:07:25,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:07:25,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-03 04:07:25,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=1819, Unknown=1, NotChecked=0, Total=2162 [2022-11-03 04:07:25,140 INFO L87 Difference]: Start difference. First operand 6022 states and 16772 transitions. Second operand has 47 states, 47 states have (on average 1.7659574468085106) internal successors, (83), 46 states have internal predecessors, (83), 0 states have call successors, (0), 0 states 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:07:29,081 WARN L833 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (let ((.cse4 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse1 (<= c_~back~0 c_~front~0)) (.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse3 (not (< (+ c_~back~0 1) c_~n~0))) (.cse2 (select .cse4 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) .cse1 (not (= (+ .cse2 1) 0)) .cse3) (or .cse1 .cse0 .cse3 (not (= .cse2 1))))) (< (+ c_~front~0 1) 0) (let ((.cse7 (* c_~front~0 4))) (let ((.cse5 (+ c_~queue~0.offset .cse7 4)) (.cse6 (select .cse4 (+ c_~queue~0.offset .cse7)))) (and (forall ((v_ArrVal_2320 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse5) .cse6) 1)) (forall ((v_ArrVal_2320 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse5) .cse6)))))))) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) is different from false [2022-11-03 04:07:29,568 WARN L833 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_2320 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_2320 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse0)) 1)))) (<= c_~back~0 c_~front~0) (not (< c_~back~0 c_~n~0)) (< c_~front~0 0))) is different from false [2022-11-03 04:07:30,172 WARN L833 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_2320 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_2320 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse0)) 1)))) (<= c_~back~0 c_~front~0) (not (< c_~back~0 c_~n~0)) (< c_~front~0 0)) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1)) is different from false [2022-11-03 04:07:31,153 WARN L833 $PredicateComparison]: unable to prove that (and (<= c_~sum~0 0) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (let ((.cse4 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse1 (<= c_~back~0 c_~front~0)) (.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse3 (not (< (+ c_~back~0 1) c_~n~0))) (.cse2 (select .cse4 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) .cse1 (not (= (+ .cse2 1) 0)) .cse3) (or .cse1 .cse0 .cse3 (not (= .cse2 1))))) (< (+ c_~front~0 1) 0) (let ((.cse7 (* c_~front~0 4))) (let ((.cse5 (+ c_~queue~0.offset .cse7 4)) (.cse6 (select .cse4 (+ c_~queue~0.offset .cse7)))) (and (forall ((v_ArrVal_2320 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse5) .cse6) 1)) (forall ((v_ArrVal_2320 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse5) .cse6)))))))) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1) (<= 0 c_~sum~0)) is different from false [2022-11-03 04:07:36,929 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (* c_~front~0 4)) (.cse0 (* c_~back~0 4))) (let ((.cse13 (+ c_~back~0 1)) (.cse1 (<= 0 c_~sum~0)) (.cse14 (<= c_~sum~0 1)) (.cse15 (= .cse9 .cse0))) (let ((.cse5 (and .cse1 .cse14 .cse15 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|)))) (.cse2 (= (mod c_~v_assert~0 256) 0)) (.cse3 (<= .cse13 c_~front~0)) (.cse4 (< (+ c_~front~0 1) 0)) (.cse6 (not (< (+ c_~back~0 2) c_~n~0))) (.cse7 (not (<= 0 c_~back~0)))) (and (or (<= (* c_~n~0 4) (+ c_~queue~0.offset 3 .cse0)) (and (<= c_~sum~0 0) .cse1)) (= c_~queue~0.offset 0) (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or (let ((.cse8 (+ c_~queue~0.offset .cse9))) (and (forall ((v_ArrVal_2320 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse8)))) (forall ((v_ArrVal_2320 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse8)) 1)))) (let ((.cse10 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse12 (not (< .cse13 c_~n~0))) (.cse11 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) (and (or .cse3 (not .cse10) (not (= (+ .cse11 1) 0)) .cse12) (or .cse3 .cse10 .cse12 (not (= .cse11 1))))) (< c_~front~0 0)) (or .cse3 .cse4 .cse5 (= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) .cse6 .cse7) (or (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) .cse1 .cse14 .cse15) .cse2 .cse3 (< (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse4 .cse6 .cse7))))) is different from false [2022-11-03 04:07:40,581 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_~back~0 4))) (and (or (<= (* c_~n~0 4) (+ c_~queue~0.offset 3 .cse0)) (and (<= c_~sum~0 0) (<= 0 c_~sum~0))) (= c_~queue~0.offset 0) (or (let ((.cse1 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_2320 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse1)))) (forall ((v_ArrVal_2320 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse1)) 1)))) (let ((.cse6 (+ c_~back~0 1))) (let ((.cse2 (<= .cse6 c_~front~0)) (.cse3 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse5 (not (< .cse6 c_~n~0))) (.cse4 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) (and (or .cse2 (not .cse3) (not (= (+ .cse4 1) 0)) .cse5) (or .cse2 .cse3 .cse5 (not (= .cse4 1)))))) (< c_~front~0 0)))) is different from false [2022-11-03 04:07:40,638 WARN L833 $PredicateComparison]: unable to prove that (and (<= c_~sum~0 0) (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_2320 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_2320 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse0)) 1)))) (<= c_~back~0 c_~front~0) (not (< c_~back~0 c_~n~0)) (< c_~front~0 0)) (<= 0 c_~sum~0)) is different from false [2022-11-03 04:07:40,660 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (* c_~front~0 4))) (let ((.cse7 (+ c_~queue~0.offset .cse8)) (.cse1 (<= c_~back~0 c_~front~0))) (and (<= c_~sum~0 0) (let ((.cse4 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse3 (not (< (+ c_~back~0 1) c_~n~0))) (.cse2 (select .cse4 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) .cse1 (not (= (+ .cse2 1) 0)) .cse3) (or .cse1 .cse0 .cse3 (not (= .cse2 1))))) (< (+ c_~front~0 1) 0) (let ((.cse5 (+ c_~queue~0.offset .cse8 4)) (.cse6 (select .cse4 .cse7))) (and (forall ((v_ArrVal_2320 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse5) .cse6) 1)) (forall ((v_ArrVal_2320 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse5) .cse6))))))) (or (and (forall ((v_ArrVal_2320 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse7)))) (forall ((v_ArrVal_2320 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse7)) 1))) .cse1 (not (< c_~back~0 c_~n~0)) (< c_~front~0 0)) (<= 0 c_~sum~0)))) is different from false [2022-11-03 04:07:42,514 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (* c_~front~0 4))) (let ((.cse7 (+ c_~queue~0.offset .cse8)) (.cse1 (<= c_~back~0 c_~front~0))) (and (<= c_~sum~0 0) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (let ((.cse4 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse3 (not (< (+ c_~back~0 1) c_~n~0))) (.cse2 (select .cse4 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) .cse1 (not (= (+ .cse2 1) 0)) .cse3) (or .cse1 .cse0 .cse3 (not (= .cse2 1))))) (< (+ c_~front~0 1) 0) (let ((.cse5 (+ c_~queue~0.offset .cse8 4)) (.cse6 (select .cse4 .cse7))) (and (forall ((v_ArrVal_2320 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse5) .cse6) 1)) (forall ((v_ArrVal_2320 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse5) .cse6))))))) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (or (and (forall ((v_ArrVal_2320 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse7)))) (forall ((v_ArrVal_2320 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse7)) 1))) .cse1 (not (< c_~back~0 c_~n~0)) (< c_~front~0 0)) (<= 0 c_~sum~0)))) is different from false [2022-11-03 04:07:45,624 WARN L833 $PredicateComparison]: unable to prove that (and (<= c_~sum~0 0) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (let ((.cse4 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse1 (<= c_~back~0 c_~front~0)) (.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse3 (not (< (+ c_~back~0 1) c_~n~0))) (.cse2 (select .cse4 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) .cse1 (not (= (+ .cse2 1) 0)) .cse3) (or .cse1 .cse0 .cse3 (not (= .cse2 1))))) (< (+ c_~front~0 1) 0) (let ((.cse7 (* c_~front~0 4))) (let ((.cse5 (+ c_~queue~0.offset .cse7 4)) (.cse6 (select .cse4 (+ c_~queue~0.offset .cse7)))) (and (forall ((v_ArrVal_2320 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse5) .cse6) 1)) (forall ((v_ArrVal_2320 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse5) .cse6)))))))) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 0 c_~sum~0)) is different from false [2022-11-03 04:07:52,991 WARN L833 $PredicateComparison]: unable to prove that (and (<= c_~v_assert~0 1) (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_2320 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_2320 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse0)) 1)))) (<= c_~back~0 c_~front~0) (not (< c_~back~0 c_~n~0)) (< c_~front~0 0)) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-11-03 04:07:55,396 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (<= c_~sum~0 0)) (.cse1 (<= 0 c_~sum~0))) (and .cse0 (or (<= (* c_~n~0 4) (+ c_~queue~0.offset 3 (* c_~back~0 4))) (and .cse0 .cse1)) (or (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_2320 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse2)))) (forall ((v_ArrVal_2320 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse2)) 1)))) (<= c_~back~0 c_~front~0) (not (< c_~back~0 c_~n~0)) (< c_~front~0 0)) (= c_~queue~0.offset 0) .cse1)) is different from false [2022-11-03 04:07:55,402 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse11 (* c_~front~0 4))) (let ((.cse0 (<= c_~sum~0 0)) (.cse1 (* c_~back~0 4)) (.cse10 (+ c_~queue~0.offset .cse11)) (.cse4 (<= c_~back~0 c_~front~0)) (.cse2 (<= 0 c_~sum~0))) (and .cse0 (or (<= (* c_~n~0 4) (+ c_~queue~0.offset 3 .cse1)) (and .cse0 .cse2)) (let ((.cse7 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse3 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse6 (not (< (+ c_~back~0 1) c_~n~0))) (.cse5 (select .cse7 (+ c_~queue~0.offset .cse1)))) (and (or (not .cse3) .cse4 (not (= (+ .cse5 1) 0)) .cse6) (or .cse4 .cse3 .cse6 (not (= .cse5 1))))) (< (+ c_~front~0 1) 0) (let ((.cse8 (+ c_~queue~0.offset .cse11 4)) (.cse9 (select .cse7 .cse10))) (and (forall ((v_ArrVal_2320 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse8) .cse9) 1)) (forall ((v_ArrVal_2320 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse8) .cse9))))))) (or (and (forall ((v_ArrVal_2320 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse10)))) (forall ((v_ArrVal_2320 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse10)) 1))) .cse4 (not (< c_~back~0 c_~n~0)) (< c_~front~0 0)) (= c_~queue~0.offset 0) .cse2))) is different from false [2022-11-03 04:07:55,762 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_2320 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_2320 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse0)) 1)))) (<= c_~back~0 c_~front~0) (not (< c_~back~0 c_~n~0)) (< c_~front~0 0)) (<= 1 c_~v_assert~0)) is different from false [2022-11-03 04:07:56,288 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_2320 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_2320 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse0)) 1)))) (<= c_~back~0 c_~front~0) (not (< c_~back~0 c_~n~0)) (< c_~front~0 0)) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-11-03 04:08:09,740 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (* c_~front~0 4))) (let ((.cse7 (+ c_~queue~0.offset .cse8)) (.cse1 (<= c_~back~0 c_~front~0))) (and (<= c_~v_assert~0 1) (let ((.cse4 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse3 (not (< (+ c_~back~0 1) c_~n~0))) (.cse2 (select .cse4 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) .cse1 (not (= (+ .cse2 1) 0)) .cse3) (or .cse1 .cse0 .cse3 (not (= .cse2 1))))) (< (+ c_~front~0 1) 0) (let ((.cse5 (+ c_~queue~0.offset .cse8 4)) (.cse6 (select .cse4 .cse7))) (and (forall ((v_ArrVal_2320 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse5) .cse6) 1)) (forall ((v_ArrVal_2320 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse5) .cse6))))))) (or (and (forall ((v_ArrVal_2320 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse7)))) (forall ((v_ArrVal_2320 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse7)) 1))) .cse1 (not (< c_~back~0 c_~n~0)) (< c_~front~0 0)) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1)))) is different from false [2022-11-03 04:08:10,456 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (* c_~front~0 4)) (.cse0 (* c_~back~0 4))) (let ((.cse13 (+ c_~back~0 1)) (.cse1 (<= 0 c_~sum~0)) (.cse14 (<= c_~sum~0 1)) (.cse15 (= .cse9 .cse0))) (let ((.cse5 (and .cse1 .cse14 .cse15 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|)))) (.cse2 (= (mod c_~v_assert~0 256) 0)) (.cse3 (<= .cse13 c_~front~0)) (.cse4 (< (+ c_~front~0 1) 0)) (.cse6 (not (< (+ c_~back~0 2) c_~n~0))) (.cse7 (not (<= 0 c_~back~0)))) (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (or (<= (* c_~n~0 4) (+ c_~queue~0.offset 3 .cse0)) (and (<= c_~sum~0 0) .cse1)) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (= c_~queue~0.offset 0) (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or (let ((.cse8 (+ c_~queue~0.offset .cse9))) (and (forall ((v_ArrVal_2320 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse8)))) (forall ((v_ArrVal_2320 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse8)) 1)))) (let ((.cse10 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse12 (not (< .cse13 c_~n~0))) (.cse11 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) (and (or .cse3 (not .cse10) (not (= (+ .cse11 1) 0)) .cse12) (or .cse3 .cse10 .cse12 (not (= .cse11 1))))) (< c_~front~0 0)) (or .cse3 .cse4 .cse5 (= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) .cse6 .cse7) (or (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) .cse1 .cse14 .cse15) .cse2 .cse3 (< (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse4 .cse6 .cse7))))) is different from false [2022-11-03 04:08:10,467 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (* c_~front~0 4)) (.cse0 (* c_~back~0 4))) (let ((.cse13 (+ c_~back~0 1)) (.cse1 (<= 0 c_~sum~0)) (.cse14 (<= c_~sum~0 1)) (.cse15 (= .cse9 .cse0))) (let ((.cse5 (and .cse1 .cse14 .cse15 (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|)))) (.cse2 (= (mod c_~v_assert~0 256) 0)) (.cse3 (<= .cse13 c_~front~0)) (.cse4 (< (+ c_~front~0 1) 0)) (.cse6 (not (< (+ c_~back~0 2) c_~n~0))) (.cse7 (not (<= 0 c_~back~0)))) (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (or (<= (* c_~n~0 4) (+ c_~queue~0.offset 3 .cse0)) (and (<= c_~sum~0 0) .cse1)) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (= c_~queue~0.offset 0) (<= 1 c_~v_assert~0) (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or (let ((.cse8 (+ c_~queue~0.offset .cse9))) (and (forall ((v_ArrVal_2320 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse8)))) (forall ((v_ArrVal_2320 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse8)) 1)))) (let ((.cse10 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse12 (not (< .cse13 c_~n~0))) (.cse11 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) (and (or .cse3 (not .cse10) (not (= (+ .cse11 1) 0)) .cse12) (or .cse3 .cse10 .cse12 (not (= .cse11 1))))) (< c_~front~0 0)) (or .cse3 .cse4 .cse5 (= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) .cse6 .cse7) (or (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) .cse1 .cse14 .cse15) .cse2 .cse3 (< (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse4 .cse6 .cse7))))) is different from false [2022-11-03 04:08:13,328 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse11 (* c_~front~0 4))) (let ((.cse0 (<= c_~sum~0 0)) (.cse1 (* c_~back~0 4)) (.cse10 (+ c_~queue~0.offset .cse11)) (.cse4 (<= c_~back~0 c_~front~0)) (.cse2 (<= 0 c_~sum~0))) (and .cse0 (or (<= (* c_~n~0 4) (+ c_~queue~0.offset 3 .cse1)) (and .cse0 .cse2)) (<= c_~v_assert~0 1) (let ((.cse7 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse3 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse6 (not (< (+ c_~back~0 1) c_~n~0))) (.cse5 (select .cse7 (+ c_~queue~0.offset .cse1)))) (and (or (not .cse3) .cse4 (not (= (+ .cse5 1) 0)) .cse6) (or .cse4 .cse3 .cse6 (not (= .cse5 1))))) (< (+ c_~front~0 1) 0) (let ((.cse8 (+ c_~queue~0.offset .cse11 4)) (.cse9 (select .cse7 .cse10))) (and (forall ((v_ArrVal_2320 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse8) .cse9) 1)) (forall ((v_ArrVal_2320 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse8) .cse9))))))) (or (and (forall ((v_ArrVal_2320 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse10)))) (forall ((v_ArrVal_2320 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse10)) 1))) .cse4 (not (< c_~back~0 c_~n~0)) (< c_~front~0 0)) (= c_~queue~0.offset 0) (<= 1 c_~v_assert~0) .cse2))) is different from false [2022-11-03 04:08:18,042 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (<= 0 c_~sum~0)) (.cse8 (* c_~front~0 4)) (.cse0 (* c_~back~0 4)) (.cse12 (+ c_~back~0 1))) (let ((.cse2 (<= .cse12 c_~front~0)) (.cse3 (< (+ c_~front~0 1) 0)) (.cse4 (and .cse1 (<= c_~sum~0 1) (= .cse8 .cse0) (not (= c_~queue~0.base |c_ULTIMATE.start_main_~#t3~0#1.base|)))) (.cse5 (not (< (+ c_~back~0 2) c_~n~0))) (.cse6 (not (<= 0 c_~back~0)))) (and (or (<= (* c_~n~0 4) (+ c_~queue~0.offset 3 .cse0)) (and (<= c_~sum~0 0) .cse1)) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (= c_~queue~0.offset 0) (or (= (mod c_~v_assert~0 256) 0) .cse2 .cse3 .cse4 .cse5 .cse6) (or (let ((.cse7 (+ c_~queue~0.offset .cse8))) (and (forall ((v_ArrVal_2320 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse7)))) (forall ((v_ArrVal_2320 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse7)) 1)))) (let ((.cse9 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse11 (not (< .cse12 c_~n~0))) (.cse10 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse0)))) (and (or .cse2 (not .cse9) (not (= (+ .cse10 1) 0)) .cse11) (or .cse2 .cse9 .cse11 (not (= .cse10 1))))) (< c_~front~0 0)) (or .cse2 .cse3 .cse4 (= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) .cse5 .cse6)))) is different from false [2022-11-03 04:08:18,696 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (* c_~front~0 4))) (let ((.cse7 (+ c_~queue~0.offset .cse8)) (.cse1 (<= c_~back~0 c_~front~0))) (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (let ((.cse4 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse3 (not (< (+ c_~back~0 1) c_~n~0))) (.cse2 (select .cse4 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) .cse1 (not (= (+ .cse2 1) 0)) .cse3) (or .cse1 .cse0 .cse3 (not (= .cse2 1))))) (< (+ c_~front~0 1) 0) (let ((.cse5 (+ c_~queue~0.offset .cse8 4)) (.cse6 (select .cse4 .cse7))) (and (forall ((v_ArrVal_2320 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse5) .cse6) 1)) (forall ((v_ArrVal_2320 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse5) .cse6))))))) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (or (and (forall ((v_ArrVal_2320 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse7)))) (forall ((v_ArrVal_2320 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse7)) 1))) .cse1 (not (< c_~back~0 c_~n~0)) (< c_~front~0 0)) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1)))) is different from false [2022-11-03 04:08:20,672 WARN L833 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (let ((.cse4 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse1 (<= c_~back~0 c_~front~0)) (.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse3 (not (< (+ c_~back~0 1) c_~n~0))) (.cse2 (select .cse4 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) .cse1 (not (= (+ .cse2 1) 0)) .cse3) (or .cse1 .cse0 .cse3 (not (= .cse2 1))))) (< (+ c_~front~0 1) 0) (let ((.cse7 (* c_~front~0 4))) (let ((.cse5 (+ c_~queue~0.offset .cse7 4)) (.cse6 (select .cse4 (+ c_~queue~0.offset .cse7)))) (and (forall ((v_ArrVal_2320 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse5) .cse6) 1)) (forall ((v_ArrVal_2320 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2320) c_~queue~0.base) .cse5) .cse6)))))))) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 c_~v_assert~0)) is different from false [2022-11-03 04:08:20,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:08:20,941 INFO L93 Difference]: Finished difference Result 17349 states and 46466 transitions. [2022-11-03 04:08:20,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 278 states. [2022-11-03 04:08:20,941 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.7659574468085106) internal successors, (83), 46 states have internal predecessors, (83), 0 states have call successors, (0), 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 33 [2022-11-03 04:08:20,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:08:20,974 INFO L225 Difference]: With dead ends: 17349 [2022-11-03 04:08:20,974 INFO L226 Difference]: Without dead ends: 17145 [2022-11-03 04:08:20,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 102 SyntacticMatches, 26 SemanticMatches, 309 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 38060 ImplicationChecksByTransitivity, 51.8s TimeCoverageRelationStatistics Valid=12680, Invalid=70385, Unknown=255, NotChecked=13090, Total=96410 [2022-11-03 04:08:20,979 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 1395 mSDsluCounter, 3019 mSDsCounter, 0 mSdLazyCounter, 5295 mSolverCounterSat, 750 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1395 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 12075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 750 IncrementalHoareTripleChecker+Valid, 5295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6030 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:08:20,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1395 Valid, 301 Invalid, 12075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [750 Valid, 5295 Invalid, 0 Unknown, 6030 Unchecked, 5.2s Time] [2022-11-03 04:08:20,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17145 states. [2022-11-03 04:08:21,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17145 to 9692. [2022-11-03 04:08:21,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9692 states, 9691 states have (on average 2.808378908265401) internal successors, (27216), 9691 states have internal predecessors, (27216), 0 states have call successors, (0), 0 states 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:21,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9692 states to 9692 states and 27216 transitions. [2022-11-03 04:08:21,260 INFO L78 Accepts]: Start accepts. Automaton has 9692 states and 27216 transitions. Word has length 33 [2022-11-03 04:08:21,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:08:21,260 INFO L495 AbstractCegarLoop]: Abstraction has 9692 states and 27216 transitions. [2022-11-03 04:08:21,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.7659574468085106) internal successors, (83), 46 states have internal predecessors, (83), 0 states have call successors, (0), 0 states 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:21,260 INFO L276 IsEmpty]: Start isEmpty. Operand 9692 states and 27216 transitions. [2022-11-03 04:08:21,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-03 04:08:21,273 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:08:21,273 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:08:21,323 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-11-03 04:08:21,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-11-03 04:08:21,474 INFO L420 AbstractCegarLoop]: === Iteration 48 === 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:21,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:08:21,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1920352834, now seen corresponding path program 43 times [2022-11-03 04:08:21,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:08:21,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216219505] [2022-11-03 04:08:21,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:08:21,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:08:21,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:08:23,979 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:08:23,980 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:08:23,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216219505] [2022-11-03 04:08:23,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216219505] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:08:23,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063620209] [2022-11-03 04:08:23,980 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 04:08:23,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:08:23,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:08:23,982 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:08:23,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-11-03 04:08:24,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:08:24,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-03 04:08:24,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:08:24,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:24,593 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 44 treesize of output 42 [2022-11-03 04:08:24,638 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:08:24,638 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 48 treesize of output 14 [2022-11-03 04:08:24,728 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 04:08:24,728 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:08:24,900 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_2377 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2377) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_2377 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2377) c_~queue~0.base) .cse0)))))) is different from false [2022-11-03 04:08:25,294 INFO L356 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-03 04:08:25,294 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 286 treesize of output 240 [2022-11-03 04:08:25,307 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 59 treesize of output 52 [2022-11-03 04:08:25,320 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 52 treesize of output 45 [2022-11-03 04:08:25,955 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 3 not checked. [2022-11-03 04:08:25,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063620209] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:08:25,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [906172770] [2022-11-03 04:08:25,955 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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:25,955 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:08:25,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 11] total 36 [2022-11-03 04:08:25,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843621242] [2022-11-03 04:08:25,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:08:25,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-03 04:08:25,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:08:25,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-03 04:08:25,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1114, Unknown=1, NotChecked=68, Total=1332 [2022-11-03 04:08:25,957 INFO L87 Difference]: Start difference. First operand 9692 states and 27216 transitions. Second operand has 37 states, 37 states have (on average 2.0) internal successors, (74), 36 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:08:31,515 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (forall ((v_ArrVal_2377 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2377) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_2377 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2377) c_~queue~0.base) .cse0)))) (<= 0 c_~sum~0) (<= c_~sum~0 1))) is different from false [2022-11-03 04:08:31,623 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (forall ((v_ArrVal_2377 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2377) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_2377 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2377) c_~queue~0.base) .cse0)))) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1))) is different from false [2022-11-03 04:08:31,642 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_2377 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2377) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_2377 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2377) c_~queue~0.base) .cse0)))) (<= 0 c_~sum~0) (<= c_~sum~0 1))) is different from false [2022-11-03 04:08:31,743 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (<= c_~sum~0 0) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (forall ((v_ArrVal_2377 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2377) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_2377 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2377) c_~queue~0.base) .cse0)))) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0))) is different from false [2022-11-03 04:08:32,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:08:32,912 INFO L93 Difference]: Finished difference Result 16704 states and 45580 transitions. [2022-11-03 04:08:32,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2022-11-03 04:08:32,912 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.0) internal successors, (74), 36 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-03 04:08:32,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:08:32,944 INFO L225 Difference]: With dead ends: 16704 [2022-11-03 04:08:32,944 INFO L226 Difference]: Without dead ends: 16550 [2022-11-03 04:08:32,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 67 SyntacticMatches, 9 SemanticMatches, 106 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 3239 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=1492, Invalid=9006, Unknown=28, NotChecked=1030, Total=11556 [2022-11-03 04:08:32,945 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 456 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 1506 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 2600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 1506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 914 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-03 04:08:32,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 53 Invalid, 2600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 1506 Invalid, 0 Unknown, 914 Unchecked, 1.4s Time] [2022-11-03 04:08:32,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16550 states. [2022-11-03 04:08:33,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16550 to 10114. [2022-11-03 04:08:33,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10114 states, 10113 states have (on average 2.8112330663502423) internal successors, (28430), 10113 states have internal predecessors, (28430), 0 states have call successors, (0), 0 states 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:33,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10114 states to 10114 states and 28430 transitions. [2022-11-03 04:08:33,177 INFO L78 Accepts]: Start accepts. Automaton has 10114 states and 28430 transitions. Word has length 33 [2022-11-03 04:08:33,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:08:33,177 INFO L495 AbstractCegarLoop]: Abstraction has 10114 states and 28430 transitions. [2022-11-03 04:08:33,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.0) internal successors, (74), 36 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:08:33,178 INFO L276 IsEmpty]: Start isEmpty. Operand 10114 states and 28430 transitions. [2022-11-03 04:08:33,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-03 04:08:33,191 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:08:33,191 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:08:33,221 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2022-11-03 04:08:33,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-11-03 04:08:33,391 INFO L420 AbstractCegarLoop]: === Iteration 49 === 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:33,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:08:33,392 INFO L85 PathProgramCache]: Analyzing trace with hash 881367640, now seen corresponding path program 44 times [2022-11-03 04:08:33,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:08:33,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735357775] [2022-11-03 04:08:33,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:08:33,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:08:33,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:08:35,465 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:08:35,465 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:08:35,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735357775] [2022-11-03 04:08:35,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735357775] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:08:35,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300845049] [2022-11-03 04:08:35,465 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 04:08:35,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:08:35,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:08:35,467 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:08:35,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-11-03 04:08:35,851 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-03 04:08:35,852 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:08:35,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-03 04:08:35,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:08:36,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:36,307 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 44 treesize of output 42 [2022-11-03 04:08:36,362 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:08:36,363 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 48 treesize of output 14 [2022-11-03 04:08:36,437 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 04:08:36,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:08:36,602 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_2434 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2434) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_2434 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2434) c_~queue~0.base) .cse0)))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-11-03 04:08:36,613 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_2434 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2434) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_2434 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2434) c_~queue~0.base) .cse0)))))) (= (mod c_~v_assert~0 256) 0)) is different from false [2022-11-03 04:08:36,652 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_2434 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2434) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_2434 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2434) c_~queue~0.base) .cse0)))))) (let ((.cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse2 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse1) (not (= (+ .cse2 1) 0))) (or .cse1 (not (= .cse2 1))))) (= (mod c_~v_assert~0 256) 0)) is different from false [2022-11-03 04:08:36,696 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (select .cse3 (+ c_~queue~0.offset .cse2))) (.cse1 (+ c_~queue~0.offset .cse2 4))) (and (forall ((v_ArrVal_2434 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2434) c_~queue~0.base) .cse1)))) (forall ((v_ArrVal_2434 (Array Int Int))) (<= (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2434) c_~queue~0.base) .cse1)) 1))))) (let ((.cse4 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse5 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse4) (not (= (+ .cse5 1) 0))) (or .cse4 (not (= .cse5 1))))) (= (mod c_~v_assert~0 256) 0))) is different from false [2022-11-03 04:08:36,819 INFO L356 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-03 04:08:36,819 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 286 treesize of output 240 [2022-11-03 04:08:36,830 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 59 treesize of output 52 [2022-11-03 04:08:36,842 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 52 treesize of output 45 [2022-11-03 04:08:37,346 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 9 not checked. [2022-11-03 04:08:37,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300845049] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:08:37,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [249372425] [2022-11-03 04:08:37,347 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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:37,347 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:08:37,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 11] total 36 [2022-11-03 04:08:37,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255177035] [2022-11-03 04:08:37,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:08:37,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-03 04:08:37,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:08:37,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-03 04:08:37,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=924, Unknown=4, NotChecked=260, Total=1332 [2022-11-03 04:08:37,348 INFO L87 Difference]: Start difference. First operand 10114 states and 28430 transitions. Second operand has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:08:40,673 WARN L833 $PredicateComparison]: unable to prove that (and (<= c_~sum~0 0) (<= 0 c_~sum~0) (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_2434 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2434) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_2434 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2434) c_~queue~0.base) .cse0)))))) (let ((.cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse2 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse1) (not (= (+ .cse2 1) 0))) (or .cse1 (not (= .cse2 1))))) (= (mod c_~v_assert~0 256) 0))) is different from false [2022-11-03 04:08:41,288 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_2434 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2434) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_2434 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2434) c_~queue~0.base) .cse0)))))) (let ((.cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse2 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse1) (not (= (+ .cse2 1) 0))) (or .cse1 (not (= .cse2 1))))) (= (mod c_~v_assert~0 256) 0))) is different from false [2022-11-03 04:08:41,365 WARN L833 $PredicateComparison]: unable to prove that (and (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_2434 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2434) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_2434 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2434) c_~queue~0.base) .cse0)))))) (= (mod c_~v_assert~0 256) 0)) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0))) is different from false [2022-11-03 04:08:41,602 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_2434 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2434) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_2434 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2434) c_~queue~0.base) .cse0)))))) (let ((.cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse2 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse1) (not (= (+ .cse2 1) 0))) (or .cse1 (not (= .cse2 1))))) (= (mod c_~v_assert~0 256) 0))) is different from false [2022-11-03 04:08:42,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:08:42,642 INFO L93 Difference]: Finished difference Result 21118 states and 58628 transitions. [2022-11-03 04:08:42,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-11-03 04:08:42,643 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-03 04:08:42,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:08:42,685 INFO L225 Difference]: With dead ends: 21118 [2022-11-03 04:08:42,686 INFO L226 Difference]: Without dead ends: 20829 [2022-11-03 04:08:42,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 51 SyntacticMatches, 8 SemanticMatches, 99 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 2736 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1308, Invalid=7272, Unknown=8, NotChecked=1512, Total=10100 [2022-11-03 04:08:42,687 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 452 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 1638 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 2477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 1638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 609 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-03 04:08:42,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 23 Invalid, 2477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 1638 Invalid, 0 Unknown, 609 Unchecked, 1.4s Time] [2022-11-03 04:08:42,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20829 states. [2022-11-03 04:08:42,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20829 to 11514. [2022-11-03 04:08:42,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11514 states, 11513 states have (on average 2.8167289151394077) internal successors, (32429), 11513 states have internal predecessors, (32429), 0 states have call successors, (0), 0 states 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:42,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11514 states to 11514 states and 32429 transitions. [2022-11-03 04:08:42,976 INFO L78 Accepts]: Start accepts. Automaton has 11514 states and 32429 transitions. Word has length 33 [2022-11-03 04:08:42,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:08:42,976 INFO L495 AbstractCegarLoop]: Abstraction has 11514 states and 32429 transitions. [2022-11-03 04:08:42,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:08:42,977 INFO L276 IsEmpty]: Start isEmpty. Operand 11514 states and 32429 transitions. [2022-11-03 04:08:42,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-03 04:08:42,992 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:08:42,992 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:08:43,026 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-11-03 04:08:43,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-11-03 04:08:43,192 INFO L420 AbstractCegarLoop]: === Iteration 50 === 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:43,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:08:43,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1242839016, now seen corresponding path program 45 times [2022-11-03 04:08:43,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:08:43,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463976862] [2022-11-03 04:08:43,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:08:43,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:08:43,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:08:44,899 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:08:44,899 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:08:44,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463976862] [2022-11-03 04:08:44,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463976862] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:08:44,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779247738] [2022-11-03 04:08:44,900 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 04:08:44,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:08:44,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:08:44,902 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:08:44,904 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-11-03 04:08:45,108 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 04:08:45,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 04:08:45,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-03 04:08:45,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:08:45,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 04:08:45,544 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 44 treesize of output 42 [2022-11-03 04:08:45,593 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 04:08:45,593 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 48 treesize of output 14 [2022-11-03 04:08:45,665 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 04:08:45,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:08:45,814 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_2491 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2491) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_2491 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2491) c_~queue~0.base) .cse0)))))) is different from false [2022-11-03 04:08:46,188 INFO L356 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-03 04:08:46,188 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 286 treesize of output 240 [2022-11-03 04:08:46,201 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 59 treesize of output 52 [2022-11-03 04:08:46,213 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 52 treesize of output 45 [2022-11-03 04:08:46,968 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 3 not checked. [2022-11-03 04:08:46,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779247738] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 04:08:46,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [591920852] [2022-11-03 04:08:46,968 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition 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,968 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 04:08:46,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 11] total 37 [2022-11-03 04:08:46,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417851605] [2022-11-03 04:08:46,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 04:08:46,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-03 04:08:46,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:08:46,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-03 04:08:46,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1174, Unknown=1, NotChecked=70, Total=1406 [2022-11-03 04:08:46,970 INFO L87 Difference]: Start difference. First operand 11514 states and 32429 transitions. Second operand has 38 states, 38 states have (on average 2.0) internal successors, (76), 37 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:08:51,672 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_2491 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2491) c_~queue~0.base) .cse0)) 1)) (<= 0 c_~sum~0) (<= c_~sum~0 1) (forall ((v_ArrVal_2491 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_2491) c_~queue~0.base) .cse0)))))) is different from false [2022-11-03 04:08:53,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:08:53,320 INFO L93 Difference]: Finished difference Result 18046 states and 49804 transitions. [2022-11-03 04:08:53,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-11-03 04:08:53,320 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.0) internal successors, (76), 37 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-03 04:08:53,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:08:53,357 INFO L225 Difference]: With dead ends: 18046 [2022-11-03 04:08:53,357 INFO L226 Difference]: Without dead ends: 17997 [2022-11-03 04:08:53,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 66 SyntacticMatches, 7 SemanticMatches, 103 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3243 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1375, Invalid=9105, Unknown=34, NotChecked=406, Total=10920 [2022-11-03 04:08:53,358 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 406 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 1758 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 2710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 824 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-03 04:08:53,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 99 Invalid, 2710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1758 Invalid, 0 Unknown, 824 Unchecked, 1.4s Time] [2022-11-03 04:08:53,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17997 states. [2022-11-03 04:08:53,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17997 to 11968. [2022-11-03 04:08:53,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11968 states, 11967 states have (on average 2.8190858193365087) internal successors, (33736), 11967 states have internal predecessors, (33736), 0 states have call successors, (0), 0 states 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:53,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11968 states to 11968 states and 33736 transitions. [2022-11-03 04:08:53,688 INFO L78 Accepts]: Start accepts. Automaton has 11968 states and 33736 transitions. Word has length 33 [2022-11-03 04:08:53,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:08:53,689 INFO L495 AbstractCegarLoop]: Abstraction has 11968 states and 33736 transitions. [2022-11-03 04:08:53,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.0) internal successors, (76), 37 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 04:08:53,689 INFO L276 IsEmpty]: Start isEmpty. Operand 11968 states and 33736 transitions. [2022-11-03 04:08:53,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-03 04:08:53,706 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:08:53,706 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:08:53,734 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2022-11-03 04:08:53,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-11-03 04:08:53,906 INFO L420 AbstractCegarLoop]: === Iteration 51 === 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:53,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:08:53,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1794847424, now seen corresponding path program 46 times [2022-11-03 04:08:53,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:08:53,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617389638] [2022-11-03 04:08:53,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:08:53,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:08:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:08:55,389 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:08:55,390 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:08:55,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617389638] [2022-11-03 04:08:55,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617389638] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 04:08:55,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953672490] [2022-11-03 04:08:55,390 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 04:08:55,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 04:08:55,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:08:55,392 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 04:08:55,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_458b726a-4dd6-4119-9c6e-1265f449307a/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-11-03 04:08:55,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:08:55,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-03 04:08:55,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:08:56,362 INFO L356 Elim1Store]: treesize reduction 90, result has 7.2 percent of original size [2022-11-03 04:08:56,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 24 [2022-11-03 04:08:56,449 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 04:08:56,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:09:00,666 INFO L356 Elim1Store]: treesize reduction 52, result has 93.5 percent of original size [2022-11-03 04:09:00,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 427 treesize of output 1013