./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8098f149-911a-446a-85a3-b67e3c4ce416/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8098f149-911a-446a-85a3-b67e3c4ce416/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8098f149-911a-446a-85a3-b67e3c4ce416/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8098f149-911a-446a-85a3-b67e3c4ce416/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8098f149-911a-446a-85a3-b67e3c4ce416/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8098f149-911a-446a-85a3-b67e3c4ce416/bin/uautomizer-verify-qhAvR1uOyd --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3ff96f1177b851e0082faef897c2fcf87c2462cab57ba2153c754c5e198aaf06 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:55:36,598 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:55:36,735 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8098f149-911a-446a-85a3-b67e3c4ce416/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-13 13:55:36,745 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:55:36,746 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:55:36,798 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:55:36,801 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:55:36,801 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:55:36,802 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:55:36,802 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:55:36,803 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:55:36,804 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:55:36,804 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:55:36,805 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:55:36,805 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:55:36,805 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:55:36,805 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:55:36,805 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 13:55:36,805 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:55:36,805 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:55:36,805 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 13:55:36,806 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 13:55:36,806 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 13:55:36,806 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:55:36,806 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 13:55:36,806 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:55:36,806 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 13:55:36,806 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:55:36,806 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:55:36,806 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:55:36,806 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:55:36,808 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:55:36,808 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:55:36,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:55:36,809 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:55:36,809 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:55:36,809 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 13:55:36,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 13:55:36,809 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:55:36,810 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:55:36,810 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:55:36,810 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:55:36,810 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_8098f149-911a-446a-85a3-b67e3c4ce416/bin/uautomizer-verify-qhAvR1uOyd 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 3ff96f1177b851e0082faef897c2fcf87c2462cab57ba2153c754c5e198aaf06 [2024-11-13 13:55:37,287 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:55:37,301 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:55:37,305 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:55:37,307 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:55:37,307 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:55:37,310 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8098f149-911a-446a-85a3-b67e3c4ce416/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c Unable to find full path for "g++" [2024-11-13 13:55:39,793 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:55:40,237 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:55:40,238 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8098f149-911a-446a-85a3-b67e3c4ce416/sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c [2024-11-13 13:55:40,249 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8098f149-911a-446a-85a3-b67e3c4ce416/bin/uautomizer-verify-qhAvR1uOyd/data/0a5b3b6aa/ceb2aa4392f847d2bfb75e540b738a75/FLAGc5b1abf2e [2024-11-13 13:55:40,269 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8098f149-911a-446a-85a3-b67e3c4ce416/bin/uautomizer-verify-qhAvR1uOyd/data/0a5b3b6aa/ceb2aa4392f847d2bfb75e540b738a75 [2024-11-13 13:55:40,271 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:55:40,273 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:55:40,275 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:55:40,275 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:55:40,281 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:55:40,282 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:55:40" (1/1) ... [2024-11-13 13:55:40,284 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3124effb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:55:40, skipping insertion in model container [2024-11-13 13:55:40,284 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:55:40" (1/1) ... [2024-11-13 13:55:40,306 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:55:40,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:55:40,535 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:55:40,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:55:40,598 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:55:40,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:55:40 WrapperNode [2024-11-13 13:55:40,599 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:55:40,601 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:55:40,601 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:55:40,601 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:55:40,611 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:55:40" (1/1) ... [2024-11-13 13:55:40,626 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:55:40" (1/1) ... [2024-11-13 13:55:40,660 INFO L138 Inliner]: procedures = 21, calls = 32, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 67 [2024-11-13 13:55:40,660 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:55:40,661 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:55:40,664 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:55:40,664 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:55:40,680 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:55:40" (1/1) ... [2024-11-13 13:55:40,680 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:55:40" (1/1) ... [2024-11-13 13:55:40,683 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:55:40" (1/1) ... [2024-11-13 13:55:40,720 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 13:55:40,721 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:55:40" (1/1) ... [2024-11-13 13:55:40,721 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:55:40" (1/1) ... [2024-11-13 13:55:40,735 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:55:40" (1/1) ... [2024-11-13 13:55:40,744 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:55:40" (1/1) ... [2024-11-13 13:55:40,746 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:55:40" (1/1) ... [2024-11-13 13:55:40,751 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:55:40" (1/1) ... [2024-11-13 13:55:40,753 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:55:40,758 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:55:40,758 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:55:40,758 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:55:40,759 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:55:40" (1/1) ... [2024-11-13 13:55:40,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:55:40,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8098f149-911a-446a-85a3-b67e3c4ce416/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:55:40,811 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8098f149-911a-446a-85a3-b67e3c4ce416/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:55:40,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8098f149-911a-446a-85a3-b67e3c4ce416/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:55:40,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:55:40,855 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-13 13:55:40,856 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-13 13:55:40,856 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-13 13:55:40,856 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-13 13:55:40,856 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-13 13:55:40,857 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-13 13:55:40,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 13:55:40,857 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-13 13:55:40,857 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-13 13:55:40,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:55:40,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:55:40,860 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 13:55:41,021 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:55:41,025 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:55:41,533 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 13:55:41,533 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:55:41,775 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:55:41,775 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-13 13:55:41,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:55:41 BoogieIcfgContainer [2024-11-13 13:55:41,776 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:55:41,779 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:55:41,779 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:55:41,785 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:55:41,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:55:40" (1/3) ... [2024-11-13 13:55:41,787 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47e2653b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:55:41, skipping insertion in model container [2024-11-13 13:55:41,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:55:40" (2/3) ... [2024-11-13 13:55:41,787 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47e2653b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:55:41, skipping insertion in model container [2024-11-13 13:55:41,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:55:41" (3/3) ... [2024-11-13 13:55:41,789 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-threaded-sum-3.wvr.c [2024-11-13 13:55:41,808 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:55:41,810 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-threaded-sum-3.wvr.c that has 4 procedures, 35 locations, 1 initial locations, 3 loop locations, and 2 error locations. [2024-11-13 13:55:41,810 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 13:55:41,915 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-13 13:55:41,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 37 transitions, 95 flow [2024-11-13 13:55:42,010 INFO L124 PetriNetUnfolderBase]: 3/34 cut-off events. [2024-11-13 13:55:42,013 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-13 13:55:42,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 34 events. 3/34 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 56 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 28. Up to 2 conditions per place. [2024-11-13 13:55:42,018 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 37 transitions, 95 flow [2024-11-13 13:55:42,022 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 33 transitions, 84 flow [2024-11-13 13:55:42,034 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:55:42,050 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@294421f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:55:42,050 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-13 13:55:42,070 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-13 13:55:42,070 INFO L124 PetriNetUnfolderBase]: 3/30 cut-off events. [2024-11-13 13:55:42,070 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-13 13:55:42,070 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:55:42,071 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:55:42,072 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 13:55:42,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:55:42,078 INFO L85 PathProgramCache]: Analyzing trace with hash -163081695, now seen corresponding path program 1 times [2024-11-13 13:55:42,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:55:42,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733956486] [2024-11-13 13:55:42,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:55:42,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:55:42,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:55:43,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:55:43,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:55:43,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733956486] [2024-11-13 13:55:43,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733956486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:55:43,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:55:43,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:55:43,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574904502] [2024-11-13 13:55:43,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:55:43,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:55:43,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:55:43,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:55:43,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:55:43,416 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2024-11-13 13:55:43,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:55:43,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:55:43,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2024-11-13 13:55:43,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:55:43,901 INFO L124 PetriNetUnfolderBase]: 367/655 cut-off events. [2024-11-13 13:55:43,902 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2024-11-13 13:55:43,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1264 conditions, 655 events. 367/655 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3357 event pairs, 26 based on Foata normal form. 21/656 useless extension candidates. Maximal degree in co-relation 1074. Up to 445 conditions per place. [2024-11-13 13:55:43,923 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 33 selfloop transitions, 5 changer transitions 0/49 dead transitions. [2024-11-13 13:55:43,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 49 transitions, 204 flow [2024-11-13 13:55:43,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:55:43,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-13 13:55:43,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2024-11-13 13:55:43,943 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6756756756756757 [2024-11-13 13:55:43,946 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 84 flow. Second operand 4 states and 100 transitions. [2024-11-13 13:55:43,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 49 transitions, 204 flow [2024-11-13 13:55:43,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 49 transitions, 184 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-13 13:55:43,966 INFO L231 Difference]: Finished difference. Result has 37 places, 35 transitions, 100 flow [2024-11-13 13:55:43,971 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=37, PETRI_TRANSITIONS=35} [2024-11-13 13:55:43,977 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2024-11-13 13:55:43,980 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 35 transitions, 100 flow [2024-11-13 13:55:43,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:55:43,981 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:55:43,981 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:55:43,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 13:55:43,981 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 13:55:43,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:55:43,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1939177129, now seen corresponding path program 1 times [2024-11-13 13:55:43,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:55:43,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763628347] [2024-11-13 13:55:43,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:55:43,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:55:44,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:55:44,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:55:44,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:55:44,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763628347] [2024-11-13 13:55:44,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763628347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:55:44,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:55:44,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:55:44,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837959011] [2024-11-13 13:55:44,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:55:44,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:55:44,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:55:44,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:55:44,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:55:44,916 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2024-11-13 13:55:44,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 100 flow. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:55:44,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:55:44,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2024-11-13 13:55:44,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:55:45,590 INFO L124 PetriNetUnfolderBase]: 1042/1655 cut-off events. [2024-11-13 13:55:45,591 INFO L125 PetriNetUnfolderBase]: For 404/436 co-relation queries the response was YES. [2024-11-13 13:55:45,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3702 conditions, 1655 events. 1042/1655 cut-off events. For 404/436 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 8425 event pairs, 251 based on Foata normal form. 24/1654 useless extension candidates. Maximal degree in co-relation 2530. Up to 925 conditions per place. [2024-11-13 13:55:45,610 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 59 selfloop transitions, 20 changer transitions 0/87 dead transitions. [2024-11-13 13:55:45,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 87 transitions, 422 flow [2024-11-13 13:55:45,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:55:45,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 13:55:45,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2024-11-13 13:55:45,613 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6864864864864865 [2024-11-13 13:55:45,613 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 100 flow. Second operand 5 states and 127 transitions. [2024-11-13 13:55:45,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 87 transitions, 422 flow [2024-11-13 13:55:45,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 87 transitions, 422 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-13 13:55:45,618 INFO L231 Difference]: Finished difference. Result has 44 places, 53 transitions, 256 flow [2024-11-13 13:55:45,618 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=256, PETRI_PLACES=44, PETRI_TRANSITIONS=53} [2024-11-13 13:55:45,619 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2024-11-13 13:55:45,619 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 53 transitions, 256 flow [2024-11-13 13:55:45,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:55:45,620 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:55:45,620 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:55:45,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 13:55:45,621 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 13:55:45,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:55:45,622 INFO L85 PathProgramCache]: Analyzing trace with hash -651327365, now seen corresponding path program 2 times [2024-11-13 13:55:45,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:55:45,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955909407] [2024-11-13 13:55:45,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:55:45,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:55:45,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:55:46,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 13:55:46,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:55:46,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955909407] [2024-11-13 13:55:46,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955909407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:55:46,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:55:46,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:55:46,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352861169] [2024-11-13 13:55:46,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:55:46,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:55:46,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:55:46,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:55:46,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:55:46,176 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2024-11-13 13:55:46,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 53 transitions, 256 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:55:46,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:55:46,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2024-11-13 13:55:46,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:55:46,604 INFO L124 PetriNetUnfolderBase]: 785/1286 cut-off events. [2024-11-13 13:55:46,604 INFO L125 PetriNetUnfolderBase]: For 1106/1207 co-relation queries the response was YES. [2024-11-13 13:55:46,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3769 conditions, 1286 events. 785/1286 cut-off events. For 1106/1207 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 6411 event pairs, 87 based on Foata normal form. 112/1364 useless extension candidates. Maximal degree in co-relation 3033. Up to 623 conditions per place. [2024-11-13 13:55:46,624 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 61 selfloop transitions, 6 changer transitions 2/83 dead transitions. [2024-11-13 13:55:46,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 83 transitions, 510 flow [2024-11-13 13:55:46,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:55:46,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 13:55:46,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2024-11-13 13:55:46,627 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6702702702702703 [2024-11-13 13:55:46,627 INFO L175 Difference]: Start difference. First operand has 44 places, 53 transitions, 256 flow. Second operand 5 states and 124 transitions. [2024-11-13 13:55:46,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 83 transitions, 510 flow [2024-11-13 13:55:46,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 83 transitions, 502 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-11-13 13:55:46,637 INFO L231 Difference]: Finished difference. Result has 51 places, 54 transitions, 274 flow [2024-11-13 13:55:46,637 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=274, PETRI_PLACES=51, PETRI_TRANSITIONS=54} [2024-11-13 13:55:46,639 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2024-11-13 13:55:46,639 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 54 transitions, 274 flow [2024-11-13 13:55:46,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:55:46,639 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:55:46,640 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:55:46,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 13:55:46,640 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 13:55:46,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:55:46,642 INFO L85 PathProgramCache]: Analyzing trace with hash 788853202, now seen corresponding path program 1 times [2024-11-13 13:55:46,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:55:46,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788449490] [2024-11-13 13:55:46,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:55:46,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:55:46,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:55:47,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:55:47,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:55:47,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788449490] [2024-11-13 13:55:47,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788449490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:55:47,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:55:47,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 13:55:47,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100990882] [2024-11-13 13:55:47,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:55:47,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:55:47,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:55:47,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:55:47,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 13:55:47,250 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2024-11-13 13:55:47,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 54 transitions, 274 flow. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:55:47,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:55:47,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2024-11-13 13:55:47,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:55:47,740 INFO L124 PetriNetUnfolderBase]: 1074/1760 cut-off events. [2024-11-13 13:55:47,740 INFO L125 PetriNetUnfolderBase]: For 2400/2502 co-relation queries the response was YES. [2024-11-13 13:55:47,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5664 conditions, 1760 events. 1074/1760 cut-off events. For 2400/2502 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 9740 event pairs, 186 based on Foata normal form. 138/1863 useless extension candidates. Maximal degree in co-relation 3923. Up to 1036 conditions per place. [2024-11-13 13:55:47,768 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 63 selfloop transitions, 10 changer transitions 0/86 dead transitions. [2024-11-13 13:55:47,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 86 transitions, 570 flow [2024-11-13 13:55:47,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:55:47,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 13:55:47,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2024-11-13 13:55:47,773 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.654054054054054 [2024-11-13 13:55:47,773 INFO L175 Difference]: Start difference. First operand has 51 places, 54 transitions, 274 flow. Second operand 5 states and 121 transitions. [2024-11-13 13:55:47,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 86 transitions, 570 flow [2024-11-13 13:55:47,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 86 transitions, 566 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 13:55:47,795 INFO L231 Difference]: Finished difference. Result has 55 places, 56 transitions, 313 flow [2024-11-13 13:55:47,795 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=313, PETRI_PLACES=55, PETRI_TRANSITIONS=56} [2024-11-13 13:55:47,797 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 15 predicate places. [2024-11-13 13:55:47,797 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 56 transitions, 313 flow [2024-11-13 13:55:47,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:55:47,799 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:55:47,799 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:55:47,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 13:55:47,800 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 13:55:47,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:55:47,802 INFO L85 PathProgramCache]: Analyzing trace with hash 404891264, now seen corresponding path program 2 times [2024-11-13 13:55:47,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:55:47,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393233225] [2024-11-13 13:55:47,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:55:47,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:55:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:55:48,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:55:48,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:55:48,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393233225] [2024-11-13 13:55:48,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393233225] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:55:48,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731899292] [2024-11-13 13:55:48,328 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 13:55:48,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:55:48,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8098f149-911a-446a-85a3-b67e3c4ce416/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:55:48,332 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8098f149-911a-446a-85a3-b67e3c4ce416/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:55:48,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8098f149-911a-446a-85a3-b67e3c4ce416/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 13:55:48,461 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 13:55:48,462 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:55:48,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-13 13:55:48,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:55:48,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:55:48,638 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:55:48,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731899292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:55:48,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 13:55:48,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2024-11-13 13:55:48,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381515574] [2024-11-13 13:55:48,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:55:48,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 13:55:48,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:55:48,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 13:55:48,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:55:48,685 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 37 [2024-11-13 13:55:48,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 56 transitions, 313 flow. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:55:48,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:55:48,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 37 [2024-11-13 13:55:48,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:55:49,293 INFO L124 PetriNetUnfolderBase]: 1551/2473 cut-off events. [2024-11-13 13:55:49,293 INFO L125 PetriNetUnfolderBase]: For 4500/4596 co-relation queries the response was YES. [2024-11-13 13:55:49,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8251 conditions, 2473 events. 1551/2473 cut-off events. For 4500/4596 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 13949 event pairs, 301 based on Foata normal form. 204/2618 useless extension candidates. Maximal degree in co-relation 5800. Up to 1069 conditions per place. [2024-11-13 13:55:49,327 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 78 selfloop transitions, 16 changer transitions 0/105 dead transitions. [2024-11-13 13:55:49,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 105 transitions, 770 flow [2024-11-13 13:55:49,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 13:55:49,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-13 13:55:49,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 149 transitions. [2024-11-13 13:55:49,330 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5752895752895753 [2024-11-13 13:55:49,330 INFO L175 Difference]: Start difference. First operand has 55 places, 56 transitions, 313 flow. Second operand 7 states and 149 transitions. [2024-11-13 13:55:49,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 105 transitions, 770 flow [2024-11-13 13:55:49,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 105 transitions, 750 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-13 13:55:49,356 INFO L231 Difference]: Finished difference. Result has 62 places, 65 transitions, 427 flow [2024-11-13 13:55:49,356 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=427, PETRI_PLACES=62, PETRI_TRANSITIONS=65} [2024-11-13 13:55:49,357 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 22 predicate places. [2024-11-13 13:55:49,357 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 65 transitions, 427 flow [2024-11-13 13:55:49,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:55:49,357 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:55:49,358 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:55:49,389 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8098f149-911a-446a-85a3-b67e3c4ce416/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 13:55:49,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8098f149-911a-446a-85a3-b67e3c4ce416/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:55:49,565 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 13:55:49,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:55:49,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1441187460, now seen corresponding path program 3 times [2024-11-13 13:55:49,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:55:49,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212369387] [2024-11-13 13:55:49,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:55:49,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:55:49,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:55:49,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:55:49,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:55:49,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212369387] [2024-11-13 13:55:49,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212369387] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:55:49,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799979488] [2024-11-13 13:55:49,990 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 13:55:49,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:55:49,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8098f149-911a-446a-85a3-b67e3c4ce416/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:55:49,994 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8098f149-911a-446a-85a3-b67e3c4ce416/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:55:49,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8098f149-911a-446a-85a3-b67e3c4ce416/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 13:55:50,142 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-13 13:55:50,142 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:55:50,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 13:55:50,146 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:55:50,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 13:55:50,267 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:55:50,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799979488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:55:50,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 13:55:50,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-13 13:55:50,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002469418] [2024-11-13 13:55:50,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:55:50,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:55:50,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:55:50,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:55:50,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:55:50,285 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2024-11-13 13:55:50,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 65 transitions, 427 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:55:50,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:55:50,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2024-11-13 13:55:50,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:55:50,692 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([318] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_1| 0) (= |v_thread2Thread1of1ForFork1_#res.offset_1| 0) (= (mod v_thread2Thread1of1ForFork1_~cond~1_5 256) 0)) InVars {thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_5} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_1|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_5, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base][102], [Black: 61#(and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (or (and (= thread1Thread1of1ForFork0_~cond~0 1) (<= 1 (mod ~s~0 4294967296))) (and (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 63#(and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (or (and (= thread1Thread1of1ForFork0_~cond~0 1) (<= 1 (mod ~s~0 4294967296))) (and (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))) (= thread2Thread1of1ForFork1_~cond~1 0)), 24#thread3EXITtrue, 170#true, Black: 115#(and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), 16#L53true, Black: 165#(and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 (mod ~u~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)), Black: 128#(= thread2Thread1of1ForFork1_~cond~1 1), 47#true, Black: 163#(and (<= 1 (mod ~u~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)), Black: 69#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 72#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= 1 thread1Thread1of1ForFork0_~cond~0) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 70#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), 57#(or (and (= thread1Thread1of1ForFork0_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))), 38#L112-4true, Black: 80#(and (<= 1 thread2Thread1of1ForFork1_~cond~1) (<= (div thread2Thread1of1ForFork1_~cond~1 256) 0)), Black: 49#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork1_~cond~1 1)), 7#thread2EXITtrue, 82#true]) [2024-11-13 13:55:50,693 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-11-13 13:55:50,693 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-11-13 13:55:50,693 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-11-13 13:55:50,693 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-11-13 13:55:50,759 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([318] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_1| 0) (= |v_thread2Thread1of1ForFork1_#res.offset_1| 0) (= (mod v_thread2Thread1of1ForFork1_~cond~1_5 256) 0)) InVars {thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_5} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_1|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_5, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base][102], [Black: 61#(and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (or (and (= thread1Thread1of1ForFork0_~cond~0 1) (<= 1 (mod ~s~0 4294967296))) (and (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 63#(and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (or (and (= thread1Thread1of1ForFork0_~cond~0 1) (<= 1 (mod ~s~0 4294967296))) (and (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))) (= thread2Thread1of1ForFork1_~cond~1 0)), 24#thread3EXITtrue, 170#true, Black: 115#(and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), Black: 165#(and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 (mod ~u~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)), 16#L53true, Black: 128#(= thread2Thread1of1ForFork1_~cond~1 1), 47#true, Black: 69#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 163#(and (<= 1 (mod ~u~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)), Black: 72#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= 1 thread1Thread1of1ForFork0_~cond~0) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 70#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), 57#(or (and (= thread1Thread1of1ForFork0_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))), Black: 80#(and (<= 1 thread2Thread1of1ForFork1_~cond~1) (<= (div thread2Thread1of1ForFork1_~cond~1 256) 0)), Black: 49#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork1_~cond~1 1)), 7#thread2EXITtrue, 13#L113true, 82#true]) [2024-11-13 13:55:50,759 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-11-13 13:55:50,759 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-11-13 13:55:50,760 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-11-13 13:55:50,760 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-11-13 13:55:50,769 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L53-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0) (= (mod v_thread1Thread1of1ForFork0_~cond~0_5 256) 0)) InVars {thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_5} OutVars{thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset][98], [Black: 57#(or (and (= thread1Thread1of1ForFork0_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))), Black: 63#(and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (or (and (= thread1Thread1of1ForFork0_~cond~0 1) (<= 1 (mod ~s~0 4294967296))) (and (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))) (= thread2Thread1of1ForFork1_~cond~1 0)), 24#thread3EXITtrue, 170#true, Black: 115#(and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), Black: 165#(and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 (mod ~u~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)), Black: 128#(= thread2Thread1of1ForFork1_~cond~1 1), Black: 163#(and (<= 1 (mod ~u~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)), 47#true, Black: 69#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 72#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= 1 thread1Thread1of1ForFork0_~cond~0) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 70#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), 10#L72true, 38#L112-4true, Black: 80#(and (<= 1 thread2Thread1of1ForFork1_~cond~1) (<= (div thread2Thread1of1ForFork1_~cond~1 256) 0)), Black: 49#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), 61#(and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (or (and (= thread1Thread1of1ForFork0_~cond~0 1) (<= 1 (mod ~s~0 4294967296))) (and (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork1_~cond~1 1)), 11#thread1EXITtrue, 82#true]) [2024-11-13 13:55:50,769 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is not cut-off event [2024-11-13 13:55:50,770 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2024-11-13 13:55:50,770 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2024-11-13 13:55:50,770 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2024-11-13 13:55:50,812 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([318] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_1| 0) (= |v_thread2Thread1of1ForFork1_#res.offset_1| 0) (= (mod v_thread2Thread1of1ForFork1_~cond~1_5 256) 0)) InVars {thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_5} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_1|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_5, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base][102], [Black: 57#(or (and (= thread1Thread1of1ForFork0_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))), Black: 61#(and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (or (and (= thread1Thread1of1ForFork0_~cond~0 1) (<= 1 (mod ~s~0 4294967296))) (and (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 63#(and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (or (and (= thread1Thread1of1ForFork0_~cond~0 1) (<= 1 (mod ~s~0 4294967296))) (and (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))) (= thread2Thread1of1ForFork1_~cond~1 0)), 24#thread3EXITtrue, 170#true, Black: 115#(and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), Black: 165#(and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 (mod ~u~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)), Black: 128#(= thread2Thread1of1ForFork1_~cond~1 1), 47#true, Black: 69#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 163#(and (<= 1 (mod ~u~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)), Black: 72#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= 1 thread1Thread1of1ForFork0_~cond~0) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 70#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), 38#L112-4true, Black: 80#(and (<= 1 thread2Thread1of1ForFork1_~cond~1) (<= (div thread2Thread1of1ForFork1_~cond~1 256) 0)), 25#L50true, Black: 49#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork1_~cond~1 1)), 7#thread2EXITtrue, 82#true, 55#true]) [2024-11-13 13:55:50,812 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-11-13 13:55:50,813 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-13 13:55:50,813 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-13 13:55:50,813 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-13 13:55:50,813 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([319] L64-->L69: Formula: (let ((.cse0 (mod v_~t~0_76 4294967296))) (or (and (= v_~t~0_76 v_~t~0_75) (= |v_thread2Thread1of1ForFork1_#t~post3_1| |v_thread2Thread1of1ForFork1_#t~post3_2|) (<= .cse0 0) (= |v_thread2Thread1of1ForFork1_#t~post4_2| |v_thread2Thread1of1ForFork1_#t~post4_1|) (= v_~s~0_77 v_~s~0_78)) (and (= v_~s~0_77 (+ v_~s~0_78 1)) (< 0 .cse0) (= v_~t~0_76 (+ v_~t~0_75 1))))) InVars {thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_1|, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_1|, ~t~0=v_~t~0_76, ~s~0=v_~s~0_78} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_2|, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_2|, ~t~0=v_~t~0_75, ~s~0=v_~s~0_77} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~post3, ~t~0, ~s~0][49], [Black: 57#(or (and (= thread1Thread1of1ForFork0_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))), Black: 61#(and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (or (and (= thread1Thread1of1ForFork0_~cond~0 1) (<= 1 (mod ~s~0 4294967296))) (and (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), 24#thread3EXITtrue, Black: 63#(and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (or (and (= thread1Thread1of1ForFork0_~cond~0 1) (<= 1 (mod ~s~0 4294967296))) (and (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))) (= thread2Thread1of1ForFork1_~cond~1 0)), 170#true, Black: 115#(and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), Black: 165#(and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 (mod ~u~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)), Black: 128#(= thread2Thread1of1ForFork1_~cond~1 1), Black: 163#(and (<= 1 (mod ~u~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)), 47#true, Black: 69#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 72#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= 1 thread1Thread1of1ForFork0_~cond~0) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 70#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), 38#L112-4true, Black: 80#(and (<= 1 thread2Thread1of1ForFork1_~cond~1) (<= (div thread2Thread1of1ForFork1_~cond~1 256) 0)), 25#L50true, Black: 49#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork1_~cond~1 1)), 39#L69true, 82#true, 55#true]) [2024-11-13 13:55:50,813 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-11-13 13:55:50,814 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-13 13:55:50,814 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-13 13:55:50,814 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-13 13:55:50,828 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([312] L53-->thread1EXIT: Formula: (and (= |v_thread1Thread1of1ForFork0_#res.base_1| 0) (= |v_thread1Thread1of1ForFork0_#res.offset_1| 0) (= (mod v_thread1Thread1of1ForFork0_~cond~0_5 256) 0)) InVars {thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_5} OutVars{thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_1|, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_1|, thread1Thread1of1ForFork0_~cond~0=v_thread1Thread1of1ForFork0_~cond~0_5} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#res.offset][98], [Black: 57#(or (and (= thread1Thread1of1ForFork0_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))), Black: 63#(and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (or (and (= thread1Thread1of1ForFork0_~cond~0 1) (<= 1 (mod ~s~0 4294967296))) (and (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))) (= thread2Thread1of1ForFork1_~cond~1 0)), 24#thread3EXITtrue, 170#true, Black: 115#(and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), Black: 165#(and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 (mod ~u~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)), Black: 128#(= thread2Thread1of1ForFork1_~cond~1 1), Black: 163#(and (<= 1 (mod ~u~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)), 47#true, Black: 69#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 72#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= 1 thread1Thread1of1ForFork0_~cond~0) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 70#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), 10#L72true, Black: 80#(and (<= 1 thread2Thread1of1ForFork1_~cond~1) (<= (div thread2Thread1of1ForFork1_~cond~1 256) 0)), 61#(and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (or (and (= thread1Thread1of1ForFork0_~cond~0 1) (<= 1 (mod ~s~0 4294967296))) (and (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 49#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork1_~cond~1 1)), 11#thread1EXITtrue, 13#L113true, 82#true]) [2024-11-13 13:55:50,828 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is not cut-off event [2024-11-13 13:55:50,829 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-11-13 13:55:50,829 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-11-13 13:55:50,829 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-11-13 13:55:50,838 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([319] L64-->L69: Formula: (let ((.cse0 (mod v_~t~0_76 4294967296))) (or (and (= v_~t~0_76 v_~t~0_75) (= |v_thread2Thread1of1ForFork1_#t~post3_1| |v_thread2Thread1of1ForFork1_#t~post3_2|) (<= .cse0 0) (= |v_thread2Thread1of1ForFork1_#t~post4_2| |v_thread2Thread1of1ForFork1_#t~post4_1|) (= v_~s~0_77 v_~s~0_78)) (and (= v_~s~0_77 (+ v_~s~0_78 1)) (< 0 .cse0) (= v_~t~0_76 (+ v_~t~0_75 1))))) InVars {thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_1|, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_1|, ~t~0=v_~t~0_76, ~s~0=v_~s~0_78} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_2|, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_2|, ~t~0=v_~t~0_75, ~s~0=v_~s~0_77} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~post3, ~t~0, ~s~0][50], [Black: 57#(or (and (= thread1Thread1of1ForFork0_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))), Black: 61#(and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (or (and (= thread1Thread1of1ForFork0_~cond~0 1) (<= 1 (mod ~s~0 4294967296))) (and (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 63#(and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (or (and (= thread1Thread1of1ForFork0_~cond~0 1) (<= 1 (mod ~s~0 4294967296))) (and (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))) (= thread2Thread1of1ForFork1_~cond~1 0)), 24#thread3EXITtrue, 170#true, Black: 115#(and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), 16#L53true, Black: 165#(and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 (mod ~u~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)), Black: 128#(= thread2Thread1of1ForFork1_~cond~1 1), Black: 163#(and (<= 1 (mod ~u~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)), 47#true, Black: 69#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 72#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= 1 thread1Thread1of1ForFork0_~cond~0) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 70#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), 38#L112-4true, Black: 80#(and (<= 1 thread2Thread1of1ForFork1_~cond~1) (<= (div thread2Thread1of1ForFork1_~cond~1 256) 0)), Black: 49#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork1_~cond~1 1)), 39#L69true, 82#true, 55#true]) [2024-11-13 13:55:50,839 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is not cut-off event [2024-11-13 13:55:50,839 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-11-13 13:55:50,839 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-11-13 13:55:50,839 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is not cut-off event [2024-11-13 13:55:50,875 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([318] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_1| 0) (= |v_thread2Thread1of1ForFork1_#res.offset_1| 0) (= (mod v_thread2Thread1of1ForFork1_~cond~1_5 256) 0)) InVars {thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_5} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_1|, thread2Thread1of1ForFork1_~cond~1=v_thread2Thread1of1ForFork1_~cond~1_5, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base][102], [Black: 57#(or (and (= thread1Thread1of1ForFork0_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))), Black: 61#(and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (or (and (= thread1Thread1of1ForFork0_~cond~0 1) (<= 1 (mod ~s~0 4294967296))) (and (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 63#(and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (or (and (= thread1Thread1of1ForFork0_~cond~0 1) (<= 1 (mod ~s~0 4294967296))) (and (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))) (= thread2Thread1of1ForFork1_~cond~1 0)), 24#thread3EXITtrue, 170#true, Black: 115#(and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), Black: 165#(and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 (mod ~u~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)), Black: 128#(= thread2Thread1of1ForFork1_~cond~1 1), 47#true, Black: 69#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 163#(and (<= 1 (mod ~u~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)), Black: 72#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= 1 thread1Thread1of1ForFork0_~cond~0) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 70#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 80#(and (<= 1 thread2Thread1of1ForFork1_~cond~1) (<= (div thread2Thread1of1ForFork1_~cond~1 256) 0)), 25#L50true, Black: 49#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork1_~cond~1 1)), 7#thread2EXITtrue, 13#L113true, 82#true, 55#true]) [2024-11-13 13:55:50,876 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-11-13 13:55:50,876 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-13 13:55:50,876 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-13 13:55:50,876 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-13 13:55:50,877 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([319] L64-->L69: Formula: (let ((.cse0 (mod v_~t~0_76 4294967296))) (or (and (= v_~t~0_76 v_~t~0_75) (= |v_thread2Thread1of1ForFork1_#t~post3_1| |v_thread2Thread1of1ForFork1_#t~post3_2|) (<= .cse0 0) (= |v_thread2Thread1of1ForFork1_#t~post4_2| |v_thread2Thread1of1ForFork1_#t~post4_1|) (= v_~s~0_77 v_~s~0_78)) (and (= v_~s~0_77 (+ v_~s~0_78 1)) (< 0 .cse0) (= v_~t~0_76 (+ v_~t~0_75 1))))) InVars {thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_1|, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_1|, ~t~0=v_~t~0_76, ~s~0=v_~s~0_78} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_2|, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_2|, ~t~0=v_~t~0_75, ~s~0=v_~s~0_77} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~post3, ~t~0, ~s~0][49], [Black: 57#(or (and (= thread1Thread1of1ForFork0_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))), Black: 61#(and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (or (and (= thread1Thread1of1ForFork0_~cond~0 1) (<= 1 (mod ~s~0 4294967296))) (and (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), 24#thread3EXITtrue, Black: 63#(and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (or (and (= thread1Thread1of1ForFork0_~cond~0 1) (<= 1 (mod ~s~0 4294967296))) (and (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))) (= thread2Thread1of1ForFork1_~cond~1 0)), 170#true, Black: 115#(and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), Black: 165#(and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 (mod ~u~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)), Black: 128#(= thread2Thread1of1ForFork1_~cond~1 1), Black: 163#(and (<= 1 (mod ~u~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)), 47#true, Black: 69#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 72#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= 1 thread1Thread1of1ForFork0_~cond~0) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 70#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 80#(and (<= 1 thread2Thread1of1ForFork1_~cond~1) (<= (div thread2Thread1of1ForFork1_~cond~1 256) 0)), 25#L50true, Black: 49#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork1_~cond~1 1)), 39#L69true, 13#L113true, 82#true, 55#true]) [2024-11-13 13:55:50,877 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-11-13 13:55:50,877 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-13 13:55:50,877 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-13 13:55:50,877 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-13 13:55:50,889 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([319] L64-->L69: Formula: (let ((.cse0 (mod v_~t~0_76 4294967296))) (or (and (= v_~t~0_76 v_~t~0_75) (= |v_thread2Thread1of1ForFork1_#t~post3_1| |v_thread2Thread1of1ForFork1_#t~post3_2|) (<= .cse0 0) (= |v_thread2Thread1of1ForFork1_#t~post4_2| |v_thread2Thread1of1ForFork1_#t~post4_1|) (= v_~s~0_77 v_~s~0_78)) (and (= v_~s~0_77 (+ v_~s~0_78 1)) (< 0 .cse0) (= v_~t~0_76 (+ v_~t~0_75 1))))) InVars {thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_1|, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_1|, ~t~0=v_~t~0_76, ~s~0=v_~s~0_78} OutVars{thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_2|, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_2|, ~t~0=v_~t~0_75, ~s~0=v_~s~0_77} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~post3, ~t~0, ~s~0][50], [Black: 57#(or (and (= thread1Thread1of1ForFork0_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))), Black: 61#(and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (or (and (= thread1Thread1of1ForFork0_~cond~0 1) (<= 1 (mod ~s~0 4294967296))) (and (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0)))), Black: 63#(and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (or (and (= thread1Thread1of1ForFork0_~cond~0 1) (<= 1 (mod ~s~0 4294967296))) (and (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork0_~cond~0 0))) (= thread2Thread1of1ForFork1_~cond~1 0)), 24#thread3EXITtrue, 170#true, Black: 115#(and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), 16#L53true, Black: 165#(and (= thread3Thread1of1ForFork2_~cond~2 1) (<= 1 (mod ~u~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)), Black: 128#(= thread2Thread1of1ForFork1_~cond~1 1), Black: 163#(and (<= 1 (mod ~u~0 4294967296)) (= thread2Thread1of1ForFork1_~cond~1 1)), 47#true, Black: 69#(and (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 72#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= (+ ~U~0 1) (+ (mod ~U~0 4294967296) ~u~0)) (<= 1 thread1Thread1of1ForFork0_~cond~0) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 70#(and (<= (div thread1Thread1of1ForFork0_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork0_~cond~0)), Black: 80#(and (<= 1 thread2Thread1of1ForFork1_~cond~1) (<= (div thread2Thread1of1ForFork1_~cond~1 256) 0)), Black: 49#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 52#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork1_~cond~1 1)), 39#L69true, 13#L113true, 82#true, 55#true]) [2024-11-13 13:55:50,890 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is not cut-off event [2024-11-13 13:55:50,890 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2024-11-13 13:55:50,890 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2024-11-13 13:55:50,890 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is not cut-off event [2024-11-13 13:55:50,965 INFO L124 PetriNetUnfolderBase]: 1865/3048 cut-off events. [2024-11-13 13:55:50,965 INFO L125 PetriNetUnfolderBase]: For 7890/8210 co-relation queries the response was YES. [2024-11-13 13:55:50,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11557 conditions, 3048 events. 1865/3048 cut-off events. For 7890/8210 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 18129 event pairs, 129 based on Foata normal form. 231/3220 useless extension candidates. Maximal degree in co-relation 5571. Up to 1666 conditions per place. [2024-11-13 13:55:51,013 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 87 selfloop transitions, 12 changer transitions 0/121 dead transitions. [2024-11-13 13:55:51,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 121 transitions, 998 flow [2024-11-13 13:55:51,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 13:55:51,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 13:55:51,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2024-11-13 13:55:51,018 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7081081081081081 [2024-11-13 13:55:51,018 INFO L175 Difference]: Start difference. First operand has 62 places, 65 transitions, 427 flow. Second operand 5 states and 131 transitions. [2024-11-13 13:55:51,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 121 transitions, 998 flow [2024-11-13 13:55:51,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 121 transitions, 985 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-13 13:55:51,046 INFO L231 Difference]: Finished difference. Result has 68 places, 76 transitions, 565 flow [2024-11-13 13:55:51,048 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=565, PETRI_PLACES=68, PETRI_TRANSITIONS=76} [2024-11-13 13:55:51,049 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 28 predicate places. [2024-11-13 13:55:51,049 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 76 transitions, 565 flow [2024-11-13 13:55:51,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:55:51,049 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:55:51,049 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:55:51,077 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8098f149-911a-446a-85a3-b67e3c4ce416/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-13 13:55:51,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8098f149-911a-446a-85a3-b67e3c4ce416/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-13 13:55:51,251 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 13:55:51,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:55:51,251 INFO L85 PathProgramCache]: Analyzing trace with hash 292888984, now seen corresponding path program 1 times [2024-11-13 13:55:51,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:55:51,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006273962] [2024-11-13 13:55:51,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:55:51,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:55:51,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:55:55,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:55:55,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:55:55,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006273962] [2024-11-13 13:55:55,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006273962] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:55:55,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424762258] [2024-11-13 13:55:55,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:55:55,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:55:55,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8098f149-911a-446a-85a3-b67e3c4ce416/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:55:55,197 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8098f149-911a-446a-85a3-b67e3c4ce416/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:55:55,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8098f149-911a-446a-85a3-b67e3c4ce416/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 13:55:55,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:55:55,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-13 13:55:55,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:55:57,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:55:57,091 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:56:22,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:56:22,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424762258] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:56:22,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:56:22,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2024-11-13 13:56:22,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454584722] [2024-11-13 13:56:22,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:56:22,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-13 13:56:22,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:56:22,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-13 13:56:22,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=388, Unknown=6, NotChecked=0, Total=506 [2024-11-13 13:56:27,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:56:29,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.66s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:56:31,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:56:35,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:56:36,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:56:36,546 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-11-13 13:56:36,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 76 transitions, 565 flow. Second operand has 23 states, 23 states have (on average 11.956521739130435) internal successors, (275), 23 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:56:36,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:56:36,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-11-13 13:56:36,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:56:59,072 INFO L124 PetriNetUnfolderBase]: 24403/35281 cut-off events. [2024-11-13 13:56:59,072 INFO L125 PetriNetUnfolderBase]: For 119627/119627 co-relation queries the response was YES. [2024-11-13 13:56:59,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142682 conditions, 35281 events. 24403/35281 cut-off events. For 119627/119627 co-relation queries the response was YES. Maximal size of possible extension queue 1685. Compared 234164 event pairs, 690 based on Foata normal form. 16/35292 useless extension candidates. Maximal degree in co-relation 66419. Up to 8081 conditions per place. [2024-11-13 13:56:59,462 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 489 selfloop transitions, 278 changer transitions 196/968 dead transitions. [2024-11-13 13:56:59,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 968 transitions, 8612 flow [2024-11-13 13:56:59,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-11-13 13:56:59,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2024-11-13 13:56:59,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 1204 transitions. [2024-11-13 13:56:59,475 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5423423423423424 [2024-11-13 13:56:59,477 INFO L175 Difference]: Start difference. First operand has 68 places, 76 transitions, 565 flow. Second operand 60 states and 1204 transitions. [2024-11-13 13:56:59,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 968 transitions, 8612 flow [2024-11-13 13:56:59,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 968 transitions, 8567 flow, removed 7 selfloop flow, removed 1 redundant places. [2024-11-13 13:56:59,962 INFO L231 Difference]: Finished difference. Result has 153 places, 358 transitions, 4006 flow [2024-11-13 13:56:59,962 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=60, PETRI_FLOW=4006, PETRI_PLACES=153, PETRI_TRANSITIONS=358} [2024-11-13 13:56:59,963 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 113 predicate places. [2024-11-13 13:56:59,963 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 358 transitions, 4006 flow [2024-11-13 13:56:59,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 11.956521739130435) internal successors, (275), 23 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:56:59,964 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:56:59,964 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:56:59,994 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8098f149-911a-446a-85a3-b67e3c4ce416/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 13:57:00,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8098f149-911a-446a-85a3-b67e3c4ce416/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-13 13:57:00,168 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 13:57:00,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:57:00,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1878112042, now seen corresponding path program 2 times [2024-11-13 13:57:00,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:57:00,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807911561] [2024-11-13 13:57:00,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:57:00,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:57:00,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:57:02,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:57:02,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:57:02,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807911561] [2024-11-13 13:57:02,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807911561] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:57:02,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324404876] [2024-11-13 13:57:02,593 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 13:57:02,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:57:02,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8098f149-911a-446a-85a3-b67e3c4ce416/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:57:02,596 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8098f149-911a-446a-85a3-b67e3c4ce416/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:57:02,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8098f149-911a-446a-85a3-b67e3c4ce416/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 13:57:02,722 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 13:57:02,722 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:57:02,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-13 13:57:02,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:57:03,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:57:03,891 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:57:18,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:57:18,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324404876] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:57:18,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:57:18,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2024-11-13 13:57:18,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844777113] [2024-11-13 13:57:18,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:57:18,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-13 13:57:18,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:57:18,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-13 13:57:18,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=396, Unknown=2, NotChecked=0, Total=506 [2024-11-13 13:57:22,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:57:26,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:57:30,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.31s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:57:34,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:57:38,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:57:38,503 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-11-13 13:57:38,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 358 transitions, 4006 flow. Second operand has 23 states, 23 states have (on average 12.130434782608695) internal successors, (279), 23 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:57:38,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:57:38,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-11-13 13:57:38,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:58:12,400 INFO L124 PetriNetUnfolderBase]: 41601/60483 cut-off events. [2024-11-13 13:58:12,400 INFO L125 PetriNetUnfolderBase]: For 371109/371109 co-relation queries the response was YES. [2024-11-13 13:58:12,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294677 conditions, 60483 events. 41601/60483 cut-off events. For 371109/371109 co-relation queries the response was YES. Maximal size of possible extension queue 2644. Compared 428470 event pairs, 1830 based on Foata normal form. 38/60516 useless extension candidates. Maximal degree in co-relation 294435. Up to 12962 conditions per place. [2024-11-13 13:58:13,071 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 664 selfloop transitions, 623 changer transitions 390/1682 dead transitions. [2024-11-13 13:58:13,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 1682 transitions, 19109 flow [2024-11-13 13:58:13,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-11-13 13:58:13,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2024-11-13 13:58:13,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 1478 transitions. [2024-11-13 13:58:13,078 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5326126126126126 [2024-11-13 13:58:13,079 INFO L175 Difference]: Start difference. First operand has 153 places, 358 transitions, 4006 flow. Second operand 75 states and 1478 transitions. [2024-11-13 13:58:13,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 1682 transitions, 19109 flow [2024-11-13 13:58:18,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 1682 transitions, 17579 flow, removed 765 selfloop flow, removed 10 redundant places. [2024-11-13 13:58:18,535 INFO L231 Difference]: Finished difference. Result has 265 places, 789 transitions, 10628 flow [2024-11-13 13:58:18,535 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3516, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=226, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=75, PETRI_FLOW=10628, PETRI_PLACES=265, PETRI_TRANSITIONS=789} [2024-11-13 13:58:18,536 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 225 predicate places. [2024-11-13 13:58:18,536 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 789 transitions, 10628 flow [2024-11-13 13:58:18,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 12.130434782608695) internal successors, (279), 23 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:58:18,537 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:58:18,537 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:58:18,554 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8098f149-911a-446a-85a3-b67e3c4ce416/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 13:58:18,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8098f149-911a-446a-85a3-b67e3c4ce416/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:58:18,741 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 13:58:18,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:58:18,742 INFO L85 PathProgramCache]: Analyzing trace with hash 2037039294, now seen corresponding path program 1 times [2024-11-13 13:58:18,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:58:18,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836327360] [2024-11-13 13:58:18,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:58:18,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:58:18,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:58:22,115 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:58:22,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:58:22,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836327360] [2024-11-13 13:58:22,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836327360] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:58:22,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388678729] [2024-11-13 13:58:22,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:58:22,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:58:22,116 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8098f149-911a-446a-85a3-b67e3c4ce416/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:58:22,118 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8098f149-911a-446a-85a3-b67e3c4ce416/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:58:22,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8098f149-911a-446a-85a3-b67e3c4ce416/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 13:58:22,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:58:22,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-13 13:58:22,248 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:58:23,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:58:23,827 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:58:32,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:58:32,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388678729] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:58:32,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:58:32,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2024-11-13 13:58:32,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429526559] [2024-11-13 13:58:32,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:58:32,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-13 13:58:32,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:58:32,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-13 13:58:32,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=476, Unknown=1, NotChecked=0, Total=600 [2024-11-13 13:58:36,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:58:41,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:58:45,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:58:49,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:58:53,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 13:58:53,048 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-11-13 13:58:53,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 789 transitions, 10628 flow. Second operand has 25 states, 25 states have (on average 11.96) internal successors, (299), 25 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:58:53,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:58:53,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-11-13 13:58:53,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand