./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ceb4cfb737a49cea9ea1be451c16ebb29f48ae611a8c94fc546ca2e3471f0eb3 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:15:25,000 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:15:25,131 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 21:15:25,142 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:15:25,143 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:15:25,191 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:15:25,192 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:15:25,192 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:15:25,194 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:15:25,199 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:15:25,201 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:15:25,202 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:15:25,202 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:15:25,205 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:15:25,205 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 21:15:25,206 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:15:25,206 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 21:15:25,207 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:15:25,207 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:15:25,208 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 21:15:25,208 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:15:25,209 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 21:15:25,209 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:15:25,210 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 21:15:25,210 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:15:25,211 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:15:25,212 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:15:25,213 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:15:25,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:15:25,214 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:15:25,215 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:15:25,216 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 21:15:25,216 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 21:15:25,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 21:15:25,217 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 21:15:25,217 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 21:15:25,217 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 21:15:25,218 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:15:25,218 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 21:15:25,218 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/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_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP 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 -> Automizer 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 -> ceb4cfb737a49cea9ea1be451c16ebb29f48ae611a8c94fc546ca2e3471f0eb3 [2023-11-06 21:15:25,573 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:15:25,601 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:15:25,604 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:15:25,606 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:15:25,606 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:15:25,608 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c [2023-11-06 21:15:29,093 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:15:29,455 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:15:29,455 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c [2023-11-06 21:15:29,467 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/data/fed884e9a/e15f8aba2d1a49ceb25827a85483dfa2/FLAGe6d100f06 [2023-11-06 21:15:29,490 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/data/fed884e9a/e15f8aba2d1a49ceb25827a85483dfa2 [2023-11-06 21:15:29,498 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:15:29,501 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:15:29,507 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:15:29,508 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:15:29,514 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:15:29,518 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:15:29" (1/1) ... [2023-11-06 21:15:29,519 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d38f202 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:29, skipping insertion in model container [2023-11-06 21:15:29,519 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:15:29" (1/1) ... [2023-11-06 21:15:29,560 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:15:29,849 WARN L240 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_97571d74-dd22-43c3-a9d2-c6854dc53ec8/sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c[2586,2599] [2023-11-06 21:15:29,861 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:15:29,879 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:15:29,930 WARN L240 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_97571d74-dd22-43c3-a9d2-c6854dc53ec8/sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c[2586,2599] [2023-11-06 21:15:29,938 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:15:29,952 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 21:15:29,953 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 21:15:29,963 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:15:29,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:29 WrapperNode [2023-11-06 21:15:29,964 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:15:29,971 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:15:29,971 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:15:29,972 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:15:29,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:29" (1/1) ... [2023-11-06 21:15:29,992 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:29" (1/1) ... [2023-11-06 21:15:30,022 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 105 [2023-11-06 21:15:30,023 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:15:30,024 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:15:30,024 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:15:30,024 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:15:30,035 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:29" (1/1) ... [2023-11-06 21:15:30,035 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:29" (1/1) ... [2023-11-06 21:15:30,040 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:29" (1/1) ... [2023-11-06 21:15:30,040 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:29" (1/1) ... [2023-11-06 21:15:30,052 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:29" (1/1) ... [2023-11-06 21:15:30,058 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:29" (1/1) ... [2023-11-06 21:15:30,061 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:29" (1/1) ... [2023-11-06 21:15:30,063 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:29" (1/1) ... [2023-11-06 21:15:30,067 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:15:30,068 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:15:30,068 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:15:30,069 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:15:30,070 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:29" (1/1) ... [2023-11-06 21:15:30,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:15:30,092 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:15:30,110 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 21:15:30,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 21:15:30,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:15:30,161 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-06 21:15:30,162 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-06 21:15:30,162 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-06 21:15:30,162 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-06 21:15:30,163 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-06 21:15:30,163 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-06 21:15:30,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 21:15:30,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 21:15:30,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 21:15:30,164 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 21:15:30,166 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 21:15:30,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 21:15:30,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:15:30,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:15:30,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 21:15:30,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 21:15:30,169 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 21:15:30,291 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:15:30,294 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:15:30,676 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:15:30,789 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:15:30,789 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-06 21:15:30,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:15:30 BoogieIcfgContainer [2023-11-06 21:15:30,794 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:15:30,799 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:15:30,800 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:15:30,804 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:15:30,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:15:29" (1/3) ... [2023-11-06 21:15:30,807 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2887fc2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:15:30, skipping insertion in model container [2023-11-06 21:15:30,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:29" (2/3) ... [2023-11-06 21:15:30,809 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2887fc2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:15:30, skipping insertion in model container [2023-11-06 21:15:30,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:15:30" (3/3) ... [2023-11-06 21:15:30,818 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array-hom.wvr.c [2023-11-06 21:15:30,830 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-06 21:15:30,843 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:15:30,844 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 21:15:30,844 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 21:15:30,979 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-06 21:15:31,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 157 transitions, 335 flow [2023-11-06 21:15:31,199 INFO L124 PetriNetUnfolderBase]: 12/154 cut-off events. [2023-11-06 21:15:31,199 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-06 21:15:31,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 154 events. 12/154 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 101 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 115. Up to 2 conditions per place. [2023-11-06 21:15:31,208 INFO L82 GeneralOperation]: Start removeDead. Operand has 155 places, 157 transitions, 335 flow [2023-11-06 21:15:31,216 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 143 transitions, 304 flow [2023-11-06 21:15:31,220 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 21:15:31,233 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 143 transitions, 304 flow [2023-11-06 21:15:31,237 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 143 transitions, 304 flow [2023-11-06 21:15:31,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 143 transitions, 304 flow [2023-11-06 21:15:31,287 INFO L124 PetriNetUnfolderBase]: 12/143 cut-off events. [2023-11-06 21:15:31,288 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-06 21:15:31,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 143 events. 12/143 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 100 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 115. Up to 2 conditions per place. [2023-11-06 21:15:31,293 INFO L119 LiptonReduction]: Number of co-enabled transitions 1518 [2023-11-06 21:15:38,995 INFO L134 LiptonReduction]: Checked pairs total: 1568 [2023-11-06 21:15:38,996 INFO L136 LiptonReduction]: Total number of compositions: 145 [2023-11-06 21:15:39,016 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:15:39,024 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=PETRI_NET, 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;@7a55e2f7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 21:15:39,025 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-06 21:15:39,033 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 21:15:39,034 INFO L124 PetriNetUnfolderBase]: 4/23 cut-off events. [2023-11-06 21:15:39,034 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-06 21:15:39,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:15:39,035 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:15:39,036 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 21:15:39,042 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:39,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1534260981, now seen corresponding path program 1 times [2023-11-06 21:15:39,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:39,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711776488] [2023-11-06 21:15:39,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:39,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:39,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:39,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:15:39,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:39,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711776488] [2023-11-06 21:15:39,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711776488] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:39,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:39,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 21:15:39,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673607192] [2023-11-06 21:15:39,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:39,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:15:39,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:39,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:15:39,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:15:39,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 302 [2023-11-06 21:15:39,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:39,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:15:39,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 302 [2023-11-06 21:15:39,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:15:40,011 INFO L124 PetriNetUnfolderBase]: 360/508 cut-off events. [2023-11-06 21:15:40,012 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-11-06 21:15:40,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1068 conditions, 508 events. 360/508 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1606 event pairs, 39 based on Foata normal form. 1/307 useless extension candidates. Maximal degree in co-relation 803. Up to 421 conditions per place. [2023-11-06 21:15:40,027 INFO L140 encePairwiseOnDemand]: 297/302 looper letters, 32 selfloop transitions, 4 changer transitions 1/40 dead transitions. [2023-11-06 21:15:40,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 40 transitions, 187 flow [2023-11-06 21:15:40,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:15:40,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 21:15:40,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 455 transitions. [2023-11-06 21:15:40,056 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5022075055187638 [2023-11-06 21:15:40,057 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 455 transitions. [2023-11-06 21:15:40,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 455 transitions. [2023-11-06 21:15:40,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:15:40,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 455 transitions. [2023-11-06 21:15:40,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:40,079 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:40,080 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:40,083 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 66 flow. Second operand 3 states and 455 transitions. [2023-11-06 21:15:40,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 40 transitions, 187 flow [2023-11-06 21:15:40,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 40 transitions, 165 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-06 21:15:40,093 INFO L231 Difference]: Finished difference. Result has 27 places, 27 transitions, 80 flow [2023-11-06 21:15:40,095 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=27, PETRI_TRANSITIONS=27} [2023-11-06 21:15:40,099 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2023-11-06 21:15:40,100 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 27 transitions, 80 flow [2023-11-06 21:15:40,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:40,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:15:40,101 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:15:40,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 21:15:40,102 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 21:15:40,103 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:40,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1137503888, now seen corresponding path program 1 times [2023-11-06 21:15:40,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:40,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692607945] [2023-11-06 21:15:40,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:40,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:40,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:40,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:15:40,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:40,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692607945] [2023-11-06 21:15:40,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692607945] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:40,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:40,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:15:40,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292689198] [2023-11-06 21:15:40,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:40,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:15:40,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:40,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:15:40,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:15:40,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 302 [2023-11-06 21:15:40,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 27 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:40,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:15:40,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 302 [2023-11-06 21:15:40,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:15:40,627 INFO L124 PetriNetUnfolderBase]: 326/475 cut-off events. [2023-11-06 21:15:40,627 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-11-06 21:15:40,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1181 conditions, 475 events. 326/475 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1599 event pairs, 142 based on Foata normal form. 0/448 useless extension candidates. Maximal degree in co-relation 424. Up to 460 conditions per place. [2023-11-06 21:15:40,633 INFO L140 encePairwiseOnDemand]: 299/302 looper letters, 23 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2023-11-06 21:15:40,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 28 transitions, 132 flow [2023-11-06 21:15:40,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:15:40,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 21:15:40,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2023-11-06 21:15:40,637 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4624724061810154 [2023-11-06 21:15:40,638 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 419 transitions. [2023-11-06 21:15:40,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 419 transitions. [2023-11-06 21:15:40,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:15:40,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 419 transitions. [2023-11-06 21:15:40,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:40,645 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:40,646 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 302.0) internal successors, (1208), 4 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:40,646 INFO L175 Difference]: Start difference. First operand has 27 places, 27 transitions, 80 flow. Second operand 3 states and 419 transitions. [2023-11-06 21:15:40,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 28 transitions, 132 flow [2023-11-06 21:15:40,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 28 transitions, 128 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 21:15:40,649 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 88 flow [2023-11-06 21:15:40,649 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2023-11-06 21:15:40,650 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -1 predicate places. [2023-11-06 21:15:40,651 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 28 transitions, 88 flow [2023-11-06 21:15:40,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:40,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:15:40,652 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:15:40,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 21:15:40,652 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 21:15:40,653 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:40,653 INFO L85 PathProgramCache]: Analyzing trace with hash -832366392, now seen corresponding path program 1 times [2023-11-06 21:15:40,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:40,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6023031] [2023-11-06 21:15:40,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:40,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:40,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:40,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 21:15:40,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:40,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6023031] [2023-11-06 21:15:40,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6023031] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:40,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:40,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:15:40,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896256406] [2023-11-06 21:15:40,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:40,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:15:40,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:40,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:15:40,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:15:40,806 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 302 [2023-11-06 21:15:40,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 28 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:40,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:15:40,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 302 [2023-11-06 21:15:40,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:15:40,974 INFO L124 PetriNetUnfolderBase]: 396/564 cut-off events. [2023-11-06 21:15:40,974 INFO L125 PetriNetUnfolderBase]: For 143/143 co-relation queries the response was YES. [2023-11-06 21:15:40,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1371 conditions, 564 events. 396/564 cut-off events. For 143/143 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1925 event pairs, 126 based on Foata normal form. 38/597 useless extension candidates. Maximal degree in co-relation 1358. Up to 425 conditions per place. [2023-11-06 21:15:40,980 INFO L140 encePairwiseOnDemand]: 298/302 looper letters, 34 selfloop transitions, 4 changer transitions 0/40 dead transitions. [2023-11-06 21:15:40,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 40 transitions, 200 flow [2023-11-06 21:15:40,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 21:15:40,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 21:15:40,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 553 transitions. [2023-11-06 21:15:40,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45778145695364236 [2023-11-06 21:15:40,985 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 553 transitions. [2023-11-06 21:15:40,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 553 transitions. [2023-11-06 21:15:40,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:15:40,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 553 transitions. [2023-11-06 21:15:40,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.25) internal successors, (553), 4 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:40,992 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 302.0) internal successors, (1510), 5 states have internal predecessors, (1510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:40,993 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 302.0) internal successors, (1510), 5 states have internal predecessors, (1510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:40,994 INFO L175 Difference]: Start difference. First operand has 29 places, 28 transitions, 88 flow. Second operand 4 states and 553 transitions. [2023-11-06 21:15:40,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 40 transitions, 200 flow [2023-11-06 21:15:40,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 40 transitions, 194 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-06 21:15:40,997 INFO L231 Difference]: Finished difference. Result has 32 places, 29 transitions, 101 flow [2023-11-06 21:15:40,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=101, PETRI_PLACES=32, PETRI_TRANSITIONS=29} [2023-11-06 21:15:40,998 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 2 predicate places. [2023-11-06 21:15:40,999 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 29 transitions, 101 flow [2023-11-06 21:15:40,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:41,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:15:41,000 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:15:41,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 21:15:41,000 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 21:15:41,001 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:41,001 INFO L85 PathProgramCache]: Analyzing trace with hash -411053538, now seen corresponding path program 1 times [2023-11-06 21:15:41,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:41,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613065878] [2023-11-06 21:15:41,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:41,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:41,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:41,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:15:41,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:41,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613065878] [2023-11-06 21:15:41,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613065878] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:15:41,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426070091] [2023-11-06 21:15:41,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:41,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:15:41,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:15:41,189 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:15:41,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 21:15:41,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:41,318 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 21:15:41,324 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:15:41,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:15:41,393 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:15:41,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:15:41,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426070091] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-06 21:15:41,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:15:41,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2023-11-06 21:15:41,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519141755] [2023-11-06 21:15:41,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:41,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:15:41,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:41,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:15:41,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-06 21:15:41,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 302 [2023-11-06 21:15:41,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 29 transitions, 101 flow. Second operand has 5 states, 5 states have (on average 128.0) internal successors, (640), 5 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:41,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:15:41,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 302 [2023-11-06 21:15:41,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:15:41,696 INFO L124 PetriNetUnfolderBase]: 324/474 cut-off events. [2023-11-06 21:15:41,696 INFO L125 PetriNetUnfolderBase]: For 253/283 co-relation queries the response was YES. [2023-11-06 21:15:41,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1310 conditions, 474 events. 324/474 cut-off events. For 253/283 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1642 event pairs, 119 based on Foata normal form. 60/526 useless extension candidates. Maximal degree in co-relation 1291. Up to 361 conditions per place. [2023-11-06 21:15:41,704 INFO L140 encePairwiseOnDemand]: 297/302 looper letters, 35 selfloop transitions, 5 changer transitions 0/42 dead transitions. [2023-11-06 21:15:41,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 231 flow [2023-11-06 21:15:41,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:15:41,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 21:15:41,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 654 transitions. [2023-11-06 21:15:41,709 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.433112582781457 [2023-11-06 21:15:41,709 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 654 transitions. [2023-11-06 21:15:41,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 654 transitions. [2023-11-06 21:15:41,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:15:41,710 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 654 transitions. [2023-11-06 21:15:41,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.8) internal successors, (654), 5 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:41,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 302.0) internal successors, (1812), 6 states have internal predecessors, (1812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:41,720 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 302.0) internal successors, (1812), 6 states have internal predecessors, (1812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:41,721 INFO L175 Difference]: Start difference. First operand has 32 places, 29 transitions, 101 flow. Second operand 5 states and 654 transitions. [2023-11-06 21:15:41,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 231 flow [2023-11-06 21:15:41,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 42 transitions, 216 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-06 21:15:41,725 INFO L231 Difference]: Finished difference. Result has 35 places, 30 transitions, 113 flow [2023-11-06 21:15:41,726 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=113, PETRI_PLACES=35, PETRI_TRANSITIONS=30} [2023-11-06 21:15:41,728 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 5 predicate places. [2023-11-06 21:15:41,731 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 113 flow [2023-11-06 21:15:41,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.0) internal successors, (640), 5 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:41,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:15:41,733 INFO L208 CegarLoopForPetriNet]: 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] [2023-11-06 21:15:41,746 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 21:15:41,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:15:41,941 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 21:15:41,941 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:41,941 INFO L85 PathProgramCache]: Analyzing trace with hash 698203757, now seen corresponding path program 1 times [2023-11-06 21:15:41,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:41,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17264002] [2023-11-06 21:15:41,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:41,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:42,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:43,588 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:15:43,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:43,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17264002] [2023-11-06 21:15:43,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17264002] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:15:43,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132388757] [2023-11-06 21:15:43,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:43,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:15:43,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:15:43,591 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:15:43,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 21:15:43,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:43,709 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-06 21:15:43,712 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:15:44,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:15:44,376 INFO L351 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 38 treesize of output 29 [2023-11-06 21:15:44,568 INFO L351 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 58 treesize of output 34 [2023-11-06 21:15:44,728 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:15:44,729 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:15:45,344 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~min2~0 c_~min1~0)) (.cse1 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (or (and .cse0 (<= c_~min2~0 c_~min3~0)) (forall ((v_ArrVal_109 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_109) c_~A~0.base) .cse1) c_~min3~0)) (and (= c_~min1~0 c_~min3~0) (<= (+ c_~min3~0 1) c_~min2~0))) (forall ((v_ArrVal_109 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_109) c_~A~0.base) .cse1))) (let ((.cse3 (+ .cse2 1))) (or (= c_~min1~0 .cse2) (< c_~min2~0 .cse3) (< c_~min3~0 .cse3))))) (or .cse0 (and (forall ((v_ArrVal_109 (Array Int Int))) (let ((.cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_109) c_~A~0.base) .cse1))) (or (< .cse4 c_~min2~0) (< c_~min3~0 (+ .cse4 1))))) (forall ((v_ArrVal_109 (Array Int Int))) (let ((.cse5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_109) c_~A~0.base) .cse1))) (or (= c_~min1~0 .cse5) (< c_~min3~0 (+ .cse5 1))))))))) is different from false [2023-11-06 21:15:45,747 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:15:45,748 INFO L351 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 322 treesize of output 242 [2023-11-06 21:15:45,781 INFO L351 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 202 treesize of output 190 [2023-11-06 21:15:45,799 INFO L351 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 190 treesize of output 178 [2023-11-06 21:15:45,816 INFO L351 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 178 treesize of output 172 [2023-11-06 21:15:45,831 INFO L351 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 172 treesize of output 154 [2023-11-06 21:15:46,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:15:46,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132388757] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:15:46,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:15:46,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2023-11-06 21:15:46,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523288406] [2023-11-06 21:15:46,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:15:46,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-06 21:15:46,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:46,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-06 21:15:46,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=380, Unknown=1, NotChecked=40, Total=506 [2023-11-06 21:15:47,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 302 [2023-11-06 21:15:47,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 113 flow. Second operand has 23 states, 23 states have (on average 87.34782608695652) internal successors, (2009), 23 states have internal predecessors, (2009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:47,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:15:47,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 302 [2023-11-06 21:15:47,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:15:48,384 INFO L124 PetriNetUnfolderBase]: 643/936 cut-off events. [2023-11-06 21:15:48,384 INFO L125 PetriNetUnfolderBase]: For 549/549 co-relation queries the response was YES. [2023-11-06 21:15:48,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2701 conditions, 936 events. 643/936 cut-off events. For 549/549 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3584 event pairs, 58 based on Foata normal form. 1/935 useless extension candidates. Maximal degree in co-relation 2392. Up to 639 conditions per place. [2023-11-06 21:15:48,395 INFO L140 encePairwiseOnDemand]: 292/302 looper letters, 72 selfloop transitions, 24 changer transitions 1/98 dead transitions. [2023-11-06 21:15:48,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 98 transitions, 524 flow [2023-11-06 21:15:48,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 21:15:48,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-06 21:15:48,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 946 transitions. [2023-11-06 21:15:48,403 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3132450331125828 [2023-11-06 21:15:48,404 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 946 transitions. [2023-11-06 21:15:48,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 946 transitions. [2023-11-06 21:15:48,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:15:48,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 946 transitions. [2023-11-06 21:15:48,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 94.6) internal successors, (946), 10 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:48,418 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 302.0) internal successors, (3322), 11 states have internal predecessors, (3322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:48,420 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 302.0) internal successors, (3322), 11 states have internal predecessors, (3322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:48,420 INFO L175 Difference]: Start difference. First operand has 35 places, 30 transitions, 113 flow. Second operand 10 states and 946 transitions. [2023-11-06 21:15:48,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 98 transitions, 524 flow [2023-11-06 21:15:48,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 98 transitions, 508 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-06 21:15:48,430 INFO L231 Difference]: Finished difference. Result has 45 places, 49 transitions, 269 flow [2023-11-06 21:15:48,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=269, PETRI_PLACES=45, PETRI_TRANSITIONS=49} [2023-11-06 21:15:48,434 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 15 predicate places. [2023-11-06 21:15:48,434 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 49 transitions, 269 flow [2023-11-06 21:15:48,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 87.34782608695652) internal successors, (2009), 23 states have internal predecessors, (2009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:48,436 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:15:48,436 INFO L208 CegarLoopForPetriNet]: 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] [2023-11-06 21:15:48,449 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 21:15:48,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:15:48,644 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 21:15:48,645 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:48,645 INFO L85 PathProgramCache]: Analyzing trace with hash -903655785, now seen corresponding path program 2 times [2023-11-06 21:15:48,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:48,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722305422] [2023-11-06 21:15:48,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:48,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:48,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:49,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:15:49,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:49,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722305422] [2023-11-06 21:15:49,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722305422] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:15:49,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228023426] [2023-11-06 21:15:49,731 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 21:15:49,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:15:49,732 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:15:49,733 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:15:49,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 21:15:49,917 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 21:15:49,917 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:15:49,920 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-06 21:15:49,923 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:15:50,570 INFO L351 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 59 treesize of output 35 [2023-11-06 21:15:50,647 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:15:50,647 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:15:51,138 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:15:51,139 INFO L351 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 131 treesize of output 75 [2023-11-06 21:15:51,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:15:51,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228023426] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:15:51,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:15:51,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 22 [2023-11-06 21:15:51,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294297932] [2023-11-06 21:15:51,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:15:51,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-06 21:15:51,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:51,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-06 21:15:51,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2023-11-06 21:15:53,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 302 [2023-11-06 21:15:53,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 49 transitions, 269 flow. Second operand has 24 states, 24 states have (on average 108.875) internal successors, (2613), 24 states have internal predecessors, (2613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:53,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:15:53,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 302 [2023-11-06 21:15:53,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:15:54,945 INFO L124 PetriNetUnfolderBase]: 913/1342 cut-off events. [2023-11-06 21:15:54,945 INFO L125 PetriNetUnfolderBase]: For 1599/1599 co-relation queries the response was YES. [2023-11-06 21:15:54,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4506 conditions, 1342 events. 913/1342 cut-off events. For 1599/1599 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4915 event pairs, 175 based on Foata normal form. 1/1342 useless extension candidates. Maximal degree in co-relation 3934. Up to 994 conditions per place. [2023-11-06 21:15:54,967 INFO L140 encePairwiseOnDemand]: 291/302 looper letters, 85 selfloop transitions, 55 changer transitions 1/141 dead transitions. [2023-11-06 21:15:54,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 141 transitions, 939 flow [2023-11-06 21:15:54,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-06 21:15:54,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-11-06 21:15:54,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2031 transitions. [2023-11-06 21:15:54,981 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37362030905077265 [2023-11-06 21:15:54,981 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2031 transitions. [2023-11-06 21:15:54,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2031 transitions. [2023-11-06 21:15:54,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:15:54,984 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2031 transitions. [2023-11-06 21:15:54,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 112.83333333333333) internal successors, (2031), 18 states have internal predecessors, (2031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:55,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 302.0) internal successors, (5738), 19 states have internal predecessors, (5738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:55,016 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 302.0) internal successors, (5738), 19 states have internal predecessors, (5738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:55,016 INFO L175 Difference]: Start difference. First operand has 45 places, 49 transitions, 269 flow. Second operand 18 states and 2031 transitions. [2023-11-06 21:15:55,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 141 transitions, 939 flow [2023-11-06 21:15:55,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 141 transitions, 878 flow, removed 15 selfloop flow, removed 2 redundant places. [2023-11-06 21:15:55,032 INFO L231 Difference]: Finished difference. Result has 68 places, 95 transitions, 654 flow [2023-11-06 21:15:55,032 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=654, PETRI_PLACES=68, PETRI_TRANSITIONS=95} [2023-11-06 21:15:55,035 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 38 predicate places. [2023-11-06 21:15:55,036 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 95 transitions, 654 flow [2023-11-06 21:15:55,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 108.875) internal successors, (2613), 24 states have internal predecessors, (2613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:55,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:15:55,041 INFO L208 CegarLoopForPetriNet]: 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] [2023-11-06 21:15:55,053 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 21:15:55,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:15:55,254 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 21:15:55,254 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:55,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1302559195, now seen corresponding path program 3 times [2023-11-06 21:15:55,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:55,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832742503] [2023-11-06 21:15:55,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:55,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:55,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:56,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:15:56,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:56,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832742503] [2023-11-06 21:15:56,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832742503] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:15:56,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195131181] [2023-11-06 21:15:56,227 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 21:15:56,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:15:56,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:15:56,229 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:15:56,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 21:15:56,401 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-06 21:15:56,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:15:56,404 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-06 21:15:56,407 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:15:56,821 INFO L351 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 64 treesize of output 40 [2023-11-06 21:15:57,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:15:57,037 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:15:57,315 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:15:57,316 INFO L351 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 123 treesize of output 75 [2023-11-06 21:15:58,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:15:58,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195131181] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:15:58,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:15:58,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2023-11-06 21:15:58,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6002750] [2023-11-06 21:15:58,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:15:58,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-06 21:15:58,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:58,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-06 21:15:58,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2023-11-06 21:15:59,436 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 302 [2023-11-06 21:15:59,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 95 transitions, 654 flow. Second operand has 22 states, 22 states have (on average 111.0) internal successors, (2442), 22 states have internal predecessors, (2442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:59,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:15:59,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 302 [2023-11-06 21:15:59,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:00,651 INFO L124 PetriNetUnfolderBase]: 933/1386 cut-off events. [2023-11-06 21:16:00,651 INFO L125 PetriNetUnfolderBase]: For 3205/3246 co-relation queries the response was YES. [2023-11-06 21:16:00,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5596 conditions, 1386 events. 933/1386 cut-off events. For 3205/3246 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5524 event pairs, 174 based on Foata normal form. 8/1370 useless extension candidates. Maximal degree in co-relation 4962. Up to 1085 conditions per place. [2023-11-06 21:16:00,671 INFO L140 encePairwiseOnDemand]: 292/302 looper letters, 88 selfloop transitions, 49 changer transitions 1/145 dead transitions. [2023-11-06 21:16:00,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 145 transitions, 1164 flow [2023-11-06 21:16:00,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 21:16:00,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-06 21:16:00,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1275 transitions. [2023-11-06 21:16:00,680 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3838049367850692 [2023-11-06 21:16:00,680 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1275 transitions. [2023-11-06 21:16:00,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1275 transitions. [2023-11-06 21:16:00,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:00,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1275 transitions. [2023-11-06 21:16:00,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 115.9090909090909) internal successors, (1275), 11 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:00,694 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 302.0) internal successors, (3624), 12 states have internal predecessors, (3624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:00,696 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 302.0) internal successors, (3624), 12 states have internal predecessors, (3624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:00,696 INFO L175 Difference]: Start difference. First operand has 68 places, 95 transitions, 654 flow. Second operand 11 states and 1275 transitions. [2023-11-06 21:16:00,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 145 transitions, 1164 flow [2023-11-06 21:16:00,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 145 transitions, 1111 flow, removed 18 selfloop flow, removed 3 redundant places. [2023-11-06 21:16:00,720 INFO L231 Difference]: Finished difference. Result has 78 places, 109 transitions, 860 flow [2023-11-06 21:16:00,720 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=860, PETRI_PLACES=78, PETRI_TRANSITIONS=109} [2023-11-06 21:16:00,721 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 48 predicate places. [2023-11-06 21:16:00,721 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 109 transitions, 860 flow [2023-11-06 21:16:00,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 111.0) internal successors, (2442), 22 states have internal predecessors, (2442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:00,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:00,723 INFO L208 CegarLoopForPetriNet]: 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] [2023-11-06 21:16:00,736 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 21:16:00,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:16:00,931 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 21:16:00,931 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:00,932 INFO L85 PathProgramCache]: Analyzing trace with hash -962560381, now seen corresponding path program 4 times [2023-11-06 21:16:00,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:16:00,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648738832] [2023-11-06 21:16:00,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:00,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:16:00,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:01,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:16:01,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:16:01,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648738832] [2023-11-06 21:16:01,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648738832] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:16:01,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121453850] [2023-11-06 21:16:01,951 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 21:16:01,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:16:01,951 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:16:01,952 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:16:01,980 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 21:16:02,104 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 21:16:02,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:16:02,107 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-06 21:16:02,110 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:16:02,593 INFO L351 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 59 treesize of output 35 [2023-11-06 21:16:02,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:16:02,693 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:16:03,008 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:16:03,009 INFO L351 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 131 treesize of output 75 [2023-11-06 21:16:03,688 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:16:03,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121453850] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:16:03,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:16:03,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 21 [2023-11-06 21:16:03,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918280420] [2023-11-06 21:16:03,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:16:03,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-06 21:16:03,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:16:03,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-06 21:16:03,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2023-11-06 21:16:05,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 302 [2023-11-06 21:16:05,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 109 transitions, 860 flow. Second operand has 23 states, 23 states have (on average 107.69565217391305) internal successors, (2477), 23 states have internal predecessors, (2477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:05,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:05,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 302 [2023-11-06 21:16:05,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:06,513 INFO L124 PetriNetUnfolderBase]: 1241/1824 cut-off events. [2023-11-06 21:16:06,513 INFO L125 PetriNetUnfolderBase]: For 4915/4915 co-relation queries the response was YES. [2023-11-06 21:16:06,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7928 conditions, 1824 events. 1241/1824 cut-off events. For 4915/4915 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7251 event pairs, 220 based on Foata normal form. 1/1813 useless extension candidates. Maximal degree in co-relation 6780. Up to 1412 conditions per place. [2023-11-06 21:16:06,541 INFO L140 encePairwiseOnDemand]: 291/302 looper letters, 136 selfloop transitions, 88 changer transitions 1/225 dead transitions. [2023-11-06 21:16:06,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 225 transitions, 1973 flow [2023-11-06 21:16:06,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-06 21:16:06,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-11-06 21:16:06,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2358 transitions. [2023-11-06 21:16:06,556 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3718070009460738 [2023-11-06 21:16:06,556 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 2358 transitions. [2023-11-06 21:16:06,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 2358 transitions. [2023-11-06 21:16:06,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:06,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 2358 transitions. [2023-11-06 21:16:06,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 112.28571428571429) internal successors, (2358), 21 states have internal predecessors, (2358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:06,586 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 302.0) internal successors, (6644), 22 states have internal predecessors, (6644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:06,589 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 302.0) internal successors, (6644), 22 states have internal predecessors, (6644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:06,590 INFO L175 Difference]: Start difference. First operand has 78 places, 109 transitions, 860 flow. Second operand 21 states and 2358 transitions. [2023-11-06 21:16:06,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 225 transitions, 1973 flow [2023-11-06 21:16:06,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 225 transitions, 1881 flow, removed 24 selfloop flow, removed 4 redundant places. [2023-11-06 21:16:06,628 INFO L231 Difference]: Finished difference. Result has 105 places, 156 transitions, 1497 flow [2023-11-06 21:16:06,628 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=783, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1497, PETRI_PLACES=105, PETRI_TRANSITIONS=156} [2023-11-06 21:16:06,632 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 75 predicate places. [2023-11-06 21:16:06,632 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 156 transitions, 1497 flow [2023-11-06 21:16:06,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 107.69565217391305) internal successors, (2477), 23 states have internal predecessors, (2477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:06,634 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:06,634 INFO L208 CegarLoopForPetriNet]: 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] [2023-11-06 21:16:06,647 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-06 21:16:06,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:16:06,842 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 21:16:06,842 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:06,843 INFO L85 PathProgramCache]: Analyzing trace with hash 411114695, now seen corresponding path program 5 times [2023-11-06 21:16:06,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:16:06,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447801622] [2023-11-06 21:16:06,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:06,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:16:06,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:07,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:16:07,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:16:07,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447801622] [2023-11-06 21:16:07,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447801622] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:16:07,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014807808] [2023-11-06 21:16:07,695 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-06 21:16:07,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:16:07,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:16:07,697 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:16:07,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 21:16:07,857 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-11-06 21:16:07,857 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:16:07,859 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-06 21:16:07,862 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:16:08,429 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:16:08,430 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 75 [2023-11-06 21:16:08,836 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:16:08,837 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:16:09,291 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:16:09,292 INFO L351 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 107 treesize of output 75 [2023-11-06 21:16:09,983 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:16:09,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014807808] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:16:09,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:16:09,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 20 [2023-11-06 21:16:09,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754660837] [2023-11-06 21:16:09,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:16:09,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-06 21:16:09,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:16:09,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-06 21:16:09,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2023-11-06 21:16:11,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 302 [2023-11-06 21:16:11,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 156 transitions, 1497 flow. Second operand has 22 states, 22 states have (on average 111.0) internal successors, (2442), 22 states have internal predecessors, (2442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:11,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:11,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 302 [2023-11-06 21:16:11,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:15,811 INFO L124 PetriNetUnfolderBase]: 1955/2905 cut-off events. [2023-11-06 21:16:15,812 INFO L125 PetriNetUnfolderBase]: For 11162/11216 co-relation queries the response was YES. [2023-11-06 21:16:15,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14009 conditions, 2905 events. 1955/2905 cut-off events. For 11162/11216 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 13351 event pairs, 190 based on Foata normal form. 13/2875 useless extension candidates. Maximal degree in co-relation 13825. Up to 1617 conditions per place. [2023-11-06 21:16:15,864 INFO L140 encePairwiseOnDemand]: 291/302 looper letters, 204 selfloop transitions, 210 changer transitions 8/432 dead transitions. [2023-11-06 21:16:15,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 432 transitions, 4070 flow [2023-11-06 21:16:15,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-11-06 21:16:15,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2023-11-06 21:16:15,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 5282 transitions. [2023-11-06 21:16:15,890 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38021883098186005 [2023-11-06 21:16:15,890 INFO L72 ComplementDD]: Start complementDD. Operand 46 states and 5282 transitions. [2023-11-06 21:16:15,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 5282 transitions. [2023-11-06 21:16:15,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:15,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 46 states and 5282 transitions. [2023-11-06 21:16:15,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 47 states, 46 states have (on average 114.82608695652173) internal successors, (5282), 46 states have internal predecessors, (5282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:15,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 47 states, 47 states have (on average 302.0) internal successors, (14194), 47 states have internal predecessors, (14194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:15,956 INFO L81 ComplementDD]: Finished complementDD. Result has 47 states, 47 states have (on average 302.0) internal successors, (14194), 47 states have internal predecessors, (14194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:15,957 INFO L175 Difference]: Start difference. First operand has 105 places, 156 transitions, 1497 flow. Second operand 46 states and 5282 transitions. [2023-11-06 21:16:15,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 432 transitions, 4070 flow [2023-11-06 21:16:16,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 432 transitions, 3968 flow, removed 24 selfloop flow, removed 6 redundant places. [2023-11-06 21:16:16,026 INFO L231 Difference]: Finished difference. Result has 147 places, 288 transitions, 3144 flow [2023-11-06 21:16:16,026 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=1397, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=3144, PETRI_PLACES=147, PETRI_TRANSITIONS=288} [2023-11-06 21:16:16,027 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 117 predicate places. [2023-11-06 21:16:16,027 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 288 transitions, 3144 flow [2023-11-06 21:16:16,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 111.0) internal successors, (2442), 22 states have internal predecessors, (2442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:16,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:16,029 INFO L208 CegarLoopForPetriNet]: 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] [2023-11-06 21:16:16,042 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-06 21:16:16,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:16:16,236 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 21:16:16,236 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:16,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1804286415, now seen corresponding path program 6 times [2023-11-06 21:16:16,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:16:16,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169608173] [2023-11-06 21:16:16,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:16,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:16:16,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:18,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:16:18,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:16:18,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169608173] [2023-11-06 21:16:18,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169608173] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:16:18,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663824211] [2023-11-06 21:16:18,023 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-06 21:16:18,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:16:18,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:16:18,024 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:16:18,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-06 21:16:18,186 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-11-06 21:16:18,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:16:18,188 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-06 21:16:18,193 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:16:18,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:16:18,581 INFO L351 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 38 treesize of output 29 [2023-11-06 21:16:18,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:16:18,866 INFO L351 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 38 treesize of output 29 [2023-11-06 21:16:19,008 INFO L351 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 58 treesize of output 34 [2023-11-06 21:16:19,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:16:19,148 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:16:19,692 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (= c_~min2~0 c_~min1~0)) (.cse2 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_271 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) c_~A~0.base) .cse2))) (let ((.cse0 (+ .cse1 1))) (or (< c_~min3~0 .cse0) (= c_~min1~0 .cse1) (< c_~min2~0 .cse0))))) (or (and .cse3 (<= c_~min2~0 c_~min3~0)) (forall ((v_ArrVal_271 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) c_~A~0.base) .cse2) c_~min3~0)) (and (= c_~min1~0 c_~min3~0) (<= (+ c_~min3~0 1) c_~min2~0))) (or .cse3 (forall ((v_ArrVal_271 (Array Int Int))) (let ((.cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) c_~A~0.base) .cse2))) (or (< .cse4 c_~min2~0) (< c_~min3~0 (+ .cse4 1)))))) (or .cse3 (forall ((v_ArrVal_271 (Array Int Int))) (let ((.cse5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) c_~A~0.base) .cse2))) (or (< c_~min3~0 (+ .cse5 1)) (= c_~min1~0 .cse5))))))) is different from false [2023-11-06 21:16:20,468 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:16:20,469 INFO L351 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 1135 treesize of output 1007 [2023-11-06 21:16:20,503 INFO L351 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 515 treesize of output 497 [2023-11-06 21:16:20,523 INFO L351 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 497 treesize of output 461 [2023-11-06 21:16:20,543 INFO L351 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 461 treesize of output 455 [2023-11-06 21:16:20,562 INFO L351 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 455 treesize of output 443 [2023-11-06 21:16:20,582 INFO L351 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 443 treesize of output 431 [2023-11-06 21:16:20,602 INFO L351 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 431 treesize of output 407 [2023-11-06 21:16:20,620 INFO L351 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 407 treesize of output 383 [2023-11-06 21:16:20,639 INFO L351 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 383 treesize of output 371 [2023-11-06 21:16:21,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:16:21,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663824211] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:16:21,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:16:21,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 26 [2023-11-06 21:16:21,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060273216] [2023-11-06 21:16:21,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:16:21,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-06 21:16:21,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:16:21,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-06 21:16:21,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=603, Unknown=2, NotChecked=50, Total=756 [2023-11-06 21:16:21,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 302 [2023-11-06 21:16:21,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 288 transitions, 3144 flow. Second operand has 28 states, 28 states have (on average 77.35714285714286) internal successors, (2166), 28 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:21,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:21,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 302 [2023-11-06 21:16:21,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:25,328 INFO L124 PetriNetUnfolderBase]: 2676/3887 cut-off events. [2023-11-06 21:16:25,328 INFO L125 PetriNetUnfolderBase]: For 15616/15616 co-relation queries the response was YES. [2023-11-06 21:16:25,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19632 conditions, 3887 events. 2676/3887 cut-off events. For 15616/15616 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 17736 event pairs, 132 based on Foata normal form. 1/3876 useless extension candidates. Maximal degree in co-relation 19432. Up to 2775 conditions per place. [2023-11-06 21:16:25,399 INFO L140 encePairwiseOnDemand]: 285/302 looper letters, 270 selfloop transitions, 146 changer transitions 1/417 dead transitions. [2023-11-06 21:16:25,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 417 transitions, 4730 flow [2023-11-06 21:16:25,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 21:16:25,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-11-06 21:16:25,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1442 transitions. [2023-11-06 21:16:25,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28087261394624075 [2023-11-06 21:16:25,405 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1442 transitions. [2023-11-06 21:16:25,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1442 transitions. [2023-11-06 21:16:25,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:25,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1442 transitions. [2023-11-06 21:16:25,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 84.82352941176471) internal successors, (1442), 17 states have internal predecessors, (1442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:25,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 302.0) internal successors, (5436), 18 states have internal predecessors, (5436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:25,426 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 302.0) internal successors, (5436), 18 states have internal predecessors, (5436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:25,426 INFO L175 Difference]: Start difference. First operand has 147 places, 288 transitions, 3144 flow. Second operand 17 states and 1442 transitions. [2023-11-06 21:16:25,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 417 transitions, 4730 flow [2023-11-06 21:16:25,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 417 transitions, 3639 flow, removed 470 selfloop flow, removed 13 redundant places. [2023-11-06 21:16:25,619 INFO L231 Difference]: Finished difference. Result has 156 places, 339 transitions, 2972 flow [2023-11-06 21:16:25,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=2085, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2972, PETRI_PLACES=156, PETRI_TRANSITIONS=339} [2023-11-06 21:16:25,622 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 126 predicate places. [2023-11-06 21:16:25,622 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 339 transitions, 2972 flow [2023-11-06 21:16:25,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 77.35714285714286) internal successors, (2166), 28 states have internal predecessors, (2166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:25,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:25,623 INFO L208 CegarLoopForPetriNet]: 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] [2023-11-06 21:16:25,633 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-06 21:16:25,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-06 21:16:25,833 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 21:16:25,833 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:25,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1373394899, now seen corresponding path program 7 times [2023-11-06 21:16:25,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:16:25,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212920260] [2023-11-06 21:16:25,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:25,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:16:25,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:26,649 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:16:26,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:16:26,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212920260] [2023-11-06 21:16:26,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212920260] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:16:26,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803697026] [2023-11-06 21:16:26,651 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-06 21:16:26,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:16:26,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:16:26,652 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:16:26,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-06 21:16:26,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:26,816 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-06 21:16:26,819 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:16:27,173 INFO L351 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 65 treesize of output 41 [2023-11-06 21:16:27,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:16:27,261 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:16:27,561 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:16:27,562 INFO L351 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 123 treesize of output 75 [2023-11-06 21:16:28,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:16:28,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803697026] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:16:28,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:16:28,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2023-11-06 21:16:28,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908722465] [2023-11-06 21:16:28,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:16:28,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-06 21:16:28,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:16:28,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-06 21:16:28,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2023-11-06 21:16:29,387 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 302 [2023-11-06 21:16:29,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 339 transitions, 2972 flow. Second operand has 19 states, 19 states have (on average 111.89473684210526) internal successors, (2126), 19 states have internal predecessors, (2126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:29,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:29,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 302 [2023-11-06 21:16:29,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:30,440 INFO L124 PetriNetUnfolderBase]: 2506/3708 cut-off events. [2023-11-06 21:16:30,440 INFO L125 PetriNetUnfolderBase]: For 19040/19258 co-relation queries the response was YES. [2023-11-06 21:16:30,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19155 conditions, 3708 events. 2506/3708 cut-off events. For 19040/19258 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 17749 event pairs, 375 based on Foata normal form. 65/3677 useless extension candidates. Maximal degree in co-relation 18969. Up to 3347 conditions per place. [2023-11-06 21:16:30,488 INFO L140 encePairwiseOnDemand]: 293/302 looper letters, 271 selfloop transitions, 83 changer transitions 1/369 dead transitions. [2023-11-06 21:16:30,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 369 transitions, 3862 flow [2023-11-06 21:16:30,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 21:16:30,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 21:16:30,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1054 transitions. [2023-11-06 21:16:30,492 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.387785136129507 [2023-11-06 21:16:30,492 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1054 transitions. [2023-11-06 21:16:30,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1054 transitions. [2023-11-06 21:16:30,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:30,493 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1054 transitions. [2023-11-06 21:16:30,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 117.11111111111111) internal successors, (1054), 9 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:30,501 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 302.0) internal successors, (3020), 10 states have internal predecessors, (3020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:30,502 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 302.0) internal successors, (3020), 10 states have internal predecessors, (3020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:30,502 INFO L175 Difference]: Start difference. First operand has 156 places, 339 transitions, 2972 flow. Second operand 9 states and 1054 transitions. [2023-11-06 21:16:30,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 369 transitions, 3862 flow [2023-11-06 21:16:30,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 369 transitions, 3584 flow, removed 97 selfloop flow, removed 7 redundant places. [2023-11-06 21:16:30,615 INFO L231 Difference]: Finished difference. Result has 159 places, 345 transitions, 2988 flow [2023-11-06 21:16:30,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=2694, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2988, PETRI_PLACES=159, PETRI_TRANSITIONS=345} [2023-11-06 21:16:30,617 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 129 predicate places. [2023-11-06 21:16:30,617 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 345 transitions, 2988 flow [2023-11-06 21:16:30,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 111.89473684210526) internal successors, (2126), 19 states have internal predecessors, (2126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:30,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:30,619 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:16:30,637 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-06 21:16:30,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-06 21:16:30,837 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 21:16:30,837 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:30,837 INFO L85 PathProgramCache]: Analyzing trace with hash 752848469, now seen corresponding path program 8 times [2023-11-06 21:16:30,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:16:30,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550356196] [2023-11-06 21:16:30,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:30,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:16:30,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:31,085 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:16:31,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:16:31,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550356196] [2023-11-06 21:16:31,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550356196] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:16:31,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574950701] [2023-11-06 21:16:31,086 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 21:16:31,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:16:31,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:16:31,088 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:16:31,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-06 21:16:31,243 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 21:16:31,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:16:31,246 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 21:16:31,248 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:16:31,350 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:16:31,350 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:16:31,442 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:16:31,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574950701] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:16:31,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:16:31,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2023-11-06 21:16:31,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812817210] [2023-11-06 21:16:31,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:16:31,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-06 21:16:31,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:16:31,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-06 21:16:31,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2023-11-06 21:16:31,764 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 302 [2023-11-06 21:16:31,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 345 transitions, 2988 flow. Second operand has 15 states, 15 states have (on average 126.8) internal successors, (1902), 15 states have internal predecessors, (1902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:31,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:31,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 302 [2023-11-06 21:16:31,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:32,632 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] L70-4-->L70-4: Formula: (and (= v_thread3Thread1of1ForFork2_~i~2_33 (+ v_thread3Thread1of1ForFork2_~i~2_34 1)) (< v_thread3Thread1of1ForFork2_~i~2_34 v_~N~0_37) (let ((.cse0 (select (select |v_#memory_int_100| v_~A~0.base_51) (+ v_~A~0.offset_51 (* v_thread3Thread1of1ForFork2_~i~2_34 4))))) (or (and (= v_~min3~0_39 v_~min3~0_38) (<= v_~min3~0_39 .cse0) (= |v_thread3Thread1of1ForFork2_#t~mem9_16| |v_thread3Thread1of1ForFork2_#t~mem9_15|)) (and (= v_~min3~0_38 .cse0) (< .cse0 v_~min3~0_39))))) InVars {~A~0.base=v_~A~0.base_51, ~A~0.offset=v_~A~0.offset_51, #memory_int=|v_#memory_int_100|, thread3Thread1of1ForFork2_#t~mem9=|v_thread3Thread1of1ForFork2_#t~mem9_16|, ~N~0=v_~N~0_37, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_34, ~min3~0=v_~min3~0_39} OutVars{~A~0.base=v_~A~0.base_51, ~A~0.offset=v_~A~0.offset_51, #memory_int=|v_#memory_int_100|, thread3Thread1of1ForFork2_#t~mem8=|v_thread3Thread1of1ForFork2_#t~mem8_9|, thread3Thread1of1ForFork2_#t~post7=|v_thread3Thread1of1ForFork2_#t~post7_17|, thread3Thread1of1ForFork2_#t~mem9=|v_thread3Thread1of1ForFork2_#t~mem9_15|, ~N~0=v_~N~0_37, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_33, ~min3~0=v_~min3~0_38} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem8, thread3Thread1of1ForFork2_#t~post7, thread3Thread1of1ForFork2_#t~mem9, thread3Thread1of1ForFork2_~i~2, ~min3~0][135], [Black: 725#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), 1434#true, 33#L70-4true, 1015#true, Black: 654#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0) (= ~M~0 0)), 1592#true, Black: 1426#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 0 ~M~0) (and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0))) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))) (or (= ~min1~0 0) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))))), Black: 1421#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0) (= ~M~0 0)), Black: 521#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1416#(and (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 561#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), Black: 1414#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0) (= ~M~0 0)), Black: 542#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0)), Black: 1222#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)))), Black: 1412#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0) (= ~M~0 0)), Black: 1423#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 0 ~M~0) (and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0))) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))))), Black: 1100#(or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))), Black: 1200#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)) (exists ((v_thread3Thread1of1ForFork2_~i~2_52 Int)) (and (<= 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork2_~i~2_52 4))) (<= 0 v_thread3Thread1of1ForFork2_~i~2_52) (<= (+ v_thread3Thread1of1ForFork2_~i~2_52 1) ~N~0))) (<= 1 ~N~0) (= ~min3~0 0)), 834#true, 72#L58-4true, Black: 160#(and (= ~min1~0 0) (= ~min2~0 0) (= ~min3~0 0)), Black: 474#(and (= ~min1~0 0) (= ~min2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (= ~N~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (= ~min3~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 479#(and (= ~min2~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (or (= ~min1~0 0) (< ~min3~0 0)) (= ~min3~0 ~min1~0) (= ~M~0 0)), 485#true, Black: 351#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~min3~0 0) (= ~M~0 0)), 316#true, Black: 165#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 108#L95-2true, Black: 879#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0)), 1243#true, Black: 994#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 839#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1)), Black: 841#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (not (= thread3Thread1of1ForFork2_~i~2 0)) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2))) (= ~min3~0 0)), Black: 173#(and (<= (+ ~M~0 1) ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 996#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 891#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0)), 666#true, Black: 842#(and (or (= ~min3~0 0) (< ~min3~0 0)) (= ~min2~0 0) (= ~min3~0 ~min1~0)), Black: 990#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 883#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (= ~M~0 0)), Black: 875#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0)), Black: 1442#(and (= ~min2~0 0) (or (= ~min1~0 0) (< ~min3~0 0)) (= ~min3~0 ~min1~0)), Black: 1441#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (not (= ~min3~0 0))) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min3~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0))), Black: 313#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 827#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (or (not (= thread3Thread1of1ForFork2_~i~2 0)) (= ~min3~0 0)) (= thread1Thread1of1ForFork0_~i~0 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2))) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (< ~min3~0 0)) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min3~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0)))]) [2023-11-06 21:16:32,633 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2023-11-06 21:16:32,633 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-11-06 21:16:32,634 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-11-06 21:16:32,634 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-11-06 21:16:32,634 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([556] L58-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_7| 0) (<= v_~M~0_23 v_thread2Thread1of1ForFork1_~i~1_30) (= |v_thread2Thread1of1ForFork1_#res.offset_7| 0)) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_30, ~M~0=v_~M~0_23} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_7|, ~M~0=v_~M~0_23, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#res.base][40], [Black: 725#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), 1434#true, 33#L70-4true, 1015#true, Black: 654#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0) (= ~M~0 0)), 1592#true, Black: 1426#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 0 ~M~0) (and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0))) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))) (or (= ~min1~0 0) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))))), Black: 1421#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0) (= ~M~0 0)), Black: 521#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1416#(and (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 561#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), Black: 1414#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0) (= ~M~0 0)), Black: 542#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0)), Black: 1222#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)))), Black: 1412#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0) (= ~M~0 0)), Black: 1100#(or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))), 7#thread2EXITtrue, Black: 1423#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 0 ~M~0) (and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0))) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))))), Black: 1200#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)) (exists ((v_thread3Thread1of1ForFork2_~i~2_52 Int)) (and (<= 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork2_~i~2_52 4))) (<= 0 v_thread3Thread1of1ForFork2_~i~2_52) (<= (+ v_thread3Thread1of1ForFork2_~i~2_52 1) ~N~0))) (<= 1 ~N~0) (= ~min3~0 0)), 834#true, Black: 474#(and (= ~min1~0 0) (= ~min2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (= ~N~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (= ~min3~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 160#(and (= ~min1~0 0) (= ~min2~0 0) (= ~min3~0 0)), Black: 479#(and (= ~min2~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (or (= ~min1~0 0) (< ~min3~0 0)) (= ~min3~0 ~min1~0) (= ~M~0 0)), 485#true, Black: 351#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~min3~0 0) (= ~M~0 0)), 316#true, Black: 165#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 108#L95-2true, 1243#true, Black: 879#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0)), 173#(and (<= (+ ~M~0 1) ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 994#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 839#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1)), Black: 841#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (not (= thread3Thread1of1ForFork2_~i~2 0)) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2))) (= ~min3~0 0)), Black: 996#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 891#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0)), 666#true, Black: 842#(and (or (= ~min3~0 0) (< ~min3~0 0)) (= ~min2~0 0) (= ~min3~0 ~min1~0)), Black: 990#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 883#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (= ~M~0 0)), Black: 875#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0)), Black: 1442#(and (= ~min2~0 0) (or (= ~min1~0 0) (< ~min3~0 0)) (= ~min3~0 ~min1~0)), Black: 1441#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (not (= ~min3~0 0))) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min3~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0))), Black: 313#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 827#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (or (not (= thread3Thread1of1ForFork2_~i~2 0)) (= ~min3~0 0)) (= thread1Thread1of1ForFork0_~i~0 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2))) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (< ~min3~0 0)) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min3~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0)))]) [2023-11-06 21:16:32,635 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2023-11-06 21:16:32,635 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-11-06 21:16:32,636 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-11-06 21:16:32,636 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-11-06 21:16:32,636 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([571] L58-4-->L58-4: Formula: (and (let ((.cse0 (select (select |v_#memory_int_98| v_~A~0.base_49) (+ (* v_thread2Thread1of1ForFork1_~i~1_34 4) v_~A~0.offset_49)))) (or (and (< .cse0 v_~min2~0_39) (= v_~min2~0_38 .cse0)) (and (= v_~min2~0_39 v_~min2~0_38) (<= v_~min2~0_39 .cse0) (= |v_thread2Thread1of1ForFork1_#t~mem6_16| |v_thread2Thread1of1ForFork1_#t~mem6_15|)))) (= v_thread2Thread1of1ForFork1_~i~1_33 (+ v_thread2Thread1of1ForFork1_~i~1_34 1)) (< v_thread2Thread1of1ForFork1_~i~1_34 v_~M~0_27)) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_34, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_16|, ~M~0=v_~M~0_27, #memory_int=|v_#memory_int_98|, ~min2~0=v_~min2~0_39} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_33, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_17|, ~A~0.base=v_~A~0.base_49, thread2Thread1of1ForFork1_#t~mem5=|v_thread2Thread1of1ForFork1_#t~mem5_9|, ~A~0.offset=v_~A~0.offset_49, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_15|, ~M~0=v_~M~0_27, #memory_int=|v_#memory_int_98|, ~min2~0=v_~min2~0_38} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~mem5, thread2Thread1of1ForFork1_#t~mem6, ~min2~0][41], [Black: 725#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), 1434#true, 33#L70-4true, 1015#true, Black: 654#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0) (= ~M~0 0)), 1592#true, Black: 1426#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 0 ~M~0) (and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0))) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))) (or (= ~min1~0 0) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))))), Black: 1421#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0) (= ~M~0 0)), Black: 521#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1416#(and (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 561#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), Black: 1414#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0) (= ~M~0 0)), Black: 542#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0)), Black: 1222#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)))), Black: 1412#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0) (= ~M~0 0)), Black: 1423#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 0 ~M~0) (and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0))) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))))), Black: 1100#(or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))), Black: 1200#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)) (exists ((v_thread3Thread1of1ForFork2_~i~2_52 Int)) (and (<= 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork2_~i~2_52 4))) (<= 0 v_thread3Thread1of1ForFork2_~i~2_52) (<= (+ v_thread3Thread1of1ForFork2_~i~2_52 1) ~N~0))) (<= 1 ~N~0) (= ~min3~0 0)), 834#true, 72#L58-4true, Black: 474#(and (= ~min1~0 0) (= ~min2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (= ~N~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (= ~min3~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 160#(and (= ~min1~0 0) (= ~min2~0 0) (= ~min3~0 0)), Black: 479#(and (= ~min2~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (or (= ~min1~0 0) (< ~min3~0 0)) (= ~min3~0 ~min1~0) (= ~M~0 0)), 485#true, Black: 351#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~min3~0 0) (= ~M~0 0)), 316#true, Black: 165#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 108#L95-2true, Black: 879#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0)), 1243#true, 173#(and (<= (+ ~M~0 1) ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 994#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 839#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1)), Black: 841#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (not (= thread3Thread1of1ForFork2_~i~2 0)) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2))) (= ~min3~0 0)), Black: 996#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 891#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0)), 666#true, Black: 842#(and (or (= ~min3~0 0) (< ~min3~0 0)) (= ~min2~0 0) (= ~min3~0 ~min1~0)), Black: 990#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 883#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (= ~M~0 0)), Black: 875#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0)), Black: 1442#(and (= ~min2~0 0) (or (= ~min1~0 0) (< ~min3~0 0)) (= ~min3~0 ~min1~0)), Black: 1441#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (not (= ~min3~0 0))) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min3~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0))), Black: 313#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 827#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (or (not (= thread3Thread1of1ForFork2_~i~2 0)) (= ~min3~0 0)) (= thread1Thread1of1ForFork0_~i~0 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2))) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (< ~min3~0 0)) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min3~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0)))]) [2023-11-06 21:16:32,639 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2023-11-06 21:16:32,639 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-11-06 21:16:32,639 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-11-06 21:16:32,639 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-11-06 21:16:32,727 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([556] L58-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_7| 0) (<= v_~M~0_23 v_thread2Thread1of1ForFork1_~i~1_30) (= |v_thread2Thread1of1ForFork1_#res.offset_7| 0)) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_30, ~M~0=v_~M~0_23} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_7|, ~M~0=v_~M~0_23, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#res.base][77], [Black: 725#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), 1434#true, 33#L70-4true, 109#L95-1true, 1015#true, Black: 654#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1426#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 0 ~M~0) (and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0))) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))) (or (= ~min1~0 0) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))))), Black: 1421#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0) (= ~M~0 0)), Black: 521#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1416#(and (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 561#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), Black: 1414#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0) (= ~M~0 0)), Black: 542#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0)), Black: 1222#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)))), Black: 1412#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0) (= ~M~0 0)), 7#thread2EXITtrue, Black: 1100#(or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))), Black: 1423#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 0 ~M~0) (and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0))) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))))), Black: 1200#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)) (exists ((v_thread3Thread1of1ForFork2_~i~2_52 Int)) (and (<= 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork2_~i~2_52 4))) (<= 0 v_thread3Thread1of1ForFork2_~i~2_52) (<= (+ v_thread3Thread1of1ForFork2_~i~2_52 1) ~N~0))) (<= 1 ~N~0) (= ~min3~0 0)), 1597#(<= 2 ~N~0), 834#true, Black: 474#(and (= ~min1~0 0) (= ~min2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (= ~N~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (= ~min3~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 160#(and (= ~min1~0 0) (= ~min2~0 0) (= ~min3~0 0)), 485#true, Black: 479#(and (= ~min2~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (or (= ~min1~0 0) (< ~min3~0 0)) (= ~min3~0 ~min1~0) (= ~M~0 0)), Black: 351#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~min3~0 0) (= ~M~0 0)), 316#true, Black: 165#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 879#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0)), 1243#true, 173#(and (<= (+ ~M~0 1) ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 994#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 839#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1)), Black: 841#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (not (= thread3Thread1of1ForFork2_~i~2 0)) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2))) (= ~min3~0 0)), Black: 996#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 891#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0)), 666#true, Black: 842#(and (or (= ~min3~0 0) (< ~min3~0 0)) (= ~min2~0 0) (= ~min3~0 ~min1~0)), Black: 990#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 883#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (= ~M~0 0)), 85#thread1EXITtrue, Black: 1442#(and (= ~min2~0 0) (or (= ~min1~0 0) (< ~min3~0 0)) (= ~min3~0 ~min1~0)), Black: 875#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0)), Black: 1441#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (not (= ~min3~0 0))) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min3~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0))), Black: 313#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 827#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (or (not (= thread3Thread1of1ForFork2_~i~2 0)) (= ~min3~0 0)) (= thread1Thread1of1ForFork0_~i~0 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2))) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (< ~min3~0 0)) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min3~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0)))]) [2023-11-06 21:16:32,728 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2023-11-06 21:16:32,728 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-11-06 21:16:32,729 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-11-06 21:16:32,729 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-11-06 21:16:32,729 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([571] L58-4-->L58-4: Formula: (and (let ((.cse0 (select (select |v_#memory_int_98| v_~A~0.base_49) (+ (* v_thread2Thread1of1ForFork1_~i~1_34 4) v_~A~0.offset_49)))) (or (and (< .cse0 v_~min2~0_39) (= v_~min2~0_38 .cse0)) (and (= v_~min2~0_39 v_~min2~0_38) (<= v_~min2~0_39 .cse0) (= |v_thread2Thread1of1ForFork1_#t~mem6_16| |v_thread2Thread1of1ForFork1_#t~mem6_15|)))) (= v_thread2Thread1of1ForFork1_~i~1_33 (+ v_thread2Thread1of1ForFork1_~i~1_34 1)) (< v_thread2Thread1of1ForFork1_~i~1_34 v_~M~0_27)) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_34, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_16|, ~M~0=v_~M~0_27, #memory_int=|v_#memory_int_98|, ~min2~0=v_~min2~0_39} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_33, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_17|, ~A~0.base=v_~A~0.base_49, thread2Thread1of1ForFork1_#t~mem5=|v_thread2Thread1of1ForFork1_#t~mem5_9|, ~A~0.offset=v_~A~0.offset_49, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_15|, ~M~0=v_~M~0_27, #memory_int=|v_#memory_int_98|, ~min2~0=v_~min2~0_38} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~mem5, thread2Thread1of1ForFork1_#t~mem6, ~min2~0][78], [Black: 725#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), 1434#true, 33#L70-4true, 109#L95-1true, 1015#true, Black: 654#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1426#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 0 ~M~0) (and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0))) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))) (or (= ~min1~0 0) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))))), Black: 1421#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0) (= ~M~0 0)), Black: 521#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1416#(and (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 561#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), Black: 1414#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0) (= ~M~0 0)), Black: 542#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0)), Black: 1222#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)))), Black: 1412#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0) (= ~M~0 0)), Black: 1423#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 0 ~M~0) (and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0))) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))))), Black: 1100#(or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))), Black: 1200#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)) (exists ((v_thread3Thread1of1ForFork2_~i~2_52 Int)) (and (<= 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork2_~i~2_52 4))) (<= 0 v_thread3Thread1of1ForFork2_~i~2_52) (<= (+ v_thread3Thread1of1ForFork2_~i~2_52 1) ~N~0))) (<= 1 ~N~0) (= ~min3~0 0)), 1597#(<= 2 ~N~0), 834#true, 72#L58-4true, Black: 160#(and (= ~min1~0 0) (= ~min2~0 0) (= ~min3~0 0)), Black: 474#(and (= ~min1~0 0) (= ~min2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (= ~N~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (= ~min3~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 479#(and (= ~min2~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (or (= ~min1~0 0) (< ~min3~0 0)) (= ~min3~0 ~min1~0) (= ~M~0 0)), 485#true, Black: 351#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~min3~0 0) (= ~M~0 0)), 316#true, Black: 165#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 879#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0)), 1243#true, 173#(and (<= (+ ~M~0 1) ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 994#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 839#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1)), Black: 841#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (not (= thread3Thread1of1ForFork2_~i~2 0)) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2))) (= ~min3~0 0)), Black: 996#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), 666#true, Black: 891#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0)), Black: 842#(and (or (= ~min3~0 0) (< ~min3~0 0)) (= ~min2~0 0) (= ~min3~0 ~min1~0)), Black: 990#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 883#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1442#(and (= ~min2~0 0) (or (= ~min1~0 0) (< ~min3~0 0)) (= ~min3~0 ~min1~0)), 85#thread1EXITtrue, Black: 875#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0)), Black: 1441#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (not (= ~min3~0 0))) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min3~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0))), Black: 313#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 827#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (or (not (= thread3Thread1of1ForFork2_~i~2 0)) (= ~min3~0 0)) (= thread1Thread1of1ForFork0_~i~0 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2))) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (< ~min3~0 0)) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min3~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0)))]) [2023-11-06 21:16:32,730 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is cut-off event [2023-11-06 21:16:32,730 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-11-06 21:16:32,730 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-11-06 21:16:32,730 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-11-06 21:16:32,777 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] L70-4-->L70-4: Formula: (and (= v_thread3Thread1of1ForFork2_~i~2_33 (+ v_thread3Thread1of1ForFork2_~i~2_34 1)) (< v_thread3Thread1of1ForFork2_~i~2_34 v_~N~0_37) (let ((.cse0 (select (select |v_#memory_int_100| v_~A~0.base_51) (+ v_~A~0.offset_51 (* v_thread3Thread1of1ForFork2_~i~2_34 4))))) (or (and (= v_~min3~0_39 v_~min3~0_38) (<= v_~min3~0_39 .cse0) (= |v_thread3Thread1of1ForFork2_#t~mem9_16| |v_thread3Thread1of1ForFork2_#t~mem9_15|)) (and (= v_~min3~0_38 .cse0) (< .cse0 v_~min3~0_39))))) InVars {~A~0.base=v_~A~0.base_51, ~A~0.offset=v_~A~0.offset_51, #memory_int=|v_#memory_int_100|, thread3Thread1of1ForFork2_#t~mem9=|v_thread3Thread1of1ForFork2_#t~mem9_16|, ~N~0=v_~N~0_37, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_34, ~min3~0=v_~min3~0_39} OutVars{~A~0.base=v_~A~0.base_51, ~A~0.offset=v_~A~0.offset_51, #memory_int=|v_#memory_int_100|, thread3Thread1of1ForFork2_#t~mem8=|v_thread3Thread1of1ForFork2_#t~mem8_9|, thread3Thread1of1ForFork2_#t~post7=|v_thread3Thread1of1ForFork2_#t~post7_17|, thread3Thread1of1ForFork2_#t~mem9=|v_thread3Thread1of1ForFork2_#t~mem9_15|, ~N~0=v_~N~0_37, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_33, ~min3~0=v_~min3~0_38} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem8, thread3Thread1of1ForFork2_#t~post7, thread3Thread1of1ForFork2_#t~mem9, thread3Thread1of1ForFork2_~i~2, ~min3~0][135], [Black: 725#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), 1434#true, 33#L70-4true, 79#L96-1true, 1015#true, Black: 654#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0) (= ~M~0 0)), 1592#true, Black: 1426#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 0 ~M~0) (and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0))) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))) (or (= ~min1~0 0) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))))), Black: 1421#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0) (= ~M~0 0)), Black: 521#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1416#(and (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 561#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), Black: 1414#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0) (= ~M~0 0)), Black: 542#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0)), Black: 1222#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)))), Black: 1412#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0) (= ~M~0 0)), Black: 1423#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 0 ~M~0) (and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0))) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))))), Black: 1100#(or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))), Black: 1200#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)) (exists ((v_thread3Thread1of1ForFork2_~i~2_52 Int)) (and (<= 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork2_~i~2_52 4))) (<= 0 v_thread3Thread1of1ForFork2_~i~2_52) (<= (+ v_thread3Thread1of1ForFork2_~i~2_52 1) ~N~0))) (<= 1 ~N~0) (= ~min3~0 0)), 834#true, 72#L58-4true, Black: 160#(and (= ~min1~0 0) (= ~min2~0 0) (= ~min3~0 0)), Black: 474#(and (= ~min1~0 0) (= ~min2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (= ~N~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (= ~min3~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 479#(and (= ~min2~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (or (= ~min1~0 0) (< ~min3~0 0)) (= ~min3~0 ~min1~0) (= ~M~0 0)), 485#true, Black: 351#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~min3~0 0) (= ~M~0 0)), 316#true, Black: 165#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 1243#true, Black: 879#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 994#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 839#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1)), Black: 173#(and (<= (+ ~M~0 1) ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 841#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (not (= thread3Thread1of1ForFork2_~i~2 0)) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2))) (= ~min3~0 0)), Black: 996#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 891#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0)), 666#true, Black: 842#(and (or (= ~min3~0 0) (< ~min3~0 0)) (= ~min2~0 0) (= ~min3~0 ~min1~0)), Black: 990#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 883#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (= ~M~0 0)), Black: 875#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0)), Black: 1442#(and (= ~min2~0 0) (or (= ~min1~0 0) (< ~min3~0 0)) (= ~min3~0 ~min1~0)), Black: 1441#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (not (= ~min3~0 0))) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min3~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0))), Black: 313#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 827#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (or (not (= thread3Thread1of1ForFork2_~i~2 0)) (= ~min3~0 0)) (= thread1Thread1of1ForFork0_~i~0 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2))) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (< ~min3~0 0)) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min3~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0)))]) [2023-11-06 21:16:32,777 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2023-11-06 21:16:32,778 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 21:16:32,778 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 21:16:32,778 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 21:16:32,778 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([556] L58-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_7| 0) (<= v_~M~0_23 v_thread2Thread1of1ForFork1_~i~1_30) (= |v_thread2Thread1of1ForFork1_#res.offset_7| 0)) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_30, ~M~0=v_~M~0_23} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_7|, ~M~0=v_~M~0_23, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#res.base][40], [Black: 725#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), 1434#true, 33#L70-4true, 79#L96-1true, 1015#true, Black: 654#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0) (= ~M~0 0)), 1592#true, Black: 1426#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 0 ~M~0) (and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0))) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))) (or (= ~min1~0 0) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))))), Black: 1421#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0) (= ~M~0 0)), Black: 521#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1416#(and (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 561#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), Black: 1414#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0) (= ~M~0 0)), Black: 542#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0)), Black: 1222#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)))), Black: 1412#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0) (= ~M~0 0)), Black: 1100#(or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))), 7#thread2EXITtrue, Black: 1423#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 0 ~M~0) (and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0))) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))))), Black: 1200#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)) (exists ((v_thread3Thread1of1ForFork2_~i~2_52 Int)) (and (<= 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork2_~i~2_52 4))) (<= 0 v_thread3Thread1of1ForFork2_~i~2_52) (<= (+ v_thread3Thread1of1ForFork2_~i~2_52 1) ~N~0))) (<= 1 ~N~0) (= ~min3~0 0)), 834#true, Black: 474#(and (= ~min1~0 0) (= ~min2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (= ~N~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (= ~min3~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 160#(and (= ~min1~0 0) (= ~min2~0 0) (= ~min3~0 0)), 485#true, Black: 479#(and (= ~min2~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (or (= ~min1~0 0) (< ~min3~0 0)) (= ~min3~0 ~min1~0) (= ~M~0 0)), Black: 351#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~min3~0 0) (= ~M~0 0)), 316#true, Black: 165#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 1243#true, Black: 879#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0)), 173#(and (<= (+ ~M~0 1) ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 994#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 839#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1)), Black: 841#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (not (= thread3Thread1of1ForFork2_~i~2 0)) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2))) (= ~min3~0 0)), Black: 996#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 891#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0)), 666#true, Black: 842#(and (or (= ~min3~0 0) (< ~min3~0 0)) (= ~min2~0 0) (= ~min3~0 ~min1~0)), Black: 990#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 883#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (= ~M~0 0)), Black: 875#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0)), Black: 1442#(and (= ~min2~0 0) (or (= ~min1~0 0) (< ~min3~0 0)) (= ~min3~0 ~min1~0)), Black: 1441#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (not (= ~min3~0 0))) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min3~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0))), Black: 313#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 827#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (or (not (= thread3Thread1of1ForFork2_~i~2 0)) (= ~min3~0 0)) (= thread1Thread1of1ForFork0_~i~0 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2))) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (< ~min3~0 0)) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min3~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0)))]) [2023-11-06 21:16:32,779 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2023-11-06 21:16:32,779 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 21:16:32,779 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 21:16:32,780 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 21:16:32,780 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([571] L58-4-->L58-4: Formula: (and (let ((.cse0 (select (select |v_#memory_int_98| v_~A~0.base_49) (+ (* v_thread2Thread1of1ForFork1_~i~1_34 4) v_~A~0.offset_49)))) (or (and (< .cse0 v_~min2~0_39) (= v_~min2~0_38 .cse0)) (and (= v_~min2~0_39 v_~min2~0_38) (<= v_~min2~0_39 .cse0) (= |v_thread2Thread1of1ForFork1_#t~mem6_16| |v_thread2Thread1of1ForFork1_#t~mem6_15|)))) (= v_thread2Thread1of1ForFork1_~i~1_33 (+ v_thread2Thread1of1ForFork1_~i~1_34 1)) (< v_thread2Thread1of1ForFork1_~i~1_34 v_~M~0_27)) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_34, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_16|, ~M~0=v_~M~0_27, #memory_int=|v_#memory_int_98|, ~min2~0=v_~min2~0_39} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_33, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_17|, ~A~0.base=v_~A~0.base_49, thread2Thread1of1ForFork1_#t~mem5=|v_thread2Thread1of1ForFork1_#t~mem5_9|, ~A~0.offset=v_~A~0.offset_49, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_15|, ~M~0=v_~M~0_27, #memory_int=|v_#memory_int_98|, ~min2~0=v_~min2~0_38} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~mem5, thread2Thread1of1ForFork1_#t~mem6, ~min2~0][41], [Black: 725#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), 1434#true, 33#L70-4true, 79#L96-1true, 1015#true, Black: 654#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0) (= ~M~0 0)), 1592#true, Black: 1426#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 0 ~M~0) (and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0))) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))) (or (= ~min1~0 0) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))))), Black: 1421#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0) (= ~M~0 0)), Black: 521#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1416#(and (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 561#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), Black: 1414#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0) (= ~M~0 0)), Black: 542#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0)), Black: 1222#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)))), Black: 1412#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0) (= ~M~0 0)), Black: 1423#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 0 ~M~0) (and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0))) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))))), Black: 1100#(or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))), Black: 1200#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)) (exists ((v_thread3Thread1of1ForFork2_~i~2_52 Int)) (and (<= 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork2_~i~2_52 4))) (<= 0 v_thread3Thread1of1ForFork2_~i~2_52) (<= (+ v_thread3Thread1of1ForFork2_~i~2_52 1) ~N~0))) (<= 1 ~N~0) (= ~min3~0 0)), 834#true, 72#L58-4true, Black: 160#(and (= ~min1~0 0) (= ~min2~0 0) (= ~min3~0 0)), Black: 474#(and (= ~min1~0 0) (= ~min2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (= ~N~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (= ~min3~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 479#(and (= ~min2~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (or (= ~min1~0 0) (< ~min3~0 0)) (= ~min3~0 ~min1~0) (= ~M~0 0)), 485#true, Black: 351#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~min3~0 0) (= ~M~0 0)), 316#true, Black: 165#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 879#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0)), 1243#true, 173#(and (<= (+ ~M~0 1) ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 994#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 839#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1)), Black: 841#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (not (= thread3Thread1of1ForFork2_~i~2 0)) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2))) (= ~min3~0 0)), Black: 996#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), 666#true, Black: 891#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0)), Black: 842#(and (or (= ~min3~0 0) (< ~min3~0 0)) (= ~min2~0 0) (= ~min3~0 ~min1~0)), Black: 990#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 883#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1442#(and (= ~min2~0 0) (or (= ~min1~0 0) (< ~min3~0 0)) (= ~min3~0 ~min1~0)), Black: 875#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0)), Black: 1441#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (not (= ~min3~0 0))) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min3~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0))), Black: 313#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 827#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (or (not (= thread3Thread1of1ForFork2_~i~2 0)) (= ~min3~0 0)) (= thread1Thread1of1ForFork0_~i~0 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2))) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (< ~min3~0 0)) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min3~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0)))]) [2023-11-06 21:16:32,781 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2023-11-06 21:16:32,781 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 21:16:32,781 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 21:16:32,781 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 21:16:32,838 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] L70-4-->L70-4: Formula: (and (= v_thread3Thread1of1ForFork2_~i~2_33 (+ v_thread3Thread1of1ForFork2_~i~2_34 1)) (< v_thread3Thread1of1ForFork2_~i~2_34 v_~N~0_37) (let ((.cse0 (select (select |v_#memory_int_100| v_~A~0.base_51) (+ v_~A~0.offset_51 (* v_thread3Thread1of1ForFork2_~i~2_34 4))))) (or (and (= v_~min3~0_39 v_~min3~0_38) (<= v_~min3~0_39 .cse0) (= |v_thread3Thread1of1ForFork2_#t~mem9_16| |v_thread3Thread1of1ForFork2_#t~mem9_15|)) (and (= v_~min3~0_38 .cse0) (< .cse0 v_~min3~0_39))))) InVars {~A~0.base=v_~A~0.base_51, ~A~0.offset=v_~A~0.offset_51, #memory_int=|v_#memory_int_100|, thread3Thread1of1ForFork2_#t~mem9=|v_thread3Thread1of1ForFork2_#t~mem9_16|, ~N~0=v_~N~0_37, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_34, ~min3~0=v_~min3~0_39} OutVars{~A~0.base=v_~A~0.base_51, ~A~0.offset=v_~A~0.offset_51, #memory_int=|v_#memory_int_100|, thread3Thread1of1ForFork2_#t~mem8=|v_thread3Thread1of1ForFork2_#t~mem8_9|, thread3Thread1of1ForFork2_#t~post7=|v_thread3Thread1of1ForFork2_#t~post7_17|, thread3Thread1of1ForFork2_#t~mem9=|v_thread3Thread1of1ForFork2_#t~mem9_15|, ~N~0=v_~N~0_37, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_33, ~min3~0=v_~min3~0_38} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem8, thread3Thread1of1ForFork2_#t~post7, thread3Thread1of1ForFork2_#t~mem9, thread3Thread1of1ForFork2_~i~2, ~min3~0][243], [Black: 725#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), 1434#true, 33#L70-4true, 109#L95-1true, 1015#true, Black: 654#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1426#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 0 ~M~0) (and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0))) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))) (or (= ~min1~0 0) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))))), Black: 1421#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0) (= ~M~0 0)), Black: 521#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1416#(and (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 561#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), Black: 1414#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0) (= ~M~0 0)), Black: 542#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0)), Black: 1222#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)))), Black: 1412#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0) (= ~M~0 0)), Black: 1423#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 0 ~M~0) (and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0))) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))))), Black: 1100#(or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))), Black: 1200#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)) (exists ((v_thread3Thread1of1ForFork2_~i~2_52 Int)) (and (<= 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork2_~i~2_52 4))) (<= 0 v_thread3Thread1of1ForFork2_~i~2_52) (<= (+ v_thread3Thread1of1ForFork2_~i~2_52 1) ~N~0))) (<= 1 ~N~0) (= ~min3~0 0)), 1597#(<= 2 ~N~0), 834#true, 72#L58-4true, Black: 160#(and (= ~min1~0 0) (= ~min2~0 0) (= ~min3~0 0)), Black: 474#(and (= ~min1~0 0) (= ~min2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (= ~N~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (= ~min3~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), 485#true, Black: 479#(and (= ~min2~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (or (= ~min1~0 0) (< ~min3~0 0)) (= ~min3~0 ~min1~0) (= ~M~0 0)), Black: 351#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~min3~0 0) (= ~M~0 0)), 316#true, Black: 165#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 879#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0)), 1243#true, Black: 994#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 839#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1)), Black: 841#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (not (= thread3Thread1of1ForFork2_~i~2 0)) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2))) (= ~min3~0 0)), Black: 173#(and (<= (+ ~M~0 1) ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 996#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 891#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0)), 666#true, Black: 842#(and (or (= ~min3~0 0) (< ~min3~0 0)) (= ~min2~0 0) (= ~min3~0 ~min1~0)), Black: 990#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 883#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1442#(and (= ~min2~0 0) (or (= ~min1~0 0) (< ~min3~0 0)) (= ~min3~0 ~min1~0)), Black: 875#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0)), 85#thread1EXITtrue, Black: 1441#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (not (= ~min3~0 0))) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min3~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0))), Black: 313#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 827#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (or (not (= thread3Thread1of1ForFork2_~i~2 0)) (= ~min3~0 0)) (= thread1Thread1of1ForFork0_~i~0 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2))) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (< ~min3~0 0)) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min3~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0)))]) [2023-11-06 21:16:32,839 INFO L294 olderBase$Statistics]: this new event has 17 ancestors and is not cut-off event [2023-11-06 21:16:32,839 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is not cut-off event [2023-11-06 21:16:32,839 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is not cut-off event [2023-11-06 21:16:32,839 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is not cut-off event [2023-11-06 21:16:32,845 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] L70-4-->L70-4: Formula: (and (= v_thread3Thread1of1ForFork2_~i~2_33 (+ v_thread3Thread1of1ForFork2_~i~2_34 1)) (< v_thread3Thread1of1ForFork2_~i~2_34 v_~N~0_37) (let ((.cse0 (select (select |v_#memory_int_100| v_~A~0.base_51) (+ v_~A~0.offset_51 (* v_thread3Thread1of1ForFork2_~i~2_34 4))))) (or (and (= v_~min3~0_39 v_~min3~0_38) (<= v_~min3~0_39 .cse0) (= |v_thread3Thread1of1ForFork2_#t~mem9_16| |v_thread3Thread1of1ForFork2_#t~mem9_15|)) (and (= v_~min3~0_38 .cse0) (< .cse0 v_~min3~0_39))))) InVars {~A~0.base=v_~A~0.base_51, ~A~0.offset=v_~A~0.offset_51, #memory_int=|v_#memory_int_100|, thread3Thread1of1ForFork2_#t~mem9=|v_thread3Thread1of1ForFork2_#t~mem9_16|, ~N~0=v_~N~0_37, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_34, ~min3~0=v_~min3~0_39} OutVars{~A~0.base=v_~A~0.base_51, ~A~0.offset=v_~A~0.offset_51, #memory_int=|v_#memory_int_100|, thread3Thread1of1ForFork2_#t~mem8=|v_thread3Thread1of1ForFork2_#t~mem8_9|, thread3Thread1of1ForFork2_#t~post7=|v_thread3Thread1of1ForFork2_#t~post7_17|, thread3Thread1of1ForFork2_#t~mem9=|v_thread3Thread1of1ForFork2_#t~mem9_15|, ~N~0=v_~N~0_37, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_33, ~min3~0=v_~min3~0_38} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem8, thread3Thread1of1ForFork2_#t~post7, thread3Thread1of1ForFork2_#t~mem9, thread3Thread1of1ForFork2_~i~2, ~min3~0][243], [Black: 725#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), 1434#true, 33#L70-4true, 1015#true, Black: 654#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1426#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 0 ~M~0) (and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0))) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))) (or (= ~min1~0 0) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))))), Black: 1421#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0) (= ~M~0 0)), Black: 521#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1416#(and (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 561#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), Black: 1414#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0) (= ~M~0 0)), Black: 542#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0)), Black: 1222#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)))), Black: 1412#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0) (= ~M~0 0)), Black: 1423#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 0 ~M~0) (and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0))) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))))), Black: 1100#(or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))), Black: 1200#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)) (exists ((v_thread3Thread1of1ForFork2_~i~2_52 Int)) (and (<= 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork2_~i~2_52 4))) (<= 0 v_thread3Thread1of1ForFork2_~i~2_52) (<= (+ v_thread3Thread1of1ForFork2_~i~2_52 1) ~N~0))) (<= 1 ~N~0) (= ~min3~0 0)), 1597#(<= 2 ~N~0), 834#true, 72#L58-4true, Black: 160#(and (= ~min1~0 0) (= ~min2~0 0) (= ~min3~0 0)), Black: 474#(and (= ~min1~0 0) (= ~min2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (= ~N~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (= ~min3~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 479#(and (= ~min2~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (or (= ~min1~0 0) (< ~min3~0 0)) (= ~min3~0 ~min1~0) (= ~M~0 0)), 485#true, Black: 351#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~min3~0 0) (= ~M~0 0)), 316#true, Black: 165#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 108#L95-2true, Black: 879#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0)), 1243#true, Black: 994#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 839#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1)), Black: 841#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (not (= thread3Thread1of1ForFork2_~i~2 0)) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2))) (= ~min3~0 0)), Black: 173#(and (<= (+ ~M~0 1) ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 996#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 891#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0)), 666#true, Black: 842#(and (or (= ~min3~0 0) (< ~min3~0 0)) (= ~min2~0 0) (= ~min3~0 ~min1~0)), Black: 990#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 883#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1442#(and (= ~min2~0 0) (or (= ~min1~0 0) (< ~min3~0 0)) (= ~min3~0 ~min1~0)), Black: 875#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0)), Black: 1441#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (not (= ~min3~0 0))) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min3~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0))), Black: 313#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 827#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (or (not (= thread3Thread1of1ForFork2_~i~2 0)) (= ~min3~0 0)) (= thread1Thread1of1ForFork0_~i~0 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2))) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (< ~min3~0 0)) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min3~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0)))]) [2023-11-06 21:16:32,846 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2023-11-06 21:16:32,846 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 21:16:32,847 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 21:16:32,847 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 21:16:32,847 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([556] L58-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_7| 0) (<= v_~M~0_23 v_thread2Thread1of1ForFork1_~i~1_30) (= |v_thread2Thread1of1ForFork1_#res.offset_7| 0)) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_30, ~M~0=v_~M~0_23} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_7|, ~M~0=v_~M~0_23, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#res.base][77], [Black: 725#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), 1434#true, 33#L70-4true, 1015#true, Black: 654#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1426#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 0 ~M~0) (and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0))) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))) (or (= ~min1~0 0) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))))), Black: 1421#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0) (= ~M~0 0)), Black: 521#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1416#(and (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 561#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), Black: 1414#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0) (= ~M~0 0)), Black: 542#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0)), Black: 1222#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)))), Black: 1412#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0) (= ~M~0 0)), Black: 1100#(or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))), 7#thread2EXITtrue, Black: 1423#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 0 ~M~0) (and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0))) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))))), Black: 1200#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)) (exists ((v_thread3Thread1of1ForFork2_~i~2_52 Int)) (and (<= 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork2_~i~2_52 4))) (<= 0 v_thread3Thread1of1ForFork2_~i~2_52) (<= (+ v_thread3Thread1of1ForFork2_~i~2_52 1) ~N~0))) (<= 1 ~N~0) (= ~min3~0 0)), 1597#(<= 2 ~N~0), 834#true, Black: 474#(and (= ~min1~0 0) (= ~min2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (= ~N~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (= ~min3~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 160#(and (= ~min1~0 0) (= ~min2~0 0) (= ~min3~0 0)), Black: 479#(and (= ~min2~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (or (= ~min1~0 0) (< ~min3~0 0)) (= ~min3~0 ~min1~0) (= ~M~0 0)), 485#true, Black: 351#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~min3~0 0) (= ~M~0 0)), 316#true, Black: 165#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 108#L95-2true, Black: 879#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0)), 1243#true, 173#(and (<= (+ ~M~0 1) ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 994#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 839#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1)), Black: 841#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (not (= thread3Thread1of1ForFork2_~i~2 0)) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2))) (= ~min3~0 0)), Black: 996#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 891#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0)), 666#true, Black: 842#(and (or (= ~min3~0 0) (< ~min3~0 0)) (= ~min2~0 0) (= ~min3~0 ~min1~0)), Black: 990#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 883#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1442#(and (= ~min2~0 0) (or (= ~min1~0 0) (< ~min3~0 0)) (= ~min3~0 ~min1~0)), Black: 875#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0)), Black: 1441#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (not (= ~min3~0 0))) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min3~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0))), Black: 313#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 827#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (or (not (= thread3Thread1of1ForFork2_~i~2 0)) (= ~min3~0 0)) (= thread1Thread1of1ForFork0_~i~0 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2))) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (< ~min3~0 0)) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min3~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0)))]) [2023-11-06 21:16:32,848 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2023-11-06 21:16:32,848 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 21:16:32,849 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 21:16:32,849 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 21:16:32,849 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([571] L58-4-->L58-4: Formula: (and (let ((.cse0 (select (select |v_#memory_int_98| v_~A~0.base_49) (+ (* v_thread2Thread1of1ForFork1_~i~1_34 4) v_~A~0.offset_49)))) (or (and (< .cse0 v_~min2~0_39) (= v_~min2~0_38 .cse0)) (and (= v_~min2~0_39 v_~min2~0_38) (<= v_~min2~0_39 .cse0) (= |v_thread2Thread1of1ForFork1_#t~mem6_16| |v_thread2Thread1of1ForFork1_#t~mem6_15|)))) (= v_thread2Thread1of1ForFork1_~i~1_33 (+ v_thread2Thread1of1ForFork1_~i~1_34 1)) (< v_thread2Thread1of1ForFork1_~i~1_34 v_~M~0_27)) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_34, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_16|, ~M~0=v_~M~0_27, #memory_int=|v_#memory_int_98|, ~min2~0=v_~min2~0_39} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_33, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_17|, ~A~0.base=v_~A~0.base_49, thread2Thread1of1ForFork1_#t~mem5=|v_thread2Thread1of1ForFork1_#t~mem5_9|, ~A~0.offset=v_~A~0.offset_49, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_15|, ~M~0=v_~M~0_27, #memory_int=|v_#memory_int_98|, ~min2~0=v_~min2~0_38} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~mem5, thread2Thread1of1ForFork1_#t~mem6, ~min2~0][78], [Black: 725#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), 1434#true, 33#L70-4true, 1015#true, Black: 654#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1426#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 0 ~M~0) (and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0))) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))) (or (= ~min1~0 0) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))))), Black: 1421#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0) (= ~M~0 0)), Black: 521#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1416#(and (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 561#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), Black: 1414#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0) (= ~M~0 0)), Black: 542#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0)), Black: 1222#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)))), Black: 1412#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0) (= ~M~0 0)), Black: 1423#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 0 ~M~0) (and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0))) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))))), Black: 1100#(or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))), Black: 1200#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)) (exists ((v_thread3Thread1of1ForFork2_~i~2_52 Int)) (and (<= 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork2_~i~2_52 4))) (<= 0 v_thread3Thread1of1ForFork2_~i~2_52) (<= (+ v_thread3Thread1of1ForFork2_~i~2_52 1) ~N~0))) (<= 1 ~N~0) (= ~min3~0 0)), 1597#(<= 2 ~N~0), 834#true, 72#L58-4true, Black: 474#(and (= ~min1~0 0) (= ~min2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (= ~N~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (= ~min3~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 160#(and (= ~min1~0 0) (= ~min2~0 0) (= ~min3~0 0)), Black: 479#(and (= ~min2~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (or (= ~min1~0 0) (< ~min3~0 0)) (= ~min3~0 ~min1~0) (= ~M~0 0)), 485#true, Black: 351#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~min3~0 0) (= ~M~0 0)), 316#true, Black: 165#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 108#L95-2true, Black: 879#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0)), 1243#true, 173#(and (<= (+ ~M~0 1) ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 994#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 839#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1)), Black: 841#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (not (= thread3Thread1of1ForFork2_~i~2 0)) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2))) (= ~min3~0 0)), Black: 996#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 891#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0)), 666#true, Black: 842#(and (or (= ~min3~0 0) (< ~min3~0 0)) (= ~min2~0 0) (= ~min3~0 ~min1~0)), Black: 990#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 883#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1442#(and (= ~min2~0 0) (or (= ~min1~0 0) (< ~min3~0 0)) (= ~min3~0 ~min1~0)), Black: 875#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0)), Black: 1441#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (not (= ~min3~0 0))) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min3~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0))), Black: 313#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 827#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (or (not (= thread3Thread1of1ForFork2_~i~2 0)) (= ~min3~0 0)) (= thread1Thread1of1ForFork0_~i~0 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2))) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (< ~min3~0 0)) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min3~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0)))]) [2023-11-06 21:16:32,850 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event [2023-11-06 21:16:32,850 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 21:16:32,850 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 21:16:32,851 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 21:16:32,911 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] L70-4-->L70-4: Formula: (and (= v_thread3Thread1of1ForFork2_~i~2_33 (+ v_thread3Thread1of1ForFork2_~i~2_34 1)) (< v_thread3Thread1of1ForFork2_~i~2_34 v_~N~0_37) (let ((.cse0 (select (select |v_#memory_int_100| v_~A~0.base_51) (+ v_~A~0.offset_51 (* v_thread3Thread1of1ForFork2_~i~2_34 4))))) (or (and (= v_~min3~0_39 v_~min3~0_38) (<= v_~min3~0_39 .cse0) (= |v_thread3Thread1of1ForFork2_#t~mem9_16| |v_thread3Thread1of1ForFork2_#t~mem9_15|)) (and (= v_~min3~0_38 .cse0) (< .cse0 v_~min3~0_39))))) InVars {~A~0.base=v_~A~0.base_51, ~A~0.offset=v_~A~0.offset_51, #memory_int=|v_#memory_int_100|, thread3Thread1of1ForFork2_#t~mem9=|v_thread3Thread1of1ForFork2_#t~mem9_16|, ~N~0=v_~N~0_37, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_34, ~min3~0=v_~min3~0_39} OutVars{~A~0.base=v_~A~0.base_51, ~A~0.offset=v_~A~0.offset_51, #memory_int=|v_#memory_int_100|, thread3Thread1of1ForFork2_#t~mem8=|v_thread3Thread1of1ForFork2_#t~mem8_9|, thread3Thread1of1ForFork2_#t~post7=|v_thread3Thread1of1ForFork2_#t~post7_17|, thread3Thread1of1ForFork2_#t~mem9=|v_thread3Thread1of1ForFork2_#t~mem9_15|, ~N~0=v_~N~0_37, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_33, ~min3~0=v_~min3~0_38} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem8, thread3Thread1of1ForFork2_#t~post7, thread3Thread1of1ForFork2_#t~mem9, thread3Thread1of1ForFork2_~i~2, ~min3~0][243], [Black: 725#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), 1434#true, 33#L70-4true, 79#L96-1true, 1015#true, Black: 654#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1426#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 0 ~M~0) (and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0))) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))) (or (= ~min1~0 0) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))))), Black: 1421#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0) (= ~M~0 0)), Black: 521#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1416#(and (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 561#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), Black: 1414#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0) (= ~M~0 0)), Black: 542#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0)), Black: 1222#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)))), Black: 1412#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0) (= ~M~0 0)), Black: 1423#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 0 ~M~0) (and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0))) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))))), Black: 1100#(or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))), Black: 1200#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)) (exists ((v_thread3Thread1of1ForFork2_~i~2_52 Int)) (and (<= 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork2_~i~2_52 4))) (<= 0 v_thread3Thread1of1ForFork2_~i~2_52) (<= (+ v_thread3Thread1of1ForFork2_~i~2_52 1) ~N~0))) (<= 1 ~N~0) (= ~min3~0 0)), 1597#(<= 2 ~N~0), 834#true, 72#L58-4true, Black: 474#(and (= ~min1~0 0) (= ~min2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (= ~N~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (= ~min3~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 160#(and (= ~min1~0 0) (= ~min2~0 0) (= ~min3~0 0)), Black: 479#(and (= ~min2~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (or (= ~min1~0 0) (< ~min3~0 0)) (= ~min3~0 ~min1~0) (= ~M~0 0)), 485#true, Black: 351#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~min3~0 0) (= ~M~0 0)), 316#true, Black: 165#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 879#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0)), 1243#true, Black: 994#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 839#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1)), Black: 841#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (not (= thread3Thread1of1ForFork2_~i~2 0)) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2))) (= ~min3~0 0)), Black: 173#(and (<= (+ ~M~0 1) ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 996#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 891#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0)), 666#true, Black: 842#(and (or (= ~min3~0 0) (< ~min3~0 0)) (= ~min2~0 0) (= ~min3~0 ~min1~0)), Black: 990#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 883#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1442#(and (= ~min2~0 0) (or (= ~min1~0 0) (< ~min3~0 0)) (= ~min3~0 ~min1~0)), Black: 875#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0)), Black: 1441#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (not (= ~min3~0 0))) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min3~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0))), Black: 313#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 827#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (or (not (= thread3Thread1of1ForFork2_~i~2 0)) (= ~min3~0 0)) (= thread1Thread1of1ForFork0_~i~0 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2))) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (< ~min3~0 0)) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min3~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0)))]) [2023-11-06 21:16:32,912 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-11-06 21:16:32,912 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 21:16:32,912 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 21:16:32,912 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 21:16:32,913 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([556] L58-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_7| 0) (<= v_~M~0_23 v_thread2Thread1of1ForFork1_~i~1_30) (= |v_thread2Thread1of1ForFork1_#res.offset_7| 0)) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_30, ~M~0=v_~M~0_23} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_7|, ~M~0=v_~M~0_23, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#res.base][77], [Black: 725#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), 1434#true, 33#L70-4true, 79#L96-1true, 1015#true, Black: 654#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1426#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 0 ~M~0) (and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0))) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))) (or (= ~min1~0 0) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))))), Black: 1421#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0) (= ~M~0 0)), Black: 521#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1416#(and (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 561#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), Black: 1414#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0) (= ~M~0 0)), Black: 542#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0)), Black: 1222#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)))), Black: 1412#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0) (= ~M~0 0)), Black: 1100#(or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))), 7#thread2EXITtrue, Black: 1423#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 0 ~M~0) (and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0))) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))))), Black: 1200#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)) (exists ((v_thread3Thread1of1ForFork2_~i~2_52 Int)) (and (<= 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork2_~i~2_52 4))) (<= 0 v_thread3Thread1of1ForFork2_~i~2_52) (<= (+ v_thread3Thread1of1ForFork2_~i~2_52 1) ~N~0))) (<= 1 ~N~0) (= ~min3~0 0)), 1597#(<= 2 ~N~0), 834#true, Black: 474#(and (= ~min1~0 0) (= ~min2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (= ~N~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (= ~min3~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 160#(and (= ~min1~0 0) (= ~min2~0 0) (= ~min3~0 0)), Black: 479#(and (= ~min2~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (or (= ~min1~0 0) (< ~min3~0 0)) (= ~min3~0 ~min1~0) (= ~M~0 0)), 485#true, Black: 351#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~min3~0 0) (= ~M~0 0)), 316#true, Black: 165#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 879#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0)), 1243#true, 173#(and (<= (+ ~M~0 1) ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 994#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 839#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1)), Black: 841#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (not (= thread3Thread1of1ForFork2_~i~2 0)) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2))) (= ~min3~0 0)), Black: 996#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 891#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0)), 666#true, Black: 842#(and (or (= ~min3~0 0) (< ~min3~0 0)) (= ~min2~0 0) (= ~min3~0 ~min1~0)), Black: 990#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 883#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1442#(and (= ~min2~0 0) (or (= ~min1~0 0) (< ~min3~0 0)) (= ~min3~0 ~min1~0)), Black: 875#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0)), Black: 1441#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (not (= ~min3~0 0))) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min3~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0))), Black: 313#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 827#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (or (not (= thread3Thread1of1ForFork2_~i~2 0)) (= ~min3~0 0)) (= thread1Thread1of1ForFork0_~i~0 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2))) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (< ~min3~0 0)) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min3~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0)))]) [2023-11-06 21:16:32,913 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-11-06 21:16:32,913 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 21:16:32,914 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 21:16:32,914 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 21:16:32,914 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([571] L58-4-->L58-4: Formula: (and (let ((.cse0 (select (select |v_#memory_int_98| v_~A~0.base_49) (+ (* v_thread2Thread1of1ForFork1_~i~1_34 4) v_~A~0.offset_49)))) (or (and (< .cse0 v_~min2~0_39) (= v_~min2~0_38 .cse0)) (and (= v_~min2~0_39 v_~min2~0_38) (<= v_~min2~0_39 .cse0) (= |v_thread2Thread1of1ForFork1_#t~mem6_16| |v_thread2Thread1of1ForFork1_#t~mem6_15|)))) (= v_thread2Thread1of1ForFork1_~i~1_33 (+ v_thread2Thread1of1ForFork1_~i~1_34 1)) (< v_thread2Thread1of1ForFork1_~i~1_34 v_~M~0_27)) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_34, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_16|, ~M~0=v_~M~0_27, #memory_int=|v_#memory_int_98|, ~min2~0=v_~min2~0_39} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_33, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_17|, ~A~0.base=v_~A~0.base_49, thread2Thread1of1ForFork1_#t~mem5=|v_thread2Thread1of1ForFork1_#t~mem5_9|, ~A~0.offset=v_~A~0.offset_49, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_15|, ~M~0=v_~M~0_27, #memory_int=|v_#memory_int_98|, ~min2~0=v_~min2~0_38} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~mem5, thread2Thread1of1ForFork1_#t~mem6, ~min2~0][78], [Black: 725#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), 1434#true, 33#L70-4true, 79#L96-1true, 1015#true, Black: 654#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1426#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 0 ~M~0) (and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0))) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))) (or (= ~min1~0 0) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))))), Black: 1421#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0) (= ~M~0 0)), Black: 521#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1416#(and (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 561#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), Black: 1414#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0) (= ~M~0 0)), Black: 542#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0)), Black: 1222#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)))), Black: 1412#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0) (= ~M~0 0)), Black: 1423#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 0 ~M~0) (and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0))) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))))), Black: 1100#(or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))), Black: 1200#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)) (exists ((v_thread3Thread1of1ForFork2_~i~2_52 Int)) (and (<= 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork2_~i~2_52 4))) (<= 0 v_thread3Thread1of1ForFork2_~i~2_52) (<= (+ v_thread3Thread1of1ForFork2_~i~2_52 1) ~N~0))) (<= 1 ~N~0) (= ~min3~0 0)), 1597#(<= 2 ~N~0), 834#true, 72#L58-4true, Black: 474#(and (= ~min1~0 0) (= ~min2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (= ~N~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (= ~min3~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 160#(and (= ~min1~0 0) (= ~min2~0 0) (= ~min3~0 0)), Black: 479#(and (= ~min2~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (or (= ~min1~0 0) (< ~min3~0 0)) (= ~min3~0 ~min1~0) (= ~M~0 0)), 485#true, Black: 351#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~min3~0 0) (= ~M~0 0)), 316#true, Black: 165#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 879#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0)), 1243#true, 173#(and (<= (+ ~M~0 1) ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 994#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 839#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1)), Black: 841#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (not (= thread3Thread1of1ForFork2_~i~2 0)) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2))) (= ~min3~0 0)), Black: 996#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 891#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0)), 666#true, Black: 842#(and (or (= ~min3~0 0) (< ~min3~0 0)) (= ~min2~0 0) (= ~min3~0 ~min1~0)), Black: 990#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 883#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (= ~M~0 0)), Black: 875#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0)), Black: 1442#(and (= ~min2~0 0) (or (= ~min1~0 0) (< ~min3~0 0)) (= ~min3~0 ~min1~0)), Black: 1441#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (not (= ~min3~0 0))) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min3~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0))), Black: 313#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 827#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (or (not (= thread3Thread1of1ForFork2_~i~2 0)) (= ~min3~0 0)) (= thread1Thread1of1ForFork0_~i~0 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2))) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (< ~min3~0 0)) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min3~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0)))]) [2023-11-06 21:16:32,915 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-11-06 21:16:32,915 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 21:16:32,915 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 21:16:32,915 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 21:16:33,020 INFO L124 PetriNetUnfolderBase]: 3112/4543 cut-off events. [2023-11-06 21:16:33,020 INFO L125 PetriNetUnfolderBase]: For 29282/29672 co-relation queries the response was YES. [2023-11-06 21:16:33,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23547 conditions, 4543 events. 3112/4543 cut-off events. For 29282/29672 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 22702 event pairs, 772 based on Foata normal form. 198/4484 useless extension candidates. Maximal degree in co-relation 23323. Up to 3187 conditions per place. [2023-11-06 21:16:33,175 INFO L140 encePairwiseOnDemand]: 296/302 looper letters, 376 selfloop transitions, 53 changer transitions 0/459 dead transitions. [2023-11-06 21:16:33,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 459 transitions, 4549 flow [2023-11-06 21:16:33,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 21:16:33,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 21:16:33,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1057 transitions. [2023-11-06 21:16:33,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2023-11-06 21:16:33,184 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1057 transitions. [2023-11-06 21:16:33,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1057 transitions. [2023-11-06 21:16:33,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:33,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1057 transitions. [2023-11-06 21:16:33,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 132.125) internal successors, (1057), 8 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:33,191 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 302.0) internal successors, (2718), 9 states have internal predecessors, (2718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:33,192 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 302.0) internal successors, (2718), 9 states have internal predecessors, (2718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:33,193 INFO L175 Difference]: Start difference. First operand has 159 places, 345 transitions, 2988 flow. Second operand 8 states and 1057 transitions. [2023-11-06 21:16:33,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 459 transitions, 4549 flow [2023-11-06 21:16:33,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 459 transitions, 4393 flow, removed 18 selfloop flow, removed 6 redundant places. [2023-11-06 21:16:33,317 INFO L231 Difference]: Finished difference. Result has 163 places, 373 transitions, 3281 flow [2023-11-06 21:16:33,318 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=2832, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3281, PETRI_PLACES=163, PETRI_TRANSITIONS=373} [2023-11-06 21:16:33,319 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 133 predicate places. [2023-11-06 21:16:33,319 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 373 transitions, 3281 flow [2023-11-06 21:16:33,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 126.8) internal successors, (1902), 15 states have internal predecessors, (1902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:33,320 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:33,320 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:16:33,334 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-06 21:16:33,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:16:33,528 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 21:16:33,528 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:33,528 INFO L85 PathProgramCache]: Analyzing trace with hash 926362406, now seen corresponding path program 9 times [2023-11-06 21:16:33,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:16:33,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034342011] [2023-11-06 21:16:33,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:33,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:16:33,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:33,700 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:16:33,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:16:33,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034342011] [2023-11-06 21:16:33,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034342011] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:16:33,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462016334] [2023-11-06 21:16:33,701 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 21:16:33,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:16:33,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:16:33,704 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:16:33,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-06 21:16:33,980 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-06 21:16:33,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:16:33,983 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 21:16:33,985 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:16:34,078 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:16:34,079 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:16:34,157 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:16:34,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462016334] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:16:34,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:16:34,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-11-06 21:16:34,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557642996] [2023-11-06 21:16:34,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:16:34,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-06 21:16:34,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:16:34,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-06 21:16:34,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-11-06 21:16:34,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 302 [2023-11-06 21:16:34,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 373 transitions, 3281 flow. Second operand has 14 states, 14 states have (on average 126.64285714285714) internal successors, (1773), 14 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:34,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:34,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 302 [2023-11-06 21:16:34,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:35,508 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] L70-4-->L70-4: Formula: (and (= v_thread3Thread1of1ForFork2_~i~2_33 (+ v_thread3Thread1of1ForFork2_~i~2_34 1)) (< v_thread3Thread1of1ForFork2_~i~2_34 v_~N~0_37) (let ((.cse0 (select (select |v_#memory_int_100| v_~A~0.base_51) (+ v_~A~0.offset_51 (* v_thread3Thread1of1ForFork2_~i~2_34 4))))) (or (and (= v_~min3~0_39 v_~min3~0_38) (<= v_~min3~0_39 .cse0) (= |v_thread3Thread1of1ForFork2_#t~mem9_16| |v_thread3Thread1of1ForFork2_#t~mem9_15|)) (and (= v_~min3~0_38 .cse0) (< .cse0 v_~min3~0_39))))) InVars {~A~0.base=v_~A~0.base_51, ~A~0.offset=v_~A~0.offset_51, #memory_int=|v_#memory_int_100|, thread3Thread1of1ForFork2_#t~mem9=|v_thread3Thread1of1ForFork2_#t~mem9_16|, ~N~0=v_~N~0_37, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_34, ~min3~0=v_~min3~0_39} OutVars{~A~0.base=v_~A~0.base_51, ~A~0.offset=v_~A~0.offset_51, #memory_int=|v_#memory_int_100|, thread3Thread1of1ForFork2_#t~mem8=|v_thread3Thread1of1ForFork2_#t~mem8_9|, thread3Thread1of1ForFork2_#t~post7=|v_thread3Thread1of1ForFork2_#t~post7_17|, thread3Thread1of1ForFork2_#t~mem9=|v_thread3Thread1of1ForFork2_#t~mem9_15|, ~N~0=v_~N~0_37, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_33, ~min3~0=v_~min3~0_38} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem8, thread3Thread1of1ForFork2_#t~post7, thread3Thread1of1ForFork2_#t~mem9, thread3Thread1of1ForFork2_~i~2, ~min3~0][240], [Black: 725#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), 33#L70-4true, 1015#true, Black: 654#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1639#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= 2 ~N~0)), Black: 1426#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 0 ~M~0) (and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0))) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))) (or (= ~min1~0 0) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))))), Black: 1421#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0) (= ~M~0 0)), Black: 521#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1416#(and (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1598#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= 2 ~N~0)), Black: 561#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), Black: 1414#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0) (= ~M~0 0)), Black: 542#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0)), Black: 1222#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)))), Black: 1412#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0) (= ~M~0 0)), Black: 1423#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 0 ~M~0) (and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0))) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))))), Black: 1100#(or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))), Black: 1200#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)) (exists ((v_thread3Thread1of1ForFork2_~i~2_52 Int)) (and (<= 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork2_~i~2_52 4))) (<= 0 v_thread3Thread1of1ForFork2_~i~2_52) (<= (+ v_thread3Thread1of1ForFork2_~i~2_52 1) ~N~0))) (<= 1 ~N~0) (= ~min3~0 0)), 1597#(<= 2 ~N~0), 834#true, 72#L58-4true, Black: 160#(and (= ~min1~0 0) (= ~min2~0 0) (= ~min3~0 0)), Black: 474#(and (= ~min1~0 0) (= ~min2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (= ~N~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (= ~min3~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 479#(and (= ~min2~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (or (= ~min1~0 0) (< ~min3~0 0)) (= ~min3~0 ~min1~0) (= ~M~0 0)), 485#true, Black: 351#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~min3~0 0) (= ~M~0 0)), 316#true, Black: 165#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 108#L95-2true, Black: 879#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0)), 1243#true, Black: 994#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 839#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1)), Black: 841#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (not (= thread3Thread1of1ForFork2_~i~2 0)) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2))) (= ~min3~0 0)), Black: 173#(and (<= (+ ~M~0 1) ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 996#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), 666#true, Black: 891#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0)), Black: 842#(and (or (= ~min3~0 0) (< ~min3~0 0)) (= ~min2~0 0) (= ~min3~0 ~min1~0)), Black: 990#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 883#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1442#(and (= ~min2~0 0) (or (= ~min1~0 0) (< ~min3~0 0)) (= ~min3~0 ~min1~0)), Black: 875#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0)), Black: 1441#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (not (= ~min3~0 0))) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min3~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0))), 1751#true, Black: 313#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 827#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (or (not (= thread3Thread1of1ForFork2_~i~2 0)) (= ~min3~0 0)) (= thread1Thread1of1ForFork0_~i~0 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2))) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (< ~min3~0 0)) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min3~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0)))]) [2023-11-06 21:16:35,509 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-11-06 21:16:35,509 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 21:16:35,509 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 21:16:35,509 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 21:16:35,510 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([556] L58-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_7| 0) (<= v_~M~0_23 v_thread2Thread1of1ForFork1_~i~1_30) (= |v_thread2Thread1of1ForFork1_#res.offset_7| 0)) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_30, ~M~0=v_~M~0_23} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_7|, ~M~0=v_~M~0_23, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#res.base][75], [Black: 725#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), 33#L70-4true, 1015#true, Black: 654#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1639#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= 2 ~N~0)), Black: 1426#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 0 ~M~0) (and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0))) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))) (or (= ~min1~0 0) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))))), Black: 1421#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0) (= ~M~0 0)), Black: 521#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1416#(and (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1598#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= 2 ~N~0)), Black: 561#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), Black: 1414#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0) (= ~M~0 0)), Black: 542#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0)), Black: 1222#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)))), Black: 1412#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0) (= ~M~0 0)), Black: 1100#(or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))), 7#thread2EXITtrue, Black: 1423#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 0 ~M~0) (and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0))) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))))), Black: 1200#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)) (exists ((v_thread3Thread1of1ForFork2_~i~2_52 Int)) (and (<= 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork2_~i~2_52 4))) (<= 0 v_thread3Thread1of1ForFork2_~i~2_52) (<= (+ v_thread3Thread1of1ForFork2_~i~2_52 1) ~N~0))) (<= 1 ~N~0) (= ~min3~0 0)), 1597#(<= 2 ~N~0), 834#true, Black: 160#(and (= ~min1~0 0) (= ~min2~0 0) (= ~min3~0 0)), Black: 474#(and (= ~min1~0 0) (= ~min2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (= ~N~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (= ~min3~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 479#(and (= ~min2~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (or (= ~min1~0 0) (< ~min3~0 0)) (= ~min3~0 ~min1~0) (= ~M~0 0)), 485#true, Black: 351#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~min3~0 0) (= ~M~0 0)), 316#true, Black: 165#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 108#L95-2true, 1243#true, Black: 879#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0)), 173#(and (<= (+ ~M~0 1) ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 994#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 839#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1)), Black: 841#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (not (= thread3Thread1of1ForFork2_~i~2 0)) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2))) (= ~min3~0 0)), Black: 996#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), 666#true, Black: 891#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0)), Black: 842#(and (or (= ~min3~0 0) (< ~min3~0 0)) (= ~min2~0 0) (= ~min3~0 ~min1~0)), Black: 990#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 883#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1442#(and (= ~min2~0 0) (or (= ~min1~0 0) (< ~min3~0 0)) (= ~min3~0 ~min1~0)), Black: 875#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0)), Black: 1441#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (not (= ~min3~0 0))) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min3~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0))), 1751#true, Black: 313#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 827#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (or (not (= thread3Thread1of1ForFork2_~i~2 0)) (= ~min3~0 0)) (= thread1Thread1of1ForFork0_~i~0 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2))) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (< ~min3~0 0)) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min3~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0)))]) [2023-11-06 21:16:35,510 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-11-06 21:16:35,511 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 21:16:35,511 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 21:16:35,511 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 21:16:35,512 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([571] L58-4-->L58-4: Formula: (and (let ((.cse0 (select (select |v_#memory_int_98| v_~A~0.base_49) (+ (* v_thread2Thread1of1ForFork1_~i~1_34 4) v_~A~0.offset_49)))) (or (and (< .cse0 v_~min2~0_39) (= v_~min2~0_38 .cse0)) (and (= v_~min2~0_39 v_~min2~0_38) (<= v_~min2~0_39 .cse0) (= |v_thread2Thread1of1ForFork1_#t~mem6_16| |v_thread2Thread1of1ForFork1_#t~mem6_15|)))) (= v_thread2Thread1of1ForFork1_~i~1_33 (+ v_thread2Thread1of1ForFork1_~i~1_34 1)) (< v_thread2Thread1of1ForFork1_~i~1_34 v_~M~0_27)) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_34, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_16|, ~M~0=v_~M~0_27, #memory_int=|v_#memory_int_98|, ~min2~0=v_~min2~0_39} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_33, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_17|, ~A~0.base=v_~A~0.base_49, thread2Thread1of1ForFork1_#t~mem5=|v_thread2Thread1of1ForFork1_#t~mem5_9|, ~A~0.offset=v_~A~0.offset_49, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_15|, ~M~0=v_~M~0_27, #memory_int=|v_#memory_int_98|, ~min2~0=v_~min2~0_38} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~mem5, thread2Thread1of1ForFork1_#t~mem6, ~min2~0][76], [Black: 725#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), 33#L70-4true, 1015#true, Black: 654#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1639#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= 2 ~N~0)), Black: 1426#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 0 ~M~0) (and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0))) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))) (or (= ~min1~0 0) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))))), Black: 1421#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0) (= ~M~0 0)), Black: 521#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1416#(and (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1598#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= 2 ~N~0)), Black: 561#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), Black: 1414#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0) (= ~M~0 0)), Black: 542#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0)), Black: 1222#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)))), Black: 1412#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0) (= ~M~0 0)), Black: 1423#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 0 ~M~0) (and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0))) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))))), Black: 1100#(or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))), Black: 1200#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)) (exists ((v_thread3Thread1of1ForFork2_~i~2_52 Int)) (and (<= 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork2_~i~2_52 4))) (<= 0 v_thread3Thread1of1ForFork2_~i~2_52) (<= (+ v_thread3Thread1of1ForFork2_~i~2_52 1) ~N~0))) (<= 1 ~N~0) (= ~min3~0 0)), 1597#(<= 2 ~N~0), 834#true, 72#L58-4true, Black: 474#(and (= ~min1~0 0) (= ~min2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (= ~N~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (= ~min3~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 160#(and (= ~min1~0 0) (= ~min2~0 0) (= ~min3~0 0)), Black: 479#(and (= ~min2~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (or (= ~min1~0 0) (< ~min3~0 0)) (= ~min3~0 ~min1~0) (= ~M~0 0)), 485#true, Black: 351#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~min3~0 0) (= ~M~0 0)), 316#true, Black: 165#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 108#L95-2true, Black: 879#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0)), 1243#true, 173#(and (<= (+ ~M~0 1) ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 994#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 839#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1)), Black: 841#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (not (= thread3Thread1of1ForFork2_~i~2 0)) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2))) (= ~min3~0 0)), Black: 996#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), 666#true, Black: 891#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0)), Black: 842#(and (or (= ~min3~0 0) (< ~min3~0 0)) (= ~min2~0 0) (= ~min3~0 ~min1~0)), Black: 990#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 883#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (= ~M~0 0)), Black: 875#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0)), Black: 1442#(and (= ~min2~0 0) (or (= ~min1~0 0) (< ~min3~0 0)) (= ~min3~0 ~min1~0)), Black: 1441#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (not (= ~min3~0 0))) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min3~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0))), 1751#true, Black: 313#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 827#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (or (not (= thread3Thread1of1ForFork2_~i~2 0)) (= ~min3~0 0)) (= thread1Thread1of1ForFork0_~i~0 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2))) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (< ~min3~0 0)) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min3~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0)))]) [2023-11-06 21:16:35,512 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-11-06 21:16:35,512 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 21:16:35,512 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 21:16:35,513 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 21:16:35,543 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] L70-4-->L70-4: Formula: (and (= v_thread3Thread1of1ForFork2_~i~2_33 (+ v_thread3Thread1of1ForFork2_~i~2_34 1)) (< v_thread3Thread1of1ForFork2_~i~2_34 v_~N~0_37) (let ((.cse0 (select (select |v_#memory_int_100| v_~A~0.base_51) (+ v_~A~0.offset_51 (* v_thread3Thread1of1ForFork2_~i~2_34 4))))) (or (and (= v_~min3~0_39 v_~min3~0_38) (<= v_~min3~0_39 .cse0) (= |v_thread3Thread1of1ForFork2_#t~mem9_16| |v_thread3Thread1of1ForFork2_#t~mem9_15|)) (and (= v_~min3~0_38 .cse0) (< .cse0 v_~min3~0_39))))) InVars {~A~0.base=v_~A~0.base_51, ~A~0.offset=v_~A~0.offset_51, #memory_int=|v_#memory_int_100|, thread3Thread1of1ForFork2_#t~mem9=|v_thread3Thread1of1ForFork2_#t~mem9_16|, ~N~0=v_~N~0_37, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_34, ~min3~0=v_~min3~0_39} OutVars{~A~0.base=v_~A~0.base_51, ~A~0.offset=v_~A~0.offset_51, #memory_int=|v_#memory_int_100|, thread3Thread1of1ForFork2_#t~mem8=|v_thread3Thread1of1ForFork2_#t~mem8_9|, thread3Thread1of1ForFork2_#t~post7=|v_thread3Thread1of1ForFork2_#t~post7_17|, thread3Thread1of1ForFork2_#t~mem9=|v_thread3Thread1of1ForFork2_#t~mem9_15|, ~N~0=v_~N~0_37, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_33, ~min3~0=v_~min3~0_38} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem8, thread3Thread1of1ForFork2_#t~post7, thread3Thread1of1ForFork2_#t~mem9, thread3Thread1of1ForFork2_~i~2, ~min3~0][240], [Black: 725#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), 33#L70-4true, 79#L96-1true, 1015#true, Black: 654#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1639#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= 2 ~N~0)), Black: 1426#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 0 ~M~0) (and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0))) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))) (or (= ~min1~0 0) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))))), Black: 1421#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0) (= ~M~0 0)), Black: 521#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1416#(and (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1598#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= 2 ~N~0)), Black: 561#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), Black: 1414#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0) (= ~M~0 0)), Black: 542#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0)), Black: 1222#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)))), Black: 1412#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0) (= ~M~0 0)), Black: 1423#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 0 ~M~0) (and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0))) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))))), Black: 1100#(or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))), Black: 1200#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)) (exists ((v_thread3Thread1of1ForFork2_~i~2_52 Int)) (and (<= 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork2_~i~2_52 4))) (<= 0 v_thread3Thread1of1ForFork2_~i~2_52) (<= (+ v_thread3Thread1of1ForFork2_~i~2_52 1) ~N~0))) (<= 1 ~N~0) (= ~min3~0 0)), 1597#(<= 2 ~N~0), 834#true, 72#L58-4true, Black: 160#(and (= ~min1~0 0) (= ~min2~0 0) (= ~min3~0 0)), Black: 474#(and (= ~min1~0 0) (= ~min2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (= ~N~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (= ~min3~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 479#(and (= ~min2~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (or (= ~min1~0 0) (< ~min3~0 0)) (= ~min3~0 ~min1~0) (= ~M~0 0)), 485#true, Black: 351#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~min3~0 0) (= ~M~0 0)), 316#true, Black: 165#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 879#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0)), 1243#true, Black: 994#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 839#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1)), Black: 841#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (not (= thread3Thread1of1ForFork2_~i~2 0)) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2))) (= ~min3~0 0)), Black: 173#(and (<= (+ ~M~0 1) ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), Black: 996#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), 666#true, Black: 891#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0)), Black: 842#(and (or (= ~min3~0 0) (< ~min3~0 0)) (= ~min2~0 0) (= ~min3~0 ~min1~0)), Black: 990#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 883#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1442#(and (= ~min2~0 0) (or (= ~min1~0 0) (< ~min3~0 0)) (= ~min3~0 ~min1~0)), Black: 875#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0)), Black: 1441#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (not (= ~min3~0 0))) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min3~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0))), 1751#true, Black: 313#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 827#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (or (not (= thread3Thread1of1ForFork2_~i~2 0)) (= ~min3~0 0)) (= thread1Thread1of1ForFork0_~i~0 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2))) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (< ~min3~0 0)) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min3~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0)))]) [2023-11-06 21:16:35,543 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-06 21:16:35,543 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 21:16:35,544 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 21:16:35,544 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 21:16:35,544 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([556] L58-4-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_7| 0) (<= v_~M~0_23 v_thread2Thread1of1ForFork1_~i~1_30) (= |v_thread2Thread1of1ForFork1_#res.offset_7| 0)) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_30, ~M~0=v_~M~0_23} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_7|, ~M~0=v_~M~0_23, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#res.base][75], [Black: 725#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), 33#L70-4true, 79#L96-1true, 1015#true, Black: 654#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1426#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 0 ~M~0) (and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0))) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))) (or (= ~min1~0 0) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))))), Black: 1639#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= 2 ~N~0)), Black: 1421#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0) (= ~M~0 0)), Black: 521#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1416#(and (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1598#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= 2 ~N~0)), Black: 561#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), Black: 1414#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0) (= ~M~0 0)), Black: 542#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0)), Black: 1222#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)))), Black: 1412#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0) (= ~M~0 0)), Black: 1100#(or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))), 7#thread2EXITtrue, Black: 1423#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 0 ~M~0) (and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0))) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))))), Black: 1200#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)) (exists ((v_thread3Thread1of1ForFork2_~i~2_52 Int)) (and (<= 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork2_~i~2_52 4))) (<= 0 v_thread3Thread1of1ForFork2_~i~2_52) (<= (+ v_thread3Thread1of1ForFork2_~i~2_52 1) ~N~0))) (<= 1 ~N~0) (= ~min3~0 0)), 1597#(<= 2 ~N~0), 834#true, Black: 474#(and (= ~min1~0 0) (= ~min2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (= ~N~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (= ~min3~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 160#(and (= ~min1~0 0) (= ~min2~0 0) (= ~min3~0 0)), Black: 479#(and (= ~min2~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (or (= ~min1~0 0) (< ~min3~0 0)) (= ~min3~0 ~min1~0) (= ~M~0 0)), 485#true, Black: 351#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~min3~0 0) (= ~M~0 0)), 316#true, Black: 165#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 879#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0)), 173#(and (<= (+ ~M~0 1) ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 1243#true, Black: 994#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 839#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1)), Black: 841#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (not (= thread3Thread1of1ForFork2_~i~2 0)) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2))) (= ~min3~0 0)), Black: 996#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 891#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0)), 666#true, Black: 842#(and (or (= ~min3~0 0) (< ~min3~0 0)) (= ~min2~0 0) (= ~min3~0 ~min1~0)), Black: 990#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 883#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1442#(and (= ~min2~0 0) (or (= ~min1~0 0) (< ~min3~0 0)) (= ~min3~0 ~min1~0)), Black: 875#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0)), Black: 1441#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (not (= ~min3~0 0))) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min3~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0))), 1751#true, Black: 313#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 827#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (or (not (= thread3Thread1of1ForFork2_~i~2 0)) (= ~min3~0 0)) (= thread1Thread1of1ForFork0_~i~0 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2))) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (< ~min3~0 0)) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min3~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0)))]) [2023-11-06 21:16:35,544 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-06 21:16:35,544 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 21:16:35,544 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 21:16:35,544 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 21:16:35,545 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([571] L58-4-->L58-4: Formula: (and (let ((.cse0 (select (select |v_#memory_int_98| v_~A~0.base_49) (+ (* v_thread2Thread1of1ForFork1_~i~1_34 4) v_~A~0.offset_49)))) (or (and (< .cse0 v_~min2~0_39) (= v_~min2~0_38 .cse0)) (and (= v_~min2~0_39 v_~min2~0_38) (<= v_~min2~0_39 .cse0) (= |v_thread2Thread1of1ForFork1_#t~mem6_16| |v_thread2Thread1of1ForFork1_#t~mem6_15|)))) (= v_thread2Thread1of1ForFork1_~i~1_33 (+ v_thread2Thread1of1ForFork1_~i~1_34 1)) (< v_thread2Thread1of1ForFork1_~i~1_34 v_~M~0_27)) InVars {thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_34, ~A~0.base=v_~A~0.base_49, ~A~0.offset=v_~A~0.offset_49, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_16|, ~M~0=v_~M~0_27, #memory_int=|v_#memory_int_98|, ~min2~0=v_~min2~0_39} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_33, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_17|, ~A~0.base=v_~A~0.base_49, thread2Thread1of1ForFork1_#t~mem5=|v_thread2Thread1of1ForFork1_#t~mem5_9|, ~A~0.offset=v_~A~0.offset_49, thread2Thread1of1ForFork1_#t~mem6=|v_thread2Thread1of1ForFork1_#t~mem6_15|, ~M~0=v_~M~0_27, #memory_int=|v_#memory_int_98|, ~min2~0=v_~min2~0_38} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~mem5, thread2Thread1of1ForFork1_#t~mem6, ~min2~0][76], [Black: 725#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), 33#L70-4true, 79#L96-1true, 1015#true, Black: 654#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1639#(and (<= thread1Thread1of1ForFork0_~i~0 1) (<= 2 ~N~0)), Black: 1426#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 0 ~M~0) (and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0))) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))) (or (= ~min1~0 0) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))))), Black: 1421#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0) (= ~M~0 0)), Black: 521#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1416#(and (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 1598#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= 2 ~N~0)), Black: 1414#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0) (= ~M~0 0)), Black: 561#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0)))), Black: 542#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0)), Black: 1222#(and (= ~min2~0 0) (or (and (<= (+ ~min3~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 1 ~N~0) (< ~min1~0 (+ (select (select |#memory_int| ~A~0.base) ~A~0.offset) 1)))), Black: 1412#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (= ~min1~0 0) (< (select (select |#memory_int| ~A~0.base) 0) 0)) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0) (= ~M~0 0)), Black: 1423#(and (= ~min2~0 0) (or (and (<= (+ ~min1~0 1) 0) (= ~min3~0 ~min1~0)) (and (= ~min1~0 0) (= ~min3~0 0))) (or (< 0 ~M~0) (and (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~M~0 0))) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) (+ ~A~0.offset (* ~M~0 4)))) (or (< thread2Thread1of1ForFork1_~i~1 ~M~0) (forall ((v_ArrVal_271 (Array Int Int))) (< ~min3~0 (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) ~A~0.base) (+ ~A~0.offset (* ~M~0 4))) 1))))), Black: 1100#(or (and (<= (+ ~min3~0 1) ~min2~0) (= ~min3~0 ~min1~0)) (and (= ~min2~0 ~min1~0) (<= ~min2~0 ~min3~0))), Black: 1200#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)) (exists ((v_thread3Thread1of1ForFork2_~i~2_52 Int)) (and (<= 0 (select (select |#memory_int| ~A~0.base) (* v_thread3Thread1of1ForFork2_~i~2_52 4))) (<= 0 v_thread3Thread1of1ForFork2_~i~2_52) (<= (+ v_thread3Thread1of1ForFork2_~i~2_52 1) ~N~0))) (<= 1 ~N~0) (= ~min3~0 0)), 1597#(<= 2 ~N~0), 834#true, 72#L58-4true, Black: 160#(and (= ~min1~0 0) (= ~min2~0 0) (= ~min3~0 0)), Black: 474#(and (= ~min1~0 0) (= ~min2~0 0) (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (= ~N~0 1) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 1))) (= ~min3~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 479#(and (= ~min2~0 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~min3~0 (select (select |#memory_int| ~A~0.base) ~A~0.offset)) (or (= ~min1~0 0) (< ~min3~0 0)) (= ~min3~0 ~min1~0) (= ~M~0 0)), 485#true, Black: 351#(and (= ~min2~0 0) (= ~A~0.offset 0) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t3~0#1.base|) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= ~min3~0 0) (= ~M~0 0)), 316#true, Black: 165#(and (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 879#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= thread2Thread1of1ForFork1_~i~1 0)), 173#(and (<= (+ ~M~0 1) ~N~0) (<= (+ thread3Thread1of1ForFork2_~i~2 1) ~N~0)), 1243#true, Black: 994#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2)), Black: 839#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1)), Black: 841#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (not (= thread3Thread1of1ForFork2_~i~2 0)) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2))) (= ~min3~0 0)), Black: 996#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 891#(and (= ~min2~0 0) (= ~A~0.offset 0) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min1~0 (select (select |#memory_int| ~A~0.base) 0))) (and (= ~min1~0 0) (<= 0 (select (select |#memory_int| ~A~0.base) 0)))) (= thread3Thread1of1ForFork2_~i~2 0) (= ~min3~0 0)), 666#true, Black: 842#(and (or (= ~min3~0 0) (< ~min3~0 0)) (= ~min2~0 0) (= ~min3~0 ~min1~0)), Black: 990#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (<= ~N~0 1) (<= thread2Thread1of1ForFork1_~i~1 0)), Black: 883#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0) (= ~M~0 0)), Black: 1442#(and (= ~min2~0 0) (or (= ~min1~0 0) (< ~min3~0 0)) (= ~min3~0 ~min1~0)), Black: 875#(and (= ~min1~0 0) (= ~min2~0 0) (<= 0 ~M~0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (= ~min3~0 0)), Black: 1441#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (= thread1Thread1of1ForFork0_~i~0 0) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (not (= ~min3~0 0))) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min3~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0))), 1751#true, Black: 313#(and (<= 1 ~N~0) (<= (+ thread1Thread1of1ForFork0_~i~0 1) ~N~0)), Black: 827#(and (= ~min1~0 0) (= ~min2~0 0) (= ~A~0.offset 0) (or (not (= thread3Thread1of1ForFork2_~i~2 0)) (= ~min3~0 0)) (= thread1Thread1of1ForFork0_~i~0 0) (or (= thread3Thread1of1ForFork2_~i~2 0) (and (<= ~N~0 1) (<= 0 thread3Thread1of1ForFork2_~i~2))) (or (< 0 (+ (select (select |#memory_int| ~A~0.base) 0) 1)) (< ~min3~0 0)) (or (and (<= (+ (select (select |#memory_int| ~A~0.base) 0) 1) 0) (= ~min3~0 (select (select |#memory_int| ~A~0.base) 0))) (= ~min3~0 0)))]) [2023-11-06 21:16:35,545 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-06 21:16:35,545 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 21:16:35,545 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 21:16:35,545 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 21:16:35,595 INFO L124 PetriNetUnfolderBase]: 2789/4210 cut-off events. [2023-11-06 21:16:35,595 INFO L125 PetriNetUnfolderBase]: For 28284/28575 co-relation queries the response was YES. [2023-11-06 21:16:35,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21771 conditions, 4210 events. 2789/4210 cut-off events. For 28284/28575 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 22127 event pairs, 516 based on Foata normal form. 322/4329 useless extension candidates. Maximal degree in co-relation 21570. Up to 1590 conditions per place. [2023-11-06 21:16:35,645 INFO L140 encePairwiseOnDemand]: 296/302 looper letters, 375 selfloop transitions, 68 changer transitions 2/475 dead transitions. [2023-11-06 21:16:35,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 475 transitions, 4753 flow [2023-11-06 21:16:35,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:16:35,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 21:16:35,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 931 transitions. [2023-11-06 21:16:35,648 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44039735099337746 [2023-11-06 21:16:35,649 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 931 transitions. [2023-11-06 21:16:35,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 931 transitions. [2023-11-06 21:16:35,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:35,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 931 transitions. [2023-11-06 21:16:35,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 133.0) internal successors, (931), 7 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:35,655 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 302.0) internal successors, (2416), 8 states have internal predecessors, (2416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:35,656 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 302.0) internal successors, (2416), 8 states have internal predecessors, (2416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:35,656 INFO L175 Difference]: Start difference. First operand has 163 places, 373 transitions, 3281 flow. Second operand 7 states and 931 transitions. [2023-11-06 21:16:35,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 475 transitions, 4753 flow [2023-11-06 21:16:35,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 475 transitions, 4712 flow, removed 16 selfloop flow, removed 4 redundant places. [2023-11-06 21:16:35,792 INFO L231 Difference]: Finished difference. Result has 166 places, 343 transitions, 3130 flow [2023-11-06 21:16:35,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=2934, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3130, PETRI_PLACES=166, PETRI_TRANSITIONS=343} [2023-11-06 21:16:35,794 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 136 predicate places. [2023-11-06 21:16:35,794 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 343 transitions, 3130 flow [2023-11-06 21:16:35,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 126.64285714285714) internal successors, (1773), 14 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:35,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:35,795 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:16:35,810 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-06 21:16:36,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:16:36,002 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 21:16:36,002 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:36,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1428528402, now seen corresponding path program 10 times [2023-11-06 21:16:36,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:16:36,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148245204] [2023-11-06 21:16:36,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:36,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:16:36,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:36,185 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:16:36,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:16:36,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148245204] [2023-11-06 21:16:36,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148245204] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:16:36,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452077348] [2023-11-06 21:16:36,187 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 21:16:36,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:16:36,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:16:36,189 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:16:36,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-06 21:16:36,300 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 21:16:36,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:16:36,302 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 21:16:36,303 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:16:36,465 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:16:36,465 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:16:36,639 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:16:36,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452077348] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:16:36,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:16:36,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 19 [2023-11-06 21:16:36,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115920660] [2023-11-06 21:16:36,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:16:36,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-06 21:16:36,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:16:36,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-06 21:16:36,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2023-11-06 21:16:37,120 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 302 [2023-11-06 21:16:37,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 343 transitions, 3130 flow. Second operand has 19 states, 19 states have (on average 121.78947368421052) internal successors, (2314), 19 states have internal predecessors, (2314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:37,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:37,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 302 [2023-11-06 21:16:37,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:38,872 INFO L124 PetriNetUnfolderBase]: 2297/3520 cut-off events. [2023-11-06 21:16:38,872 INFO L125 PetriNetUnfolderBase]: For 26495/26653 co-relation queries the response was YES. [2023-11-06 21:16:38,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20582 conditions, 3520 events. 2297/3520 cut-off events. For 26495/26653 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 18230 event pairs, 234 based on Foata normal form. 269/3736 useless extension candidates. Maximal degree in co-relation 20513. Up to 1409 conditions per place. [2023-11-06 21:16:38,910 INFO L140 encePairwiseOnDemand]: 293/302 looper letters, 295 selfloop transitions, 203 changer transitions 48/560 dead transitions. [2023-11-06 21:16:38,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 560 transitions, 6442 flow [2023-11-06 21:16:38,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-06 21:16:38,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-11-06 21:16:38,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 3655 transitions. [2023-11-06 21:16:38,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41733272436629365 [2023-11-06 21:16:38,921 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 3655 transitions. [2023-11-06 21:16:38,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 3655 transitions. [2023-11-06 21:16:38,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:38,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 3655 transitions. [2023-11-06 21:16:38,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 126.03448275862068) internal successors, (3655), 29 states have internal predecessors, (3655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:38,945 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 302.0) internal successors, (9060), 30 states have internal predecessors, (9060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:38,948 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 302.0) internal successors, (9060), 30 states have internal predecessors, (9060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:38,949 INFO L175 Difference]: Start difference. First operand has 166 places, 343 transitions, 3130 flow. Second operand 29 states and 3655 transitions. [2023-11-06 21:16:38,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 560 transitions, 6442 flow [2023-11-06 21:16:39,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 560 transitions, 6222 flow, removed 28 selfloop flow, removed 8 redundant places. [2023-11-06 21:16:39,193 INFO L231 Difference]: Finished difference. Result has 185 places, 335 transitions, 3916 flow [2023-11-06 21:16:39,194 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=2495, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=3916, PETRI_PLACES=185, PETRI_TRANSITIONS=335} [2023-11-06 21:16:39,195 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 155 predicate places. [2023-11-06 21:16:39,195 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 335 transitions, 3916 flow [2023-11-06 21:16:39,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 121.78947368421052) internal successors, (2314), 19 states have internal predecessors, (2314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:39,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:39,196 INFO L208 CegarLoopForPetriNet]: 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] [2023-11-06 21:16:39,203 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-06 21:16:39,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-06 21:16:39,403 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 21:16:39,403 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:39,403 INFO L85 PathProgramCache]: Analyzing trace with hash 246782638, now seen corresponding path program 1 times [2023-11-06 21:16:39,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:16:39,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356685714] [2023-11-06 21:16:39,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:39,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:16:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:39,556 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:16:39,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:16:39,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356685714] [2023-11-06 21:16:39,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356685714] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:16:39,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399833210] [2023-11-06 21:16:39,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:39,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:16:39,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:16:39,559 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:16:39,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-06 21:16:39,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:39,712 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 21:16:39,717 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:16:39,796 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:16:39,796 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:16:39,869 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:16:39,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399833210] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:16:39,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:16:39,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2023-11-06 21:16:39,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558168145] [2023-11-06 21:16:39,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:16:39,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 21:16:39,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:16:39,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 21:16:39,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2023-11-06 21:16:40,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 302 [2023-11-06 21:16:40,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 335 transitions, 3916 flow. Second operand has 13 states, 13 states have (on average 124.76923076923077) internal successors, (1622), 13 states have internal predecessors, (1622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:40,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:40,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 302 [2023-11-06 21:16:40,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:41,112 INFO L124 PetriNetUnfolderBase]: 1778/2757 cut-off events. [2023-11-06 21:16:41,113 INFO L125 PetriNetUnfolderBase]: For 27820/27968 co-relation queries the response was YES. [2023-11-06 21:16:41,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17587 conditions, 2757 events. 1778/2757 cut-off events. For 27820/27968 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 13998 event pairs, 465 based on Foata normal form. 230/2879 useless extension candidates. Maximal degree in co-relation 17464. Up to 1650 conditions per place. [2023-11-06 21:16:41,139 INFO L140 encePairwiseOnDemand]: 296/302 looper letters, 181 selfloop transitions, 3 changer transitions 125/326 dead transitions. [2023-11-06 21:16:41,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 326 transitions, 4390 flow [2023-11-06 21:16:41,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:16:41,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 21:16:41,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 784 transitions. [2023-11-06 21:16:41,142 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4326710816777042 [2023-11-06 21:16:41,143 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 784 transitions. [2023-11-06 21:16:41,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 784 transitions. [2023-11-06 21:16:41,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:41,143 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 784 transitions. [2023-11-06 21:16:41,145 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 130.66666666666666) internal successors, (784), 6 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:41,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 302.0) internal successors, (2114), 7 states have internal predecessors, (2114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:41,149 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 302.0) internal successors, (2114), 7 states have internal predecessors, (2114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:41,149 INFO L175 Difference]: Start difference. First operand has 185 places, 335 transitions, 3916 flow. Second operand 6 states and 784 transitions. [2023-11-06 21:16:41,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 326 transitions, 4390 flow [2023-11-06 21:16:41,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 326 transitions, 3667 flow, removed 92 selfloop flow, removed 20 redundant places. [2023-11-06 21:16:41,479 INFO L231 Difference]: Finished difference. Result has 168 places, 201 transitions, 1953 flow [2023-11-06 21:16:41,479 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=2793, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1953, PETRI_PLACES=168, PETRI_TRANSITIONS=201} [2023-11-06 21:16:41,482 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 138 predicate places. [2023-11-06 21:16:41,482 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 201 transitions, 1953 flow [2023-11-06 21:16:41,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 124.76923076923077) internal successors, (1622), 13 states have internal predecessors, (1622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:41,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:41,483 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:16:41,492 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-06 21:16:41,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-06 21:16:41,692 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 21:16:41,692 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:41,692 INFO L85 PathProgramCache]: Analyzing trace with hash -2114290310, now seen corresponding path program 11 times [2023-11-06 21:16:41,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:16:41,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139807470] [2023-11-06 21:16:41,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:41,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:16:41,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:41,934 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:16:41,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:16:41,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139807470] [2023-11-06 21:16:41,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139807470] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:16:41,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611361770] [2023-11-06 21:16:41,935 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-06 21:16:41,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:16:41,936 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:16:41,941 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:16:41,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-06 21:16:42,098 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 21:16:42,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:16:42,101 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 21:16:42,103 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:16:42,236 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:16:42,236 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:16:42,346 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:16:42,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611361770] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:16:42,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:16:42,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2023-11-06 21:16:42,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592111398] [2023-11-06 21:16:42,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:16:42,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-06 21:16:42,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:16:42,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-06 21:16:42,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2023-11-06 21:16:42,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 302 [2023-11-06 21:16:42,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 201 transitions, 1953 flow. Second operand has 17 states, 17 states have (on average 114.41176470588235) internal successors, (1945), 17 states have internal predecessors, (1945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:42,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:42,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 302 [2023-11-06 21:16:42,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:44,265 INFO L124 PetriNetUnfolderBase]: 1590/2278 cut-off events. [2023-11-06 21:16:44,265 INFO L125 PetriNetUnfolderBase]: For 21385/21385 co-relation queries the response was YES. [2023-11-06 21:16:44,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14379 conditions, 2278 events. 1590/2278 cut-off events. For 21385/21385 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 9132 event pairs, 149 based on Foata normal form. 36/2304 useless extension candidates. Maximal degree in co-relation 14330. Up to 1099 conditions per place. [2023-11-06 21:16:44,289 INFO L140 encePairwiseOnDemand]: 290/302 looper letters, 295 selfloop transitions, 181 changer transitions 0/476 dead transitions. [2023-11-06 21:16:44,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 476 transitions, 5100 flow [2023-11-06 21:16:44,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-06 21:16:44,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-11-06 21:16:44,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2378 transitions. [2023-11-06 21:16:44,296 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3937086092715232 [2023-11-06 21:16:44,296 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2378 transitions. [2023-11-06 21:16:44,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2378 transitions. [2023-11-06 21:16:44,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:44,298 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2378 transitions. [2023-11-06 21:16:44,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 118.9) internal successors, (2378), 20 states have internal predecessors, (2378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:44,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 302.0) internal successors, (6342), 21 states have internal predecessors, (6342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:44,313 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 302.0) internal successors, (6342), 21 states have internal predecessors, (6342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:44,313 INFO L175 Difference]: Start difference. First operand has 168 places, 201 transitions, 1953 flow. Second operand 20 states and 2378 transitions. [2023-11-06 21:16:44,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 476 transitions, 5100 flow [2023-11-06 21:16:44,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 476 transitions, 4667 flow, removed 149 selfloop flow, removed 15 redundant places. [2023-11-06 21:16:44,514 INFO L231 Difference]: Finished difference. Result has 142 places, 285 transitions, 2910 flow [2023-11-06 21:16:44,514 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=1684, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=2910, PETRI_PLACES=142, PETRI_TRANSITIONS=285} [2023-11-06 21:16:44,515 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 112 predicate places. [2023-11-06 21:16:44,515 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 285 transitions, 2910 flow [2023-11-06 21:16:44,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 114.41176470588235) internal successors, (1945), 17 states have internal predecessors, (1945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:44,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:44,516 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:16:44,521 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-06 21:16:44,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-06 21:16:44,716 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 21:16:44,717 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:44,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1435311856, now seen corresponding path program 12 times [2023-11-06 21:16:44,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:16:44,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683225120] [2023-11-06 21:16:44,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:44,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:16:44,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:44,930 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:16:44,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:16:44,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683225120] [2023-11-06 21:16:44,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683225120] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:16:44,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659884296] [2023-11-06 21:16:44,930 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-06 21:16:44,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:16:44,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:16:44,933 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:16:44,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-06 21:16:45,087 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-11-06 21:16:45,087 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:16:45,089 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-06 21:16:45,090 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:16:45,209 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:16:45,209 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:16:45,371 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:16:45,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659884296] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:16:45,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:16:45,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2023-11-06 21:16:45,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666472872] [2023-11-06 21:16:45,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:16:45,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-06 21:16:45,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:16:45,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-06 21:16:45,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2023-11-06 21:16:45,796 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 302 [2023-11-06 21:16:45,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 285 transitions, 2910 flow. Second operand has 20 states, 20 states have (on average 119.0) internal successors, (2380), 20 states have internal predecessors, (2380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:45,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:45,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 302 [2023-11-06 21:16:45,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:46,742 INFO L124 PetriNetUnfolderBase]: 1948/2798 cut-off events. [2023-11-06 21:16:46,743 INFO L125 PetriNetUnfolderBase]: For 27898/27899 co-relation queries the response was YES. [2023-11-06 21:16:46,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18812 conditions, 2798 events. 1948/2798 cut-off events. For 27898/27899 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 11688 event pairs, 329 based on Foata normal form. 16/2800 useless extension candidates. Maximal degree in co-relation 18765. Up to 1586 conditions per place. [2023-11-06 21:16:46,773 INFO L140 encePairwiseOnDemand]: 293/302 looper letters, 282 selfloop transitions, 94 changer transitions 0/397 dead transitions. [2023-11-06 21:16:46,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 397 transitions, 4783 flow [2023-11-06 21:16:46,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 21:16:46,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-06 21:16:46,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1237 transitions. [2023-11-06 21:16:46,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4096026490066225 [2023-11-06 21:16:46,838 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1237 transitions. [2023-11-06 21:16:46,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1237 transitions. [2023-11-06 21:16:46,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:46,839 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1237 transitions. [2023-11-06 21:16:46,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 123.7) internal successors, (1237), 10 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:46,848 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 302.0) internal successors, (3322), 11 states have internal predecessors, (3322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:46,849 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 302.0) internal successors, (3322), 11 states have internal predecessors, (3322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:46,849 INFO L175 Difference]: Start difference. First operand has 142 places, 285 transitions, 2910 flow. Second operand 10 states and 1237 transitions. [2023-11-06 21:16:46,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 397 transitions, 4783 flow [2023-11-06 21:16:47,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 397 transitions, 4439 flow, removed 128 selfloop flow, removed 7 redundant places. [2023-11-06 21:16:47,054 INFO L231 Difference]: Finished difference. Result has 147 places, 306 transitions, 3207 flow [2023-11-06 21:16:47,055 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=2661, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3207, PETRI_PLACES=147, PETRI_TRANSITIONS=306} [2023-11-06 21:16:47,055 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 117 predicate places. [2023-11-06 21:16:47,055 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 306 transitions, 3207 flow [2023-11-06 21:16:47,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 119.0) internal successors, (2380), 20 states have internal predecessors, (2380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:47,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:47,057 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:16:47,069 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-06 21:16:47,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:16:47,264 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 21:16:47,265 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:47,265 INFO L85 PathProgramCache]: Analyzing trace with hash 839071538, now seen corresponding path program 13 times [2023-11-06 21:16:47,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:16:47,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742975016] [2023-11-06 21:16:47,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:47,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:16:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:47,529 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:16:47,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:16:47,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742975016] [2023-11-06 21:16:47,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742975016] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:16:47,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152014396] [2023-11-06 21:16:47,531 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-06 21:16:47,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:16:47,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:16:47,533 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:16:47,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-06 21:16:47,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:47,697 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-06 21:16:47,699 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:16:47,880 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:16:47,880 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:16:48,059 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:16:48,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152014396] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:16:48,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:16:48,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2023-11-06 21:16:48,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46857056] [2023-11-06 21:16:48,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:16:48,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-06 21:16:48,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:16:48,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-06 21:16:48,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2023-11-06 21:16:48,575 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 302 [2023-11-06 21:16:48,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 306 transitions, 3207 flow. Second operand has 21 states, 21 states have (on average 119.14285714285714) internal successors, (2502), 21 states have internal predecessors, (2502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:48,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:48,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 302 [2023-11-06 21:16:48,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:49,999 INFO L124 PetriNetUnfolderBase]: 2391/3455 cut-off events. [2023-11-06 21:16:49,999 INFO L125 PetriNetUnfolderBase]: For 35865/35869 co-relation queries the response was YES. [2023-11-06 21:16:50,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23516 conditions, 3455 events. 2391/3455 cut-off events. For 35865/35869 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 15338 event pairs, 507 based on Foata normal form. 32/3475 useless extension candidates. Maximal degree in co-relation 23469. Up to 2316 conditions per place. [2023-11-06 21:16:50,038 INFO L140 encePairwiseOnDemand]: 293/302 looper letters, 404 selfloop transitions, 160 changer transitions 0/585 dead transitions. [2023-11-06 21:16:50,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 585 transitions, 7280 flow [2023-11-06 21:16:50,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 21:16:50,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-11-06 21:16:50,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1987 transitions. [2023-11-06 21:16:50,043 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41121688741721857 [2023-11-06 21:16:50,043 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1987 transitions. [2023-11-06 21:16:50,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1987 transitions. [2023-11-06 21:16:50,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:50,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1987 transitions. [2023-11-06 21:16:50,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 124.1875) internal successors, (1987), 16 states have internal predecessors, (1987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:50,055 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 302.0) internal successors, (5134), 17 states have internal predecessors, (5134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:50,056 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 302.0) internal successors, (5134), 17 states have internal predecessors, (5134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:50,056 INFO L175 Difference]: Start difference. First operand has 147 places, 306 transitions, 3207 flow. Second operand 16 states and 1987 transitions. [2023-11-06 21:16:50,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 585 transitions, 7280 flow [2023-11-06 21:16:50,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 585 transitions, 7000 flow, removed 62 selfloop flow, removed 6 redundant places. [2023-11-06 21:16:50,314 INFO L231 Difference]: Finished difference. Result has 162 places, 418 transitions, 5094 flow [2023-11-06 21:16:50,315 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=3066, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=5094, PETRI_PLACES=162, PETRI_TRANSITIONS=418} [2023-11-06 21:16:50,315 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 132 predicate places. [2023-11-06 21:16:50,315 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 418 transitions, 5094 flow [2023-11-06 21:16:50,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 119.14285714285714) internal successors, (2502), 21 states have internal predecessors, (2502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:50,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:50,316 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:16:50,324 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-11-06 21:16:50,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-06 21:16:50,517 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 21:16:50,517 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:50,517 INFO L85 PathProgramCache]: Analyzing trace with hash -2040768582, now seen corresponding path program 14 times [2023-11-06 21:16:50,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:16:50,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179050822] [2023-11-06 21:16:50,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:50,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:16:50,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:50,767 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:16:50,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:16:50,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179050822] [2023-11-06 21:16:50,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179050822] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:16:50,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655625463] [2023-11-06 21:16:50,768 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 21:16:50,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:16:50,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:16:50,781 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:16:50,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-06 21:16:50,959 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 21:16:50,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:16:50,962 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-06 21:16:50,963 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:16:51,115 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:16:51,115 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:16:51,271 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:16:51,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655625463] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:16:51,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:16:51,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2023-11-06 21:16:51,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289092571] [2023-11-06 21:16:51,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:16:51,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-06 21:16:51,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:16:51,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-06 21:16:51,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2023-11-06 21:16:51,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 302 [2023-11-06 21:16:51,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 418 transitions, 5094 flow. Second operand has 20 states, 20 states have (on average 118.9) internal successors, (2378), 20 states have internal predecessors, (2378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:51,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:51,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 302 [2023-11-06 21:16:51,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:52,938 INFO L124 PetriNetUnfolderBase]: 2431/3522 cut-off events. [2023-11-06 21:16:52,939 INFO L125 PetriNetUnfolderBase]: For 39608/39612 co-relation queries the response was YES. [2023-11-06 21:16:52,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25067 conditions, 3522 events. 2431/3522 cut-off events. For 39608/39612 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 15807 event pairs, 610 based on Foata normal form. 32/3535 useless extension candidates. Maximal degree in co-relation 25014. Up to 2894 conditions per place. [2023-11-06 21:16:52,976 INFO L140 encePairwiseOnDemand]: 293/302 looper letters, 368 selfloop transitions, 110 changer transitions 0/499 dead transitions. [2023-11-06 21:16:52,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 499 transitions, 6918 flow [2023-11-06 21:16:52,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 21:16:52,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-06 21:16:52,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1231 transitions. [2023-11-06 21:16:52,981 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4076158940397351 [2023-11-06 21:16:52,981 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1231 transitions. [2023-11-06 21:16:52,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1231 transitions. [2023-11-06 21:16:52,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:52,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1231 transitions. [2023-11-06 21:16:52,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 123.1) internal successors, (1231), 10 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:52,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 302.0) internal successors, (3322), 11 states have internal predecessors, (3322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:52,988 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 302.0) internal successors, (3322), 11 states have internal predecessors, (3322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:52,989 INFO L175 Difference]: Start difference. First operand has 162 places, 418 transitions, 5094 flow. Second operand 10 states and 1231 transitions. [2023-11-06 21:16:52,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 499 transitions, 6918 flow [2023-11-06 21:16:53,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 499 transitions, 6619 flow, removed 146 selfloop flow, removed 4 redundant places. [2023-11-06 21:16:53,335 INFO L231 Difference]: Finished difference. Result has 170 places, 446 transitions, 5604 flow [2023-11-06 21:16:53,335 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=4799, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5604, PETRI_PLACES=170, PETRI_TRANSITIONS=446} [2023-11-06 21:16:53,336 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 140 predicate places. [2023-11-06 21:16:53,336 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 446 transitions, 5604 flow [2023-11-06 21:16:53,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 118.9) internal successors, (2378), 20 states have internal predecessors, (2378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:53,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:53,337 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:16:53,343 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-11-06 21:16:53,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:16:53,538 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 21:16:53,538 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:53,538 INFO L85 PathProgramCache]: Analyzing trace with hash -607523078, now seen corresponding path program 15 times [2023-11-06 21:16:53,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:16:53,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496102949] [2023-11-06 21:16:53,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:53,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:16:53,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:53,745 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:16:53,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:16:53,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496102949] [2023-11-06 21:16:53,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496102949] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:16:53,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240837836] [2023-11-06 21:16:53,746 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 21:16:53,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:16:53,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:16:53,749 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:16:53,772 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-06 21:16:53,913 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-06 21:16:53,913 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:16:53,915 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-06 21:16:53,916 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:16:54,069 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:16:54,069 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:16:54,212 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:16:54,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240837836] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:16:54,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:16:54,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2023-11-06 21:16:54,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605961162] [2023-11-06 21:16:54,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:16:54,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-06 21:16:54,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:16:54,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-06 21:16:54,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2023-11-06 21:16:54,734 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 302 [2023-11-06 21:16:54,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 446 transitions, 5604 flow. Second operand has 21 states, 21 states have (on average 118.85714285714286) internal successors, (2496), 21 states have internal predecessors, (2496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:54,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:54,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 302 [2023-11-06 21:16:54,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:56,384 INFO L124 PetriNetUnfolderBase]: 2874/4146 cut-off events. [2023-11-06 21:16:56,385 INFO L125 PetriNetUnfolderBase]: For 49008/49024 co-relation queries the response was YES. [2023-11-06 21:16:56,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30155 conditions, 4146 events. 2874/4146 cut-off events. For 49008/49024 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 19036 event pairs, 333 based on Foata normal form. 36/4170 useless extension candidates. Maximal degree in co-relation 30099. Up to 2189 conditions per place. [2023-11-06 21:16:56,436 INFO L140 encePairwiseOnDemand]: 293/302 looper letters, 395 selfloop transitions, 281 changer transitions 0/697 dead transitions. [2023-11-06 21:16:56,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 697 transitions, 9691 flow [2023-11-06 21:16:56,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-06 21:16:56,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-11-06 21:16:56,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2371 transitions. [2023-11-06 21:16:56,444 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4132101777622865 [2023-11-06 21:16:56,445 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2371 transitions. [2023-11-06 21:16:56,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2371 transitions. [2023-11-06 21:16:56,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:56,446 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2371 transitions. [2023-11-06 21:16:56,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 124.78947368421052) internal successors, (2371), 19 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:56,457 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 302.0) internal successors, (6040), 20 states have internal predecessors, (6040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:56,459 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 302.0) internal successors, (6040), 20 states have internal predecessors, (6040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:56,459 INFO L175 Difference]: Start difference. First operand has 170 places, 446 transitions, 5604 flow. Second operand 19 states and 2371 transitions. [2023-11-06 21:16:56,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 697 transitions, 9691 flow [2023-11-06 21:16:56,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 697 transitions, 9382 flow, removed 61 selfloop flow, removed 6 redundant places. [2023-11-06 21:16:56,873 INFO L231 Difference]: Finished difference. Result has 187 places, 517 transitions, 7350 flow [2023-11-06 21:16:56,873 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=5315, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=215, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=7350, PETRI_PLACES=187, PETRI_TRANSITIONS=517} [2023-11-06 21:16:56,874 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 157 predicate places. [2023-11-06 21:16:56,874 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 517 transitions, 7350 flow [2023-11-06 21:16:56,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 118.85714285714286) internal successors, (2496), 21 states have internal predecessors, (2496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:56,874 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:56,875 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:16:56,880 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-11-06 21:16:57,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:16:57,075 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 21:16:57,076 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:57,076 INFO L85 PathProgramCache]: Analyzing trace with hash 352974692, now seen corresponding path program 16 times [2023-11-06 21:16:57,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:16:57,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211625169] [2023-11-06 21:16:57,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:57,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:16:57,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:57,294 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:16:57,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:16:57,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211625169] [2023-11-06 21:16:57,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211625169] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:16:57,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955065245] [2023-11-06 21:16:57,295 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 21:16:57,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:16:57,295 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:16:57,297 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:16:57,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-06 21:16:57,430 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 21:16:57,430 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:16:57,431 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 21:16:57,433 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:16:57,606 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:16:57,606 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:16:57,748 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:16:57,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955065245] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:16:57,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:16:57,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2023-11-06 21:16:57,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972756312] [2023-11-06 21:16:57,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:16:57,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-06 21:16:57,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:16:57,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-06 21:16:57,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2023-11-06 21:16:58,238 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 302 [2023-11-06 21:16:58,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 517 transitions, 7350 flow. Second operand has 20 states, 20 states have (on average 114.4) internal successors, (2288), 20 states have internal predecessors, (2288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:58,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:58,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 302 [2023-11-06 21:16:58,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:17:00,367 INFO L124 PetriNetUnfolderBase]: 2917/4183 cut-off events. [2023-11-06 21:17:00,367 INFO L125 PetriNetUnfolderBase]: For 57105/57105 co-relation queries the response was YES. [2023-11-06 21:17:00,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32618 conditions, 4183 events. 2917/4183 cut-off events. For 57105/57105 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 18934 event pairs, 341 based on Foata normal form. 16/4193 useless extension candidates. Maximal degree in co-relation 32557. Up to 2191 conditions per place. [2023-11-06 21:17:00,420 INFO L140 encePairwiseOnDemand]: 290/302 looper letters, 391 selfloop transitions, 340 changer transitions 0/731 dead transitions. [2023-11-06 21:17:00,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 731 transitions, 11105 flow [2023-11-06 21:17:00,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-06 21:17:00,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-11-06 21:17:00,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 3431 transitions. [2023-11-06 21:17:00,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39175610870061656 [2023-11-06 21:17:00,428 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 3431 transitions. [2023-11-06 21:17:00,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 3431 transitions. [2023-11-06 21:17:00,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:17:00,430 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 3431 transitions. [2023-11-06 21:17:00,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 118.3103448275862) internal successors, (3431), 29 states have internal predecessors, (3431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:17:00,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 302.0) internal successors, (9060), 30 states have internal predecessors, (9060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:17:00,448 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 302.0) internal successors, (9060), 30 states have internal predecessors, (9060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:17:00,448 INFO L175 Difference]: Start difference. First operand has 187 places, 517 transitions, 7350 flow. Second operand 29 states and 3431 transitions. [2023-11-06 21:17:00,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 731 transitions, 11105 flow [2023-11-06 21:17:01,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 731 transitions, 10152 flow, removed 288 selfloop flow, removed 8 redundant places. [2023-11-06 21:17:01,014 INFO L231 Difference]: Finished difference. Result has 206 places, 563 transitions, 7847 flow [2023-11-06 21:17:01,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=6572, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=514, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=291, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=7847, PETRI_PLACES=206, PETRI_TRANSITIONS=563} [2023-11-06 21:17:01,015 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 176 predicate places. [2023-11-06 21:17:01,015 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 563 transitions, 7847 flow [2023-11-06 21:17:01,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 114.4) internal successors, (2288), 20 states have internal predecessors, (2288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:17:01,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:17:01,016 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:17:01,025 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-11-06 21:17:01,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:17:01,217 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 21:17:01,217 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:17:01,217 INFO L85 PathProgramCache]: Analyzing trace with hash -296234124, now seen corresponding path program 17 times [2023-11-06 21:17:01,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:17:01,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423026926] [2023-11-06 21:17:01,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:17:01,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:17:01,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:17:01,427 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:17:01,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:17:01,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423026926] [2023-11-06 21:17:01,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423026926] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:17:01,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959574914] [2023-11-06 21:17:01,429 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-06 21:17:01,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:17:01,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:17:01,433 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:17:01,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-11-06 21:17:01,618 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 21:17:01,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:17:01,620 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 21:17:01,621 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:17:01,756 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:17:01,757 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:17:01,875 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:17:01,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959574914] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:17:01,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:17:01,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-11-06 21:17:01,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618615093] [2023-11-06 21:17:01,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:17:01,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-06 21:17:01,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:17:01,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-06 21:17:01,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2023-11-06 21:17:02,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 302 [2023-11-06 21:17:02,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 563 transitions, 7847 flow. Second operand has 18 states, 18 states have (on average 114.33333333333333) internal successors, (2058), 18 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:17:02,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:17:02,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 302 [2023-11-06 21:17:02,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:17:04,249 INFO L124 PetriNetUnfolderBase]: 2880/4126 cut-off events. [2023-11-06 21:17:04,249 INFO L125 PetriNetUnfolderBase]: For 48968/48968 co-relation queries the response was YES. [2023-11-06 21:17:04,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31827 conditions, 4126 events. 2880/4126 cut-off events. For 48968/48968 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 18619 event pairs, 340 based on Foata normal form. 30/4150 useless extension candidates. Maximal degree in co-relation 31766. Up to 2161 conditions per place. [2023-11-06 21:17:04,293 INFO L140 encePairwiseOnDemand]: 290/302 looper letters, 406 selfloop transitions, 285 changer transitions 0/691 dead transitions. [2023-11-06 21:17:04,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 691 transitions, 10377 flow [2023-11-06 21:17:04,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-06 21:17:04,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-11-06 21:17:04,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2368 transitions. [2023-11-06 21:17:04,298 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3920529801324503 [2023-11-06 21:17:04,298 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2368 transitions. [2023-11-06 21:17:04,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2368 transitions. [2023-11-06 21:17:04,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:17:04,300 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2368 transitions. [2023-11-06 21:17:04,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 118.4) internal successors, (2368), 20 states have internal predecessors, (2368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:17:04,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 302.0) internal successors, (6342), 21 states have internal predecessors, (6342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:17:04,310 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 302.0) internal successors, (6342), 21 states have internal predecessors, (6342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:17:04,310 INFO L175 Difference]: Start difference. First operand has 206 places, 563 transitions, 7847 flow. Second operand 20 states and 2368 transitions. [2023-11-06 21:17:04,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 691 transitions, 10377 flow [2023-11-06 21:17:04,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 691 transitions, 9865 flow, removed 57 selfloop flow, removed 12 redundant places. [2023-11-06 21:17:04,689 INFO L231 Difference]: Finished difference. Result has 209 places, 554 transitions, 7733 flow [2023-11-06 21:17:04,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=7093, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=279, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=7733, PETRI_PLACES=209, PETRI_TRANSITIONS=554} [2023-11-06 21:17:04,690 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 179 predicate places. [2023-11-06 21:17:04,690 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 554 transitions, 7733 flow [2023-11-06 21:17:04,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 114.33333333333333) internal successors, (2058), 18 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:17:04,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:17:04,691 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:17:04,696 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-11-06 21:17:04,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:17:04,891 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 21:17:04,892 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:17:04,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1432077240, now seen corresponding path program 18 times [2023-11-06 21:17:04,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:17:04,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892254185] [2023-11-06 21:17:04,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:17:04,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:17:04,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:17:05,103 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:17:05,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:17:05,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892254185] [2023-11-06 21:17:05,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892254185] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:17:05,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001271205] [2023-11-06 21:17:05,104 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-06 21:17:05,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:17:05,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:17:05,109 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:17:05,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-11-06 21:17:05,289 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-11-06 21:17:05,289 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:17:05,290 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-06 21:17:05,291 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:17:05,419 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:17:05,420 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:17:05,567 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 21:17:05,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001271205] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:17:05,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:17:05,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2023-11-06 21:17:05,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971470041] [2023-11-06 21:17:05,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:17:05,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-06 21:17:05,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:17:05,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-06 21:17:05,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2023-11-06 21:17:06,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 302 [2023-11-06 21:17:06,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 554 transitions, 7733 flow. Second operand has 22 states, 22 states have (on average 118.81818181818181) internal successors, (2614), 22 states have internal predecessors, (2614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:17:06,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:17:06,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 302 [2023-11-06 21:17:06,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:17:07,678 INFO L124 PetriNetUnfolderBase]: 2795/4008 cut-off events. [2023-11-06 21:17:07,678 INFO L125 PetriNetUnfolderBase]: For 47714/47731 co-relation queries the response was YES. [2023-11-06 21:17:07,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31494 conditions, 4008 events. 2795/4008 cut-off events. For 47714/47731 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 18068 event pairs, 334 based on Foata normal form. 22/4019 useless extension candidates. Maximal degree in co-relation 31433. Up to 2140 conditions per place. [2023-11-06 21:17:07,731 INFO L140 encePairwiseOnDemand]: 293/302 looper letters, 386 selfloop transitions, 281 changer transitions 0/694 dead transitions. [2023-11-06 21:17:07,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 694 transitions, 10376 flow [2023-11-06 21:17:07,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 21:17:07,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-11-06 21:17:07,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2119 transitions. [2023-11-06 21:17:07,736 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4127386053759252 [2023-11-06 21:17:07,736 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2119 transitions. [2023-11-06 21:17:07,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2119 transitions. [2023-11-06 21:17:07,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:17:07,738 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2119 transitions. [2023-11-06 21:17:07,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 124.6470588235294) internal successors, (2119), 17 states have internal predecessors, (2119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:17:07,746 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 302.0) internal successors, (5436), 18 states have internal predecessors, (5436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:17:07,747 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 302.0) internal successors, (5436), 18 states have internal predecessors, (5436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:17:07,747 INFO L175 Difference]: Start difference. First operand has 209 places, 554 transitions, 7733 flow. Second operand 17 states and 2119 transitions. [2023-11-06 21:17:07,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 694 transitions, 10376 flow [2023-11-06 21:17:08,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 694 transitions, 10108 flow, removed 0 selfloop flow, removed 13 redundant places. [2023-11-06 21:17:08,143 INFO L231 Difference]: Finished difference. Result has 211 places, 548 transitions, 7953 flow [2023-11-06 21:17:08,143 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=302, PETRI_DIFFERENCE_MINUEND_FLOW=7391, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=281, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=7953, PETRI_PLACES=211, PETRI_TRANSITIONS=548} [2023-11-06 21:17:08,144 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 181 predicate places. [2023-11-06 21:17:08,144 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 548 transitions, 7953 flow [2023-11-06 21:17:08,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 118.81818181818181) internal successors, (2614), 22 states have internal predecessors, (2614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:17:08,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:17:08,145 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:17:08,151 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-11-06 21:17:08,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:17:08,347 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-06 21:17:08,347 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:17:08,347 INFO L85 PathProgramCache]: Analyzing trace with hash -138205637, now seen corresponding path program 2 times [2023-11-06 21:17:08,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:17:08,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358596245] [2023-11-06 21:17:08,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:17:08,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:17:08,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:17:11,127 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:17:11,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:17:11,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358596245] [2023-11-06 21:17:11,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358596245] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:17:11,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520846081] [2023-11-06 21:17:11,129 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 21:17:11,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:17:11,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:17:11,133 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:17:11,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97571d74-dd22-43c3-a9d2-c6854dc53ec8/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-11-06 21:17:11,308 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 21:17:11,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:17:11,311 INFO L262 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-06 21:17:11,313 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:17:11,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:17:11,884 INFO L351 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 38 treesize of output 29 [2023-11-06 21:17:12,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:17:12,265 INFO L351 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 98 treesize of output 73 [2023-11-06 21:17:13,805 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:17:13,805 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 99 [2023-11-06 21:17:14,623 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:17:14,623 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:17:22,718 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse21 (= c_~min2~0 c_~min1~0)) (.cse43 (= c_~min1~0 c_~min3~0)) (.cse1 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork0_~i~0 4))) (.cse31 (+ c_~min3~0 1))) (and (forall ((v_ArrVal_760 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_760))) (or (< (select (select .cse0 c_~A~0.base) .cse1) c_~min1~0) (forall ((v_thread3Thread1of1ForFork2_~i~2_118 Int)) (or (< (+ v_thread3Thread1of1ForFork2_~i~2_118 1) c_~N~0) (< c_~M~0 v_thread3Thread1of1ForFork2_~i~2_118) (forall ((v_ArrVal_761 (Array Int Int))) (let ((.cse3 (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_761) c_~A~0.base))) (let ((.cse2 (select .cse3 c_~A~0.offset))) (or (< c_~min2~0 (+ .cse2 1)) (< (select .cse3 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork2_~i~2_118 4))) c_~min3~0) (< c_~min3~0 .cse2) (= c_~min1~0 .cse2)))))))))) (forall ((v_ArrVal_760 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_760))) (let ((.cse5 (select (select .cse8 c_~A~0.base) .cse1))) (or (forall ((v_ArrVal_761 (Array Int Int))) (let ((.cse7 (select (store .cse8 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_761) c_~A~0.base))) (let ((.cse4 (select .cse7 c_~A~0.offset))) (or (= .cse4 .cse5) (< c_~min2~0 (+ .cse4 1)) (forall ((v_thread3Thread1of1ForFork2_~i~2_118 Int)) (let ((.cse6 (select .cse7 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork2_~i~2_118 4))))) (or (< (+ v_thread3Thread1of1ForFork2_~i~2_118 1) c_~N~0) (< c_~min3~0 (+ .cse6 1)) (= .cse5 .cse6) (< c_~M~0 v_thread3Thread1of1ForFork2_~i~2_118)))))))) (< c_~min1~0 (+ .cse5 1)))))) (forall ((v_thread3Thread1of1ForFork2_~i~2_118 Int)) (or (< (+ v_thread3Thread1of1ForFork2_~i~2_118 1) c_~N~0) (< c_~M~0 v_thread3Thread1of1ForFork2_~i~2_118) (forall ((v_ArrVal_760 (Array Int Int)) (v_ArrVal_761 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_760))) (let ((.cse9 (select (store .cse11 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_761) c_~A~0.base)) (.cse10 (select (select .cse11 c_~A~0.base) .cse1))) (or (< (select .cse9 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork2_~i~2_118 4))) c_~min3~0) (< (select .cse9 c_~A~0.offset) c_~min2~0) (= c_~min2~0 .cse10) (= c_~min3~0 .cse10) (< c_~min1~0 (+ .cse10 1)))))))) (forall ((v_ArrVal_760 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_760))) (let ((.cse14 (select (select .cse15 c_~A~0.base) .cse1))) (or (forall ((v_thread3Thread1of1ForFork2_~i~2_118 Int) (v_ArrVal_761 (Array Int Int))) (let ((.cse13 (select (store .cse15 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_761) c_~A~0.base))) (let ((.cse12 (select .cse13 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork2_~i~2_118 4))))) (or (< (+ v_thread3Thread1of1ForFork2_~i~2_118 1) c_~N~0) (< c_~min3~0 (+ .cse12 1)) (< (select .cse13 c_~A~0.offset) c_~min2~0) (= .cse14 .cse12) (< c_~M~0 v_thread3Thread1of1ForFork2_~i~2_118))))) (= c_~min2~0 .cse14) (< c_~min1~0 (+ .cse14 1)))))) (forall ((v_ArrVal_760 (Array Int Int))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_760))) (let ((.cse17 (select (select .cse20 c_~A~0.base) .cse1))) (or (forall ((v_ArrVal_761 (Array Int Int))) (let ((.cse19 (select (store .cse20 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_761) c_~A~0.base))) (or (forall ((v_thread3Thread1of1ForFork2_~i~2_118 Int)) (let ((.cse18 (select .cse19 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork2_~i~2_118 4))))) (let ((.cse16 (+ .cse18 1))) (or (< c_~min2~0 .cse16) (< (+ v_thread3Thread1of1ForFork2_~i~2_118 1) c_~N~0) (< c_~min3~0 .cse16) (= .cse17 .cse18) (< c_~M~0 v_thread3Thread1of1ForFork2_~i~2_118))))) (< (select .cse19 c_~A~0.offset) c_~min2~0)))) (< c_~min1~0 (+ .cse17 1)))))) (or .cse21 (forall ((v_thread3Thread1of1ForFork2_~i~2_118 Int) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_761 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_760))) (let ((.cse23 (select (store .cse24 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_761) c_~A~0.base))) (let ((.cse22 (select .cse23 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork2_~i~2_118 4))))) (or (< (+ v_thread3Thread1of1ForFork2_~i~2_118 1) c_~N~0) (< c_~min3~0 (+ .cse22 1)) (< (select .cse23 c_~A~0.offset) c_~min2~0) (< (select (select .cse24 c_~A~0.base) .cse1) c_~min1~0) (< c_~M~0 v_thread3Thread1of1ForFork2_~i~2_118) (= c_~min1~0 .cse22))))))) (or (forall ((v_thread3Thread1of1ForFork2_~i~2_118 Int) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_761 (Array Int Int))) (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_760))) (let ((.cse25 (select (store .cse27 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_761) c_~A~0.base)) (.cse26 (select (select .cse27 c_~A~0.base) .cse1))) (or (< (select .cse25 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork2_~i~2_118 4))) c_~min3~0) (< (+ v_thread3Thread1of1ForFork2_~i~2_118 1) c_~N~0) (< (select .cse25 c_~A~0.offset) c_~min2~0) (= c_~min2~0 .cse26) (< c_~M~0 v_thread3Thread1of1ForFork2_~i~2_118) (< c_~min1~0 (+ .cse26 1)))))) (< c_~min3~0 c_~min2~0)) (or (forall ((v_thread3Thread1of1ForFork2_~i~2_118 Int) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_761 (Array Int Int))) (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_760))) (let ((.cse28 (select (store .cse30 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_761) c_~A~0.base)) (.cse29 (select (select .cse30 c_~A~0.base) .cse1))) (or (< (select .cse28 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork2_~i~2_118 4))) c_~min3~0) (< (+ v_thread3Thread1of1ForFork2_~i~2_118 1) c_~N~0) (< (select .cse28 c_~A~0.offset) c_~min2~0) (< c_~M~0 v_thread3Thread1of1ForFork2_~i~2_118) (= c_~min3~0 .cse29) (< c_~min1~0 (+ .cse29 1)))))) (< c_~min2~0 .cse31)) (forall ((v_ArrVal_760 (Array Int Int))) (let ((.cse35 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_760))) (or (forall ((v_ArrVal_761 (Array Int Int))) (let ((.cse34 (select (store .cse35 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_761) c_~A~0.base))) (let ((.cse32 (select .cse34 c_~A~0.offset))) (or (< c_~min2~0 (+ .cse32 1)) (forall ((v_thread3Thread1of1ForFork2_~i~2_118 Int)) (let ((.cse33 (select .cse34 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork2_~i~2_118 4))))) (or (< (+ v_thread3Thread1of1ForFork2_~i~2_118 1) c_~N~0) (< c_~min3~0 (+ .cse33 1)) (< c_~M~0 v_thread3Thread1of1ForFork2_~i~2_118) (= c_~min1~0 .cse33)))) (= c_~min1~0 .cse32))))) (< (select (select .cse35 c_~A~0.base) .cse1) c_~min1~0)))) (or .cse21 (forall ((v_thread3Thread1of1ForFork2_~i~2_118 Int) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_761 (Array Int Int))) (let ((.cse38 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_760))) (let ((.cse37 (select (store .cse38 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_761) c_~A~0.base))) (let ((.cse36 (select .cse37 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork2_~i~2_118 4))))) (or (< (+ v_thread3Thread1of1ForFork2_~i~2_118 1) c_~N~0) (< c_~min3~0 (+ .cse36 1)) (< (select .cse37 c_~A~0.offset) c_~min2~0) (< .cse36 c_~min2~0) (< (select (select .cse38 c_~A~0.base) .cse1) c_~min1~0) (< c_~M~0 v_thread3Thread1of1ForFork2_~i~2_118))))))) (forall ((v_ArrVal_760 (Array Int Int))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_760))) (let ((.cse42 (select (select .cse41 c_~A~0.base) .cse1))) (or (forall ((v_thread3Thread1of1ForFork2_~i~2_118 Int) (v_ArrVal_761 (Array Int Int))) (let ((.cse40 (select (store .cse41 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_761) c_~A~0.base))) (let ((.cse39 (select .cse40 c_~A~0.offset))) (or (< c_~min2~0 (+ .cse39 1)) (< (select .cse40 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork2_~i~2_118 4))) c_~min3~0) (< (+ v_thread3Thread1of1ForFork2_~i~2_118 1) c_~N~0) (< c_~M~0 v_thread3Thread1of1ForFork2_~i~2_118) (< .cse39 .cse31))))) (= c_~min3~0 .cse42) (< c_~min1~0 (+ .cse42 1)))))) (or .cse43 (forall ((v_thread3Thread1of1ForFork2_~i~2_118 Int) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_761 (Array Int Int))) (let ((.cse46 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_760))) (let ((.cse45 (select (store .cse46 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_761) c_~A~0.base))) (let ((.cse44 (select .cse45 c_~A~0.offset))) (or (< c_~min2~0 (+ .cse44 1)) (< (select .cse45 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork2_~i~2_118 4))) c_~min3~0) (< (+ v_thread3Thread1of1ForFork2_~i~2_118 1) c_~N~0) (= c_~min1~0 .cse44) (< (select (select .cse46 c_~A~0.base) .cse1) c_~min1~0) (< c_~M~0 v_thread3Thread1of1ForFork2_~i~2_118))))))) (forall ((v_ArrVal_760 (Array Int Int))) (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_760))) (let ((.cse48 (select (select .cse51 c_~A~0.base) .cse1))) (or (forall ((v_ArrVal_761 (Array Int Int))) (let ((.cse50 (select (store .cse51 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_761) c_~A~0.base))) (let ((.cse47 (select .cse50 c_~A~0.offset))) (or (= .cse47 .cse48) (< c_~min2~0 (+ .cse47 1)) (forall ((v_thread3Thread1of1ForFork2_~i~2_118 Int)) (let ((.cse49 (select .cse50 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork2_~i~2_118 4))))) (or (< (+ v_thread3Thread1of1ForFork2_~i~2_118 1) c_~N~0) (< c_~min3~0 (+ .cse49 1)) (< .cse49 .cse47) (< c_~M~0 v_thread3Thread1of1ForFork2_~i~2_118)))))))) (< c_~min1~0 (+ .cse48 1)))))) (forall ((v_ArrVal_760 (Array Int Int))) (let ((.cse54 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_760))) (let ((.cse55 (select (select .cse54 c_~A~0.base) .cse1))) (or (forall ((v_thread3Thread1of1ForFork2_~i~2_118 Int) (v_ArrVal_761 (Array Int Int))) (let ((.cse53 (select (store .cse54 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_761) c_~A~0.base))) (let ((.cse52 (select .cse53 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork2_~i~2_118 4))))) (or (< (+ v_thread3Thread1of1ForFork2_~i~2_118 1) c_~N~0) (< c_~min3~0 (+ .cse52 1)) (< (select .cse53 c_~A~0.offset) c_~min2~0) (< .cse52 c_~min2~0) (< c_~M~0 v_thread3Thread1of1ForFork2_~i~2_118))))) (= c_~min2~0 .cse55) (< c_~min1~0 (+ .cse55 1)))))) (forall ((v_ArrVal_760 (Array Int Int))) (let ((.cse56 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_760))) (or (< (select (select .cse56 c_~A~0.base) .cse1) c_~min1~0) (forall ((v_ArrVal_761 (Array Int Int))) (let ((.cse57 (select (store .cse56 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_761) c_~A~0.base))) (or (< (select .cse57 c_~A~0.offset) c_~min2~0) (forall ((v_thread3Thread1of1ForFork2_~i~2_118 Int)) (let ((.cse59 (select .cse57 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork2_~i~2_118 4))))) (let ((.cse58 (+ .cse59 1))) (or (< c_~min2~0 .cse58) (< (+ v_thread3Thread1of1ForFork2_~i~2_118 1) c_~N~0) (< c_~min3~0 .cse58) (< c_~M~0 v_thread3Thread1of1ForFork2_~i~2_118) (= c_~min1~0 .cse59))))))))))) (forall ((v_ArrVal_760 (Array Int Int))) (let ((.cse60 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_760))) (or (< (select (select .cse60 c_~A~0.base) .cse1) c_~min1~0) (forall ((v_ArrVal_761 (Array Int Int))) (let ((.cse64 (select (store .cse60 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_761) c_~A~0.base))) (let ((.cse61 (select .cse64 c_~A~0.offset))) (or (< c_~min2~0 (+ .cse61 1)) (forall ((v_thread3Thread1of1ForFork2_~i~2_118 Int)) (let ((.cse63 (select .cse64 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork2_~i~2_118 4))))) (let ((.cse62 (+ .cse63 1))) (or (< (+ v_thread3Thread1of1ForFork2_~i~2_118 1) c_~N~0) (< c_~min3~0 .cse62) (< c_~M~0 v_thread3Thread1of1ForFork2_~i~2_118) (< .cse61 .cse62) (= c_~min1~0 .cse63)))))))))))) (forall ((v_ArrVal_760 (Array Int Int))) (let ((.cse65 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_760))) (or (< (select (select .cse65 c_~A~0.base) .cse1) c_~min1~0) (forall ((v_ArrVal_761 (Array Int Int))) (let ((.cse68 (select (store .cse65 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_761) c_~A~0.base))) (let ((.cse66 (select .cse68 c_~A~0.offset))) (or (< c_~min2~0 (+ .cse66 1)) (= c_~min1~0 .cse66) (forall ((v_thread3Thread1of1ForFork2_~i~2_118 Int)) (let ((.cse67 (select .cse68 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork2_~i~2_118 4))))) (or (< (+ v_thread3Thread1of1ForFork2_~i~2_118 1) c_~N~0) (< c_~min3~0 (+ .cse67 1)) (< .cse67 .cse66) (< c_~M~0 v_thread3Thread1of1ForFork2_~i~2_118))))))))))) (forall ((v_ArrVal_760 (Array Int Int))) (let ((.cse74 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_760))) (let ((.cse71 (select (select .cse74 c_~A~0.base) .cse1))) (or (forall ((v_ArrVal_761 (Array Int Int))) (let ((.cse73 (select (store .cse74 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_761) c_~A~0.base))) (let ((.cse69 (select .cse73 c_~A~0.offset))) (or (< c_~min2~0 (+ .cse69 1)) (forall ((v_thread3Thread1of1ForFork2_~i~2_118 Int)) (let ((.cse72 (select .cse73 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork2_~i~2_118 4))))) (let ((.cse70 (+ .cse72 1))) (or (< (+ v_thread3Thread1of1ForFork2_~i~2_118 1) c_~N~0) (< c_~min3~0 .cse70) (= .cse71 .cse72) (< c_~M~0 v_thread3Thread1of1ForFork2_~i~2_118) (< .cse69 .cse70))))))))) (< c_~min1~0 (+ .cse71 1)))))) (forall ((v_ArrVal_760 (Array Int Int))) (let ((.cse78 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_760))) (let ((.cse76 (select (select .cse78 c_~A~0.base) .cse1))) (or (forall ((v_thread3Thread1of1ForFork2_~i~2_118 Int) (v_ArrVal_761 (Array Int Int))) (let ((.cse77 (select (store .cse78 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_761) c_~A~0.base))) (let ((.cse75 (select .cse77 c_~A~0.offset))) (or (= .cse75 .cse76) (< c_~min2~0 (+ .cse75 1)) (< (select .cse77 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork2_~i~2_118 4))) c_~min3~0) (< (+ v_thread3Thread1of1ForFork2_~i~2_118 1) c_~N~0) (< c_~M~0 v_thread3Thread1of1ForFork2_~i~2_118))))) (= c_~min3~0 .cse76) (< c_~min1~0 (+ .cse76 1)))))) (forall ((v_ArrVal_760 (Array Int Int))) (let ((.cse82 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_760))) (let ((.cse80 (select (select .cse82 c_~A~0.base) .cse1))) (or (forall ((v_thread3Thread1of1ForFork2_~i~2_118 Int)) (or (< (+ v_thread3Thread1of1ForFork2_~i~2_118 1) c_~N~0) (forall ((v_ArrVal_761 (Array Int Int))) (let ((.cse81 (select (store .cse82 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_761) c_~A~0.base))) (let ((.cse79 (select .cse81 c_~A~0.offset))) (or (= .cse79 .cse80) (< c_~min2~0 (+ .cse79 1)) (< (select .cse81 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork2_~i~2_118 4))) c_~min3~0) (< c_~min3~0 .cse79))))) (< c_~M~0 v_thread3Thread1of1ForFork2_~i~2_118))) (< c_~min1~0 (+ .cse80 1)))))) (or (and .cse21 (<= c_~min2~0 c_~min3~0)) (and .cse43 (<= .cse31 c_~min2~0)) (forall ((v_thread3Thread1of1ForFork2_~i~2_118 Int) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_761 (Array Int Int))) (let ((.cse84 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_760))) (let ((.cse83 (select (store .cse84 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_761) c_~A~0.base))) (or (< (select .cse83 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork2_~i~2_118 4))) c_~min3~0) (< (+ v_thread3Thread1of1ForFork2_~i~2_118 1) c_~N~0) (< (select .cse83 c_~A~0.offset) c_~min2~0) (< (select (select .cse84 c_~A~0.base) .cse1) c_~min1~0) (< c_~M~0 v_thread3Thread1of1ForFork2_~i~2_118)))))) (or .cse43 (forall ((v_thread3Thread1of1ForFork2_~i~2_118 Int) (v_ArrVal_760 (Array Int Int)) (v_ArrVal_761 (Array Int Int))) (let ((.cse87 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_760))) (let ((.cse86 (select (store .cse87 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_761) c_~A~0.base))) (let ((.cse85 (select .cse86 c_~A~0.offset))) (or (< c_~min2~0 (+ .cse85 1)) (< (select .cse86 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork2_~i~2_118 4))) c_~min3~0) (< (+ v_thread3Thread1of1ForFork2_~i~2_118 1) c_~N~0) (< (select (select .cse87 c_~A~0.base) .cse1) c_~min1~0) (< c_~M~0 v_thread3Thread1of1ForFork2_~i~2_118) (< .cse85 .cse31))))))))) is different from false [2023-11-06 21:17:50,883 WARN L293 SmtUtils]: Spent 27.18s on a formula simplification that was a NOOP. DAG size: 1248 (called from [L 319] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-06 21:17:50,884 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:17:50,889 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 25 select indices, 25 select index equivalence classes, 0 disjoint index pairs (out of 300 index pairs), introduced 25 new quantified variables, introduced 300 case distinctions, treesize of input 9675 treesize of output 10699 [2023-11-06 21:17:56,950 WARN L293 SmtUtils]: Spent 6.04s on a formula simplification. DAG size of input: 2795 DAG size of output: 2426 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-06 21:17:57,357 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:17:57,360 INFO L351 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 5119 treesize of output 5092 [2023-11-06 21:18:00,460 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:18:00,462 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 5083 treesize of output 5073 [2023-11-06 21:18:03,352 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:18:03,354 INFO L351 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 5044 treesize of output 5037 [2023-11-06 21:18:06,331 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:18:06,334 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 5028 treesize of output 5028 [2023-11-06 21:18:09,255 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:18:09,258 INFO L351 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 4999 treesize of output 4976 [2023-11-06 21:18:12,957 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:18:12,959 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4967 treesize of output 4969 [2023-11-06 21:18:15,838 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:18:15,840 INFO L351 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 4940 treesize of output 4909 [2023-11-06 21:18:18,723 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:18:18,725 INFO L351 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 4900 treesize of output 4893 [2023-11-06 21:18:22,189 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:18:22,191 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4884 treesize of output 4896 [2023-11-06 21:18:25,757 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:18:25,760 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4867 treesize of output 4845 [2023-11-06 21:18:29,333 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:18:29,336 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4816 treesize of output 4812 [2023-11-06 21:18:32,559 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:18:32,562 INFO L351 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 4783 treesize of output 4760 [2023-11-06 21:18:35,526 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:18:35,528 INFO L351 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 4751 treesize of output 4740 [2023-11-06 21:18:38,838 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:18:38,840 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4731 treesize of output 4739 [2023-11-06 21:18:41,665 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:18:41,668 INFO L351 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 4710 treesize of output 4691 [2023-11-06 21:18:44,711 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:18:44,713 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4682 treesize of output 4670 [2023-11-06 21:18:47,684 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:18:47,687 INFO L351 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 4641 treesize of output 4610 [2023-11-06 21:18:51,183 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:18:51,186 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4601 treesize of output 4605 [2023-11-06 21:18:54,020 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:18:54,023 INFO L351 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 4576 treesize of output 4549 [2023-11-06 21:18:56,997 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:18:56,999 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4540 treesize of output 4552 [2023-11-06 21:18:59,897 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:18:59,899 INFO L351 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 4523 treesize of output 4504