./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/weaver/parallel-bakery-3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version cf1a7837 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_7f38051d-341a-4de9-a8dc-b5156be481f6/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f38051d-341a-4de9-a8dc-b5156be481f6/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f38051d-341a-4de9-a8dc-b5156be481f6/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f38051d-341a-4de9-a8dc-b5156be481f6/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/parallel-bakery-3.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f38051d-341a-4de9-a8dc-b5156be481f6/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f38051d-341a-4de9-a8dc-b5156be481f6/bin/uautomizer-verify-uTZkv6EMXl --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0f1f05cefb3bd84a08d6d936499ca6f215f6edf0bfbf58f9874b646b6408f7c8 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:33:04,433 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:33:04,544 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f38051d-341a-4de9-a8dc-b5156be481f6/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-11-12 02:33:04,549 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:33:04,556 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:33:04,598 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:33:04,600 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:33:04,600 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:33:04,602 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:33:04,607 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:33:04,609 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:33:04,609 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:33:04,610 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:33:04,612 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:33:04,612 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:33:04,613 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:33:04,613 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:33:04,614 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:33:04,614 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:33:04,615 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:33:04,615 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:33:04,616 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:33:04,616 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-12 02:33:04,617 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 02:33:04,617 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:33:04,618 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:33:04,618 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:33:04,619 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:33:04,620 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:33:04,620 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:33:04,622 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:33:04,622 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:33:04,622 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:33:04,623 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:33:04,623 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:33:04,623 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:33:04,624 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:33:04,632 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:33:04,632 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:33:04,633 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:33:04,633 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:33:04,634 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_7f38051d-341a-4de9-a8dc-b5156be481f6/bin/uautomizer-verify-uTZkv6EMXl/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_7f38051d-341a-4de9-a8dc-b5156be481f6/bin/uautomizer-verify-uTZkv6EMXl Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 ! overflow) ) 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 -> 0f1f05cefb3bd84a08d6d936499ca6f215f6edf0bfbf58f9874b646b6408f7c8 [2023-11-12 02:33:04,958 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:33:04,982 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:33:04,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:33:04,987 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:33:04,988 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:33:04,989 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f38051d-341a-4de9-a8dc-b5156be481f6/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/weaver/parallel-bakery-3.wvr.c [2023-11-12 02:33:08,185 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:33:08,391 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:33:08,392 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f38051d-341a-4de9-a8dc-b5156be481f6/sv-benchmarks/c/weaver/parallel-bakery-3.wvr.c [2023-11-12 02:33:08,402 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f38051d-341a-4de9-a8dc-b5156be481f6/bin/uautomizer-verify-uTZkv6EMXl/data/ed8078cd8/03a1828ddbd24f17a06fb03c6d1a0334/FLAG0d902d03a [2023-11-12 02:33:08,419 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f38051d-341a-4de9-a8dc-b5156be481f6/bin/uautomizer-verify-uTZkv6EMXl/data/ed8078cd8/03a1828ddbd24f17a06fb03c6d1a0334 [2023-11-12 02:33:08,422 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:33:08,424 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:33:08,425 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:33:08,426 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:33:08,432 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:33:08,433 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:33:08" (1/1) ... [2023-11-12 02:33:08,434 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37f66627 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:33:08, skipping insertion in model container [2023-11-12 02:33:08,435 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:33:08" (1/1) ... [2023-11-12 02:33:08,470 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:33:08,688 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:33:08,700 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:33:08,740 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:33:08,750 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:33:08,750 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:33:08,759 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:33:08,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:33:08 WrapperNode [2023-11-12 02:33:08,760 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:33:08,761 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:33:08,761 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:33:08,762 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:33:08,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:33:08" (1/1) ... [2023-11-12 02:33:08,782 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:33:08" (1/1) ... [2023-11-12 02:33:08,822 INFO L138 Inliner]: procedures = 22, calls = 111, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 281 [2023-11-12 02:33:08,822 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:33:08,823 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:33:08,824 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:33:08,824 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:33:08,836 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:33:08" (1/1) ... [2023-11-12 02:33:08,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:33:08" (1/1) ... [2023-11-12 02:33:08,841 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:33:08" (1/1) ... [2023-11-12 02:33:08,842 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:33:08" (1/1) ... [2023-11-12 02:33:08,852 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:33:08" (1/1) ... [2023-11-12 02:33:08,855 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:33:08" (1/1) ... [2023-11-12 02:33:08,858 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:33:08" (1/1) ... [2023-11-12 02:33:08,860 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:33:08" (1/1) ... [2023-11-12 02:33:08,865 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:33:08,866 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:33:08,866 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:33:08,866 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:33:08,867 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:33:08" (1/1) ... [2023-11-12 02:33:08,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:33:08,907 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f38051d-341a-4de9-a8dc-b5156be481f6/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:33:08,927 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f38051d-341a-4de9-a8dc-b5156be481f6/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:33:08,942 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7f38051d-341a-4de9-a8dc-b5156be481f6/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:33:08,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:33:08,972 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-12 02:33:08,972 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-12 02:33:08,972 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-12 02:33:08,972 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-12 02:33:08,972 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-12 02:33:08,972 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-12 02:33:08,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:33:08,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 02:33:08,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:33:08,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-12 02:33:08,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-12 02:33:08,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:33:08,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:33:08,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 02:33:08,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 02:33:08,976 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-12 02:33:09,095 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:33:09,096 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:33:09,561 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:33:09,778 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:33:09,779 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-12 02:33:09,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:33:09 BoogieIcfgContainer [2023-11-12 02:33:09,782 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:33:09,785 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:33:09,786 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:33:09,790 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:33:09,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:33:08" (1/3) ... [2023-11-12 02:33:09,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62ea409a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:33:09, skipping insertion in model container [2023-11-12 02:33:09,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:33:08" (2/3) ... [2023-11-12 02:33:09,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62ea409a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:33:09, skipping insertion in model container [2023-11-12 02:33:09,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:33:09" (3/3) ... [2023-11-12 02:33:09,795 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-bakery-3.wvr.c [2023-11-12 02:33:09,805 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-12 02:33:09,818 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:33:09,819 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2023-11-12 02:33:09,819 INFO L521 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-12 02:33:09,913 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-12 02:33:09,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 183 places, 175 transitions, 371 flow [2023-11-12 02:33:10,122 INFO L124 PetriNetUnfolderBase]: 2/172 cut-off events. [2023-11-12 02:33:10,123 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-12 02:33:10,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 172 events. 2/172 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 170 event pairs, 0 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 123. Up to 2 conditions per place. [2023-11-12 02:33:10,128 INFO L82 GeneralOperation]: Start removeDead. Operand has 183 places, 175 transitions, 371 flow [2023-11-12 02:33:10,134 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 157 places, 148 transitions, 311 flow [2023-11-12 02:33:10,138 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-12 02:33:10,149 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 157 places, 148 transitions, 311 flow [2023-11-12 02:33:10,152 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 148 transitions, 311 flow [2023-11-12 02:33:10,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 148 transitions, 311 flow [2023-11-12 02:33:10,187 INFO L124 PetriNetUnfolderBase]: 1/148 cut-off events. [2023-11-12 02:33:10,188 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-12 02:33:10,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 148 events. 1/148 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 168 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 123. Up to 2 conditions per place. [2023-11-12 02:33:10,192 INFO L119 LiptonReduction]: Number of co-enabled transitions 3534 [2023-11-12 02:33:15,511 INFO L134 LiptonReduction]: Checked pairs total: 34288 [2023-11-12 02:33:15,512 INFO L136 LiptonReduction]: Total number of compositions: 108 [2023-11-12 02:33:15,527 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:33:15,534 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=LoopHeads, 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;@79abf282, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:33:15,534 INFO L358 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2023-11-12 02:33:15,537 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-12 02:33:15,537 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2023-11-12 02:33:15,538 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:33:15,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:33:15,538 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-12 02:33:15,539 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-11-12 02:33:15,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:33:15,544 INFO L85 PathProgramCache]: Analyzing trace with hash 779108362, now seen corresponding path program 1 times [2023-11-12 02:33:15,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:33:15,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115070120] [2023-11-12 02:33:15,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:33:15,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:33:15,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:33:16,140 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-12 02:33:16,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:33:16,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115070120] [2023-11-12 02:33:16,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115070120] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:33:16,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:33:16,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:33:16,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993616357] [2023-11-12 02:33:16,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:33:16,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:33:16,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:33:16,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:33:16,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:33:16,250 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 283 [2023-11-12 02:33:16,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 59 transitions, 133 flow. Second operand has 4 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 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-12 02:33:16,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:33:16,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 283 [2023-11-12 02:33:16,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:33:18,701 INFO L124 PetriNetUnfolderBase]: 12726/19422 cut-off events. [2023-11-12 02:33:18,701 INFO L125 PetriNetUnfolderBase]: For 583/583 co-relation queries the response was YES. [2023-11-12 02:33:18,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38486 conditions, 19422 events. 12726/19422 cut-off events. For 583/583 co-relation queries the response was YES. Maximal size of possible extension queue 600. Compared 128942 event pairs, 6252 based on Foata normal form. 111/16792 useless extension candidates. Maximal degree in co-relation 36095. Up to 17871 conditions per place. [2023-11-12 02:33:18,889 INFO L140 encePairwiseOnDemand]: 270/283 looper letters, 70 selfloop transitions, 10 changer transitions 0/90 dead transitions. [2023-11-12 02:33:18,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 90 transitions, 364 flow [2023-11-12 02:33:18,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:33:18,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-12 02:33:18,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 617 transitions. [2023-11-12 02:33:18,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5450530035335689 [2023-11-12 02:33:18,913 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 617 transitions. [2023-11-12 02:33:18,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 617 transitions. [2023-11-12 02:33:18,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:33:18,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 617 transitions. [2023-11-12 02:33:18,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 154.25) internal successors, (617), 4 states have internal predecessors, (617), 0 states have call successors, (0), 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-12 02:33:18,935 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 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-12 02:33:18,937 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 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-12 02:33:18,939 INFO L175 Difference]: Start difference. First operand has 69 places, 59 transitions, 133 flow. Second operand 4 states and 617 transitions. [2023-11-12 02:33:18,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 90 transitions, 364 flow [2023-11-12 02:33:18,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 90 transitions, 351 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-12 02:33:18,951 INFO L231 Difference]: Finished difference. Result has 69 places, 68 transitions, 206 flow [2023-11-12 02:33:18,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=206, PETRI_PLACES=69, PETRI_TRANSITIONS=68} [2023-11-12 02:33:18,957 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 0 predicate places. [2023-11-12 02:33:18,958 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 68 transitions, 206 flow [2023-11-12 02:33:18,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 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-12 02:33:18,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:33:18,959 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:33:18,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:33:18,959 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-11-12 02:33:18,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:33:18,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1245088509, now seen corresponding path program 1 times [2023-11-12 02:33:18,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:33:18,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575701098] [2023-11-12 02:33:18,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:33:18,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:33:18,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:33:19,251 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-12 02:33:19,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:33:19,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575701098] [2023-11-12 02:33:19,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575701098] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:33:19,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:33:19,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:33:19,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678989476] [2023-11-12 02:33:19,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:33:19,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:33:19,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:33:19,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:33:19,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:33:19,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 283 [2023-11-12 02:33:19,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 68 transitions, 206 flow. Second operand has 4 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 0 states have call successors, (0), 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-12 02:33:19,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:33:19,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 283 [2023-11-12 02:33:19,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:33:21,819 INFO L124 PetriNetUnfolderBase]: 13835/21291 cut-off events. [2023-11-12 02:33:21,819 INFO L125 PetriNetUnfolderBase]: For 4165/4561 co-relation queries the response was YES. [2023-11-12 02:33:21,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47967 conditions, 21291 events. 13835/21291 cut-off events. For 4165/4561 co-relation queries the response was YES. Maximal size of possible extension queue 619. Compared 141273 event pairs, 4823 based on Foata normal form. 268/18974 useless extension candidates. Maximal degree in co-relation 39348. Up to 19343 conditions per place. [2023-11-12 02:33:21,958 INFO L140 encePairwiseOnDemand]: 272/283 looper letters, 78 selfloop transitions, 11 changer transitions 0/101 dead transitions. [2023-11-12 02:33:21,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 101 transitions, 470 flow [2023-11-12 02:33:21,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:33:21,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-12 02:33:21,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 617 transitions. [2023-11-12 02:33:21,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5450530035335689 [2023-11-12 02:33:21,961 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 617 transitions. [2023-11-12 02:33:21,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 617 transitions. [2023-11-12 02:33:21,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:33:21,963 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 617 transitions. [2023-11-12 02:33:21,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 154.25) internal successors, (617), 4 states have internal predecessors, (617), 0 states have call successors, (0), 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-12 02:33:21,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 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-12 02:33:21,969 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 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-12 02:33:21,970 INFO L175 Difference]: Start difference. First operand has 69 places, 68 transitions, 206 flow. Second operand 4 states and 617 transitions. [2023-11-12 02:33:21,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 101 transitions, 470 flow [2023-11-12 02:33:21,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 101 transitions, 470 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-12 02:33:21,978 INFO L231 Difference]: Finished difference. Result has 74 places, 77 transitions, 303 flow [2023-11-12 02:33:21,978 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=303, PETRI_PLACES=74, PETRI_TRANSITIONS=77} [2023-11-12 02:33:21,979 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 5 predicate places. [2023-11-12 02:33:21,979 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 77 transitions, 303 flow [2023-11-12 02:33:21,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 0 states have call successors, (0), 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-12 02:33:21,980 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:33:21,980 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:33:21,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:33:21,981 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-11-12 02:33:21,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:33:21,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1995937311, now seen corresponding path program 2 times [2023-11-12 02:33:21,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:33:21,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215366181] [2023-11-12 02:33:21,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:33:21,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:33:22,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:33:22,258 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-12 02:33:22,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:33:22,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215366181] [2023-11-12 02:33:22,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215366181] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:33:22,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:33:22,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:33:22,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244428228] [2023-11-12 02:33:22,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:33:22,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:33:22,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:33:22,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:33:22,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:33:22,352 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 283 [2023-11-12 02:33:22,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 77 transitions, 303 flow. Second operand has 5 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-12 02:33:22,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:33:22,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 283 [2023-11-12 02:33:22,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:33:25,171 INFO L124 PetriNetUnfolderBase]: 15641/23711 cut-off events. [2023-11-12 02:33:25,171 INFO L125 PetriNetUnfolderBase]: For 11297/11495 co-relation queries the response was YES. [2023-11-12 02:33:25,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60705 conditions, 23711 events. 15641/23711 cut-off events. For 11297/11495 co-relation queries the response was YES. Maximal size of possible extension queue 684. Compared 156816 event pairs, 1869 based on Foata normal form. 108/21264 useless extension candidates. Maximal degree in co-relation 51110. Up to 18043 conditions per place. [2023-11-12 02:33:25,361 INFO L140 encePairwiseOnDemand]: 270/283 looper letters, 108 selfloop transitions, 20 changer transitions 0/138 dead transitions. [2023-11-12 02:33:25,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 138 transitions, 747 flow [2023-11-12 02:33:25,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:33:25,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:33:25,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 763 transitions. [2023-11-12 02:33:25,365 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5392226148409894 [2023-11-12 02:33:25,365 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 763 transitions. [2023-11-12 02:33:25,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 763 transitions. [2023-11-12 02:33:25,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:33:25,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 763 transitions. [2023-11-12 02:33:25,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 152.6) internal successors, (763), 5 states have internal predecessors, (763), 0 states have call successors, (0), 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-12 02:33:25,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 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-12 02:33:25,374 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 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-12 02:33:25,375 INFO L175 Difference]: Start difference. First operand has 74 places, 77 transitions, 303 flow. Second operand 5 states and 763 transitions. [2023-11-12 02:33:25,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 138 transitions, 747 flow [2023-11-12 02:33:25,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 138 transitions, 743 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-11-12 02:33:25,487 INFO L231 Difference]: Finished difference. Result has 79 places, 85 transitions, 418 flow [2023-11-12 02:33:25,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=418, PETRI_PLACES=79, PETRI_TRANSITIONS=85} [2023-11-12 02:33:25,489 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 10 predicate places. [2023-11-12 02:33:25,489 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 85 transitions, 418 flow [2023-11-12 02:33:25,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 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-12 02:33:25,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:33:25,490 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:33:25,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:33:25,491 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-11-12 02:33:25,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:33:25,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1995937312, now seen corresponding path program 1 times [2023-11-12 02:33:25,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:33:25,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961471414] [2023-11-12 02:33:25,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:33:25,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:33:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:33:25,789 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-12 02:33:25,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:33:25,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961471414] [2023-11-12 02:33:25,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961471414] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:33:25,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:33:25,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:33:25,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086557750] [2023-11-12 02:33:25,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:33:25,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:33:25,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:33:25,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:33:25,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:33:25,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 283 [2023-11-12 02:33:25,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 85 transitions, 418 flow. Second operand has 5 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-12 02:33:25,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:33:25,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 283 [2023-11-12 02:33:25,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:33:28,540 INFO L124 PetriNetUnfolderBase]: 17075/26027 cut-off events. [2023-11-12 02:33:28,541 INFO L125 PetriNetUnfolderBase]: For 24840/25128 co-relation queries the response was YES. [2023-11-12 02:33:28,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71534 conditions, 26027 events. 17075/26027 cut-off events. For 24840/25128 co-relation queries the response was YES. Maximal size of possible extension queue 767. Compared 176777 event pairs, 1851 based on Foata normal form. 418/24436 useless extension candidates. Maximal degree in co-relation 60570. Up to 20521 conditions per place. [2023-11-12 02:33:28,700 INFO L140 encePairwiseOnDemand]: 272/283 looper letters, 111 selfloop transitions, 19 changer transitions 0/140 dead transitions. [2023-11-12 02:33:28,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 140 transitions, 842 flow [2023-11-12 02:33:28,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:33:28,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:33:28,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 760 transitions. [2023-11-12 02:33:28,704 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5371024734982333 [2023-11-12 02:33:28,704 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 760 transitions. [2023-11-12 02:33:28,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 760 transitions. [2023-11-12 02:33:28,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:33:28,705 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 760 transitions. [2023-11-12 02:33:28,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 152.0) internal successors, (760), 5 states have internal predecessors, (760), 0 states have call successors, (0), 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-12 02:33:28,711 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 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-12 02:33:28,713 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 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-12 02:33:28,713 INFO L175 Difference]: Start difference. First operand has 79 places, 85 transitions, 418 flow. Second operand 5 states and 760 transitions. [2023-11-12 02:33:28,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 140 transitions, 842 flow [2023-11-12 02:33:28,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 140 transitions, 810 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-11-12 02:33:28,741 INFO L231 Difference]: Finished difference. Result has 81 places, 89 transitions, 478 flow [2023-11-12 02:33:28,741 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=478, PETRI_PLACES=81, PETRI_TRANSITIONS=89} [2023-11-12 02:33:28,742 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 12 predicate places. [2023-11-12 02:33:28,743 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 89 transitions, 478 flow [2023-11-12 02:33:28,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 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-12 02:33:28,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:33:28,744 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:33:28,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:33:28,744 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-11-12 02:33:28,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:33:28,745 INFO L85 PathProgramCache]: Analyzing trace with hash 2014067891, now seen corresponding path program 1 times [2023-11-12 02:33:28,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:33:28,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979135550] [2023-11-12 02:33:28,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:33:28,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:33:28,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:33:28,915 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-12 02:33:28,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:33:28,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979135550] [2023-11-12 02:33:28,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979135550] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:33:28,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:33:28,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:33:28,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919412026] [2023-11-12 02:33:28,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:33:28,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:33:28,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:33:28,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:33:28,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:33:28,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 283 [2023-11-12 02:33:28,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 89 transitions, 478 flow. Second operand has 5 states, 5 states have (on average 132.8) internal successors, (664), 5 states have internal predecessors, (664), 0 states have call successors, (0), 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-12 02:33:28,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:33:28,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 283 [2023-11-12 02:33:28,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:33:32,195 INFO L124 PetriNetUnfolderBase]: 19735/29886 cut-off events. [2023-11-12 02:33:32,195 INFO L125 PetriNetUnfolderBase]: For 40716/41618 co-relation queries the response was YES. [2023-11-12 02:33:32,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86259 conditions, 29886 events. 19735/29886 cut-off events. For 40716/41618 co-relation queries the response was YES. Maximal size of possible extension queue 918. Compared 206592 event pairs, 3423 based on Foata normal form. 510/28160 useless extension candidates. Maximal degree in co-relation 62745. Up to 21482 conditions per place. [2023-11-12 02:33:32,398 INFO L140 encePairwiseOnDemand]: 271/283 looper letters, 116 selfloop transitions, 28 changer transitions 0/154 dead transitions. [2023-11-12 02:33:32,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 154 transitions, 1036 flow [2023-11-12 02:33:32,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:33:32,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:33:32,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 772 transitions. [2023-11-12 02:33:32,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.545583038869258 [2023-11-12 02:33:32,406 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 772 transitions. [2023-11-12 02:33:32,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 772 transitions. [2023-11-12 02:33:32,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:33:32,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 772 transitions. [2023-11-12 02:33:32,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 154.4) internal successors, (772), 5 states have internal predecessors, (772), 0 states have call successors, (0), 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-12 02:33:32,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 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-12 02:33:32,415 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 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-12 02:33:32,415 INFO L175 Difference]: Start difference. First operand has 81 places, 89 transitions, 478 flow. Second operand 5 states and 772 transitions. [2023-11-12 02:33:32,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 154 transitions, 1036 flow [2023-11-12 02:33:32,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 154 transitions, 984 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-11-12 02:33:32,470 INFO L231 Difference]: Finished difference. Result has 83 places, 99 transitions, 624 flow [2023-11-12 02:33:32,471 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=624, PETRI_PLACES=83, PETRI_TRANSITIONS=99} [2023-11-12 02:33:32,474 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 14 predicate places. [2023-11-12 02:33:32,474 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 99 transitions, 624 flow [2023-11-12 02:33:32,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.8) internal successors, (664), 5 states have internal predecessors, (664), 0 states have call successors, (0), 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-12 02:33:32,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:33:32,475 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:33:32,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:33:32,476 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-11-12 02:33:32,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:33:32,476 INFO L85 PathProgramCache]: Analyzing trace with hash -927667620, now seen corresponding path program 1 times [2023-11-12 02:33:32,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:33:32,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617668665] [2023-11-12 02:33:32,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:33:32,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:33:32,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:33:32,540 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-12 02:33:32,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:33:32,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617668665] [2023-11-12 02:33:32,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617668665] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:33:32,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:33:32,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 02:33:32,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072708263] [2023-11-12 02:33:32,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:33:32,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:33:32,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:33:32,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:33:32,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:33:32,556 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 283 [2023-11-12 02:33:32,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 99 transitions, 624 flow. Second operand has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 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-12 02:33:32,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:33:32,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 283 [2023-11-12 02:33:32,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:33:34,055 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][91], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 47#L96true, 186#true, 95#L191-2true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 214#true, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 221#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:34,055 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-11-12 02:33:34,055 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-12 02:33:34,055 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-12 02:33:34,055 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-12 02:33:34,161 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][91], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 172#L192-1true, 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 47#L96true, 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 214#true, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 221#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:34,162 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-11-12 02:33:34,162 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-12 02:33:34,162 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-12 02:33:34,162 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-12 02:33:34,273 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][91], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 186#true, 95#L191-2true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 214#true, 51#L103true, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 221#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:34,274 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-12 02:33:34,274 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-12 02:33:34,274 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-12 02:33:34,274 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-12 02:33:34,401 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][91], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 172#L192-1true, 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 214#true, 51#L103true, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 221#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:34,402 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-12 02:33:34,402 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-12 02:33:34,402 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-12 02:33:34,402 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-12 02:33:34,403 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][91], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 186#true, 95#L191-2true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 214#true, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 221#true, 7#L106true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:34,403 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-12 02:33:34,404 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-12 02:33:34,404 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-12 02:33:34,404 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-12 02:33:34,534 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][91], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 172#L192-1true, 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 214#true, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 221#true, 7#L106true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:34,534 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-12 02:33:34,535 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-12 02:33:34,535 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-12 02:33:34,535 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-12 02:33:34,536 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][91], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 29#L109true, Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 186#true, 95#L191-2true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 214#true, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 221#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:34,536 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-12 02:33:34,536 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-12 02:33:34,536 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-12 02:33:34,537 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-12 02:33:34,619 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][91], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 172#L192-1true, 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 29#L109true, Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 214#true, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 221#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:34,619 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-12 02:33:34,619 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:34,620 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:34,620 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:34,620 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][91], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 14#L112true, 186#true, 95#L191-2true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 214#true, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 221#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:34,620 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-12 02:33:34,620 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:34,621 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:34,621 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:34,673 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][91], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 172#L192-1true, 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 14#L112true, 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 214#true, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 221#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:34,674 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-12 02:33:34,674 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-12 02:33:34,674 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-12 02:33:34,674 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-12 02:33:35,069 INFO L124 PetriNetUnfolderBase]: 12873/19876 cut-off events. [2023-11-12 02:33:35,070 INFO L125 PetriNetUnfolderBase]: For 49317/55299 co-relation queries the response was YES. [2023-11-12 02:33:35,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62049 conditions, 19876 events. 12873/19876 cut-off events. For 49317/55299 co-relation queries the response was YES. Maximal size of possible extension queue 655. Compared 134436 event pairs, 5093 based on Foata normal form. 2838/21453 useless extension candidates. Maximal degree in co-relation 33173. Up to 11050 conditions per place. [2023-11-12 02:33:35,182 INFO L140 encePairwiseOnDemand]: 273/283 looper letters, 115 selfloop transitions, 4 changer transitions 0/144 dead transitions. [2023-11-12 02:33:35,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 144 transitions, 1131 flow [2023-11-12 02:33:35,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:33:35,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:33:35,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2023-11-12 02:33:35,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5842167255594818 [2023-11-12 02:33:35,185 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 496 transitions. [2023-11-12 02:33:35,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 496 transitions. [2023-11-12 02:33:35,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:33:35,186 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 496 transitions. [2023-11-12 02:33:35,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 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-12 02:33:35,190 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 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-12 02:33:35,191 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 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-12 02:33:35,191 INFO L175 Difference]: Start difference. First operand has 83 places, 99 transitions, 624 flow. Second operand 3 states and 496 transitions. [2023-11-12 02:33:35,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 144 transitions, 1131 flow [2023-11-12 02:33:35,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 144 transitions, 1057 flow, removed 14 selfloop flow, removed 3 redundant places. [2023-11-12 02:33:35,227 INFO L231 Difference]: Finished difference. Result has 83 places, 102 transitions, 607 flow [2023-11-12 02:33:35,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=607, PETRI_PLACES=83, PETRI_TRANSITIONS=102} [2023-11-12 02:33:35,229 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 14 predicate places. [2023-11-12 02:33:35,229 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 102 transitions, 607 flow [2023-11-12 02:33:35,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 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-12 02:33:35,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:33:35,230 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:33:35,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:33:35,230 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-11-12 02:33:35,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:33:35,231 INFO L85 PathProgramCache]: Analyzing trace with hash 99730330, now seen corresponding path program 1 times [2023-11-12 02:33:35,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:33:35,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397344099] [2023-11-12 02:33:35,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:33:35,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:33:35,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:33:35,481 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-12 02:33:35,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:33:35,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397344099] [2023-11-12 02:33:35,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397344099] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:33:35,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:33:35,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:33:35,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824729878] [2023-11-12 02:33:35,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:33:35,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:33:35,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:33:35,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:33:35,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:33:35,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 283 [2023-11-12 02:33:35,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 102 transitions, 607 flow. Second operand has 5 states, 5 states have (on average 131.2) internal successors, (656), 5 states have internal predecessors, (656), 0 states have call successors, (0), 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-12 02:33:35,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:33:35,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 283 [2023-11-12 02:33:35,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:33:37,119 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][83], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 65#thread1EXITtrue, 51#L103true, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), 49#L190-4true, thread3Thread1of1ForFork0InUse, 221#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 226#true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:37,120 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-11-12 02:33:37,120 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-12 02:33:37,120 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-12 02:33:37,120 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-12 02:33:37,229 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][83], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 65#thread1EXITtrue, 51#L103true, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 221#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 226#true, 144#L191-1true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:37,229 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-11-12 02:33:37,229 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-12 02:33:37,229 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-12 02:33:37,229 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-12 02:33:37,403 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][83], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 65#thread1EXITtrue, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), 49#L190-4true, thread3Thread1of1ForFork0InUse, 221#true, 7#L106true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 226#true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:37,403 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-11-12 02:33:37,403 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-12 02:33:37,404 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-12 02:33:37,404 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-12 02:33:37,477 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][83], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 65#thread1EXITtrue, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 221#true, 7#L106true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 226#true, 144#L191-1true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:37,477 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-12 02:33:37,477 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-12 02:33:37,478 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-12 02:33:37,478 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-12 02:33:37,478 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][83], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 186#true, 95#L191-2true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 51#L103true, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 221#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 226#true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:37,478 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-12 02:33:37,478 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-12 02:33:37,478 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-12 02:33:37,478 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-12 02:33:37,481 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][83], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, 29#L109true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 65#thread1EXITtrue, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), 49#L190-4true, thread3Thread1of1ForFork0InUse, 221#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 226#true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:37,481 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-12 02:33:37,481 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-12 02:33:37,481 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-12 02:33:37,482 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-12 02:33:37,562 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][83], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 29#L109true, Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 65#thread1EXITtrue, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 221#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 226#true, 144#L191-1true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:37,563 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-12 02:33:37,563 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-12 02:33:37,563 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-12 02:33:37,563 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-12 02:33:37,564 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][83], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 186#true, 95#L191-2true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 221#true, 7#L106true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 226#true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:37,564 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-12 02:33:37,564 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-12 02:33:37,564 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-12 02:33:37,564 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-12 02:33:37,564 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][83], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 172#L192-1true, 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 51#L103true, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 221#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 226#true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:37,564 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-12 02:33:37,564 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-12 02:33:37,565 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-12 02:33:37,565 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-12 02:33:37,567 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][83], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 14#L112true, Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 65#thread1EXITtrue, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), 49#L190-4true, thread3Thread1of1ForFork0InUse, 221#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 226#true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:37,567 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-12 02:33:37,567 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-12 02:33:37,567 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-12 02:33:37,568 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-12 02:33:37,645 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][83], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 14#L112true, 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 65#thread1EXITtrue, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 221#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 226#true, 144#L191-1true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:37,645 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-12 02:33:37,645 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-12 02:33:37,645 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-12 02:33:37,645 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-12 02:33:37,646 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][83], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 29#L109true, Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 186#true, 95#L191-2true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 221#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 226#true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:37,646 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-12 02:33:37,646 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-12 02:33:37,646 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-12 02:33:37,646 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-12 02:33:37,647 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][83], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 172#L192-1true, 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 221#true, 7#L106true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 226#true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:37,647 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-12 02:33:37,647 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-12 02:33:37,648 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-12 02:33:37,648 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-12 02:33:37,650 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][83], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 131#thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 65#thread1EXITtrue, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), 49#L190-4true, thread3Thread1of1ForFork0InUse, 221#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 226#true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:37,650 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-12 02:33:37,650 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-12 02:33:37,650 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-12 02:33:37,650 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-12 02:33:37,650 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][83], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 77#thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 65#thread1EXITtrue, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), 49#L190-4true, thread3Thread1of1ForFork0InUse, 221#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 226#true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:37,650 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-12 02:33:37,650 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-12 02:33:37,650 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-12 02:33:37,651 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-12 02:33:37,704 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][83], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 14#L112true, 186#true, 95#L191-2true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 221#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 226#true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:37,704 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-12 02:33:37,704 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:37,704 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:37,704 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:37,705 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][83], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 131#thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 65#thread1EXITtrue, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 221#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 226#true, 144#L191-1true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:37,705 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-12 02:33:37,705 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:37,705 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:37,705 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:37,705 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][83], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 77#thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 65#thread1EXITtrue, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 221#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 226#true, 144#L191-1true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:37,705 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-12 02:33:37,705 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:37,706 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:37,706 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:37,706 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][83], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 172#L192-1true, 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 29#L109true, Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 221#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 226#true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:37,706 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-12 02:33:37,706 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:37,706 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:37,706 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:37,708 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([748] L119-->thread2EXIT: Formula: (and (= v_~n2~0_69 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_7|, ~n2~0=v_~n2~0_69, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, thread2Thread1of1ForFork2_#res#1.base][126], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 65#thread1EXITtrue, 15#thread2EXITtrue, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), 49#L190-4true, thread3Thread1of1ForFork0InUse, 221#true, 31#L136true, 226#true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:37,708 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-12 02:33:37,708 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:37,709 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:37,709 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:37,709 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][83], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 158#L119true, 65#thread1EXITtrue, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), 49#L190-4true, thread3Thread1of1ForFork0InUse, 221#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 226#true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:37,709 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-12 02:33:37,709 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:37,709 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:37,709 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:37,760 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([748] L119-->thread2EXIT: Formula: (and (= v_~n2~0_69 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_7|, ~n2~0=v_~n2~0_69, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, thread2Thread1of1ForFork2_#res#1.base][126], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 65#thread1EXITtrue, 15#thread2EXITtrue, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 221#true, 31#L136true, 226#true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 144#L191-1true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:37,760 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-12 02:33:37,760 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-12 02:33:37,761 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-12 02:33:37,761 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-12 02:33:37,761 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][83], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 158#L119true, 65#thread1EXITtrue, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 221#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 226#true, 144#L191-1true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:37,761 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-12 02:33:37,761 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-12 02:33:37,761 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-12 02:33:37,761 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-12 02:33:37,762 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][83], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 172#L192-1true, 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 14#L112true, 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 221#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 226#true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:37,762 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-12 02:33:37,762 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-12 02:33:37,762 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-12 02:33:37,762 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-12 02:33:37,763 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][83], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 131#thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 186#true, 95#L191-2true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 221#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 226#true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:37,763 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-12 02:33:37,763 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-12 02:33:37,763 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-12 02:33:37,763 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-12 02:33:37,764 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][83], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 77#thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 186#true, 95#L191-2true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 221#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 226#true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:37,764 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-12 02:33:37,764 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-12 02:33:37,764 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-12 02:33:37,764 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-12 02:33:37,817 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([748] L119-->thread2EXIT: Formula: (and (= v_~n2~0_69 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_7|, ~n2~0=v_~n2~0_69, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, thread2Thread1of1ForFork2_#res#1.base][126], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 186#true, 95#L191-2true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 15#thread2EXITtrue, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 221#true, 31#L136true, 226#true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:37,817 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-12 02:33:37,817 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-12 02:33:37,817 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-12 02:33:37,817 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-12 02:33:37,818 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][83], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 186#true, 95#L191-2true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 158#L119true, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 221#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 226#true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:37,818 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-12 02:33:37,818 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-12 02:33:37,818 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-12 02:33:37,818 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-12 02:33:37,819 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][83], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 172#L192-1true, 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 131#thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 221#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 226#true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:37,819 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-12 02:33:37,820 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-12 02:33:37,820 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-12 02:33:37,820 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-12 02:33:37,820 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][83], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 172#L192-1true, 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 77#thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 221#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 226#true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:37,821 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-12 02:33:37,821 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-12 02:33:37,821 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-12 02:33:37,821 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-12 02:33:37,859 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([748] L119-->thread2EXIT: Formula: (and (= v_~n2~0_69 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_7|, ~n2~0=v_~n2~0_69, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, thread2Thread1of1ForFork2_#res#1.base][126], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 172#L192-1true, 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 15#thread2EXITtrue, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 221#true, 31#L136true, 226#true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:37,860 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-12 02:33:37,860 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-12 02:33:37,860 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-12 02:33:37,860 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-12 02:33:37,860 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][83], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 172#L192-1true, 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 158#L119true, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 221#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 226#true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:37,861 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-12 02:33:37,861 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-12 02:33:37,861 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-12 02:33:37,861 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-12 02:33:37,973 INFO L124 PetriNetUnfolderBase]: 15475/23796 cut-off events. [2023-11-12 02:33:37,973 INFO L125 PetriNetUnfolderBase]: For 47413/51331 co-relation queries the response was YES. [2023-11-12 02:33:38,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74292 conditions, 23796 events. 15475/23796 cut-off events. For 47413/51331 co-relation queries the response was YES. Maximal size of possible extension queue 695. Compared 159796 event pairs, 4025 based on Foata normal form. 1626/24514 useless extension candidates. Maximal degree in co-relation 63985. Up to 19471 conditions per place. [2023-11-12 02:33:38,144 INFO L140 encePairwiseOnDemand]: 270/283 looper letters, 124 selfloop transitions, 18 changer transitions 0/158 dead transitions. [2023-11-12 02:33:38,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 158 transitions, 1093 flow [2023-11-12 02:33:38,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:33:38,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:33:38,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 759 transitions. [2023-11-12 02:33:38,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5363957597173145 [2023-11-12 02:33:38,149 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 759 transitions. [2023-11-12 02:33:38,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 759 transitions. [2023-11-12 02:33:38,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:33:38,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 759 transitions. [2023-11-12 02:33:38,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 151.8) internal successors, (759), 5 states have internal predecessors, (759), 0 states have call successors, (0), 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-12 02:33:38,156 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 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-12 02:33:38,157 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 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-12 02:33:38,157 INFO L175 Difference]: Start difference. First operand has 83 places, 102 transitions, 607 flow. Second operand 5 states and 759 transitions. [2023-11-12 02:33:38,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 158 transitions, 1093 flow [2023-11-12 02:33:38,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 158 transitions, 1086 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-12 02:33:38,205 INFO L231 Difference]: Finished difference. Result has 87 places, 107 transitions, 692 flow [2023-11-12 02:33:38,205 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=692, PETRI_PLACES=87, PETRI_TRANSITIONS=107} [2023-11-12 02:33:38,206 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 18 predicate places. [2023-11-12 02:33:38,206 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 107 transitions, 692 flow [2023-11-12 02:33:38,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.2) internal successors, (656), 5 states have internal predecessors, (656), 0 states have call successors, (0), 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-12 02:33:38,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:33:38,207 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:33:38,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 02:33:38,208 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-11-12 02:33:38,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:33:38,208 INFO L85 PathProgramCache]: Analyzing trace with hash -292195015, now seen corresponding path program 1 times [2023-11-12 02:33:38,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:33:38,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489655725] [2023-11-12 02:33:38,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:33:38,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:33:38,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:33:38,663 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-12 02:33:38,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:33:38,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489655725] [2023-11-12 02:33:38,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489655725] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:33:38,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:33:38,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:33:38,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088384075] [2023-11-12 02:33:38,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:33:38,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:33:38,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:33:38,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:33:38,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:33:38,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 283 [2023-11-12 02:33:38,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 107 transitions, 692 flow. Second operand has 5 states, 5 states have (on average 130.4) internal successors, (652), 5 states have internal predecessors, (652), 0 states have call successors, (0), 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-12 02:33:38,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:33:38,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 283 [2023-11-12 02:33:38,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:33:40,748 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][67], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 233#true, Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 65#thread1EXITtrue, 51#L103true, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), 49#L190-4true, thread3Thread1of1ForFork0InUse, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 226#true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:40,749 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-11-12 02:33:40,749 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-12 02:33:40,749 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-12 02:33:40,749 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-12 02:33:40,842 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][67], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 233#true, Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 65#thread1EXITtrue, 51#L103true, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 22#L139true, 226#true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 144#L191-1true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:40,842 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-11-12 02:33:40,842 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-12 02:33:40,842 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-12 02:33:40,842 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-12 02:33:40,847 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][67], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 233#true, Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 65#thread1EXITtrue, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), 49#L190-4true, thread3Thread1of1ForFork0InUse, 7#L106true, 22#L139true, 226#true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:40,847 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-11-12 02:33:40,847 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-12 02:33:40,848 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-12 02:33:40,848 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-12 02:33:40,860 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][67], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 172#L192-1true, 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 233#true, Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 47#L96true, 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 22#L139true, 226#true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:40,860 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-11-12 02:33:40,860 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-12 02:33:40,860 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-12 02:33:40,860 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-12 02:33:41,161 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][67], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 233#true, Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 65#thread1EXITtrue, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 7#L106true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 226#true, 144#L191-1true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:41,161 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-12 02:33:41,161 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-12 02:33:41,161 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-12 02:33:41,161 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-12 02:33:41,162 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][67], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 233#true, Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, 95#L191-2true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 51#L103true, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 22#L139true, 226#true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:41,162 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-12 02:33:41,162 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-12 02:33:41,162 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-12 02:33:41,162 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-12 02:33:41,168 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][67], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 29#L109true, 233#true, Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 65#thread1EXITtrue, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), 49#L190-4true, thread3Thread1of1ForFork0InUse, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 226#true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:41,168 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-12 02:33:41,168 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-12 02:33:41,168 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-12 02:33:41,168 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-12 02:33:41,255 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][67], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, 29#L109true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 233#true, Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 65#thread1EXITtrue, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 22#L139true, 226#true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 144#L191-1true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:41,255 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-12 02:33:41,255 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-12 02:33:41,256 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-12 02:33:41,256 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-12 02:33:41,256 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][67], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 233#true, Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, 95#L191-2true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 7#L106true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 226#true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:41,256 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-12 02:33:41,256 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-12 02:33:41,256 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-12 02:33:41,256 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-12 02:33:41,257 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][67], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 172#L192-1true, 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 233#true, Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 51#L103true, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 226#true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:41,257 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-12 02:33:41,257 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-12 02:33:41,257 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-12 02:33:41,257 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-12 02:33:41,263 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][67], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 14#L112true, 233#true, Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 65#thread1EXITtrue, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), 49#L190-4true, thread3Thread1of1ForFork0InUse, 22#L139true, 226#true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:41,263 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-12 02:33:41,263 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-12 02:33:41,263 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-12 02:33:41,263 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-12 02:33:41,349 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][67], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 233#true, Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 14#L112true, Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 65#thread1EXITtrue, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 226#true, 144#L191-1true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:41,350 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-12 02:33:41,350 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-12 02:33:41,350 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-12 02:33:41,350 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-12 02:33:41,351 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][67], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, 29#L109true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 233#true, Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, 95#L191-2true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 22#L139true, 226#true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:41,351 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-12 02:33:41,351 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-12 02:33:41,351 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-12 02:33:41,351 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-12 02:33:41,352 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][67], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 172#L192-1true, 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 233#true, Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 7#L106true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 226#true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:41,352 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-12 02:33:41,352 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-12 02:33:41,352 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-12 02:33:41,352 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-12 02:33:41,358 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][67], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 233#true, Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 131#thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 65#thread1EXITtrue, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), 49#L190-4true, thread3Thread1of1ForFork0InUse, 22#L139true, 226#true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:41,358 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-12 02:33:41,359 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-12 02:33:41,359 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-12 02:33:41,359 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-12 02:33:41,359 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][67], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 77#thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 233#true, Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 65#thread1EXITtrue, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), 49#L190-4true, thread3Thread1of1ForFork0InUse, 22#L139true, 226#true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:41,359 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-12 02:33:41,359 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-12 02:33:41,359 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-12 02:33:41,359 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-12 02:33:41,425 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][67], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 233#true, Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 14#L112true, Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, 95#L191-2true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 226#true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:41,426 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-12 02:33:41,426 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:41,426 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:41,426 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:41,426 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][67], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 233#true, Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 131#thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 65#thread1EXITtrue, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 22#L139true, 226#true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 144#L191-1true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:41,426 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-12 02:33:41,426 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:41,426 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:41,426 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:41,427 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][67], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 77#thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 233#true, Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 65#thread1EXITtrue, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 22#L139true, 226#true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 144#L191-1true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:41,427 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-12 02:33:41,427 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:41,427 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:41,427 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:41,428 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][67], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 172#L192-1true, 193#true, 29#L109true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 233#true, Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 22#L139true, 226#true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:41,428 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-12 02:33:41,428 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:41,428 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:41,428 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:41,432 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([748] L119-->thread2EXIT: Formula: (and (= v_~n2~0_69 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_7|, ~n2~0=v_~n2~0_69, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, thread2Thread1of1ForFork2_#res#1.base][129], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 233#true, Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 65#thread1EXITtrue, 15#thread2EXITtrue, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), 49#L190-4true, thread3Thread1of1ForFork0InUse, 31#L136true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 226#true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:41,432 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-12 02:33:41,432 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:41,432 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:41,432 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:41,432 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][67], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 233#true, Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 158#L119true, 65#thread1EXITtrue, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), 49#L190-4true, thread3Thread1of1ForFork0InUse, 22#L139true, 226#true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:41,432 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-12 02:33:41,433 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:41,433 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:41,433 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:41,487 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([748] L119-->thread2EXIT: Formula: (and (= v_~n2~0_69 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_7|, ~n2~0=v_~n2~0_69, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, thread2Thread1of1ForFork2_#res#1.base][129], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 233#true, Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 65#thread1EXITtrue, 15#thread2EXITtrue, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 31#L136true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 226#true, 144#L191-1true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:41,488 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-12 02:33:41,488 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-12 02:33:41,488 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-12 02:33:41,488 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-12 02:33:41,488 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][67], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 233#true, Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 158#L119true, 65#thread1EXITtrue, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 22#L139true, 226#true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 144#L191-1true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:41,488 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-12 02:33:41,488 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-12 02:33:41,488 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-12 02:33:41,488 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-12 02:33:41,489 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][67], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 172#L192-1true, 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 14#L112true, 233#true, Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 22#L139true, 226#true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:41,489 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-12 02:33:41,489 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-12 02:33:41,489 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-12 02:33:41,489 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-12 02:33:41,489 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][67], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 233#true, Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 131#thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 186#true, 95#L191-2true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 226#true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:41,490 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-12 02:33:41,490 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-12 02:33:41,490 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-12 02:33:41,490 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-12 02:33:41,490 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][67], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 77#thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 233#true, Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, 95#L191-2true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 226#true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:41,490 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-12 02:33:41,490 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-12 02:33:41,490 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-12 02:33:41,490 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-12 02:33:41,531 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([748] L119-->thread2EXIT: Formula: (and (= v_~n2~0_69 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_7|, ~n2~0=v_~n2~0_69, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, thread2Thread1of1ForFork2_#res#1.base][129], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 233#true, Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, 95#L191-2true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 15#thread2EXITtrue, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 31#L136true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 226#true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:41,531 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-12 02:33:41,532 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-12 02:33:41,532 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-12 02:33:41,532 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-12 02:33:41,532 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][67], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 233#true, Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, 95#L191-2true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 158#L119true, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 22#L139true, 226#true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:41,532 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-12 02:33:41,532 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-12 02:33:41,532 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-12 02:33:41,533 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-12 02:33:41,533 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][67], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 172#L192-1true, 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 233#true, Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 131#thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 22#L139true, 226#true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:41,533 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-12 02:33:41,533 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-12 02:33:41,534 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-12 02:33:41,534 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-12 02:33:41,534 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][67], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 172#L192-1true, 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 233#true, 77#thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 22#L139true, 226#true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:41,534 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-12 02:33:41,534 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-12 02:33:41,535 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-12 02:33:41,535 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-12 02:33:41,568 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([748] L119-->thread2EXIT: Formula: (and (= v_~n2~0_69 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_7|, ~n2~0=v_~n2~0_69, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, thread2Thread1of1ForFork2_#res#1.base][129], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 172#L192-1true, 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 233#true, Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 15#thread2EXITtrue, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 31#L136true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 226#true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:41,569 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-12 02:33:41,569 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-12 02:33:41,569 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-12 02:33:41,569 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-12 02:33:41,569 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][67], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 172#L192-1true, 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 233#true, Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 158#L119true, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 22#L139true, 226#true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:41,569 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-12 02:33:41,569 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-12 02:33:41,569 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-12 02:33:41,569 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-12 02:33:41,657 INFO L124 PetriNetUnfolderBase]: 17593/27121 cut-off events. [2023-11-12 02:33:41,657 INFO L125 PetriNetUnfolderBase]: For 68341/73414 co-relation queries the response was YES. [2023-11-12 02:33:41,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86051 conditions, 27121 events. 17593/27121 cut-off events. For 68341/73414 co-relation queries the response was YES. Maximal size of possible extension queue 774. Compared 184496 event pairs, 7167 based on Foata normal form. 2178/28559 useless extension candidates. Maximal degree in co-relation 45618. Up to 23029 conditions per place. [2023-11-12 02:33:41,800 INFO L140 encePairwiseOnDemand]: 270/283 looper letters, 135 selfloop transitions, 20 changer transitions 0/170 dead transitions. [2023-11-12 02:33:41,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 170 transitions, 1239 flow [2023-11-12 02:33:41,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:33:41,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:33:41,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 758 transitions. [2023-11-12 02:33:41,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5356890459363958 [2023-11-12 02:33:41,804 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 758 transitions. [2023-11-12 02:33:41,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 758 transitions. [2023-11-12 02:33:41,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:33:41,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 758 transitions. [2023-11-12 02:33:41,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 151.6) internal successors, (758), 5 states have internal predecessors, (758), 0 states have call successors, (0), 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-12 02:33:41,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 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-12 02:33:41,812 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 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-12 02:33:41,812 INFO L175 Difference]: Start difference. First operand has 87 places, 107 transitions, 692 flow. Second operand 5 states and 758 transitions. [2023-11-12 02:33:41,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 170 transitions, 1239 flow [2023-11-12 02:33:41,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 170 transitions, 1198 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-11-12 02:33:41,880 INFO L231 Difference]: Finished difference. Result has 91 places, 123 transitions, 859 flow [2023-11-12 02:33:41,880 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=663, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=859, PETRI_PLACES=91, PETRI_TRANSITIONS=123} [2023-11-12 02:33:41,881 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 22 predicate places. [2023-11-12 02:33:41,881 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 123 transitions, 859 flow [2023-11-12 02:33:41,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.4) internal successors, (652), 5 states have internal predecessors, (652), 0 states have call successors, (0), 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-12 02:33:41,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:33:41,882 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:33:41,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 02:33:41,882 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-11-12 02:33:41,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:33:41,883 INFO L85 PathProgramCache]: Analyzing trace with hash 862009619, now seen corresponding path program 1 times [2023-11-12 02:33:41,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:33:41,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978367770] [2023-11-12 02:33:41,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:33:41,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:33:41,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:33:42,049 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-12 02:33:42,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:33:42,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978367770] [2023-11-12 02:33:42,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978367770] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:33:42,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:33:42,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:33:42,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171203018] [2023-11-12 02:33:42,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:33:42,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:33:42,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:33:42,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:33:42,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:33:42,139 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 283 [2023-11-12 02:33:42,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 123 transitions, 859 flow. Second operand has 5 states, 5 states have (on average 131.2) internal successors, (656), 5 states have internal predecessors, (656), 0 states have call successors, (0), 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-12 02:33:42,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:33:42,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 283 [2023-11-12 02:33:42,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:33:44,338 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][78], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 233#true, Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), Black: 235#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 236#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), 65#thread1EXITtrue, Black: 237#(and (= ~n2~0 0) (= ~n3~0 1)), 51#L103true, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), 49#L190-4true, thread3Thread1of1ForFork0InUse, 242#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:44,338 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-11-12 02:33:44,338 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-12 02:33:44,338 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-12 02:33:44,338 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-12 02:33:44,492 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][78], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 233#true, Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), Black: 235#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 65#thread1EXITtrue, Black: 236#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), Black: 237#(and (= ~n2~0 0) (= ~n3~0 1)), 51#L103true, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 242#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 144#L191-1true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:44,492 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-11-12 02:33:44,492 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-12 02:33:44,492 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-12 02:33:44,492 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-12 02:33:44,499 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][78], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 233#true, Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), Black: 235#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 236#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), 65#thread1EXITtrue, Black: 237#(and (= ~n2~0 0) (= ~n3~0 1)), Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), 49#L190-4true, thread3Thread1of1ForFork0InUse, 242#true, 7#L106true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:44,500 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-11-12 02:33:44,500 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-12 02:33:44,500 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-12 02:33:44,500 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-12 02:33:44,639 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][78], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 233#true, Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), Black: 235#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 65#thread1EXITtrue, Black: 236#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), Black: 237#(and (= ~n2~0 0) (= ~n3~0 1)), Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 242#true, 7#L106true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 144#L191-1true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:44,640 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-12 02:33:44,640 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-12 02:33:44,640 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-12 02:33:44,640 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-12 02:33:44,640 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][78], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 233#true, Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, 95#L191-2true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), Black: 235#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 236#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), Black: 237#(and (= ~n2~0 0) (= ~n3~0 1)), 51#L103true, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 242#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:44,641 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-12 02:33:44,641 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-12 02:33:44,641 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-12 02:33:44,641 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-12 02:33:44,648 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][78], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 29#L109true, Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 233#true, Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), Black: 235#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 65#thread1EXITtrue, Black: 236#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), Black: 237#(and (= ~n2~0 0) (= ~n3~0 1)), Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), 49#L190-4true, thread3Thread1of1ForFork0InUse, 242#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:44,648 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-12 02:33:44,648 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-12 02:33:44,648 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-12 02:33:44,649 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-12 02:33:44,789 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][78], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 29#L109true, 233#true, Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), Black: 235#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 236#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), 65#thread1EXITtrue, Black: 237#(and (= ~n2~0 0) (= ~n3~0 1)), Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 242#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 144#L191-1true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:44,789 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-12 02:33:44,789 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-12 02:33:44,790 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-12 02:33:44,790 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-12 02:33:44,791 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][78], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 233#true, Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, 95#L191-2true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), Black: 235#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 236#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), Black: 237#(and (= ~n2~0 0) (= ~n3~0 1)), Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 7#L106true, 242#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:44,791 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-12 02:33:44,791 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-12 02:33:44,791 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-12 02:33:44,791 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-12 02:33:44,792 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][78], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 172#L192-1true, 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 233#true, Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), Black: 235#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 236#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), Black: 237#(and (= ~n2~0 0) (= ~n3~0 1)), 51#L103true, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 242#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:44,792 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-12 02:33:44,792 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-12 02:33:44,792 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-12 02:33:44,792 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-12 02:33:44,801 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][78], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 14#L112true, 233#true, Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), Black: 235#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 65#thread1EXITtrue, Black: 236#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), Black: 237#(and (= ~n2~0 0) (= ~n3~0 1)), Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), 49#L190-4true, thread3Thread1of1ForFork0InUse, 242#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:44,801 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-12 02:33:44,801 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-12 02:33:44,801 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-12 02:33:44,801 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-12 02:33:45,148 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][78], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 233#true, 14#L112true, Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), Black: 235#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 236#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), 65#thread1EXITtrue, Black: 237#(and (= ~n2~0 0) (= ~n3~0 1)), Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 242#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 144#L191-1true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:45,149 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-12 02:33:45,149 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-12 02:33:45,149 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-12 02:33:45,149 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-12 02:33:45,150 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][78], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 29#L109true, 233#true, Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, 95#L191-2true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), Black: 235#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 236#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), Black: 237#(and (= ~n2~0 0) (= ~n3~0 1)), Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 242#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:45,150 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-12 02:33:45,150 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-12 02:33:45,150 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-12 02:33:45,151 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-12 02:33:45,151 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][78], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 172#L192-1true, 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 233#true, Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), Black: 235#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 236#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), Black: 237#(and (= ~n2~0 0) (= ~n3~0 1)), Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 7#L106true, 242#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:45,151 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-12 02:33:45,151 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-12 02:33:45,151 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-12 02:33:45,152 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-12 02:33:45,159 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][78], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 233#true, Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 131#thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), Black: 235#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 65#thread1EXITtrue, Black: 236#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), Black: 237#(and (= ~n2~0 0) (= ~n3~0 1)), Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), 49#L190-4true, thread3Thread1of1ForFork0InUse, 242#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:45,159 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-12 02:33:45,159 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-12 02:33:45,159 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-12 02:33:45,159 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-12 02:33:45,160 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][78], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 233#true, 77#thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), Black: 235#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 65#thread1EXITtrue, Black: 236#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), Black: 237#(and (= ~n2~0 0) (= ~n3~0 1)), Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), 49#L190-4true, thread3Thread1of1ForFork0InUse, 242#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:45,160 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-12 02:33:45,160 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-12 02:33:45,160 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-12 02:33:45,161 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-12 02:33:45,235 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][78], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 233#true, 14#L112true, Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, 95#L191-2true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), Black: 235#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 236#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), Black: 237#(and (= ~n2~0 0) (= ~n3~0 1)), Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 242#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:45,235 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-12 02:33:45,235 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:45,235 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:45,235 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:45,236 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][78], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 233#true, Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 131#thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), Black: 235#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 236#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), 65#thread1EXITtrue, Black: 237#(and (= ~n2~0 0) (= ~n3~0 1)), Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 242#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 144#L191-1true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:45,236 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-12 02:33:45,236 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:45,236 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:45,236 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:45,236 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][78], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 233#true, 77#thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), Black: 235#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 236#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), 65#thread1EXITtrue, Black: 237#(and (= ~n2~0 0) (= ~n3~0 1)), Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 242#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 144#L191-1true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:45,237 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-12 02:33:45,237 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:45,237 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:45,237 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:45,237 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][78], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 172#L192-1true, 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 29#L109true, 233#true, Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), Black: 235#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 236#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), Black: 237#(and (= ~n2~0 0) (= ~n3~0 1)), Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 242#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:45,237 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-12 02:33:45,237 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:45,237 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:45,238 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:45,242 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([748] L119-->thread2EXIT: Formula: (and (= v_~n2~0_69 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_7|, ~n2~0=v_~n2~0_69, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, thread2Thread1of1ForFork2_#res#1.base][138], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 233#true, Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), Black: 235#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 65#thread1EXITtrue, Black: 236#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), Black: 237#(and (= ~n2~0 0) (= ~n3~0 1)), 15#thread2EXITtrue, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), 49#L190-4true, thread3Thread1of1ForFork0InUse, 31#L136true, 242#true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:45,242 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-12 02:33:45,242 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:45,242 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:45,242 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:45,242 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][78], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 233#true, Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), Black: 235#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 158#L119true, 65#thread1EXITtrue, Black: 236#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), Black: 237#(and (= ~n2~0 0) (= ~n3~0 1)), Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), 49#L190-4true, thread3Thread1of1ForFork0InUse, 242#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:45,242 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-12 02:33:45,242 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:45,242 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:45,242 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-12 02:33:45,299 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([748] L119-->thread2EXIT: Formula: (and (= v_~n2~0_69 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_7|, ~n2~0=v_~n2~0_69, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, thread2Thread1of1ForFork2_#res#1.base][138], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 233#true, Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), Black: 235#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 65#thread1EXITtrue, Black: 236#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), Black: 237#(and (= ~n2~0 0) (= ~n3~0 1)), 15#thread2EXITtrue, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 31#L136true, 242#true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 144#L191-1true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:45,299 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-12 02:33:45,299 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-12 02:33:45,299 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-12 02:33:45,299 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-12 02:33:45,299 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][78], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 233#true, Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 158#L119true, Black: 235#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 65#thread1EXITtrue, Black: 236#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), Black: 237#(and (= ~n2~0 0) (= ~n3~0 1)), Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 242#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), 144#L191-1true, Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:45,299 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-12 02:33:45,300 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-12 02:33:45,300 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-12 02:33:45,300 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-12 02:33:45,300 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][78], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 172#L192-1true, 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 233#true, 14#L112true, Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), Black: 235#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 236#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), Black: 237#(and (= ~n2~0 0) (= ~n3~0 1)), Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 242#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:45,300 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-12 02:33:45,300 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-12 02:33:45,300 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-12 02:33:45,300 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-12 02:33:45,301 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][78], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 233#true, Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 131#thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 186#true, 95#L191-2true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), Black: 235#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 236#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), Black: 237#(and (= ~n2~0 0) (= ~n3~0 1)), Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 242#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:45,301 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-12 02:33:45,301 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-12 02:33:45,301 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-12 02:33:45,301 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-12 02:33:45,302 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][78], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 233#true, 77#thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, 95#L191-2true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), Black: 235#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 236#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), Black: 237#(and (= ~n2~0 0) (= ~n3~0 1)), Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 242#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:45,302 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-12 02:33:45,302 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-12 02:33:45,302 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-12 02:33:45,302 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-12 02:33:45,351 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([748] L119-->thread2EXIT: Formula: (and (= v_~n2~0_69 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_7|, ~n2~0=v_~n2~0_69, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, thread2Thread1of1ForFork2_#res#1.base][138], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 233#true, Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, 95#L191-2true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), Black: 235#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 236#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), Black: 237#(and (= ~n2~0 0) (= ~n3~0 1)), 15#thread2EXITtrue, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 31#L136true, 242#true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:45,351 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-12 02:33:45,351 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-12 02:33:45,351 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-12 02:33:45,351 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-12 02:33:45,352 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][78], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 233#true, Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, 95#L191-2true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 158#L119true, Black: 235#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 236#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), Black: 237#(and (= ~n2~0 0) (= ~n3~0 1)), Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 242#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:45,352 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-12 02:33:45,352 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-12 02:33:45,352 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-12 02:33:45,352 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-12 02:33:45,352 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][78], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 172#L192-1true, 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 233#true, Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 131#thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), Black: 235#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 236#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), Black: 237#(and (= ~n2~0 0) (= ~n3~0 1)), Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 242#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:45,353 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-12 02:33:45,353 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-12 02:33:45,353 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-12 02:33:45,353 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-12 02:33:45,354 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][78], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 172#L192-1true, 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), 233#true, 77#thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), Black: 235#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 236#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), Black: 237#(and (= ~n2~0 0) (= ~n3~0 1)), Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 242#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:45,354 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-12 02:33:45,354 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-12 02:33:45,354 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-12 02:33:45,354 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-12 02:33:45,391 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([748] L119-->thread2EXIT: Formula: (and (= v_~n2~0_69 0) (= |v_thread2Thread1of1ForFork2_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork2_#res#1.offset_7| 0)) InVars {} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_7|, ~n2~0=v_~n2~0_69, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, ~n2~0, thread2Thread1of1ForFork2_#res#1.base][138], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 172#L192-1true, 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 233#true, Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), Black: 235#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 236#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), Black: 237#(and (= ~n2~0 0) (= ~n3~0 1)), 15#thread2EXITtrue, Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 31#L136true, 242#true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:45,392 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-12 02:33:45,392 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-12 02:33:45,392 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-12 02:33:45,392 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-12 02:33:45,392 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([661] L136-->L139: Formula: (and (= (+ v_~n3~0_52 1) v_~n3~0_51) (<= v_~n3~0_52 2147483646) (<= 0 (+ 2147483649 v_~n3~0_52))) InVars {~n3~0=v_~n3~0_52} OutVars{~n3~0=v_~n3~0_51, thread3Thread1of1ForFork0_#t~post3#1=|v_thread3Thread1of1ForFork0_#t~post3#1_5|} AuxVars[] AssignedVars[~n3~0, thread3Thread1of1ForFork0_#t~post3#1][78], [Black: 188#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 223#(= ~i~0 0), 172#L192-1true, 193#true, Black: 195#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), 233#true, Black: 196#(and (= ~n2~0 0) (= ~n3~0 0)), Black: 230#(and (= ~n2~0 0) (<= 1 ~n3~0)), 186#true, Black: 204#(and (<= 1 ~n2~0) (= ~n3~0 0)), 158#L119true, Black: 235#(and (= ~n2~0 0) (= ~n3~0 0) (= ~n1~0 0)), Black: 236#(and (= ~n2~0 0) (= ~n1~0 0) (= ~n3~0 1)), Black: 237#(and (= ~n2~0 0) (= ~n3~0 1)), Black: 211#(and (= ~n2~0 1) (= ~n3~0 0)), thread3Thread1of1ForFork0InUse, 242#true, 22#L139true, Black: 218#(and (<= ~n1~0 1) (= ~n3~0 0)), Black: 189#(and (= ~n3~0 0) (= ~n1~0 0))]) [2023-11-12 02:33:45,393 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-12 02:33:45,393 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-12 02:33:45,393 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-12 02:33:45,393 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-12 02:33:45,533 INFO L124 PetriNetUnfolderBase]: 17749/27360 cut-off events. [2023-11-12 02:33:45,533 INFO L125 PetriNetUnfolderBase]: For 88088/93580 co-relation queries the response was YES. [2023-11-12 02:33:45,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92449 conditions, 27360 events. 17749/27360 cut-off events. For 88088/93580 co-relation queries the response was YES. Maximal size of possible extension queue 816. Compared 188388 event pairs, 4736 based on Foata normal form. 1812/28428 useless extension candidates. Maximal degree in co-relation 80284. Up to 21898 conditions per place. [2023-11-12 02:33:45,701 INFO L140 encePairwiseOnDemand]: 272/283 looper letters, 136 selfloop transitions, 25 changer transitions 0/178 dead transitions. [2023-11-12 02:33:45,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 178 transitions, 1400 flow [2023-11-12 02:33:45,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:33:45,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:33:45,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 755 transitions. [2023-11-12 02:33:45,704 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5335689045936396 [2023-11-12 02:33:45,704 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 755 transitions. [2023-11-12 02:33:45,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 755 transitions. [2023-11-12 02:33:45,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:33:45,705 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 755 transitions. [2023-11-12 02:33:45,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 151.0) internal successors, (755), 5 states have internal predecessors, (755), 0 states have call successors, (0), 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-12 02:33:45,711 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 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-12 02:33:45,712 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 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-12 02:33:45,712 INFO L175 Difference]: Start difference. First operand has 91 places, 123 transitions, 859 flow. Second operand 5 states and 755 transitions. [2023-11-12 02:33:45,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 178 transitions, 1400 flow [2023-11-12 02:33:45,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 178 transitions, 1368 flow, removed 16 selfloop flow, removed 0 redundant places. [2023-11-12 02:33:45,784 INFO L231 Difference]: Finished difference. Result has 96 places, 128 transitions, 955 flow [2023-11-12 02:33:45,785 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=835, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=955, PETRI_PLACES=96, PETRI_TRANSITIONS=128} [2023-11-12 02:33:45,785 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 27 predicate places. [2023-11-12 02:33:45,786 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 128 transitions, 955 flow [2023-11-12 02:33:45,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.2) internal successors, (656), 5 states have internal predecessors, (656), 0 states have call successors, (0), 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-12 02:33:45,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:33:45,786 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:33:45,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 02:33:45,787 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-11-12 02:33:45,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:33:45,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1611814469, now seen corresponding path program 1 times [2023-11-12 02:33:45,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:33:45,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586197754] [2023-11-12 02:33:45,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:33:45,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:33:45,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:33:46,020 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-12 02:33:46,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:33:46,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586197754] [2023-11-12 02:33:46,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586197754] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:33:46,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:33:46,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:33:46,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503831615] [2023-11-12 02:33:46,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:33:46,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:33:46,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:33:46,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:33:46,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:33:46,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 283 [2023-11-12 02:33:46,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 128 transitions, 955 flow. Second operand has 6 states, 6 states have (on average 128.33333333333334) internal successors, (770), 6 states have internal predecessors, (770), 0 states have call successors, (0), 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-12 02:33:46,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:33:46,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 283 [2023-11-12 02:33:46,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:33:50,403 INFO L124 PetriNetUnfolderBase]: 23850/37116 cut-off events. [2023-11-12 02:33:50,403 INFO L125 PetriNetUnfolderBase]: For 121546/124494 co-relation queries the response was YES. [2023-11-12 02:33:50,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123927 conditions, 37116 events. 23850/37116 cut-off events. For 121546/124494 co-relation queries the response was YES. Maximal size of possible extension queue 1069. Compared 269144 event pairs, 4979 based on Foata normal form. 1482/37564 useless extension candidates. Maximal degree in co-relation 99128. Up to 22359 conditions per place. [2023-11-12 02:33:50,938 INFO L140 encePairwiseOnDemand]: 268/283 looper letters, 188 selfloop transitions, 52 changer transitions 0/255 dead transitions. [2023-11-12 02:33:50,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 255 transitions, 2073 flow [2023-11-12 02:33:50,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:33:50,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-12 02:33:50,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 922 transitions. [2023-11-12 02:33:50,942 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5429917550058893 [2023-11-12 02:33:50,943 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 922 transitions. [2023-11-12 02:33:50,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 922 transitions. [2023-11-12 02:33:50,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:33:50,944 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 922 transitions. [2023-11-12 02:33:50,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 153.66666666666666) internal successors, (922), 6 states have internal predecessors, (922), 0 states have call successors, (0), 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-12 02:33:50,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 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-12 02:33:50,951 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 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-12 02:33:50,952 INFO L175 Difference]: Start difference. First operand has 96 places, 128 transitions, 955 flow. Second operand 6 states and 922 transitions. [2023-11-12 02:33:50,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 255 transitions, 2073 flow [2023-11-12 02:33:51,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 255 transitions, 2032 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-11-12 02:33:51,060 INFO L231 Difference]: Finished difference. Result has 103 places, 157 transitions, 1448 flow [2023-11-12 02:33:51,061 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=919, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1448, PETRI_PLACES=103, PETRI_TRANSITIONS=157} [2023-11-12 02:33:51,062 INFO L281 CegarLoopForPetriNet]: 69 programPoint places, 34 predicate places. [2023-11-12 02:33:51,062 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 157 transitions, 1448 flow [2023-11-12 02:33:51,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 128.33333333333334) internal successors, (770), 6 states have internal predecessors, (770), 0 states have call successors, (0), 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-12 02:33:51,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:33:51,063 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:33:51,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-12 02:33:51,063 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2023-11-12 02:33:51,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:33:51,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1998977873, now seen corresponding path program 1 times [2023-11-12 02:33:51,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:33:51,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348541360] [2023-11-12 02:33:51,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:33:51,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:33:51,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:33:51,420 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-12 02:33:51,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:33:51,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348541360] [2023-11-12 02:33:51,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348541360] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:33:51,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:33:51,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:33:51,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203629095] [2023-11-12 02:33:51,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:33:51,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:33:51,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:33:51,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:33:51,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:33:51,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 283 [2023-11-12 02:33:51,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 157 transitions, 1448 flow. Second operand has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 0 states have call successors, (0), 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-12 02:33:51,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:33:51,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 283 [2023-11-12 02:33:51,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand