./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/queue_ok.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh --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 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 --- 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-2329fc7 [2022-12-14 12:39:03,688 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 12:39:03,690 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 12:39:03,707 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 12:39:03,707 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 12:39:03,708 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 12:39:03,709 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 12:39:03,710 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 12:39:03,712 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 12:39:03,713 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 12:39:03,713 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 12:39:03,714 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 12:39:03,715 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 12:39:03,716 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 12:39:03,717 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 12:39:03,718 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 12:39:03,718 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 12:39:03,719 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 12:39:03,721 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 12:39:03,722 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 12:39:03,724 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 12:39:03,725 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 12:39:03,726 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 12:39:03,726 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 12:39:03,730 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 12:39:03,730 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 12:39:03,730 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 12:39:03,731 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 12:39:03,731 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 12:39:03,732 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 12:39:03,733 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 12:39:03,733 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 12:39:03,734 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 12:39:03,735 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 12:39:03,736 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 12:39:03,736 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 12:39:03,737 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 12:39:03,737 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 12:39:03,738 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 12:39:03,738 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 12:39:03,739 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 12:39:03,740 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 12:39:03,759 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 12:39:03,759 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 12:39:03,759 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 12:39:03,759 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 12:39:03,760 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 12:39:03,760 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 12:39:03,760 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 12:39:03,760 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 12:39:03,761 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 12:39:03,761 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 12:39:03,761 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 12:39:03,761 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 12:39:03,761 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 12:39:03,761 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 12:39:03,761 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 12:39:03,762 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 12:39:03,762 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 12:39:03,762 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 12:39:03,762 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 12:39:03,763 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 12:39:03,763 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 12:39:03,763 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 12:39:03,763 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 12:39:03,763 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 12:39:03,763 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 12:39:03,764 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 12:39:03,764 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 12:39:03,764 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 12:39:03,764 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 12:39:03,764 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 12:39:03,764 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 12:39:03,764 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 12:39:03,765 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 12:39:03,765 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 12:39:03,765 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 12:39:03,765 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 12:39:03,765 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 12:39:03,765 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 12:39:03,766 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 12:39:03,766 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 12:39:03,766 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 12:39:03,766 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_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh/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_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh 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 -> 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 [2022-12-14 12:39:03,970 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 12:39:03,989 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 12:39:03,991 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 12:39:03,992 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 12:39:03,992 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 12:39:03,993 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/pthread/queue_ok.i [2022-12-14 12:39:06,548 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 12:39:06,741 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 12:39:06,742 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/sv-benchmarks/c/pthread/queue_ok.i [2022-12-14 12:39:06,752 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh/data/c960a9c23/fdd41d4d6e87462bade0629fc52f5a5a/FLAG1a0716f9f [2022-12-14 12:39:07,142 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh/data/c960a9c23/fdd41d4d6e87462bade0629fc52f5a5a [2022-12-14 12:39:07,147 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 12:39:07,150 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 12:39:07,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 12:39:07,152 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 12:39:07,156 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 12:39:07,157 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 12:39:07" (1/1) ... [2022-12-14 12:39:07,158 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f0031f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:39:07, skipping insertion in model container [2022-12-14 12:39:07,158 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 12:39:07" (1/1) ... [2022-12-14 12:39:07,164 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 12:39:07,192 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 12:39:07,463 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/sv-benchmarks/c/pthread/queue_ok.i[43266,43279] [2022-12-14 12:39:07,468 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/sv-benchmarks/c/pthread/queue_ok.i[43543,43556] [2022-12-14 12:39:07,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 12:39:07,479 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 12:39:07,507 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/sv-benchmarks/c/pthread/queue_ok.i[43266,43279] [2022-12-14 12:39:07,509 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/sv-benchmarks/c/pthread/queue_ok.i[43543,43556] [2022-12-14 12:39:07,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 12:39:07,541 INFO L208 MainTranslator]: Completed translation [2022-12-14 12:39:07,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:39:07 WrapperNode [2022-12-14 12:39:07,541 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 12:39:07,542 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 12:39:07,542 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 12:39:07,542 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 12:39:07,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:39:07" (1/1) ... [2022-12-14 12:39:07,559 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:39:07" (1/1) ... [2022-12-14 12:39:07,577 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 202 [2022-12-14 12:39:07,578 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 12:39:07,578 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 12:39:07,578 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 12:39:07,578 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 12:39:07,585 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:39:07" (1/1) ... [2022-12-14 12:39:07,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:39:07" (1/1) ... [2022-12-14 12:39:07,588 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:39:07" (1/1) ... [2022-12-14 12:39:07,588 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:39:07" (1/1) ... [2022-12-14 12:39:07,594 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:39:07" (1/1) ... [2022-12-14 12:39:07,597 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:39:07" (1/1) ... [2022-12-14 12:39:07,598 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:39:07" (1/1) ... [2022-12-14 12:39:07,599 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:39:07" (1/1) ... [2022-12-14 12:39:07,602 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 12:39:07,602 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 12:39:07,602 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 12:39:07,603 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 12:39:07,603 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:39:07" (1/1) ... [2022-12-14 12:39:07,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 12:39:07,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:39:07,626 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 12:39:07,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 12:39:07,654 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-14 12:39:07,655 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-14 12:39:07,655 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-14 12:39:07,655 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-14 12:39:07,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 12:39:07,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 12:39:07,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 12:39:07,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 12:39:07,655 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-14 12:39:07,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 12:39:07,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 12:39:07,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 12:39:07,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 12:39:07,656 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-14 12:39:07,766 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 12:39:07,768 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 12:39:08,048 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 12:39:08,059 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 12:39:08,060 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-14 12:39:08,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 12:39:08 BoogieIcfgContainer [2022-12-14 12:39:08,062 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 12:39:08,065 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 12:39:08,065 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 12:39:08,068 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 12:39:08,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 12:39:07" (1/3) ... [2022-12-14 12:39:08,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ef392a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 12:39:08, skipping insertion in model container [2022-12-14 12:39:08,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 12:39:07" (2/3) ... [2022-12-14 12:39:08,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ef392a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 12:39:08, skipping insertion in model container [2022-12-14 12:39:08,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 12:39:08" (3/3) ... [2022-12-14 12:39:08,070 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2022-12-14 12:39:08,078 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-14 12:39:08,087 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 12:39:08,087 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-14 12:39:08,087 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 12:39:08,151 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-14 12:39:08,185 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 12:39:08,198 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 223 places, 229 transitions, 474 flow [2022-12-14 12:39:08,201 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 223 places, 229 transitions, 474 flow [2022-12-14 12:39:08,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 223 places, 229 transitions, 474 flow [2022-12-14 12:39:08,290 INFO L130 PetriNetUnfolder]: 13/227 cut-off events. [2022-12-14 12:39:08,291 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-14 12:39:08,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 227 events. 13/227 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 366 event pairs, 0 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 146. Up to 3 conditions per place. [2022-12-14 12:39:08,308 INFO L119 LiptonReduction]: Number of co-enabled transitions 10630 [2022-12-14 12:39:16,036 INFO L134 LiptonReduction]: Checked pairs total: 22280 [2022-12-14 12:39:16,036 INFO L136 LiptonReduction]: Total number of compositions: 210 [2022-12-14 12:39:16,043 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 52 places, 52 transitions, 120 flow [2022-12-14 12:39:16,084 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 545 states, 543 states have (on average 2.686924493554328) internal successors, (1459), 544 states have internal predecessors, (1459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:39:16,096 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 12:39:16,100 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;@67900b31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 12:39:16,101 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-14 12:39:16,103 INFO L276 IsEmpty]: Start isEmpty. Operand has 545 states, 543 states have (on average 2.686924493554328) internal successors, (1459), 544 states have internal predecessors, (1459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:39:16,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-12-14 12:39:16,106 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:39:16,106 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-12-14 12:39:16,107 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 2 more)] === [2022-12-14 12:39:16,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:39:16,110 INFO L85 PathProgramCache]: Analyzing trace with hash 895, now seen corresponding path program 1 times [2022-12-14 12:39:16,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:39:16,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574950528] [2022-12-14 12:39:16,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:39:16,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:39:16,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:39:16,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:39:16,192 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:39:16,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574950528] [2022-12-14 12:39:16,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574950528] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:39:16,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:39:16,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-14 12:39:16,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938672200] [2022-12-14 12:39:16,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:39:16,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-14 12:39:16,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:39:16,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-14 12:39:16,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 12:39:16,214 INFO L87 Difference]: Start difference. First operand has 545 states, 543 states have (on average 2.686924493554328) internal successors, (1459), 544 states have internal predecessors, (1459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:39:16,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:39:16,293 INFO L93 Difference]: Finished difference Result 544 states and 1458 transitions. [2022-12-14 12:39:16,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-14 12:39:16,295 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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 1 [2022-12-14 12:39:16,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:39:16,305 INFO L225 Difference]: With dead ends: 544 [2022-12-14 12:39:16,305 INFO L226 Difference]: Without dead ends: 544 [2022-12-14 12:39:16,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 12:39:16,308 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 12:39:16,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 12:39:16,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2022-12-14 12:39:16,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 544. [2022-12-14 12:39:16,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 543 states have (on average 2.685082872928177) internal successors, (1458), 543 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:39:16,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 1458 transitions. [2022-12-14 12:39:16,356 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 1458 transitions. Word has length 1 [2022-12-14 12:39:16,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:39:16,356 INFO L495 AbstractCegarLoop]: Abstraction has 544 states and 1458 transitions. [2022-12-14 12:39:16,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:39:16,357 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 1458 transitions. [2022-12-14 12:39:16,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 12:39:16,358 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:39:16,359 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:39:16,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 12:39:16,359 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-14 12:39:16,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:39:16,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1841080405, now seen corresponding path program 1 times [2022-12-14 12:39:16,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:39:16,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113882289] [2022-12-14 12:39:16,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:39:16,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:39:16,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:39:16,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-12-14 12:39:16,550 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:39:16,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113882289] [2022-12-14 12:39:16,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113882289] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:39:16,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:39:16,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 12:39:16,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52441008] [2022-12-14 12:39:16,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:39:16,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 12:39:16,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:39:16,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 12:39:16,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 12:39:16,553 INFO L87 Difference]: Start difference. First operand 544 states and 1458 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:39:16,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:39:16,611 INFO L93 Difference]: Finished difference Result 230 states and 498 transitions. [2022-12-14 12:39:16,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 12:39:16,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-12-14 12:39:16,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:39:16,613 INFO L225 Difference]: With dead ends: 230 [2022-12-14 12:39:16,613 INFO L226 Difference]: Without dead ends: 208 [2022-12-14 12:39:16,613 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-12-14 12:39:16,614 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 19 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:39:16,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 4 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:39:16,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-12-14 12:39:16,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2022-12-14 12:39:16,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 2.2028985507246377) internal successors, (456), 207 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:39:16,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 456 transitions. [2022-12-14 12:39:16,621 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 456 transitions. Word has length 16 [2022-12-14 12:39:16,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:39:16,621 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 456 transitions. [2022-12-14 12:39:16,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:39:16,621 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 456 transitions. [2022-12-14 12:39:16,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 12:39:16,622 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:39:16,622 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:39:16,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 12:39:16,623 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-14 12:39:16,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:39:16,623 INFO L85 PathProgramCache]: Analyzing trace with hash 61465947, now seen corresponding path program 1 times [2022-12-14 12:39:16,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:39:16,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548427792] [2022-12-14 12:39:16,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:39:16,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:39:16,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:39:16,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:39:16,679 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:39:16,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548427792] [2022-12-14 12:39:16,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548427792] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:39:16,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:39:16,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 12:39:16,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274423489] [2022-12-14 12:39:16,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:39:16,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 12:39:16,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:39:16,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 12:39:16,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 12:39:16,681 INFO L87 Difference]: Start difference. First operand 208 states and 456 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:39:16,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:39:16,745 INFO L93 Difference]: Finished difference Result 262 states and 570 transitions. [2022-12-14 12:39:16,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 12:39:16,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-14 12:39:16,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:39:16,748 INFO L225 Difference]: With dead ends: 262 [2022-12-14 12:39:16,748 INFO L226 Difference]: Without dead ends: 262 [2022-12-14 12:39:16,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 12:39:16,750 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:39:16,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 6 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:39:16,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-12-14 12:39:16,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 214. [2022-12-14 12:39:16,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 213 states have (on average 2.1971830985915495) internal successors, (468), 213 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:39:16,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 468 transitions. [2022-12-14 12:39:16,757 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 468 transitions. Word has length 20 [2022-12-14 12:39:16,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:39:16,758 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 468 transitions. [2022-12-14 12:39:16,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:39:16,758 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 468 transitions. [2022-12-14 12:39:16,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 12:39:16,759 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:39:16,759 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:39:16,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 12:39:16,759 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-14 12:39:16,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:39:16,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1770066499, now seen corresponding path program 1 times [2022-12-14 12:39:16,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:39:16,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915071578] [2022-12-14 12:39:16,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:39:16,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:39:16,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:39:16,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:39:16,866 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:39:16,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915071578] [2022-12-14 12:39:16,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915071578] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:39:16,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:39:16,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 12:39:16,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732810812] [2022-12-14 12:39:16,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:39:16,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 12:39:16,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:39:16,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 12:39:16,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 12:39:16,868 INFO L87 Difference]: Start difference. First operand 214 states and 468 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:39:16,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:39:16,921 INFO L93 Difference]: Finished difference Result 160 states and 321 transitions. [2022-12-14 12:39:16,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 12:39:16,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-12-14 12:39:16,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:39:16,922 INFO L225 Difference]: With dead ends: 160 [2022-12-14 12:39:16,923 INFO L226 Difference]: Without dead ends: 158 [2022-12-14 12:39:16,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 12:39:16,924 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 33 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 12:39:16,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 2 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 12:39:16,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-12-14 12:39:16,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2022-12-14 12:39:16,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 2.0254777070063694) internal successors, (318), 157 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:39:16,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 318 transitions. [2022-12-14 12:39:16,930 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 318 transitions. Word has length 27 [2022-12-14 12:39:16,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:39:16,930 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 318 transitions. [2022-12-14 12:39:16,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:39:16,930 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 318 transitions. [2022-12-14 12:39:16,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 12:39:16,931 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:39:16,931 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:39:16,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 12:39:16,931 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-14 12:39:16,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:39:16,932 INFO L85 PathProgramCache]: Analyzing trace with hash 960237311, now seen corresponding path program 1 times [2022-12-14 12:39:16,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:39:16,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40359912] [2022-12-14 12:39:16,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:39:16,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:39:16,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:39:17,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:39:17,001 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:39:17,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40359912] [2022-12-14 12:39:17,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40359912] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:39:17,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183319099] [2022-12-14 12:39:17,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:39:17,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:39:17,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:39:17,003 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:39:17,004 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 12:39:17,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:39:17,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 12:39:17,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:39:17,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:39:17,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:39:17,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:39:17,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183319099] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:39:17,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [944163543] [2022-12-14 12:39:17,187 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 12:39:17,189 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:39:17,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-14 12:39:17,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465942660] [2022-12-14 12:39:17,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:39:17,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 12:39:17,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:39:17,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 12:39:17,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:39:17,191 INFO L87 Difference]: Start difference. First operand 158 states and 318 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:39:17,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:39:17,308 INFO L93 Difference]: Finished difference Result 266 states and 519 transitions. [2022-12-14 12:39:17,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 12:39:17,308 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 12:39:17,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:39:17,310 INFO L225 Difference]: With dead ends: 266 [2022-12-14 12:39:17,310 INFO L226 Difference]: Without dead ends: 266 [2022-12-14 12:39:17,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:39:17,311 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 49 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:39:17,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 11 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:39:17,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-12-14 12:39:17,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2022-12-14 12:39:17,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 1.9584905660377359) internal successors, (519), 265 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:39:17,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 519 transitions. [2022-12-14 12:39:17,317 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 519 transitions. Word has length 28 [2022-12-14 12:39:17,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:39:17,317 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 519 transitions. [2022-12-14 12:39:17,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:39:17,317 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 519 transitions. [2022-12-14 12:39:17,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-12-14 12:39:17,318 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:39:17,319 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:39:17,324 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 12:39:17,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:39:17,520 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-14 12:39:17,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:39:17,520 INFO L85 PathProgramCache]: Analyzing trace with hash -2122919915, now seen corresponding path program 2 times [2022-12-14 12:39:17,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:39:17,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289468404] [2022-12-14 12:39:17,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:39:17,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:39:17,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:39:17,737 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:39:17,737 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:39:17,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289468404] [2022-12-14 12:39:17,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289468404] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:39:17,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166481165] [2022-12-14 12:39:17,738 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 12:39:17,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:39:17,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:39:17,739 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:39:17,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 12:39:18,292 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-14 12:39:18,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:39:18,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 51 conjunts are in the unsatisfiable core [2022-12-14 12:39:18,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:39:18,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 12:39:18,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:39:18,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 12:39:18,565 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:39:18,573 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-14 12:39:18,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-12-14 12:39:18,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:39:18,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-14 12:39:18,618 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 22 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 12:39:18,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:39:18,746 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:39:18,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 43 [2022-12-14 12:39:18,755 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:39:18,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 80 [2022-12-14 12:39:18,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 47 [2022-12-14 12:39:18,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-12-14 12:39:18,826 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:39:18,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 65 [2022-12-14 12:39:18,950 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 22 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-14 12:39:18,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166481165] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:39:18,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [957271051] [2022-12-14 12:39:18,951 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 12:39:18,951 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:39:18,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2022-12-14 12:39:18,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050527490] [2022-12-14 12:39:18,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:39:18,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 12:39:18,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:39:18,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 12:39:18,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=268, Unknown=8, NotChecked=0, Total=342 [2022-12-14 12:39:18,954 INFO L87 Difference]: Start difference. First operand 266 states and 519 transitions. Second operand has 19 states, 19 states have (on average 5.368421052631579) internal successors, (102), 19 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:39:19,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:39:19,834 INFO L93 Difference]: Finished difference Result 549 states and 1040 transitions. [2022-12-14 12:39:19,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-14 12:39:19,834 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.368421052631579) internal successors, (102), 19 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-12-14 12:39:19,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:39:19,837 INFO L225 Difference]: With dead ends: 549 [2022-12-14 12:39:19,837 INFO L226 Difference]: Without dead ends: 549 [2022-12-14 12:39:19,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=443, Invalid=1109, Unknown=8, NotChecked=0, Total=1560 [2022-12-14 12:39:19,838 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 594 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 12:39:19,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 18 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 12:39:19,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2022-12-14 12:39:19,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 399. [2022-12-14 12:39:19,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 398 states have (on average 1.9020100502512562) internal successors, (757), 398 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:39:19,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 757 transitions. [2022-12-14 12:39:19,852 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 757 transitions. Word has length 49 [2022-12-14 12:39:19,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:39:19,853 INFO L495 AbstractCegarLoop]: Abstraction has 399 states and 757 transitions. [2022-12-14 12:39:19,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.368421052631579) internal successors, (102), 19 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:39:19,853 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 757 transitions. [2022-12-14 12:39:19,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-14 12:39:19,855 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:39:19,855 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:39:19,860 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 12:39:20,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:39:20,056 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-14 12:39:20,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:39:20,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1343244735, now seen corresponding path program 1 times [2022-12-14 12:39:20,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:39:20,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143327184] [2022-12-14 12:39:20,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:39:20,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:39:20,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:39:20,298 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:39:20,299 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:39:20,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143327184] [2022-12-14 12:39:20,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143327184] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:39:20,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485261061] [2022-12-14 12:39:20,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:39:20,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:39:20,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:39:20,300 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:39:20,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 12:39:20,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:39:20,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 12:39:20,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:39:20,487 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:39:20,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:39:20,566 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:39:20,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485261061] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:39:20,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1542141535] [2022-12-14 12:39:20,566 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 12:39:20,567 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:39:20,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2022-12-14 12:39:20,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295540889] [2022-12-14 12:39:20,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:39:20,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 12:39:20,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:39:20,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 12:39:20,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2022-12-14 12:39:20,569 INFO L87 Difference]: Start difference. First operand 399 states and 757 transitions. Second operand has 15 states, 15 states have (on average 7.133333333333334) internal successors, (107), 15 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:39:20,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:39:20,767 INFO L93 Difference]: Finished difference Result 819 states and 1520 transitions. [2022-12-14 12:39:20,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 12:39:20,767 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.133333333333334) internal successors, (107), 15 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-12-14 12:39:20,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:39:20,770 INFO L225 Difference]: With dead ends: 819 [2022-12-14 12:39:20,770 INFO L226 Difference]: Without dead ends: 819 [2022-12-14 12:39:20,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2022-12-14 12:39:20,770 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 152 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 12:39:20,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 21 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 12:39:20,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2022-12-14 12:39:20,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 819. [2022-12-14 12:39:20,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 818 states have (on average 1.8581907090464547) internal successors, (1520), 818 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:39:20,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1520 transitions. [2022-12-14 12:39:20,783 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1520 transitions. Word has length 58 [2022-12-14 12:39:20,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:39:20,783 INFO L495 AbstractCegarLoop]: Abstraction has 819 states and 1520 transitions. [2022-12-14 12:39:20,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.133333333333334) internal successors, (107), 15 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:39:20,783 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1520 transitions. [2022-12-14 12:39:20,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-12-14 12:39:20,786 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:39:20,786 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:39:20,792 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 12:39:20,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-14 12:39:20,987 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-14 12:39:20,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:39:20,988 INFO L85 PathProgramCache]: Analyzing trace with hash -217317803, now seen corresponding path program 2 times [2022-12-14 12:39:20,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:39:20,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595671876] [2022-12-14 12:39:20,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:39:20,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:39:21,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:39:21,467 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 0 proven. 453 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:39:21,467 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:39:21,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595671876] [2022-12-14 12:39:21,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595671876] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:39:21,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055428924] [2022-12-14 12:39:21,467 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 12:39:21,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:39:21,468 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:39:21,468 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:39:21,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 12:39:22,867 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-12-14 12:39:22,867 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:39:22,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 100 conjunts are in the unsatisfiable core [2022-12-14 12:39:22,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:39:22,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:39:22,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:39:22,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2022-12-14 12:39:22,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:39:22,964 INFO L321 Elim1Store]: treesize reduction 41, result has 49.4 percent of original size [2022-12-14 12:39:22,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 49 treesize of output 74 [2022-12-14 12:39:23,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-12-14 12:39:23,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 46 treesize of output 39 [2022-12-14 12:39:23,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 42 treesize of output 37 [2022-12-14 12:39:23,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2022-12-14 12:39:23,259 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 397 trivial. 0 not checked. [2022-12-14 12:39:23,260 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 12:39:23,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055428924] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:39:23,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 12:39:23,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2022-12-14 12:39:23,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789794814] [2022-12-14 12:39:23,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:39:23,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 12:39:23,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:39:23,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 12:39:23,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2022-12-14 12:39:23,262 INFO L87 Difference]: Start difference. First operand 819 states and 1520 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:39:23,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:39:23,425 INFO L93 Difference]: Finished difference Result 834 states and 1545 transitions. [2022-12-14 12:39:23,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 12:39:23,426 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 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 111 [2022-12-14 12:39:23,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:39:23,429 INFO L225 Difference]: With dead ends: 834 [2022-12-14 12:39:23,429 INFO L226 Difference]: Without dead ends: 834 [2022-12-14 12:39:23,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2022-12-14 12:39:23,430 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 12 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 12:39:23,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 6 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 12:39:23,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2022-12-14 12:39:23,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 828. [2022-12-14 12:39:23,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 827 states have (on average 1.856106408706167) internal successors, (1535), 827 states have internal predecessors, (1535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:39:23,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1535 transitions. [2022-12-14 12:39:23,451 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1535 transitions. Word has length 111 [2022-12-14 12:39:23,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:39:23,451 INFO L495 AbstractCegarLoop]: Abstraction has 828 states and 1535 transitions. [2022-12-14 12:39:23,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:39:23,451 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1535 transitions. [2022-12-14 12:39:23,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-12-14 12:39:23,454 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:39:23,454 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:39:23,462 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 12:39:23,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:39:23,655 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-14 12:39:23,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:39:23,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1835997013, now seen corresponding path program 3 times [2022-12-14 12:39:23,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:39:23,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928233435] [2022-12-14 12:39:23,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:39:23,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:39:23,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:39:24,044 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 0 proven. 453 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:39:24,044 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:39:24,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928233435] [2022-12-14 12:39:24,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928233435] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:39:24,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605508656] [2022-12-14 12:39:24,045 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 12:39:24,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:39:24,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:39:24,046 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:39:24,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 12:39:24,261 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 12:39:24,262 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:39:24,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-14 12:39:24,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:39:24,355 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 0 proven. 453 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:39:24,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:39:24,563 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 0 proven. 453 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 12:39:24,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605508656] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:39:24,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [572486894] [2022-12-14 12:39:24,564 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 12:39:24,564 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:39:24,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 23 [2022-12-14 12:39:24,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641508721] [2022-12-14 12:39:24,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:39:24,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-14 12:39:24,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:39:24,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-14 12:39:24,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2022-12-14 12:39:24,567 INFO L87 Difference]: Start difference. First operand 828 states and 1535 transitions. Second operand has 23 states, 23 states have (on average 8.217391304347826) internal successors, (189), 23 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:39:24,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:39:24,872 INFO L93 Difference]: Finished difference Result 1308 states and 2407 transitions. [2022-12-14 12:39:24,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-14 12:39:24,872 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 8.217391304347826) internal successors, (189), 23 states have internal predecessors, (189), 0 states have call successors, (0), 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 111 [2022-12-14 12:39:24,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:39:24,877 INFO L225 Difference]: With dead ends: 1308 [2022-12-14 12:39:24,878 INFO L226 Difference]: Without dead ends: 1308 [2022-12-14 12:39:24,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 208 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2022-12-14 12:39:24,878 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 162 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 12:39:24,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 37 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 12:39:24,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2022-12-14 12:39:24,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1308. [2022-12-14 12:39:24,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1308 states, 1307 states have (on average 1.8416220351951034) internal successors, (2407), 1307 states have internal predecessors, (2407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:39:24,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 2407 transitions. [2022-12-14 12:39:24,898 INFO L78 Accepts]: Start accepts. Automaton has 1308 states and 2407 transitions. Word has length 111 [2022-12-14 12:39:24,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:39:24,899 INFO L495 AbstractCegarLoop]: Abstraction has 1308 states and 2407 transitions. [2022-12-14 12:39:24,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.217391304347826) internal successors, (189), 23 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:39:24,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 2407 transitions. [2022-12-14 12:39:24,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-12-14 12:39:24,902 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:39:24,902 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 20, 20, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:39:24,908 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 12:39:25,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:39:25,103 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-14 12:39:25,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:39:25,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1508628523, now seen corresponding path program 4 times [2022-12-14 12:39:25,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:39:25,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810749186] [2022-12-14 12:39:25,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:39:25,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:39:25,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:39:27,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1295 backedges. 434 proven. 16 refuted. 0 times theorem prover too weak. 845 trivial. 0 not checked. [2022-12-14 12:39:27,446 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:39:27,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810749186] [2022-12-14 12:39:27,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810749186] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:39:27,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616761714] [2022-12-14 12:39:27,447 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 12:39:27,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:39:27,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:39:27,448 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:39:27,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 12:39:27,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:39:27,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 1279 conjuncts, 63 conjunts are in the unsatisfiable core [2022-12-14 12:39:27,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:39:27,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 12:39:27,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:39:27,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 12:39:28,024 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:39:28,031 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-14 12:39:28,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-12-14 12:39:28,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:39:28,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-14 12:39:28,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 15 [2022-12-14 12:39:28,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:39:28,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 12:39:28,185 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:39:28,190 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-14 12:39:28,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-12-14 12:39:28,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-14 12:39:28,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1295 backedges. 716 proven. 36 refuted. 0 times theorem prover too weak. 543 trivial. 0 not checked. [2022-12-14 12:39:28,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:39:28,302 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_167| Int) (v_ArrVal_1459 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1457) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_167| 4) |c_~#queue~0.offset|) v_ArrVal_1459) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_167| (select .cse0 .cse1)))))) is different from false [2022-12-14 12:39:28,315 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_167| Int) (v_ArrVal_1459 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1457) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_167| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_167| 4) |c_~#queue~0.offset|) v_ArrVal_1459) .cse1) 20))))) is different from false [2022-12-14 12:39:28,327 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_167| Int) (v_ArrVal_1459 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1457) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_167| 4) |c_~#queue~0.offset|) v_ArrVal_1459) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_167| (select .cse0 .cse1)))))) is different from false [2022-12-14 12:39:28,350 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1453 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_167| Int) (v_ArrVal_1459 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1453) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1457) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_167| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_167| 4) |c_~#queue~0.offset|) v_ArrVal_1459) .cse1) 20))))) is different from false [2022-12-14 12:39:28,379 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1453 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_167| Int) (v_ArrVal_1452 Int) (v_ArrVal_1459 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1452)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1453) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1457) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_167| 4) |c_~#queue~0.offset|) v_ArrVal_1459) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_167| (select .cse0 .cse1)))))) is different from false [2022-12-14 12:39:28,533 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:39:28,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 209 treesize of output 149 [2022-12-14 12:39:28,546 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:39:28,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 275 treesize of output 273 [2022-12-14 12:39:28,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 253 treesize of output 237 [2022-12-14 12:39:28,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 293 treesize of output 281 [2022-12-14 12:39:28,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-12-14 12:39:28,654 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:39:28,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 107 [2022-12-14 12:39:28,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1295 backedges. 681 proven. 31 refuted. 0 times theorem prover too weak. 543 trivial. 40 not checked. [2022-12-14 12:39:28,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616761714] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:39:28,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1285416447] [2022-12-14 12:39:28,806 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 12:39:28,806 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:39:28,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 13] total 33 [2022-12-14 12:39:28,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866753241] [2022-12-14 12:39:28,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:39:28,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-14 12:39:28,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:39:28,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-14 12:39:28,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=618, Unknown=7, NotChecked=290, Total=1122 [2022-12-14 12:39:28,809 INFO L87 Difference]: Start difference. First operand 1308 states and 2407 transitions. Second operand has 34 states, 34 states have (on average 3.8529411764705883) internal successors, (131), 33 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:39:30,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:39:30,212 INFO L93 Difference]: Finished difference Result 2940 states and 5287 transitions. [2022-12-14 12:39:30,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-14 12:39:30,212 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.8529411764705883) internal successors, (131), 33 states have internal predecessors, (131), 0 states have call successors, (0), 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 171 [2022-12-14 12:39:30,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:39:30,221 INFO L225 Difference]: With dead ends: 2940 [2022-12-14 12:39:30,222 INFO L226 Difference]: Without dead ends: 2940 [2022-12-14 12:39:30,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 324 SyntacticMatches, 13 SemanticMatches, 44 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=443, Invalid=1210, Unknown=7, NotChecked=410, Total=2070 [2022-12-14 12:39:30,223 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 344 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 1624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 630 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 12:39:30,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 42 Invalid, 1624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 957 Invalid, 0 Unknown, 630 Unchecked, 0.7s Time] [2022-12-14 12:39:30,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2022-12-14 12:39:30,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 2421. [2022-12-14 12:39:30,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2421 states, 2420 states have (on average 1.7983471074380166) internal successors, (4352), 2420 states have internal predecessors, (4352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:39:30,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2421 states to 2421 states and 4352 transitions. [2022-12-14 12:39:30,278 INFO L78 Accepts]: Start accepts. Automaton has 2421 states and 4352 transitions. Word has length 171 [2022-12-14 12:39:30,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:39:30,279 INFO L495 AbstractCegarLoop]: Abstraction has 2421 states and 4352 transitions. [2022-12-14 12:39:30,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.8529411764705883) internal successors, (131), 33 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:39:30,279 INFO L276 IsEmpty]: Start isEmpty. Operand 2421 states and 4352 transitions. [2022-12-14 12:39:30,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-12-14 12:39:30,285 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:39:30,285 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 20, 20, 14, 14, 14, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:39:30,291 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 12:39:30,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-14 12:39:30,486 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-14 12:39:30,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:39:30,486 INFO L85 PathProgramCache]: Analyzing trace with hash 912944581, now seen corresponding path program 5 times [2022-12-14 12:39:30,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:39:30,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023420287] [2022-12-14 12:39:30,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:39:30,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:39:30,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:39:32,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 1261 trivial. 0 not checked. [2022-12-14 12:39:32,350 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:39:32,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023420287] [2022-12-14 12:39:32,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023420287] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 12:39:32,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 12:39:32,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 12:39:32,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646924046] [2022-12-14 12:39:32,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 12:39:32,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 12:39:32,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:39:32,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 12:39:32,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-14 12:39:32,352 INFO L87 Difference]: Start difference. First operand 2421 states and 4352 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:39:32,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:39:32,554 INFO L93 Difference]: Finished difference Result 2352 states and 4234 transitions. [2022-12-14 12:39:32,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 12:39:32,555 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 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 175 [2022-12-14 12:39:32,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:39:32,562 INFO L225 Difference]: With dead ends: 2352 [2022-12-14 12:39:32,563 INFO L226 Difference]: Without dead ends: 2352 [2022-12-14 12:39:32,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-14 12:39:32,563 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 24 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 12:39:32,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 6 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 12:39:32,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2352 states. [2022-12-14 12:39:32,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2352 to 2343. [2022-12-14 12:39:32,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2343 states, 2342 states have (on average 1.8014517506404781) internal successors, (4219), 2342 states have internal predecessors, (4219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:39:32,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2343 states to 2343 states and 4219 transitions. [2022-12-14 12:39:32,600 INFO L78 Accepts]: Start accepts. Automaton has 2343 states and 4219 transitions. Word has length 175 [2022-12-14 12:39:32,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:39:32,600 INFO L495 AbstractCegarLoop]: Abstraction has 2343 states and 4219 transitions. [2022-12-14 12:39:32,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:39:32,600 INFO L276 IsEmpty]: Start isEmpty. Operand 2343 states and 4219 transitions. [2022-12-14 12:39:32,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-12-14 12:39:32,604 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:39:32,604 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 20, 20, 14, 14, 14, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:39:32,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 12:39:32,605 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-14 12:39:32,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:39:32,605 INFO L85 PathProgramCache]: Analyzing trace with hash 2012944969, now seen corresponding path program 6 times [2022-12-14 12:39:32,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:39:32,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396493767] [2022-12-14 12:39:32,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:39:32,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:39:32,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:39:35,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 342 proven. 18 refuted. 0 times theorem prover too weak. 997 trivial. 0 not checked. [2022-12-14 12:39:35,392 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:39:35,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396493767] [2022-12-14 12:39:35,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396493767] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:39:35,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602648859] [2022-12-14 12:39:35,393 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 12:39:35,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:39:35,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:39:35,393 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:39:35,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 12:39:35,692 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 12:39:35,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 12:39:35,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 1283 conjuncts, 119 conjunts are in the unsatisfiable core [2022-12-14 12:39:35,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:39:35,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 12:39:36,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:39:36,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 12:39:36,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-12-14 12:39:36,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 12:39:36,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:39:36,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 12:39:36,219 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:39:36,228 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-14 12:39:36,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-12-14 12:39:36,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:39:36,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-14 12:39:36,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 15 [2022-12-14 12:39:36,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:39:36,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 12:39:36,414 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:39:36,422 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-14 12:39:36,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-12-14 12:39:36,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:39:36,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-14 12:39:36,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 15 [2022-12-14 12:39:36,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:39:36,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 12:39:36,623 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:39:36,629 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-14 12:39:36,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-12-14 12:39:36,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:39:36,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-14 12:39:36,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 15 [2022-12-14 12:39:36,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:39:36,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 12:39:36,795 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:39:36,802 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-14 12:39:36,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 27 [2022-12-14 12:39:36,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-14 12:39:36,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 837 proven. 125 refuted. 0 times theorem prover too weak. 395 trivial. 0 not checked. [2022-12-14 12:39:36,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:39:37,148 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2076 Int) (v_ArrVal_2079 (Array Int Int)) (v_ArrVal_2081 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_192| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2076) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2079) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_192| 4)) v_ArrVal_2081) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_192| (select .cse0 .cse1)))))) is different from false [2022-12-14 12:39:37,170 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2074 Int) (v_ArrVal_2076 Int) (v_ArrVal_2079 (Array Int Int)) (v_ArrVal_2081 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_192| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2074)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2076) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2079) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_192| (select .cse0 .cse1))) (not (= 20 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_192| 4)) v_ArrVal_2081) .cse1)))))) is different from false [2022-12-14 12:39:37,282 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2072 (Array Int Int)) (v_ArrVal_2074 Int) (v_ArrVal_2076 Int) (v_ArrVal_2079 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_194| Int) (v_ArrVal_2081 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_192| Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2072))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_194| 4)) v_ArrVal_2074))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2076) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2079) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_192| 4)) v_ArrVal_2081) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_192| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_194| (select .cse2 .cse1)))))))) is different from false [2022-12-14 12:39:37,531 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2072 (Array Int Int)) (v_ArrVal_2074 Int) (v_ArrVal_2076 Int) (v_ArrVal_2068 Int) (v_ArrVal_2079 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_194| Int) (v_ArrVal_2081 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_192| Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2068) .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2072))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_194| 4)) v_ArrVal_2074))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2076) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2079) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_192| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_192| 4)) v_ArrVal_2081) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_194| (select .cse2 .cse1)))))))) is different from false [2022-12-14 12:39:37,570 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2072 (Array Int Int)) (v_ArrVal_2074 Int) (v_ArrVal_2076 Int) (v_ArrVal_2067 Int) (v_ArrVal_2068 Int) (v_ArrVal_2079 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_194| Int) (v_ArrVal_2081 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_192| Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2067)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2068) .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2072))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_194| 4)) v_ArrVal_2074))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2076) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2079) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_192| 4)) v_ArrVal_2081) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_194| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_192| (select .cse0 .cse1)))))))) is different from false [2022-12-14 12:39:40,262 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2079 (Array Int Int)) (v_ArrVal_2065 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_194| Int) (v_ArrVal_2081 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_192| Int) (v_ArrVal_2072 (Array Int Int)) (v_ArrVal_2074 Int) (v_ArrVal_2062 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_196| Int) (v_ArrVal_2076 Int) (v_ArrVal_2067 Int) (v_ArrVal_2068 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse9 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2062) .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2065))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_196| 4) |c_~#queue~0.offset|) v_ArrVal_2067))) (store (store .cse8 .cse6 v_ArrVal_2068) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2072))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_194| 4)) v_ArrVal_2074))) (store (store .cse5 .cse6 v_ArrVal_2076) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2079) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_196| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_194| (select .cse2 .cse1))) (not (= (select (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_192| 4)) v_ArrVal_2081) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_192| (select .cse3 .cse1)))))))))) is different from false [2022-12-14 12:39:40,320 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2079 (Array Int Int)) (v_ArrVal_2065 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_194| Int) (v_ArrVal_2081 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_192| Int) (v_ArrVal_2072 (Array Int Int)) (v_ArrVal_2074 Int) (v_ArrVal_2062 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_196| Int) (v_ArrVal_2076 Int) (v_ArrVal_2067 Int) (v_ArrVal_2068 Int) (v_ArrVal_2059 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2059)) (.cse10 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse9 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2062) .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2065))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_196| 4) |c_~#queue~0.offset|) v_ArrVal_2067))) (store (store .cse8 .cse6 v_ArrVal_2068) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2072))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_194| 4)) v_ArrVal_2074))) (store (store .cse5 .cse6 v_ArrVal_2076) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2079) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_192| 4)) v_ArrVal_2081) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_196| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_194| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_192| (select .cse0 .cse1)))))))))) is different from false [2022-12-14 12:39:41,378 INFO L321 Elim1Store]: treesize reduction 335, result has 45.1 percent of original size [2022-12-14 12:39:41,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 5238 treesize of output 1970 [2022-12-14 12:39:41,493 INFO L321 Elim1Store]: treesize reduction 52, result has 13.3 percent of original size [2022-12-14 12:39:41,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 2565 treesize of output 2573 [2022-12-14 12:39:41,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:39:41,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:39:41,640 INFO L321 Elim1Store]: treesize reduction 56, result has 35.6 percent of original size [2022-12-14 12:39:41,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 15 case distinctions, treesize of input 2831 treesize of output 3226 [2022-12-14 12:39:41,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2594 treesize of output 2546 [2022-12-14 12:39:41,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2269 treesize of output 2173 [2022-12-14 12:39:41,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2658 treesize of output 2586 [2022-12-14 12:39:41,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:39:41,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:39:41,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:39:42,016 INFO L321 Elim1Store]: treesize reduction 58, result has 40.2 percent of original size [2022-12-14 12:39:42,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 9 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 19 case distinctions, treesize of input 468 treesize of output 2546 [2022-12-14 12:39:42,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-12-14 12:39:42,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-12-14 12:39:42,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-12-14 12:39:43,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:39:43,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:39:43,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:39:43,293 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 12:39:43,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 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 214 treesize of output 328 [2022-12-14 12:39:43,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-12-14 12:39:43,441 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:39:43,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 85 [2022-12-14 12:39:44,284 INFO L321 Elim1Store]: treesize reduction 107, result has 25.7 percent of original size [2022-12-14 12:39:44,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 764 treesize of output 1996 [2022-12-14 12:39:44,772 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-12-14 12:39:44,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 424 treesize of output 216 [2022-12-14 12:39:44,787 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 12:39:44,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 215 treesize of output 195 [2022-12-14 12:39:44,813 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:39:44,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 174 treesize of output 178 [2022-12-14 12:39:44,899 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:39:44,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 190 treesize of output 174 [2022-12-14 12:39:45,169 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:39:45,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 280 treesize of output 264 [2022-12-14 12:39:45,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 682 proven. 81 refuted. 3 times theorem prover too weak. 451 trivial. 140 not checked. [2022-12-14 12:39:45,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602648859] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:39:45,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1298381380] [2022-12-14 12:39:45,379 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 12:39:45,380 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:39:45,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19, 24] total 55 [2022-12-14 12:39:45,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163381672] [2022-12-14 12:39:45,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:39:45,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-12-14 12:39:45,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:39:45,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-12-14 12:39:45,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=530, Invalid=1796, Unknown=54, NotChecked=700, Total=3080 [2022-12-14 12:39:45,381 INFO L87 Difference]: Start difference. First operand 2343 states and 4219 transitions. Second operand has 56 states, 56 states have (on average 2.8035714285714284) internal successors, (157), 55 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:39:54,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 12:39:54,713 INFO L93 Difference]: Finished difference Result 5634 states and 9918 transitions. [2022-12-14 12:39:54,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-12-14 12:39:54,713 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 2.8035714285714284) internal successors, (157), 55 states have internal predecessors, (157), 0 states have call successors, (0), 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 175 [2022-12-14 12:39:54,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 12:39:54,723 INFO L225 Difference]: With dead ends: 5634 [2022-12-14 12:39:54,724 INFO L226 Difference]: Without dead ends: 5634 [2022-12-14 12:39:54,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 314 SyntacticMatches, 32 SemanticMatches, 83 ConstructedPredicates, 7 IntricatePredicates, 2 DeprecatedPredicates, 2828 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=1287, Invalid=4693, Unknown=54, NotChecked=1106, Total=7140 [2022-12-14 12:39:54,725 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 885 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 2365 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 885 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 3710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 2365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1239 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-12-14 12:39:54,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [885 Valid, 104 Invalid, 3710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 2365 Invalid, 0 Unknown, 1239 Unchecked, 3.4s Time] [2022-12-14 12:39:54,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5634 states. [2022-12-14 12:39:54,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5634 to 4000. [2022-12-14 12:39:54,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4000 states, 3999 states have (on average 1.7649412353088272) internal successors, (7058), 3999 states have internal predecessors, (7058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:39:54,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4000 states to 4000 states and 7058 transitions. [2022-12-14 12:39:54,782 INFO L78 Accepts]: Start accepts. Automaton has 4000 states and 7058 transitions. Word has length 175 [2022-12-14 12:39:54,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 12:39:54,783 INFO L495 AbstractCegarLoop]: Abstraction has 4000 states and 7058 transitions. [2022-12-14 12:39:54,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 2.8035714285714284) internal successors, (157), 55 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:39:54,783 INFO L276 IsEmpty]: Start isEmpty. Operand 4000 states and 7058 transitions. [2022-12-14 12:39:54,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-12-14 12:39:54,789 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 12:39:54,789 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 20, 20, 17, 17, 17, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 12:39:54,795 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 12:39:54,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-14 12:39:54,990 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-14 12:39:54,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 12:39:54,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1377164405, now seen corresponding path program 7 times [2022-12-14 12:39:54,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 12:39:54,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549350421] [2022-12-14 12:39:54,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 12:39:54,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 12:39:55,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:40:03,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1435 backedges. 851 proven. 220 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-12-14 12:40:03,041 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 12:40:03,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549350421] [2022-12-14 12:40:03,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549350421] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 12:40:03,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328684687] [2022-12-14 12:40:03,042 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 12:40:03,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 12:40:03,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 12:40:03,043 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 12:40:03,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5c4a3cae-17e3-4778-893b-0c290f101790/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 12:40:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 12:40:03,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 1286 conjuncts, 166 conjunts are in the unsatisfiable core [2022-12-14 12:40:03,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 12:40:03,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 12:40:03,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:40:03,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 12:40:03,816 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:40:03,824 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-14 12:40:03,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-12-14 12:40:03,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:40:03,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-14 12:40:03,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 34 treesize of output 18 [2022-12-14 12:40:03,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:40:03,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 12:40:04,021 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:40:04,029 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-14 12:40:04,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-12-14 12:40:04,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:40:04,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-14 12:40:04,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 34 treesize of output 18 [2022-12-14 12:40:04,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:40:04,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 12:40:04,240 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:40:04,247 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-14 12:40:04,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-12-14 12:40:04,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:40:04,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-14 12:40:04,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 34 treesize of output 18 [2022-12-14 12:40:04,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:40:04,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 12:40:04,453 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:40:04,462 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-14 12:40:04,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-12-14 12:40:04,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:40:04,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-14 12:40:04,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 34 treesize of output 18 [2022-12-14 12:40:04,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:40:04,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 12:40:04,683 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:40:04,690 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-14 12:40:04,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-12-14 12:40:04,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:40:04,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-14 12:40:04,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 34 treesize of output 18 [2022-12-14 12:40:04,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:40:04,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 12:40:04,907 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:40:04,916 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-14 12:40:04,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-12-14 12:40:04,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:40:04,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-14 12:40:05,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 34 treesize of output 18 [2022-12-14 12:40:05,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:40:05,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 12:40:05,117 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:40:05,125 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-12-14 12:40:05,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-12-14 12:40:05,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:40:05,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-14 12:40:05,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 34 treesize of output 18 [2022-12-14 12:40:05,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 12:40:05,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 12:40:05,326 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 12:40:05,332 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-14 12:40:05,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-12-14 12:40:05,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-14 12:40:05,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1435 backedges. 882 proven. 260 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2022-12-14 12:40:05,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 12:40:05,497 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2531 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| Int) (v_ArrVal_2527 Int) (v_ArrVal_2529 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2527)) |c_~#stored_elements~0.base| v_ArrVal_2529) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| 4) |c_~#queue~0.offset|) v_ArrVal_2531) .cse1) 20) (not (<= v_ArrVal_2527 (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| (select .cse0 .cse1)))))) is different from false [2022-12-14 12:40:05,512 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2531 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| Int) (v_ArrVal_2527 Int) (v_ArrVal_2529 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_2527)) |c_~#stored_elements~0.base| v_ArrVal_2529) |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2527) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| 4) |c_~#queue~0.offset|) v_ArrVal_2531) .cse3) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| (select .cse2 .cse3))))))) is different from false [2022-12-14 12:40:05,539 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2531 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| Int) (v_ArrVal_2525 Int) (v_ArrVal_2527 Int) (v_ArrVal_2529 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2525) .cse3 v_ArrVal_2527)) |c_~#stored_elements~0.base| v_ArrVal_2529) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| 4) |c_~#queue~0.offset|) v_ArrVal_2531) .cse1) 20) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2527) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| (select .cse0 .cse1))))))) is different from false [2022-12-14 12:40:05,568 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2531 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| Int) (v_ArrVal_2524 Int) (v_ArrVal_2525 Int) (v_ArrVal_2527 Int) (v_ArrVal_2529 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2524)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2525) .cse3 v_ArrVal_2527)) |c_~#stored_elements~0.base| v_ArrVal_2529) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| (select .cse0 .cse1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| 4) |c_~#queue~0.offset|) v_ArrVal_2531) .cse1) 20) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2527))))) is different from false [2022-12-14 12:40:09,798 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| Int) (v_ArrVal_2522 (Array Int Int)) (v_ArrVal_2531 Int) (v_ArrVal_2521 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| Int) (v_ArrVal_2524 Int) (v_ArrVal_2525 Int) (v_ArrVal_2527 Int) (v_ArrVal_2529 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2521)) |c_~#stored_elements~0.base| v_ArrVal_2522))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse3 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| 4) |c_~#queue~0.offset|) v_ArrVal_2524)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse3 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2525) .cse1 v_ArrVal_2527)) |c_~#stored_elements~0.base| v_ArrVal_2529) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_2521 (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| (select .cse2 .cse1))) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| 4) |c_~#queue~0.offset|) v_ArrVal_2531) .cse1) 20) (< (+ (select .cse3 .cse1) 1) v_ArrVal_2527))))))) is different from false [2022-12-14 12:40:09,827 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| Int) (v_ArrVal_2522 (Array Int Int)) (v_ArrVal_2531 Int) (v_ArrVal_2521 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| Int) (v_ArrVal_2524 Int) (v_ArrVal_2525 Int) (v_ArrVal_2527 Int) (v_ArrVal_2529 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_2521)) |c_~#stored_elements~0.base| v_ArrVal_2522))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| 4) |c_~#queue~0.offset|) v_ArrVal_2524)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2525) .cse1 v_ArrVal_2527)) |c_~#stored_elements~0.base| v_ArrVal_2529) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2521) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| (select .cse4 .cse1))) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| 4) |c_~#queue~0.offset|) v_ArrVal_2531) .cse1) 20) (< (+ (select .cse5 .cse1) 1) v_ArrVal_2527)))))))) is different from false [2022-12-14 12:40:09,882 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| Int) (v_ArrVal_2518 Int) (v_ArrVal_2522 (Array Int Int)) (v_ArrVal_2531 Int) (v_ArrVal_2521 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| Int) (v_ArrVal_2524 Int) (v_ArrVal_2525 Int) (v_ArrVal_2527 Int) (v_ArrVal_2529 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2518) .cse1 v_ArrVal_2521)) |c_~#stored_elements~0.base| v_ArrVal_2522))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| 4) |c_~#queue~0.offset|) v_ArrVal_2524)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse2 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2525) .cse3 v_ArrVal_2527)) |c_~#stored_elements~0.base| v_ArrVal_2529) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2521) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2527) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| 4) |c_~#queue~0.offset|) v_ArrVal_2531) .cse3) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| (select .cse4 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| (select .cse5 .cse3)))))))))) is different from false [2022-12-14 12:40:09,945 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| Int) (v_ArrVal_2518 Int) (v_ArrVal_2522 (Array Int Int)) (v_ArrVal_2531 Int) (v_ArrVal_2521 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| Int) (v_ArrVal_2524 Int) (v_ArrVal_2525 Int) (v_ArrVal_2516 Int) (v_ArrVal_2527 Int) (v_ArrVal_2529 (Array Int Int))) (let ((.cse4 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2516)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2518) .cse5 v_ArrVal_2521)) |c_~#stored_elements~0.base| v_ArrVal_2522))) (let ((.cse2 (select .cse6 |c_~#queue~0.base|))) (let ((.cse3 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| 4) |c_~#queue~0.offset|) v_ArrVal_2524)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse3 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2525) .cse1 v_ArrVal_2527)) |c_~#stored_elements~0.base| v_ArrVal_2529) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| (select .cse0 .cse1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| 4) |c_~#queue~0.offset|) v_ArrVal_2531) .cse1) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| (select .cse2 .cse1))) (< (+ (select .cse3 .cse1) 1) v_ArrVal_2527) (< (+ (select .cse4 .cse5) 1) v_ArrVal_2521)))))))) is different from false [2022-12-14 12:40:18,580 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2518 Int) (v_ArrVal_2515 (Array Int Int)) (v_ArrVal_2522 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2531 Int) (v_ArrVal_2521 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| Int) (v_ArrVal_2524 Int) (v_ArrVal_2514 Int) (v_ArrVal_2525 Int) (v_ArrVal_2516 Int) (v_ArrVal_2527 Int) (v_ArrVal_2529 (Array Int Int))) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse7 v_ArrVal_2514)) |c_~#stored_elements~0.base| v_ArrVal_2515))) (let ((.cse5 (select .cse10 |c_~#queue~0.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2516)) (.cse9 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse10 |c_~#queue~0.base| (store (store .cse2 .cse9 v_ArrVal_2518) .cse1 v_ArrVal_2521)) |c_~#stored_elements~0.base| v_ArrVal_2522))) (let ((.cse3 (select .cse8 |c_~#queue~0.base|))) (let ((.cse0 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| 4) |c_~#queue~0.offset|) v_ArrVal_2524))) (let ((.cse4 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse0 .cse9 v_ArrVal_2525) .cse1 v_ArrVal_2527)) |c_~#stored_elements~0.base| v_ArrVal_2529) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2527) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2521) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| (select .cse4 .cse1))) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| 4) |c_~#queue~0.offset|) v_ArrVal_2531) .cse1) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| (select .cse5 .cse1))) (< (+ (select .cse6 .cse7) 1) v_ArrVal_2514))))))))))) is different from false [2022-12-14 12:40:18,663 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2518 Int) (v_ArrVal_2515 (Array Int Int)) (v_ArrVal_2522 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2531 Int) (v_ArrVal_2521 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| Int) (v_ArrVal_2524 Int) (v_ArrVal_2512 Int) (v_ArrVal_2514 Int) (v_ArrVal_2525 Int) (v_ArrVal_2516 Int) (v_ArrVal_2527 Int) (v_ArrVal_2529 (Array Int Int))) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2512) .cse7 v_ArrVal_2514)) |c_~#stored_elements~0.base| v_ArrVal_2515))) (let ((.cse0 (select .cse10 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2516)) (.cse9 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse10 |c_~#queue~0.base| (store (store .cse2 .cse9 v_ArrVal_2518) .cse1 v_ArrVal_2521)) |c_~#stored_elements~0.base| v_ArrVal_2522))) (let ((.cse4 (select .cse8 |c_~#queue~0.base|))) (let ((.cse5 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| 4) |c_~#queue~0.offset|) v_ArrVal_2524))) (let ((.cse3 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse5 .cse9 v_ArrVal_2525) .cse1 v_ArrVal_2527)) |c_~#stored_elements~0.base| v_ArrVal_2529) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2521) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| (select .cse3 .cse1))) (< (select (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| 4) |c_~#queue~0.offset|) v_ArrVal_2531) .cse1) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| (select .cse4 .cse1))) (< (+ (select .cse5 .cse1) 1) v_ArrVal_2527) (< (+ (select .cse6 .cse7) 1) v_ArrVal_2514))))))))))) is different from false [2022-12-14 12:40:30,200 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2518 Int) (v_ArrVal_2515 (Array Int Int)) (v_ArrVal_2522 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2531 Int) (v_ArrVal_2510 Int) (v_ArrVal_2521 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| Int) (v_ArrVal_2524 Int) (v_ArrVal_2512 Int) (v_ArrVal_2514 Int) (v_ArrVal_2525 Int) (v_ArrVal_2506 Int) (v_ArrVal_2508 (Array Int Int)) (v_ArrVal_2516 Int) (v_ArrVal_2527 Int) (v_ArrVal_2529 (Array Int Int))) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2506)) |c_~#stored_elements~0.base| v_ArrVal_2508))) (let ((.cse4 (select .cse11 |c_~#queue~0.base|))) (let ((.cse5 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| 4) |c_~#queue~0.offset|) v_ArrVal_2510)) (.cse9 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| (store (store .cse5 .cse9 v_ArrVal_2512) .cse1 v_ArrVal_2514)) |c_~#stored_elements~0.base| v_ArrVal_2515))) (let ((.cse6 (select .cse10 |c_~#queue~0.base|))) (let ((.cse7 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2516))) (let ((.cse8 (store (store .cse10 |c_~#queue~0.base| (store (store .cse7 .cse9 v_ArrVal_2518) .cse1 v_ArrVal_2521)) |c_~#stored_elements~0.base| v_ArrVal_2522))) (let ((.cse2 (select .cse8 |c_~#queue~0.base|))) (let ((.cse3 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| 4) |c_~#queue~0.offset|) v_ArrVal_2524))) (let ((.cse0 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse3 .cse9 v_ArrVal_2525) .cse1 v_ArrVal_2527)) |c_~#stored_elements~0.base| v_ArrVal_2529) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| 4) |c_~#queue~0.offset|) v_ArrVal_2531) .cse1) 20) (not (<= v_ArrVal_2506 (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| (select .cse0 .cse1))) (< (+ (select .cse3 .cse1) 1) v_ArrVal_2527) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| (select .cse4 .cse1))) (< (+ (select .cse5 .cse1) 1) v_ArrVal_2514) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| (select .cse6 .cse1))) (< (+ (select .cse7 .cse1) 1) v_ArrVal_2521))))))))))))) is different from false [2022-12-14 12:40:36,141 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2518 Int) (v_ArrVal_2515 (Array Int Int)) (v_ArrVal_2522 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2531 Int) (v_ArrVal_2510 Int) (v_ArrVal_2521 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| Int) (v_ArrVal_2524 Int) (v_ArrVal_2512 Int) (v_ArrVal_2503 Int) (v_ArrVal_2514 Int) (v_ArrVal_2525 Int) (v_ArrVal_2506 Int) (v_ArrVal_2508 (Array Int Int)) (v_ArrVal_2505 Int) (v_ArrVal_2516 Int) (v_ArrVal_2527 Int) (v_ArrVal_2529 (Array Int Int))) (let ((.cse8 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2503)) (.cse9 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2505) .cse9 v_ArrVal_2506)) |c_~#stored_elements~0.base| v_ArrVal_2508))) (let ((.cse2 (select .cse13 |c_~#queue~0.base|))) (let ((.cse3 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| 4) |c_~#queue~0.offset|) v_ArrVal_2510)) (.cse11 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse12 (store (store .cse13 |c_~#queue~0.base| (store (store .cse3 .cse11 v_ArrVal_2512) .cse1 v_ArrVal_2514)) |c_~#stored_elements~0.base| v_ArrVal_2515))) (let ((.cse7 (select .cse12 |c_~#queue~0.base|))) (let ((.cse0 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2516))) (let ((.cse10 (store (store .cse12 |c_~#queue~0.base| (store (store .cse0 .cse11 v_ArrVal_2518) .cse1 v_ArrVal_2521)) |c_~#stored_elements~0.base| v_ArrVal_2522))) (let ((.cse6 (select .cse10 |c_~#queue~0.base|))) (let ((.cse4 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| 4) |c_~#queue~0.offset|) v_ArrVal_2524))) (let ((.cse5 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse4 .cse11 v_ArrVal_2525) .cse1 v_ArrVal_2527)) |c_~#stored_elements~0.base| v_ArrVal_2529) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2521) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| (select .cse2 .cse1))) (< (+ (select .cse3 .cse1) 1) v_ArrVal_2514) (< (+ (select .cse4 .cse1) 1) v_ArrVal_2527) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| (select .cse5 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| (select .cse6 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| (select .cse7 .cse1))) (< (+ (select .cse8 .cse9) 1) v_ArrVal_2506) (< (select (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| 4) |c_~#queue~0.offset|) v_ArrVal_2531) .cse1) 20)))))))))))))) is different from false [2022-12-14 12:40:47,601 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2518 Int) (v_ArrVal_2515 (Array Int Int)) (v_ArrVal_2501 (Array Int Int)) (v_ArrVal_2522 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2531 Int) (v_ArrVal_2510 Int) (v_ArrVal_2521 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_237| Int) (v_ArrVal_2524 Int) (v_ArrVal_2512 Int) (v_ArrVal_2503 Int) (v_ArrVal_2514 Int) (v_ArrVal_2525 Int) (v_ArrVal_2506 Int) (v_ArrVal_2508 (Array Int Int)) (v_ArrVal_2505 Int) (v_ArrVal_2516 Int) (v_ArrVal_2527 Int) (v_ArrVal_2529 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2501))) (let ((.cse8 (select .cse14 |c_~#queue~0.base|))) (let ((.cse5 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_237| 4) |c_~#queue~0.offset|) v_ArrVal_2503)) (.cse11 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse13 (store (store .cse14 |c_~#queue~0.base| (store (store .cse5 .cse11 v_ArrVal_2505) .cse1 v_ArrVal_2506)) |c_~#stored_elements~0.base| v_ArrVal_2508))) (let ((.cse7 (select .cse13 |c_~#queue~0.base|))) (let ((.cse9 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| 4) |c_~#queue~0.offset|) v_ArrVal_2510))) (let ((.cse12 (store (store .cse13 |c_~#queue~0.base| (store (store .cse9 .cse11 v_ArrVal_2512) .cse1 v_ArrVal_2514)) |c_~#stored_elements~0.base| v_ArrVal_2515))) (let ((.cse3 (select .cse12 |c_~#queue~0.base|))) (let ((.cse2 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2516))) (let ((.cse10 (store (store .cse12 |c_~#queue~0.base| (store (store .cse2 .cse11 v_ArrVal_2518) .cse1 v_ArrVal_2521)) |c_~#stored_elements~0.base| v_ArrVal_2522))) (let ((.cse4 (select .cse10 |c_~#queue~0.base|))) (let ((.cse6 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| 4) |c_~#queue~0.offset|) v_ArrVal_2524))) (let ((.cse0 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse6 .cse11 v_ArrVal_2525) .cse1 v_ArrVal_2527)) |c_~#stored_elements~0.base| v_ArrVal_2529) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2521) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| (select .cse4 .cse1))) (< (+ (select .cse5 .cse1) 1) v_ArrVal_2506) (< (+ (select .cse6 .cse1) 1) v_ArrVal_2527) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| (select .cse7 .cse1))) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| 4) |c_~#queue~0.offset|) v_ArrVal_2531) .cse1) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_237| (select .cse8 .cse1))) (< (+ (select .cse9 .cse1) 1) v_ArrVal_2514)))))))))))))))) is different from false [2022-12-14 12:40:48,011 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2501 (Array Int Int)) (v_ArrVal_2522 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2531 Int) (v_ArrVal_2499 Int) (v_ArrVal_2510 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_237| Int) (v_ArrVal_2512 Int) (v_ArrVal_2514 Int) (v_ArrVal_2516 Int) (v_ArrVal_2518 Int) (v_ArrVal_2515 (Array Int Int)) (v_ArrVal_2521 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| Int) (v_ArrVal_2524 Int) (v_ArrVal_2503 Int) (v_ArrVal_2525 Int) (v_ArrVal_2506 Int) (v_ArrVal_2508 (Array Int Int)) (v_ArrVal_2505 Int) (v_ArrVal_2527 Int) (v_ArrVal_2529 (Array Int Int))) (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse16 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse10 .cse11 v_ArrVal_2499)) |c_~#stored_elements~0.base| v_ArrVal_2501))) (let ((.cse5 (select .cse16 |c_~#queue~0.base|))) (let ((.cse7 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_237| 4) |c_~#queue~0.offset|) v_ArrVal_2503)) (.cse13 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse15 (store (store .cse16 |c_~#queue~0.base| (store (store .cse7 .cse13 v_ArrVal_2505) .cse1 v_ArrVal_2506)) |c_~#stored_elements~0.base| v_ArrVal_2508))) (let ((.cse2 (select .cse15 |c_~#queue~0.base|))) (let ((.cse6 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| 4) |c_~#queue~0.offset|) v_ArrVal_2510))) (let ((.cse14 (store (store .cse15 |c_~#queue~0.base| (store (store .cse6 .cse13 v_ArrVal_2512) .cse1 v_ArrVal_2514)) |c_~#stored_elements~0.base| v_ArrVal_2515))) (let ((.cse3 (select .cse14 |c_~#queue~0.base|))) (let ((.cse0 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2516))) (let ((.cse12 (store (store .cse14 |c_~#queue~0.base| (store (store .cse0 .cse13 v_ArrVal_2518) .cse1 v_ArrVal_2521)) |c_~#stored_elements~0.base| v_ArrVal_2522))) (let ((.cse4 (select .cse12 |c_~#queue~0.base|))) (let ((.cse8 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| 4) |c_~#queue~0.offset|) v_ArrVal_2524))) (let ((.cse9 (select (store (store .cse12 |c_~#queue~0.base| (store (store .cse8 .cse13 v_ArrVal_2525) .cse1 v_ArrVal_2527)) |c_~#stored_elements~0.base| v_ArrVal_2529) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2521) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| (select .cse4 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_237| (select .cse5 .cse1))) (< (+ (select .cse6 .cse1) 1) v_ArrVal_2514) (< (+ (select .cse7 .cse1) 1) v_ArrVal_2506) (< (+ (select .cse8 .cse1) 1) v_ArrVal_2527) (< (select (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| 4) |c_~#queue~0.offset|) v_ArrVal_2531) .cse1) 20) (< (+ (select .cse10 .cse11) 1) v_ArrVal_2499) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| (select .cse9 .cse1))))))))))))))))))) is different from false [2022-12-14 12:40:48,813 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2501 (Array Int Int)) (v_ArrVal_2522 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| Int) (v_ArrVal_2496 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2531 Int) (v_ArrVal_2497 Int) (v_ArrVal_2499 Int) (v_ArrVal_2510 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_237| Int) (v_ArrVal_2512 Int) (v_ArrVal_2514 Int) (v_ArrVal_2516 Int) (v_ArrVal_2518 Int) (v_ArrVal_2515 (Array Int Int)) (v_ArrVal_2521 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| Int) (v_ArrVal_2524 Int) (v_ArrVal_2503 Int) (v_ArrVal_2525 Int) (v_ArrVal_2506 Int) (v_ArrVal_2508 (Array Int Int)) (v_ArrVal_2505 Int) (v_ArrVal_2527 Int) (v_ArrVal_2529 (Array Int Int))) (let ((.cse6 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2496)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse16 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2497) .cse7 v_ArrVal_2499)) |c_~#stored_elements~0.base| v_ArrVal_2501))) (let ((.cse2 (select .cse16 |c_~#queue~0.base|))) (let ((.cse0 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_237| 4) |c_~#queue~0.offset|) v_ArrVal_2503)) (.cse13 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse15 (store (store .cse16 |c_~#queue~0.base| (store (store .cse0 .cse13 v_ArrVal_2505) .cse1 v_ArrVal_2506)) |c_~#stored_elements~0.base| v_ArrVal_2508))) (let ((.cse10 (select .cse15 |c_~#queue~0.base|))) (let ((.cse8 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| 4) |c_~#queue~0.offset|) v_ArrVal_2510))) (let ((.cse14 (store (store .cse15 |c_~#queue~0.base| (store (store .cse8 .cse13 v_ArrVal_2512) .cse1 v_ArrVal_2514)) |c_~#stored_elements~0.base| v_ArrVal_2515))) (let ((.cse11 (select .cse14 |c_~#queue~0.base|))) (let ((.cse3 (store .cse11 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2516))) (let ((.cse12 (store (store .cse14 |c_~#queue~0.base| (store (store .cse3 .cse13 v_ArrVal_2518) .cse1 v_ArrVal_2521)) |c_~#stored_elements~0.base| v_ArrVal_2522))) (let ((.cse9 (select .cse12 |c_~#queue~0.base|))) (let ((.cse4 (store .cse9 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| 4) |c_~#queue~0.offset|) v_ArrVal_2524))) (let ((.cse5 (select (store (store .cse12 |c_~#queue~0.base| (store (store .cse4 .cse13 v_ArrVal_2525) .cse1 v_ArrVal_2527)) |c_~#stored_elements~0.base| v_ArrVal_2529) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2506) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_237| (select .cse2 .cse1))) (< (+ (select .cse3 .cse1) 1) v_ArrVal_2521) (< (+ (select .cse4 .cse1) 1) v_ArrVal_2527) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| (select .cse5 .cse1))) (< (+ (select .cse6 .cse7) 1) v_ArrVal_2499) (< (+ (select .cse8 .cse1) 1) v_ArrVal_2514) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| (select .cse9 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| (select .cse10 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| (select .cse11 .cse1))) (< (select (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| 4) |c_~#queue~0.offset|) v_ArrVal_2531) .cse1) 20))))))))))))))))) is different from false [2022-12-14 12:41:14,645 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2501 (Array Int Int)) (v_ArrVal_2522 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| Int) (v_ArrVal_2493 Int) (v_ArrVal_2496 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2531 Int) (v_ArrVal_2497 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2499 Int) (v_ArrVal_2510 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_237| Int) (v_ArrVal_2512 Int) (v_ArrVal_2514 Int) (v_ArrVal_2516 Int) (v_ArrVal_2518 Int) (v_ArrVal_2515 (Array Int Int)) (v_ArrVal_2494 (Array Int Int)) (v_ArrVal_2521 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| Int) (v_ArrVal_2524 Int) (v_ArrVal_2503 Int) (v_ArrVal_2525 Int) (v_ArrVal_2506 Int) (v_ArrVal_2508 (Array Int Int)) (v_ArrVal_2505 Int) (v_ArrVal_2527 Int) (v_ArrVal_2529 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse19 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 v_ArrVal_2493)) |c_~#stored_elements~0.base| v_ArrVal_2494))) (let ((.cse10 (select .cse19 |c_~#queue~0.base|))) (let ((.cse9 (store .cse10 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2496)) (.cse15 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse18 (store (store .cse19 |c_~#queue~0.base| (store (store .cse9 .cse15 v_ArrVal_2497) .cse1 v_ArrVal_2499)) |c_~#stored_elements~0.base| v_ArrVal_2501))) (let ((.cse3 (select .cse18 |c_~#queue~0.base|))) (let ((.cse0 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_237| 4) |c_~#queue~0.offset|) v_ArrVal_2503))) (let ((.cse17 (store (store .cse18 |c_~#queue~0.base| (store (store .cse0 .cse15 v_ArrVal_2505) .cse1 v_ArrVal_2506)) |c_~#stored_elements~0.base| v_ArrVal_2508))) (let ((.cse13 (select .cse17 |c_~#queue~0.base|))) (let ((.cse7 (store .cse13 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| 4) |c_~#queue~0.offset|) v_ArrVal_2510))) (let ((.cse16 (store (store .cse17 |c_~#queue~0.base| (store (store .cse7 .cse15 v_ArrVal_2512) .cse1 v_ArrVal_2514)) |c_~#stored_elements~0.base| v_ArrVal_2515))) (let ((.cse11 (select .cse16 |c_~#queue~0.base|))) (let ((.cse6 (store .cse11 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2516))) (let ((.cse14 (store (store .cse16 |c_~#queue~0.base| (store (store .cse6 .cse15 v_ArrVal_2518) .cse1 v_ArrVal_2521)) |c_~#stored_elements~0.base| v_ArrVal_2522))) (let ((.cse8 (select .cse14 |c_~#queue~0.base|))) (let ((.cse12 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| 4) |c_~#queue~0.offset|) v_ArrVal_2524))) (let ((.cse2 (select (store (store .cse14 |c_~#queue~0.base| (store (store .cse12 .cse15 v_ArrVal_2525) .cse1 v_ArrVal_2527)) |c_~#stored_elements~0.base| v_ArrVal_2529) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2506) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| 4) |c_~#queue~0.offset|) v_ArrVal_2531) .cse1) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_237| (select .cse3 .cse1))) (< (+ (select .cse4 .cse5) 1) v_ArrVal_2493) (< (+ (select .cse6 .cse1) 1) v_ArrVal_2521) (< (+ (select .cse7 .cse1) 1) v_ArrVal_2514) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| (select .cse8 .cse1))) (< (+ (select .cse9 .cse1) 1) v_ArrVal_2499) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| (select .cse10 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| (select .cse11 .cse1))) (< (+ (select .cse12 .cse1) 1) v_ArrVal_2527) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| (select .cse13 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| (select .cse2 .cse1)))))))))))))))))))))) is different from false [2022-12-14 12:41:14,925 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2501 (Array Int Int)) (v_ArrVal_2522 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| Int) (v_ArrVal_2491 Int) (v_ArrVal_2493 Int) (v_ArrVal_2496 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2531 Int) (v_ArrVal_2497 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2499 Int) (v_ArrVal_2510 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_237| Int) (v_ArrVal_2512 Int) (v_ArrVal_2514 Int) (v_ArrVal_2516 Int) (v_ArrVal_2518 Int) (v_ArrVal_2515 (Array Int Int)) (v_ArrVal_2494 (Array Int Int)) (v_ArrVal_2521 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| Int) (v_ArrVal_2524 Int) (v_ArrVal_2503 Int) (v_ArrVal_2525 Int) (v_ArrVal_2506 Int) (v_ArrVal_2508 (Array Int Int)) (v_ArrVal_2505 Int) (v_ArrVal_2527 Int) (v_ArrVal_2529 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse19 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2491) .cse6 v_ArrVal_2493)) |c_~#stored_elements~0.base| v_ArrVal_2494))) (let ((.cse0 (select .cse19 |c_~#queue~0.base|))) (let ((.cse12 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2496)) (.cse15 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse18 (store (store .cse19 |c_~#queue~0.base| (store (store .cse12 .cse15 v_ArrVal_2497) .cse1 v_ArrVal_2499)) |c_~#stored_elements~0.base| v_ArrVal_2501))) (let ((.cse8 (select .cse18 |c_~#queue~0.base|))) (let ((.cse13 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_237| 4) |c_~#queue~0.offset|) v_ArrVal_2503))) (let ((.cse17 (store (store .cse18 |c_~#queue~0.base| (store (store .cse13 .cse15 v_ArrVal_2505) .cse1 v_ArrVal_2506)) |c_~#stored_elements~0.base| v_ArrVal_2508))) (let ((.cse4 (select .cse17 |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| 4) |c_~#queue~0.offset|) v_ArrVal_2510))) (let ((.cse16 (store (store .cse17 |c_~#queue~0.base| (store (store .cse3 .cse15 v_ArrVal_2512) .cse1 v_ArrVal_2514)) |c_~#stored_elements~0.base| v_ArrVal_2515))) (let ((.cse10 (select .cse16 |c_~#queue~0.base|))) (let ((.cse11 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2516))) (let ((.cse14 (store (store .cse16 |c_~#queue~0.base| (store (store .cse11 .cse15 v_ArrVal_2518) .cse1 v_ArrVal_2521)) |c_~#stored_elements~0.base| v_ArrVal_2522))) (let ((.cse2 (select .cse14 |c_~#queue~0.base|))) (let ((.cse9 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| 4) |c_~#queue~0.offset|) v_ArrVal_2524))) (let ((.cse7 (select (store (store .cse14 |c_~#queue~0.base| (store (store .cse9 .cse15 v_ArrVal_2525) .cse1 v_ArrVal_2527)) |c_~#stored_elements~0.base| v_ArrVal_2529) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| (select .cse2 .cse1))) (< (+ (select .cse3 .cse1) 1) v_ArrVal_2514) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| (select .cse4 .cse1))) (< (+ (select .cse5 .cse6) 1) v_ArrVal_2493) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| (select .cse7 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_237| (select .cse8 .cse1))) (< (+ (select .cse9 .cse1) 1) v_ArrVal_2527) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| (select .cse10 .cse1))) (< (select (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| 4) |c_~#queue~0.offset|) v_ArrVal_2531) .cse1) 20) (< (+ (select .cse11 .cse1) 1) v_ArrVal_2521) (< (+ (select .cse12 .cse1) 1) v_ArrVal_2499) (< (+ (select .cse13 .cse1) 1) v_ArrVal_2506)))))))))))))))))))) is different from false [2022-12-14 12:41:15,208 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2501 (Array Int Int)) (v_ArrVal_2522 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| Int) (v_ArrVal_2491 Int) (v_ArrVal_2493 Int) (v_ArrVal_2496 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2531 Int) (v_ArrVal_2497 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2499 Int) (v_ArrVal_2510 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_237| Int) (v_ArrVal_2512 Int) (v_ArrVal_2514 Int) (v_ArrVal_2516 Int) (v_ArrVal_2518 Int) (v_ArrVal_2515 (Array Int Int)) (v_ArrVal_2494 (Array Int Int)) (v_ArrVal_2488 Int) (v_ArrVal_2521 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| Int) (v_ArrVal_2524 Int) (v_ArrVal_2503 Int) (v_ArrVal_2525 Int) (v_ArrVal_2506 Int) (v_ArrVal_2508 (Array Int Int)) (v_ArrVal_2505 Int) (v_ArrVal_2527 Int) (v_ArrVal_2529 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2488)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse19 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2491) .cse3 v_ArrVal_2493)) |c_~#stored_elements~0.base| v_ArrVal_2494))) (let ((.cse8 (select .cse19 |c_~#queue~0.base|))) (let ((.cse11 (store .cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2496)) (.cse15 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse18 (store (store .cse19 |c_~#queue~0.base| (store (store .cse11 .cse15 v_ArrVal_2497) .cse1 v_ArrVal_2499)) |c_~#stored_elements~0.base| v_ArrVal_2501))) (let ((.cse12 (select .cse18 |c_~#queue~0.base|))) (let ((.cse13 (store .cse12 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_237| 4) |c_~#queue~0.offset|) v_ArrVal_2503))) (let ((.cse17 (store (store .cse18 |c_~#queue~0.base| (store (store .cse13 .cse15 v_ArrVal_2505) .cse1 v_ArrVal_2506)) |c_~#stored_elements~0.base| v_ArrVal_2508))) (let ((.cse5 (select .cse17 |c_~#queue~0.base|))) (let ((.cse0 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| 4) |c_~#queue~0.offset|) v_ArrVal_2510))) (let ((.cse16 (store (store .cse17 |c_~#queue~0.base| (store (store .cse0 .cse15 v_ArrVal_2512) .cse1 v_ArrVal_2514)) |c_~#stored_elements~0.base| v_ArrVal_2515))) (let ((.cse4 (select .cse16 |c_~#queue~0.base|))) (let ((.cse7 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2516))) (let ((.cse14 (store (store .cse16 |c_~#queue~0.base| (store (store .cse7 .cse15 v_ArrVal_2518) .cse1 v_ArrVal_2521)) |c_~#stored_elements~0.base| v_ArrVal_2522))) (let ((.cse10 (select .cse14 |c_~#queue~0.base|))) (let ((.cse9 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| 4) |c_~#queue~0.offset|) v_ArrVal_2524))) (let ((.cse6 (select (store (store .cse14 |c_~#queue~0.base| (store (store .cse9 .cse15 v_ArrVal_2525) .cse1 v_ArrVal_2527)) |c_~#stored_elements~0.base| v_ArrVal_2529) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2514) (< (+ (select .cse2 .cse3) 1) v_ArrVal_2493) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| (select .cse4 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| (select .cse5 .cse1))) (< (select (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| 4) |c_~#queue~0.offset|) v_ArrVal_2531) .cse1) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| (select .cse6 .cse1))) (< (+ (select .cse7 .cse1) 1) v_ArrVal_2521) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| (select .cse8 .cse1))) (< (+ (select .cse9 .cse1) 1) v_ArrVal_2527) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| (select .cse10 .cse1))) (< (+ (select .cse11 .cse1) 1) v_ArrVal_2499) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_237| (select .cse12 .cse1))) (< (+ (select .cse13 .cse1) 1) v_ArrVal_2506)))))))))))))))))))) is different from false [2022-12-14 12:41:30,233 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2501 (Array Int Int)) (v_ArrVal_2522 (Array Int Int)) (v_ArrVal_2487 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| Int) (v_ArrVal_2491 Int) (v_ArrVal_2493 Int) (v_ArrVal_2496 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2531 Int) (v_ArrVal_2497 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2499 Int) (v_ArrVal_2510 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_237| Int) (v_ArrVal_2512 Int) (v_ArrVal_2514 Int) (v_ArrVal_2516 Int) (v_ArrVal_2518 Int) (v_ArrVal_2515 (Array Int Int)) (v_ArrVal_2494 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2488 Int) (v_ArrVal_2521 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| Int) (v_ArrVal_2524 Int) (v_ArrVal_2503 Int) (v_ArrVal_2525 Int) (v_ArrVal_2506 Int) (v_ArrVal_2508 (Array Int Int)) (v_ArrVal_2505 Int) (v_ArrVal_2527 Int) (v_ArrVal_2529 (Array Int Int))) (let ((.cse20 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2487))) (let ((.cse2 (select .cse20 |c_~#queue~0.base|))) (let ((.cse9 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2488)) (.cse15 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse19 (store (store .cse20 |c_~#queue~0.base| (store (store .cse9 .cse15 v_ArrVal_2491) .cse1 v_ArrVal_2493)) |c_~#stored_elements~0.base| v_ArrVal_2494))) (let ((.cse11 (select .cse19 |c_~#queue~0.base|))) (let ((.cse3 (store .cse11 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2496))) (let ((.cse18 (store (store .cse19 |c_~#queue~0.base| (store (store .cse3 .cse15 v_ArrVal_2497) .cse1 v_ArrVal_2499)) |c_~#stored_elements~0.base| v_ArrVal_2501))) (let ((.cse12 (select .cse18 |c_~#queue~0.base|))) (let ((.cse5 (store .cse12 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_237| 4) |c_~#queue~0.offset|) v_ArrVal_2503))) (let ((.cse17 (store (store .cse18 |c_~#queue~0.base| (store (store .cse5 .cse15 v_ArrVal_2505) .cse1 v_ArrVal_2506)) |c_~#stored_elements~0.base| v_ArrVal_2508))) (let ((.cse13 (select .cse17 |c_~#queue~0.base|))) (let ((.cse4 (store .cse13 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| 4) |c_~#queue~0.offset|) v_ArrVal_2510))) (let ((.cse16 (store (store .cse17 |c_~#queue~0.base| (store (store .cse4 .cse15 v_ArrVal_2512) .cse1 v_ArrVal_2514)) |c_~#stored_elements~0.base| v_ArrVal_2515))) (let ((.cse7 (select .cse16 |c_~#queue~0.base|))) (let ((.cse10 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2516))) (let ((.cse14 (store (store .cse16 |c_~#queue~0.base| (store (store .cse10 .cse15 v_ArrVal_2518) .cse1 v_ArrVal_2521)) |c_~#stored_elements~0.base| v_ArrVal_2522))) (let ((.cse6 (select .cse14 |c_~#queue~0.base|))) (let ((.cse8 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| 4) |c_~#queue~0.offset|) v_ArrVal_2524))) (let ((.cse0 (select (store (store .cse14 |c_~#queue~0.base| (store (store .cse8 .cse15 v_ArrVal_2525) .cse1 v_ArrVal_2527)) |c_~#stored_elements~0.base| v_ArrVal_2529) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| 4) |c_~#queue~0.offset|) v_ArrVal_2531) .cse1) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse2 .cse1))) (< (+ (select .cse3 .cse1) 1) v_ArrVal_2499) (< (+ (select .cse4 .cse1) 1) v_ArrVal_2514) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| (select .cse0 .cse1))) (< (+ (select .cse5 .cse1) 1) v_ArrVal_2506) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| (select .cse6 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| (select .cse7 .cse1))) (< (+ (select .cse8 .cse1) 1) v_ArrVal_2527) (< (+ (select .cse9 .cse1) 1) v_ArrVal_2493) (< (+ (select .cse10 .cse1) 1) v_ArrVal_2521) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| (select .cse11 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_237| (select .cse12 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| (select .cse13 .cse1)))))))))))))))))))))))) is different from false [2022-12-14 12:41:30,414 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2501 (Array Int Int)) (v_ArrVal_2522 (Array Int Int)) (v_ArrVal_2487 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| Int) (v_ArrVal_2491 Int) (v_ArrVal_2493 Int) (v_ArrVal_2496 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2531 Int) (v_ArrVal_2497 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2499 Int) (v_ArrVal_2510 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_237| Int) (v_ArrVal_2512 Int) (v_ArrVal_2514 Int) (v_ArrVal_2516 Int) (v_ArrVal_2518 Int) (v_ArrVal_2515 (Array Int Int)) (v_ArrVal_2494 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2485 Int) (v_ArrVal_2488 Int) (v_ArrVal_2521 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| Int) (v_ArrVal_2524 Int) (v_ArrVal_2503 Int) (v_ArrVal_2525 Int) (v_ArrVal_2506 Int) (v_ArrVal_2508 (Array Int Int)) (v_ArrVal_2505 Int) (v_ArrVal_2527 Int) (v_ArrVal_2529 (Array Int Int))) (let ((.cse20 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2485)) |c_~#stored_elements~0.base| v_ArrVal_2487))) (let ((.cse13 (select .cse20 |c_~#queue~0.base|))) (let ((.cse4 (store .cse13 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2488)) (.cse15 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse19 (store (store .cse20 |c_~#queue~0.base| (store (store .cse4 .cse15 v_ArrVal_2491) .cse1 v_ArrVal_2493)) |c_~#stored_elements~0.base| v_ArrVal_2494))) (let ((.cse9 (select .cse19 |c_~#queue~0.base|))) (let ((.cse12 (store .cse9 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2496))) (let ((.cse18 (store (store .cse19 |c_~#queue~0.base| (store (store .cse12 .cse15 v_ArrVal_2497) .cse1 v_ArrVal_2499)) |c_~#stored_elements~0.base| v_ArrVal_2501))) (let ((.cse5 (select .cse18 |c_~#queue~0.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_237| 4) |c_~#queue~0.offset|) v_ArrVal_2503))) (let ((.cse17 (store (store .cse18 |c_~#queue~0.base| (store (store .cse2 .cse15 v_ArrVal_2505) .cse1 v_ArrVal_2506)) |c_~#stored_elements~0.base| v_ArrVal_2508))) (let ((.cse8 (select .cse17 |c_~#queue~0.base|))) (let ((.cse11 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| 4) |c_~#queue~0.offset|) v_ArrVal_2510))) (let ((.cse16 (store (store .cse17 |c_~#queue~0.base| (store (store .cse11 .cse15 v_ArrVal_2512) .cse1 v_ArrVal_2514)) |c_~#stored_elements~0.base| v_ArrVal_2515))) (let ((.cse6 (select .cse16 |c_~#queue~0.base|))) (let ((.cse7 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2516))) (let ((.cse14 (store (store .cse16 |c_~#queue~0.base| (store (store .cse7 .cse15 v_ArrVal_2518) .cse1 v_ArrVal_2521)) |c_~#stored_elements~0.base| v_ArrVal_2522))) (let ((.cse10 (select .cse14 |c_~#queue~0.base|))) (let ((.cse3 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| 4) |c_~#queue~0.offset|) v_ArrVal_2524))) (let ((.cse0 (select (store (store .cse14 |c_~#queue~0.base| (store (store .cse3 .cse15 v_ArrVal_2525) .cse1 v_ArrVal_2527)) |c_~#stored_elements~0.base| v_ArrVal_2529) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| 4) |c_~#queue~0.offset|) v_ArrVal_2531) .cse1) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2506) (< (+ (select .cse3 .cse1) 1) v_ArrVal_2527) (< (+ (select .cse4 .cse1) 1) v_ArrVal_2493) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_237| (select .cse5 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| (select .cse6 .cse1))) (< (+ (select .cse7 .cse1) 1) v_ArrVal_2521) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| (select .cse8 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| (select .cse9 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| (select .cse10 .cse1))) (< (+ (select .cse11 .cse1) 1) v_ArrVal_2514) (not (<= v_ArrVal_2485 (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) (< (+ (select .cse12 .cse1) 1) v_ArrVal_2499) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse13 .cse1)))))))))))))))))))))))) is different from false [2022-12-14 12:41:30,585 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2501 (Array Int Int)) (v_ArrVal_2522 (Array Int Int)) (v_ArrVal_2487 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| Int) (v_ArrVal_2491 Int) (v_ArrVal_2493 Int) (v_ArrVal_2496 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2531 Int) (v_ArrVal_2497 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2499 Int) (v_ArrVal_2510 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_237| Int) (v_ArrVal_2512 Int) (v_ArrVal_2514 Int) (v_ArrVal_2516 Int) (v_ArrVal_2518 Int) (v_ArrVal_2515 (Array Int Int)) (v_ArrVal_2494 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2485 Int) (v_ArrVal_2488 Int) (v_ArrVal_2521 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| Int) (v_ArrVal_2524 Int) (v_ArrVal_2503 Int) (v_ArrVal_2525 Int) (v_ArrVal_2506 Int) (v_ArrVal_2508 (Array Int Int)) (v_ArrVal_2505 Int) (v_ArrVal_2527 Int) (v_ArrVal_2529 (Array Int Int))) (let ((.cse13 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse14 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse22 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse13 .cse14 v_ArrVal_2485)) |c_~#stored_elements~0.base| v_ArrVal_2487))) (let ((.cse15 (select .cse22 |c_~#queue~0.base|))) (let ((.cse4 (store .cse15 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2488)) (.cse17 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse21 (store (store .cse22 |c_~#queue~0.base| (store (store .cse4 .cse17 v_ArrVal_2491) .cse1 v_ArrVal_2493)) |c_~#stored_elements~0.base| v_ArrVal_2494))) (let ((.cse9 (select .cse21 |c_~#queue~0.base|))) (let ((.cse12 (store .cse9 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2496))) (let ((.cse20 (store (store .cse21 |c_~#queue~0.base| (store (store .cse12 .cse17 v_ArrVal_2497) .cse1 v_ArrVal_2499)) |c_~#stored_elements~0.base| v_ArrVal_2501))) (let ((.cse5 (select .cse20 |c_~#queue~0.base|))) (let ((.cse2 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_237| 4) |c_~#queue~0.offset|) v_ArrVal_2503))) (let ((.cse19 (store (store .cse20 |c_~#queue~0.base| (store (store .cse2 .cse17 v_ArrVal_2505) .cse1 v_ArrVal_2506)) |c_~#stored_elements~0.base| v_ArrVal_2508))) (let ((.cse8 (select .cse19 |c_~#queue~0.base|))) (let ((.cse11 (store .cse8 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| 4) |c_~#queue~0.offset|) v_ArrVal_2510))) (let ((.cse18 (store (store .cse19 |c_~#queue~0.base| (store (store .cse11 .cse17 v_ArrVal_2512) .cse1 v_ArrVal_2514)) |c_~#stored_elements~0.base| v_ArrVal_2515))) (let ((.cse6 (select .cse18 |c_~#queue~0.base|))) (let ((.cse7 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2516))) (let ((.cse16 (store (store .cse18 |c_~#queue~0.base| (store (store .cse7 .cse17 v_ArrVal_2518) .cse1 v_ArrVal_2521)) |c_~#stored_elements~0.base| v_ArrVal_2522))) (let ((.cse10 (select .cse16 |c_~#queue~0.base|))) (let ((.cse3 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| 4) |c_~#queue~0.offset|) v_ArrVal_2524))) (let ((.cse0 (select (store (store .cse16 |c_~#queue~0.base| (store (store .cse3 .cse17 v_ArrVal_2525) .cse1 v_ArrVal_2527)) |c_~#stored_elements~0.base| v_ArrVal_2529) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| 4) |c_~#queue~0.offset|) v_ArrVal_2531) .cse1) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2506) (< (+ (select .cse3 .cse1) 1) v_ArrVal_2527) (< (+ (select .cse4 .cse1) 1) v_ArrVal_2493) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_237| (select .cse5 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| (select .cse6 .cse1))) (< (+ (select .cse7 .cse1) 1) v_ArrVal_2521) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| (select .cse8 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| (select .cse9 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| (select .cse10 .cse1))) (< (+ (select .cse11 .cse1) 1) v_ArrVal_2514) (< (+ (select .cse12 .cse1) 1) v_ArrVal_2499) (< (+ (select .cse13 .cse14) 1) v_ArrVal_2485) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse15 .cse1))))))))))))))))))))))))) is different from false [2022-12-14 12:41:30,952 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2501 (Array Int Int)) (v_ArrVal_2522 (Array Int Int)) (v_ArrVal_2487 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| Int) (v_ArrVal_2491 Int) (v_ArrVal_2493 Int) (v_ArrVal_2496 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2531 Int) (v_ArrVal_2497 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2499 Int) (v_ArrVal_2510 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_237| Int) (v_ArrVal_2512 Int) (v_ArrVal_2514 Int) (v_ArrVal_2516 Int) (v_ArrVal_2518 Int) (v_ArrVal_2515 (Array Int Int)) (v_ArrVal_2494 (Array Int Int)) (v_ArrVal_2483 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2485 Int) (v_ArrVal_2488 Int) (v_ArrVal_2521 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| Int) (v_ArrVal_2524 Int) (v_ArrVal_2503 Int) (v_ArrVal_2525 Int) (v_ArrVal_2506 Int) (v_ArrVal_2508 (Array Int Int)) (v_ArrVal_2505 Int) (v_ArrVal_2527 Int) (v_ArrVal_2529 (Array Int Int))) (let ((.cse14 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse15 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse22 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse14 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2483) .cse15 v_ArrVal_2485)) |c_~#stored_elements~0.base| v_ArrVal_2487))) (let ((.cse10 (select .cse22 |c_~#queue~0.base|))) (let ((.cse9 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2488)) (.cse17 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse21 (store (store .cse22 |c_~#queue~0.base| (store (store .cse9 .cse17 v_ArrVal_2491) .cse1 v_ArrVal_2493)) |c_~#stored_elements~0.base| v_ArrVal_2494))) (let ((.cse2 (select .cse21 |c_~#queue~0.base|))) (let ((.cse4 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2496))) (let ((.cse20 (store (store .cse21 |c_~#queue~0.base| (store (store .cse4 .cse17 v_ArrVal_2497) .cse1 v_ArrVal_2499)) |c_~#stored_elements~0.base| v_ArrVal_2501))) (let ((.cse13 (select .cse20 |c_~#queue~0.base|))) (let ((.cse12 (store .cse13 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_237| 4) |c_~#queue~0.offset|) v_ArrVal_2503))) (let ((.cse19 (store (store .cse20 |c_~#queue~0.base| (store (store .cse12 .cse17 v_ArrVal_2505) .cse1 v_ArrVal_2506)) |c_~#stored_elements~0.base| v_ArrVal_2508))) (let ((.cse5 (select .cse19 |c_~#queue~0.base|))) (let ((.cse8 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| 4) |c_~#queue~0.offset|) v_ArrVal_2510))) (let ((.cse18 (store (store .cse19 |c_~#queue~0.base| (store (store .cse8 .cse17 v_ArrVal_2512) .cse1 v_ArrVal_2514)) |c_~#stored_elements~0.base| v_ArrVal_2515))) (let ((.cse7 (select .cse18 |c_~#queue~0.base|))) (let ((.cse0 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2516))) (let ((.cse16 (store (store .cse18 |c_~#queue~0.base| (store (store .cse0 .cse17 v_ArrVal_2518) .cse1 v_ArrVal_2521)) |c_~#stored_elements~0.base| v_ArrVal_2522))) (let ((.cse3 (select .cse16 |c_~#queue~0.base|))) (let ((.cse11 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| 4) |c_~#queue~0.offset|) v_ArrVal_2524))) (let ((.cse6 (select (store (store .cse16 |c_~#queue~0.base| (store (store .cse11 .cse17 v_ArrVal_2525) .cse1 v_ArrVal_2527)) |c_~#stored_elements~0.base| v_ArrVal_2529) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_2521) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| (select .cse3 .cse1))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_2499) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| (select .cse5 .cse1))) (< (select (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| 4) |c_~#queue~0.offset|) v_ArrVal_2531) .cse1) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| (select .cse7 .cse1))) (< (+ (select .cse8 .cse1) 1) v_ArrVal_2514) (< (+ (select .cse9 .cse1) 1) v_ArrVal_2493) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse10 .cse1))) (< (+ (select .cse11 .cse1) 1) v_ArrVal_2527) (< (+ (select .cse12 .cse1) 1) v_ArrVal_2506) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_237| (select .cse13 .cse1))) (< (+ (select .cse14 .cse15) 1) v_ArrVal_2485) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| (select .cse6 .cse1))))))))))))))))))))))))) is different from false [2022-12-14 12:41:31,329 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2501 (Array Int Int)) (v_ArrVal_2522 (Array Int Int)) (v_ArrVal_2487 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| Int) (v_ArrVal_2491 Int) (v_ArrVal_2493 Int) (v_ArrVal_2496 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| Int) (v_ArrVal_2531 Int) (v_ArrVal_2497 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2499 Int) (v_ArrVal_2510 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_237| Int) (v_ArrVal_2512 Int) (v_ArrVal_2514 Int) (v_ArrVal_2516 Int) (v_ArrVal_2518 Int) (v_ArrVal_2515 (Array Int Int)) (v_ArrVal_2494 (Array Int Int)) (v_ArrVal_2483 Int) (v_ArrVal_2482 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| Int) (v_ArrVal_2485 Int) (v_ArrVal_2488 Int) (v_ArrVal_2521 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| Int) (v_ArrVal_2524 Int) (v_ArrVal_2503 Int) (v_ArrVal_2525 Int) (v_ArrVal_2506 Int) (v_ArrVal_2508 (Array Int Int)) (v_ArrVal_2505 Int) (v_ArrVal_2527 Int) (v_ArrVal_2529 (Array Int Int))) (let ((.cse8 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2482)) (.cse9 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse22 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse8 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2483) .cse9 v_ArrVal_2485)) |c_~#stored_elements~0.base| v_ArrVal_2487))) (let ((.cse7 (select .cse22 |c_~#queue~0.base|))) (let ((.cse5 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| 4) |c_~#queue~0.offset|) v_ArrVal_2488)) (.cse17 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse21 (store (store .cse22 |c_~#queue~0.base| (store (store .cse5 .cse17 v_ArrVal_2491) .cse1 v_ArrVal_2493)) |c_~#stored_elements~0.base| v_ArrVal_2494))) (let ((.cse4 (select .cse21 |c_~#queue~0.base|))) (let ((.cse10 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2496))) (let ((.cse20 (store (store .cse21 |c_~#queue~0.base| (store (store .cse10 .cse17 v_ArrVal_2497) .cse1 v_ArrVal_2499)) |c_~#stored_elements~0.base| v_ArrVal_2501))) (let ((.cse12 (select .cse20 |c_~#queue~0.base|))) (let ((.cse3 (store .cse12 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_237| 4) |c_~#queue~0.offset|) v_ArrVal_2503))) (let ((.cse19 (store (store .cse20 |c_~#queue~0.base| (store (store .cse3 .cse17 v_ArrVal_2505) .cse1 v_ArrVal_2506)) |c_~#stored_elements~0.base| v_ArrVal_2508))) (let ((.cse13 (select .cse19 |c_~#queue~0.base|))) (let ((.cse14 (store .cse13 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| 4) |c_~#queue~0.offset|) v_ArrVal_2510))) (let ((.cse18 (store (store .cse19 |c_~#queue~0.base| (store (store .cse14 .cse17 v_ArrVal_2512) .cse1 v_ArrVal_2514)) |c_~#stored_elements~0.base| v_ArrVal_2515))) (let ((.cse15 (select .cse18 |c_~#queue~0.base|))) (let ((.cse2 (store .cse15 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| 4) |c_~#queue~0.offset|) v_ArrVal_2516))) (let ((.cse16 (store (store .cse18 |c_~#queue~0.base| (store (store .cse2 .cse17 v_ArrVal_2518) .cse1 v_ArrVal_2521)) |c_~#stored_elements~0.base| v_ArrVal_2522))) (let ((.cse6 (select .cse16 |c_~#queue~0.base|))) (let ((.cse11 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| 4) |c_~#queue~0.offset|) v_ArrVal_2524))) (let ((.cse0 (select (store (store .cse16 |c_~#queue~0.base| (store (store .cse11 .cse17 v_ArrVal_2525) .cse1 v_ArrVal_2527)) |c_~#stored_elements~0.base| v_ArrVal_2529) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_2521) (< (+ (select .cse3 .cse1) 1) v_ArrVal_2506) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| (select .cse4 .cse1))) (< (+ (select .cse5 .cse1) 1) v_ArrVal_2493) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_231| (select .cse6 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_241| (select .cse7 .cse1))) (< (+ (select .cse8 .cse9) 1) v_ArrVal_2485) (< (+ (select .cse10 .cse1) 1) v_ArrVal_2499) (< (+ (select .cse11 .cse1) 1) v_ArrVal_2527) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_229| 4) |c_~#queue~0.offset|) v_ArrVal_2531) .cse1) 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_237| (select .cse12 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_235| (select .cse13 .cse1))) (< (+ (select .cse14 .cse1) 1) v_ArrVal_2514) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_233| (select .cse15 .cse1))))))))))))))))))))))))) is different from false [2022-12-14 12:42:04,565 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:42:04,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19203 treesize of output 14113 [2022-12-14 12:42:08,245 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:42:08,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29171 treesize of output 29159 [2022-12-14 12:42:08,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15818 treesize of output 14794 [2022-12-14 12:42:08,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10526 treesize of output 10518 [2022-12-14 12:42:08,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18574 treesize of output 18062 [2022-12-14 12:42:08,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19124 treesize of output 18868 [2022-12-14 12:42:09,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18667 treesize of output 18539 [2022-12-14 12:42:09,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17923 treesize of output 17859 [2022-12-14 12:42:09,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17216 treesize of output 17184 [2022-12-14 12:42:09,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16656 treesize of output 16640 [2022-12-14 12:42:09,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-12-14 12:42:10,308 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 12:42:10,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 7999 treesize of output 7995 [2022-12-14 12:44:27,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1435 backedges. 403 proven. 89 refuted. 176 times theorem prover too weak. 293 trivial. 474 not checked. [2022-12-14 12:44:27,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328684687] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 12:44:27,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1227374663] [2022-12-14 12:44:27,585 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 12:44:27,585 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 12:44:27,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 49] total 117 [2022-12-14 12:44:27,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305528952] [2022-12-14 12:44:27,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 12:44:27,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 118 states [2022-12-14 12:44:27,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 12:44:27,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2022-12-14 12:44:27,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2333, Invalid=6385, Unknown=304, NotChecked=4784, Total=13806 [2022-12-14 12:44:27,594 INFO L87 Difference]: Start difference. First operand 4000 states and 7058 transitions. Second operand has 118 states, 118 states have (on average 2.330508474576271) internal successors, (275), 117 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 12:44:52,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 12:44:54,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 12:45:06,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 12:45:23,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 12:45:51,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 12:45:53,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 12:46:05,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 12:46:39,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 12:46:42,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 12:46:44,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 12:47:28,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 12:47:30,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 12:47:54,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 12:47:56,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 12:48:22,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 12:48:58,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 12:49:25,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 12:49:52,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 12:51:19,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 12:53:15,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]