./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/weaver/parallel-misc-4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4fc147d-e4bd-4c32-b9b0-5f02eca7a27d/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4fc147d-e4bd-4c32-b9b0-5f02eca7a27d/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4fc147d-e4bd-4c32-b9b0-5f02eca7a27d/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4fc147d-e4bd-4c32-b9b0-5f02eca7a27d/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/weaver/parallel-misc-4.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4fc147d-e4bd-4c32-b9b0-5f02eca7a27d/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4fc147d-e4bd-4c32-b9b0-5f02eca7a27d/bin/uautomizer-verify-aQ6SnzHsRB --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 287b872f435ea31dbbf77f267944e24b96122b5f745db0674c91555289f3b84c --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 04:02:52,567 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 04:02:52,693 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4fc147d-e4bd-4c32-b9b0-5f02eca7a27d/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-28 04:02:52,699 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 04:02:52,700 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 04:02:52,728 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 04:02:52,729 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 04:02:52,729 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 04:02:52,729 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 04:02:52,729 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 04:02:52,730 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 04:02:52,730 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 04:02:52,730 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 04:02:52,730 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 04:02:52,730 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 04:02:52,730 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 04:02:52,731 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 04:02:52,731 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 04:02:52,731 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 04:02:52,731 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 04:02:52,731 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 04:02:52,731 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 04:02:52,731 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 04:02:52,732 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 04:02:52,732 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 04:02:52,732 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 04:02:52,732 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 04:02:52,732 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 04:02:52,732 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 04:02:52,733 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 04:02:52,733 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:02:52,733 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:02:52,733 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:02:52,733 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:02:52,733 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 04:02:52,733 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:02:52,733 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:02:52,734 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:02:52,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:02:52,734 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 04:02:52,734 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 04:02:52,734 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 04:02:52,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 04:02:52,734 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 04:02:52,735 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 04:02:52,735 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 04:02:52,735 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 04:02:52,735 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_a4fc147d-e4bd-4c32-b9b0-5f02eca7a27d/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 287b872f435ea31dbbf77f267944e24b96122b5f745db0674c91555289f3b84c [2024-11-28 04:02:53,146 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 04:02:53,157 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 04:02:53,160 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 04:02:53,162 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 04:02:53,163 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 04:02:53,164 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4fc147d-e4bd-4c32-b9b0-5f02eca7a27d/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/weaver/parallel-misc-4.wvr.c [2024-11-28 04:02:57,034 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4fc147d-e4bd-4c32-b9b0-5f02eca7a27d/bin/uautomizer-verify-aQ6SnzHsRB/data/8e243f7ec/9bfd40c10a7a4171aa91a9752bbb01e5/FLAG0c30726e8 [2024-11-28 04:02:57,376 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 04:02:57,377 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4fc147d-e4bd-4c32-b9b0-5f02eca7a27d/sv-benchmarks/c/weaver/parallel-misc-4.wvr.c [2024-11-28 04:02:57,386 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4fc147d-e4bd-4c32-b9b0-5f02eca7a27d/bin/uautomizer-verify-aQ6SnzHsRB/data/8e243f7ec/9bfd40c10a7a4171aa91a9752bbb01e5/FLAG0c30726e8 [2024-11-28 04:02:57,631 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4fc147d-e4bd-4c32-b9b0-5f02eca7a27d/bin/uautomizer-verify-aQ6SnzHsRB/data/8e243f7ec/9bfd40c10a7a4171aa91a9752bbb01e5 [2024-11-28 04:02:57,634 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 04:02:57,636 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 04:02:57,638 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 04:02:57,638 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 04:02:57,644 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 04:02:57,647 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:02:57" (1/1) ... [2024-11-28 04:02:57,652 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4730e2b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:02:57, skipping insertion in model container [2024-11-28 04:02:57,652 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:02:57" (1/1) ... [2024-11-28 04:02:57,678 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 04:02:57,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:02:57,948 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 04:02:57,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:02:57,996 INFO L204 MainTranslator]: Completed translation [2024-11-28 04:02:57,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:02:57 WrapperNode [2024-11-28 04:02:57,997 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 04:02:57,998 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 04:02:57,999 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 04:02:57,999 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 04:02:58,008 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:02:57" (1/1) ... [2024-11-28 04:02:58,019 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:02:57" (1/1) ... [2024-11-28 04:02:58,043 INFO L138 Inliner]: procedures = 19, calls = 11, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2024-11-28 04:02:58,043 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 04:02:58,044 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 04:02:58,044 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 04:02:58,044 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 04:02:58,056 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:02:57" (1/1) ... [2024-11-28 04:02:58,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:02:57" (1/1) ... [2024-11-28 04:02:58,059 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:02:57" (1/1) ... [2024-11-28 04:02:58,076 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-28 04:02:58,076 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:02:57" (1/1) ... [2024-11-28 04:02:58,076 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:02:57" (1/1) ... [2024-11-28 04:02:58,082 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:02:57" (1/1) ... [2024-11-28 04:02:58,083 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:02:57" (1/1) ... [2024-11-28 04:02:58,091 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:02:57" (1/1) ... [2024-11-28 04:02:58,093 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:02:57" (1/1) ... [2024-11-28 04:02:58,094 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:02:57" (1/1) ... [2024-11-28 04:02:58,099 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 04:02:58,100 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 04:02:58,100 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 04:02:58,100 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 04:02:58,101 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:02:57" (1/1) ... [2024-11-28 04:02:58,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:02:58,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4fc147d-e4bd-4c32-b9b0-5f02eca7a27d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:02:58,161 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4fc147d-e4bd-4c32-b9b0-5f02eca7a27d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 04:02:58,165 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4fc147d-e4bd-4c32-b9b0-5f02eca7a27d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 04:02:58,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 04:02:58,204 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-28 04:02:58,204 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-28 04:02:58,204 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-28 04:02:58,204 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-28 04:02:58,204 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-28 04:02:58,205 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-28 04:02:58,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 04:02:58,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 04:02:58,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 04:02:58,208 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-28 04:02:58,369 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 04:02:58,372 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 04:02:58,758 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-28 04:02:58,758 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 04:02:58,967 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 04:02:58,967 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-28 04:02:58,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:02:58 BoogieIcfgContainer [2024-11-28 04:02:58,968 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 04:02:58,971 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 04:02:58,972 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 04:02:58,979 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 04:02:58,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:02:57" (1/3) ... [2024-11-28 04:02:58,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c96afd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:02:58, skipping insertion in model container [2024-11-28 04:02:58,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:02:57" (2/3) ... [2024-11-28 04:02:58,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c96afd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:02:58, skipping insertion in model container [2024-11-28 04:02:58,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:02:58" (3/3) ... [2024-11-28 04:02:58,983 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-4.wvr.c [2024-11-28 04:02:59,006 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 04:02:59,008 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-4.wvr.c that has 4 procedures, 40 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2024-11-28 04:02:59,008 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-28 04:02:59,104 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-28 04:02:59,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 43 transitions, 107 flow [2024-11-28 04:02:59,222 INFO L124 PetriNetUnfolderBase]: 4/40 cut-off events. [2024-11-28 04:02:59,228 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-28 04:02:59,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 40 events. 4/40 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 77 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2024-11-28 04:02:59,236 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 43 transitions, 107 flow [2024-11-28 04:02:59,245 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 39 transitions, 96 flow [2024-11-28 04:02:59,260 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 04:02:59,284 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;@174e4544, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 04:02:59,284 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-28 04:02:59,330 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-28 04:02:59,331 INFO L124 PetriNetUnfolderBase]: 4/36 cut-off events. [2024-11-28 04:02:59,331 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-28 04:02:59,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:02:59,332 INFO L206 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] [2024-11-28 04:02:59,332 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-28 04:02:59,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:02:59,343 INFO L85 PathProgramCache]: Analyzing trace with hash -870383612, now seen corresponding path program 1 times [2024-11-28 04:02:59,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:02:59,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426775155] [2024-11-28 04:02:59,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:02:59,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:02:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:03:00,172 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-28 04:03:00,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:03:00,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426775155] [2024-11-28 04:03:00,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426775155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:03:00,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:03:00,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:03:00,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233661551] [2024-11-28 04:03:00,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:03:00,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:03:00,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:03:00,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:03:00,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:03:00,287 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 43 [2024-11-28 04:03:00,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 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-28 04:03:00,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:03:00,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 43 [2024-11-28 04:03:00,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:03:00,789 INFO L124 PetriNetUnfolderBase]: 476/950 cut-off events. [2024-11-28 04:03:00,789 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2024-11-28 04:03:00,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1665 conditions, 950 events. 476/950 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 5558 event pairs, 58 based on Foata normal form. 66/905 useless extension candidates. Maximal degree in co-relation 1486. Up to 403 conditions per place. [2024-11-28 04:03:00,806 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 39 selfloop transitions, 8 changer transitions 1/64 dead transitions. [2024-11-28 04:03:00,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 64 transitions, 266 flow [2024-11-28 04:03:00,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 04:03:00,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-28 04:03:00,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 154 transitions. [2024-11-28 04:03:00,828 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7162790697674418 [2024-11-28 04:03:00,831 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 96 flow. Second operand 5 states and 154 transitions. [2024-11-28 04:03:00,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 64 transitions, 266 flow [2024-11-28 04:03:00,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 64 transitions, 238 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-28 04:03:00,853 INFO L231 Difference]: Finished difference. Result has 44 places, 42 transitions, 135 flow [2024-11-28 04:03:00,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=135, PETRI_PLACES=44, PETRI_TRANSITIONS=42} [2024-11-28 04:03:00,868 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -1 predicate places. [2024-11-28 04:03:00,869 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 42 transitions, 135 flow [2024-11-28 04:03:00,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 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-28 04:03:00,870 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:03:00,870 INFO L206 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] [2024-11-28 04:03:00,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 04:03:00,871 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-28 04:03:00,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:03:00,873 INFO L85 PathProgramCache]: Analyzing trace with hash -695647144, now seen corresponding path program 2 times [2024-11-28 04:03:00,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:03:00,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463774062] [2024-11-28 04:03:00,874 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:03:00,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:03:00,901 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 04:03:00,902 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:03:00,984 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-28 04:03:00,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:03:00,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463774062] [2024-11-28 04:03:00,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463774062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:03:00,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:03:00,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:03:00,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603741586] [2024-11-28 04:03:00,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:03:00,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:03:00,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:03:00,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:03:00,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:03:01,000 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 43 [2024-11-28 04:03:01,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 42 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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-28 04:03:01,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:03:01,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 43 [2024-11-28 04:03:01,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:03:01,353 INFO L124 PetriNetUnfolderBase]: 632/1187 cut-off events. [2024-11-28 04:03:01,353 INFO L125 PetriNetUnfolderBase]: For 844/844 co-relation queries the response was YES. [2024-11-28 04:03:01,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2566 conditions, 1187 events. 632/1187 cut-off events. For 844/844 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 7035 event pairs, 189 based on Foata normal form. 92/1142 useless extension candidates. Maximal degree in co-relation 1474. Up to 594 conditions per place. [2024-11-28 04:03:01,383 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 26 selfloop transitions, 5 changer transitions 1/50 dead transitions. [2024-11-28 04:03:01,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 50 transitions, 224 flow [2024-11-28 04:03:01,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:03:01,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:03:01,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2024-11-28 04:03:01,387 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6976744186046512 [2024-11-28 04:03:01,388 INFO L175 Difference]: Start difference. First operand has 44 places, 42 transitions, 135 flow. Second operand 3 states and 90 transitions. [2024-11-28 04:03:01,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 50 transitions, 224 flow [2024-11-28 04:03:01,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 50 transitions, 219 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 04:03:01,397 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 162 flow [2024-11-28 04:03:01,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=162, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2024-11-28 04:03:01,399 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2024-11-28 04:03:01,399 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 162 flow [2024-11-28 04:03:01,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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-28 04:03:01,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:03:01,400 INFO L206 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] [2024-11-28 04:03:01,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 04:03:01,401 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-28 04:03:01,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:03:01,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1901893286, now seen corresponding path program 1 times [2024-11-28 04:03:01,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:03:01,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076872334] [2024-11-28 04:03:01,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:03:01,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:03:01,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:03:01,603 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-28 04:03:01,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:03:01,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076872334] [2024-11-28 04:03:01,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076872334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:03:01,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:03:01,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:03:01,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767331453] [2024-11-28 04:03:01,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:03:01,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:03:01,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:03:01,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:03:01,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:03:01,620 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 43 [2024-11-28 04:03:01,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 162 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:03:01,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:03:01,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 43 [2024-11-28 04:03:01,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:03:02,066 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([245] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][46], [Black: 61#true, 42#L88-4true, 26#L46-2true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, 11#L69-1true, 36#L55-3true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-28 04:03:02,070 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-28 04:03:02,070 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 04:03:02,070 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 04:03:02,071 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-28 04:03:02,071 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([244] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [Black: 61#true, 42#L88-4true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 11#L69-1true, 13#L43-2true, 66#true, 36#L55-3true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-28 04:03:02,071 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-28 04:03:02,071 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 04:03:02,071 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 04:03:02,072 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-28 04:03:02,072 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([250] L55-3-->L55-1: Formula: (not (= (mod v_~v_assert~0_3 256) 0)) InVars {~v_assert~0=v_~v_assert~0_3} OutVars{~v_assert~0=v_~v_assert~0_3} AuxVars[] AssignedVars[][15], [Black: 61#true, 42#L88-4true, 16#L55-1true, 28#L41-1true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, 11#L69-1true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-28 04:03:02,072 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-11-28 04:03:02,072 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-28 04:03:02,072 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-28 04:03:02,072 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-28 04:03:02,136 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([245] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][46], [Black: 61#true, 5#L89true, 26#L46-2true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, 11#L69-1true, Black: 54#(<= 0 ~pos~0), 36#L55-3true, Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-28 04:03:02,136 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-28 04:03:02,136 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 04:03:02,136 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 04:03:02,137 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 04:03:02,140 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([244] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [Black: 61#true, 5#L89true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 13#L43-2true, 66#true, 11#L69-1true, 36#L55-3true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-28 04:03:02,140 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-28 04:03:02,140 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 04:03:02,140 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 04:03:02,141 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 04:03:02,141 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([250] L55-3-->L55-1: Formula: (not (= (mod v_~v_assert~0_3 256) 0)) InVars {~v_assert~0=v_~v_assert~0_3} OutVars{~v_assert~0=v_~v_assert~0_3} AuxVars[] AssignedVars[][15], [Black: 61#true, 5#L89true, 16#L55-1true, 28#L41-1true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, 11#L69-1true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-28 04:03:02,141 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-28 04:03:02,142 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 04:03:02,142 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-28 04:03:02,142 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 04:03:02,143 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([245] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][46], [Black: 61#true, 42#L88-4true, 26#L46-2true, 12#thread3EXITtrue, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, 36#L55-3true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-28 04:03:02,143 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-28 04:03:02,144 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 04:03:02,144 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 04:03:02,144 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 04:03:02,144 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([244] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [Black: 61#true, 42#L88-4true, 12#thread3EXITtrue, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 13#L43-2true, 66#true, 36#L55-3true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-28 04:03:02,144 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-28 04:03:02,144 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 04:03:02,144 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 04:03:02,145 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 04:03:02,145 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([250] L55-3-->L55-1: Formula: (not (= (mod v_~v_assert~0_3 256) 0)) InVars {~v_assert~0=v_~v_assert~0_3} OutVars{~v_assert~0=v_~v_assert~0_3} AuxVars[] AssignedVars[][15], [Black: 61#true, 42#L88-4true, 16#L55-1true, 28#L41-1true, 12#thread3EXITtrue, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-28 04:03:02,145 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-28 04:03:02,145 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 04:03:02,145 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 04:03:02,145 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-28 04:03:02,160 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([245] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][46], [Black: 61#true, 42#L88-4true, 26#L46-2true, 63#(<= 1 (mod ~v_assert~0 256)), 66#true, 11#L69-1true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), 36#L55-3true, 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-28 04:03:02,161 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-28 04:03:02,161 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 04:03:02,161 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-28 04:03:02,161 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 04:03:02,162 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([244] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [Black: 61#true, 42#L88-4true, 63#(<= 1 (mod ~v_assert~0 256)), 13#L43-2true, 66#true, 11#L69-1true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 36#L55-3true, Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-28 04:03:02,162 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-28 04:03:02,163 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 04:03:02,163 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-28 04:03:02,163 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 04:03:02,164 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([250] L55-3-->L55-1: Formula: (not (= (mod v_~v_assert~0_3 256) 0)) InVars {~v_assert~0=v_~v_assert~0_3} OutVars{~v_assert~0=v_~v_assert~0_3} AuxVars[] AssignedVars[][15], [Black: 61#true, 42#L88-4true, 16#L55-1true, 63#(<= 1 (mod ~v_assert~0 256)), 28#L41-1true, 11#L69-1true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-28 04:03:02,164 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-11-28 04:03:02,164 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-28 04:03:02,165 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-28 04:03:02,165 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-28 04:03:02,172 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([245] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][46], [Black: 61#true, 5#L89true, 26#L46-2true, 12#thread3EXITtrue, 63#(<= 1 (mod ~v_assert~0 256)), 66#true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 36#L55-3true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-28 04:03:02,172 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-28 04:03:02,172 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 04:03:02,173 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 04:03:02,173 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 04:03:02,173 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([244] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [Black: 61#true, 5#L89true, 12#thread3EXITtrue, 63#(<= 1 (mod ~v_assert~0 256)), 13#L43-2true, 66#true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 36#L55-3true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-28 04:03:02,174 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-28 04:03:02,174 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 04:03:02,174 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 04:03:02,174 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 04:03:02,174 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([250] L55-3-->L55-1: Formula: (not (= (mod v_~v_assert~0_3 256) 0)) InVars {~v_assert~0=v_~v_assert~0_3} OutVars{~v_assert~0=v_~v_assert~0_3} AuxVars[] AssignedVars[][15], [Black: 61#true, 5#L89true, 16#L55-1true, 12#thread3EXITtrue, 28#L41-1true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-28 04:03:02,174 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-28 04:03:02,175 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 04:03:02,175 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 04:03:02,175 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 04:03:02,181 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([250] L55-3-->L55-1: Formula: (not (= (mod v_~v_assert~0_3 256) 0)) InVars {~v_assert~0=v_~v_assert~0_3} OutVars{~v_assert~0=v_~v_assert~0_3} AuxVars[] AssignedVars[][15], [Black: 61#true, 42#L88-4true, 16#L55-1true, 63#(<= 1 (mod ~v_assert~0 256)), 28#L41-1true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, 11#L69-1true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-28 04:03:02,181 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-28 04:03:02,181 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-28 04:03:02,181 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-28 04:03:02,182 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 04:03:02,182 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-28 04:03:02,189 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([245] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][46], [Black: 61#true, 5#L89true, 26#L46-2true, 63#(<= 1 (mod ~v_assert~0 256)), 11#L69-1true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, 36#L55-3true, Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-28 04:03:02,189 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-28 04:03:02,189 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 04:03:02,189 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 04:03:02,189 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 04:03:02,192 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([244] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [Black: 61#true, 5#L89true, 63#(<= 1 (mod ~v_assert~0 256)), 11#L69-1true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 13#L43-2true, 66#true, Black: 54#(<= 0 ~pos~0), 36#L55-3true, 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-28 04:03:02,193 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-28 04:03:02,193 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 04:03:02,193 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 04:03:02,193 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 04:03:02,194 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([250] L55-3-->L55-1: Formula: (not (= (mod v_~v_assert~0_3 256) 0)) InVars {~v_assert~0=v_~v_assert~0_3} OutVars{~v_assert~0=v_~v_assert~0_3} AuxVars[] AssignedVars[][15], [5#L89true, Black: 61#true, 16#L55-1true, 63#(<= 1 (mod ~v_assert~0 256)), 28#L41-1true, 11#L69-1true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-28 04:03:02,194 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2024-11-28 04:03:02,194 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 04:03:02,194 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-28 04:03:02,194 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 04:03:02,195 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([245] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][46], [Black: 61#true, 42#L88-4true, 26#L46-2true, 12#thread3EXITtrue, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), 36#L55-3true, 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-28 04:03:02,195 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-28 04:03:02,195 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 04:03:02,195 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 04:03:02,196 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 04:03:02,196 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([244] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [Black: 61#true, 42#L88-4true, 12#thread3EXITtrue, 63#(<= 1 (mod ~v_assert~0 256)), 13#L43-2true, 66#true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 36#L55-3true, Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-28 04:03:02,196 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-28 04:03:02,196 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 04:03:02,196 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 04:03:02,196 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 04:03:02,201 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([244] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][16], [5#L89true, Black: 61#true, 8#L57true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 13#L43-2true, 11#L69-1true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 68#(<= 1 (mod ~d2~0 256))]) [2024-11-28 04:03:02,201 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-28 04:03:02,202 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 04:03:02,202 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-28 04:03:02,202 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-28 04:03:02,202 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([245] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][37], [5#L89true, Black: 61#true, 8#L57true, 26#L46-2true, 63#(<= 1 (mod ~v_assert~0 256)), 11#L69-1true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 68#(<= 1 (mod ~d2~0 256))]) [2024-11-28 04:03:02,202 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-28 04:03:02,202 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 04:03:02,202 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-28 04:03:02,202 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-28 04:03:02,203 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([244] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [Black: 61#true, 42#L88-4true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 11#L69-1true, 13#L43-2true, 66#true, Black: 54#(<= 0 ~pos~0), 36#L55-3true, Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-28 04:03:02,203 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-28 04:03:02,203 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 04:03:02,203 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 04:03:02,203 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-28 04:03:02,203 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-28 04:03:02,208 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([245] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][46], [Black: 61#true, 42#L88-4true, 26#L46-2true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, 11#L69-1true, Black: 54#(<= 0 ~pos~0), 36#L55-3true, Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-28 04:03:02,209 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-28 04:03:02,209 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-28 04:03:02,209 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 04:03:02,209 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 04:03:02,209 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-28 04:03:02,210 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([250] L55-3-->L55-1: Formula: (not (= (mod v_~v_assert~0_3 256) 0)) InVars {~v_assert~0=v_~v_assert~0_3} OutVars{~v_assert~0=v_~v_assert~0_3} AuxVars[] AssignedVars[][15], [Black: 61#true, 5#L89true, 16#L55-1true, 63#(<= 1 (mod ~v_assert~0 256)), 28#L41-1true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, 11#L69-1true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-28 04:03:02,210 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-28 04:03:02,210 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 04:03:02,210 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-28 04:03:02,210 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-11-28 04:03:02,211 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 04:03:02,214 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([245] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][46], [Black: 61#true, 5#L89true, 26#L46-2true, 63#(<= 1 (mod ~v_assert~0 256)), 12#thread3EXITtrue, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, 36#L55-3true, Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-28 04:03:02,214 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-28 04:03:02,214 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 04:03:02,214 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 04:03:02,214 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 04:03:02,215 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([244] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [Black: 61#true, 5#L89true, 63#(<= 1 (mod ~v_assert~0 256)), 12#thread3EXITtrue, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 13#L43-2true, 66#true, Black: 54#(<= 0 ~pos~0), 36#L55-3true, 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-28 04:03:02,215 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-28 04:03:02,215 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 04:03:02,215 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 04:03:02,215 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 04:03:02,217 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([244] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][32], [Black: 61#true, 5#L89true, 63#(<= 1 (mod ~v_assert~0 256)), 13#L43-2true, 66#true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 11#L69-1true, 36#L55-3true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-28 04:03:02,217 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-28 04:03:02,217 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 04:03:02,220 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-28 04:03:02,220 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 04:03:02,220 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 04:03:02,221 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([245] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][46], [Black: 61#true, 5#L89true, 26#L46-2true, 63#(<= 1 (mod ~v_assert~0 256)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, 11#L69-1true, 36#L55-3true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-28 04:03:02,221 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-28 04:03:02,222 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-28 04:03:02,222 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 04:03:02,222 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 04:03:02,222 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 04:03:02,225 INFO L124 PetriNetUnfolderBase]: 1341/2307 cut-off events. [2024-11-28 04:03:02,225 INFO L125 PetriNetUnfolderBase]: For 1739/1795 co-relation queries the response was YES. [2024-11-28 04:03:02,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5604 conditions, 2307 events. 1341/2307 cut-off events. For 1739/1795 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 14173 event pairs, 439 based on Foata normal form. 11/1836 useless extension candidates. Maximal degree in co-relation 3065. Up to 897 conditions per place. [2024-11-28 04:03:02,267 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 34 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2024-11-28 04:03:02,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 59 transitions, 292 flow [2024-11-28 04:03:02,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:03:02,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:03:02,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2024-11-28 04:03:02,271 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.751937984496124 [2024-11-28 04:03:02,273 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 162 flow. Second operand 3 states and 97 transitions. [2024-11-28 04:03:02,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 59 transitions, 292 flow [2024-11-28 04:03:02,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 59 transitions, 282 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 04:03:02,290 INFO L231 Difference]: Finished difference. Result has 49 places, 46 transitions, 174 flow [2024-11-28 04:03:02,290 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=49, PETRI_TRANSITIONS=46} [2024-11-28 04:03:02,293 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 4 predicate places. [2024-11-28 04:03:02,294 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 46 transitions, 174 flow [2024-11-28 04:03:02,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:03:02,294 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:03:02,294 INFO L206 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-28 04:03:02,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 04:03:02,296 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-28 04:03:02,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:03:02,297 INFO L85 PathProgramCache]: Analyzing trace with hash -414979549, now seen corresponding path program 1 times [2024-11-28 04:03:02,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:03:02,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741724410] [2024-11-28 04:03:02,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:03:02,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:03:02,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:03:02,421 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-28 04:03:02,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:03:02,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741724410] [2024-11-28 04:03:02,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741724410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:03:02,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:03:02,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:03:02,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055193706] [2024-11-28 04:03:02,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:03:02,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:03:02,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:03:02,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:03:02,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:03:02,438 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 43 [2024-11-28 04:03:02,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 46 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:03:02,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:03:02,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 43 [2024-11-28 04:03:02,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:03:02,782 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([240] L41-3-->L41-1: Formula: (not (= (mod v_~v_assert~0_1 256) 0)) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1} AuxVars[] AssignedVars[][9], [Black: 61#true, Black: 68#(<= 1 (mod ~d2~0 256)), 16#L55-1true, 3#L88-3true, 28#L41-1true, 66#true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 71#true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-28 04:03:02,782 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-28 04:03:02,782 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 04:03:02,782 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 04:03:02,782 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 04:03:02,804 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([240] L41-3-->L41-1: Formula: (not (= (mod v_~v_assert~0_1 256) 0)) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1} AuxVars[] AssignedVars[][9], [Black: 61#true, 42#L88-4true, 20#$Ultimate##0true, Black: 68#(<= 1 (mod ~d2~0 256)), 16#L55-1true, 28#L41-1true, 66#true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), 71#true, Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-28 04:03:02,804 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-28 04:03:02,804 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 04:03:02,804 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 04:03:02,805 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 04:03:02,822 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([240] L41-3-->L41-1: Formula: (not (= (mod v_~v_assert~0_1 256) 0)) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1} AuxVars[] AssignedVars[][9], [Black: 61#true, 42#L88-4true, Black: 68#(<= 1 (mod ~d2~0 256)), 16#L55-1true, 12#thread3EXITtrue, 28#L41-1true, 66#true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), 71#true, 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-28 04:03:02,823 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2024-11-28 04:03:02,823 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-28 04:03:02,823 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-28 04:03:02,823 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-28 04:03:02,831 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([240] L41-3-->L41-1: Formula: (not (= (mod v_~v_assert~0_1 256) 0)) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1} AuxVars[] AssignedVars[][9], [Black: 61#true, 5#L89true, 20#$Ultimate##0true, Black: 68#(<= 1 (mod ~d2~0 256)), 16#L55-1true, 28#L41-1true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), 71#true, Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-28 04:03:02,831 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-28 04:03:02,832 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 04:03:02,832 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 04:03:02,832 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-28 04:03:02,848 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([240] L41-3-->L41-1: Formula: (not (= (mod v_~v_assert~0_1 256) 0)) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1} AuxVars[] AssignedVars[][9], [Black: 61#true, 5#L89true, Black: 68#(<= 1 (mod ~d2~0 256)), 16#L55-1true, 12#thread3EXITtrue, 28#L41-1true, 66#true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), 71#true, 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-28 04:03:02,848 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-11-28 04:03:02,848 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-28 04:03:02,848 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-28 04:03:02,848 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-28 04:03:02,858 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([255] L60-->L60-1: Formula: (= (+ v_~pos~0_7 2) v_~pos~0_8) InVars {~pos~0=v_~pos~0_8} OutVars{~pos~0=v_~pos~0_7} AuxVars[] AssignedVars[~pos~0][45], [Black: 61#true, 42#L88-4true, 26#L46-2true, Black: 68#(<= 1 (mod ~d2~0 256)), 12#thread3EXITtrue, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, 71#true, Black: 54#(<= 0 ~pos~0), 23#L60-1true, 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-28 04:03:02,859 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-28 04:03:02,859 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-28 04:03:02,859 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-28 04:03:02,859 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-28 04:03:02,877 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([255] L60-->L60-1: Formula: (= (+ v_~pos~0_7 2) v_~pos~0_8) InVars {~pos~0=v_~pos~0_8} OutVars{~pos~0=v_~pos~0_7} AuxVars[] AssignedVars[~pos~0][45], [Black: 61#true, 5#L89true, 26#L46-2true, Black: 68#(<= 1 (mod ~d2~0 256)), 12#thread3EXITtrue, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, 71#true, Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 23#L60-1true]) [2024-11-28 04:03:02,877 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-11-28 04:03:02,877 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-28 04:03:02,878 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-28 04:03:02,878 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-28 04:03:02,879 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([240] L41-3-->L41-1: Formula: (not (= (mod v_~v_assert~0_1 256) 0)) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1} AuxVars[] AssignedVars[][9], [5#L89true, Black: 61#true, Black: 68#(<= 1 (mod ~d2~0 256)), 16#L55-1true, 28#L41-1true, 11#L69-1true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, 71#true, Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-28 04:03:02,879 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-11-28 04:03:02,882 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-28 04:03:02,882 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-28 04:03:02,884 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-28 04:03:02,886 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([240] L41-3-->L41-1: Formula: (not (= (mod v_~v_assert~0_1 256) 0)) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1} AuxVars[] AssignedVars[][9], [Black: 61#true, 42#L88-4true, Black: 68#(<= 1 (mod ~d2~0 256)), 16#L55-1true, 28#L41-1true, 12#thread3EXITtrue, 66#true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), 71#true, 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-28 04:03:02,886 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-11-28 04:03:02,886 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-28 04:03:02,886 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-28 04:03:02,886 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-28 04:03:02,886 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-28 04:03:02,893 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([240] L41-3-->L41-1: Formula: (not (= (mod v_~v_assert~0_1 256) 0)) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1} AuxVars[] AssignedVars[][9], [Black: 61#true, 42#L88-4true, Black: 68#(<= 1 (mod ~d2~0 256)), 16#L55-1true, 12#thread3EXITtrue, 28#L41-1true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, 71#true, Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-28 04:03:02,893 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-11-28 04:03:02,893 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-28 04:03:02,893 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-28 04:03:02,893 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-28 04:03:02,893 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-28 04:03:02,893 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-28 04:03:02,897 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([240] L41-3-->L41-1: Formula: (not (= (mod v_~v_assert~0_1 256) 0)) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1} AuxVars[] AssignedVars[][9], [5#L89true, Black: 61#true, Black: 68#(<= 1 (mod ~d2~0 256)), 16#L55-1true, 12#thread3EXITtrue, 28#L41-1true, 66#true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 71#true, Black: 54#(<= 0 ~pos~0), 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-28 04:03:02,902 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-28 04:03:02,902 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-28 04:03:02,902 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-28 04:03:02,902 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-28 04:03:02,902 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-28 04:03:02,904 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([240] L41-3-->L41-1: Formula: (not (= (mod v_~v_assert~0_1 256) 0)) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1} AuxVars[] AssignedVars[][9], [Black: 61#true, 5#L89true, Black: 68#(<= 1 (mod ~d2~0 256)), 16#L55-1true, 28#L41-1true, 12#thread3EXITtrue, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 66#true, Black: 54#(<= 0 ~pos~0), 71#true, 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0))]) [2024-11-28 04:03:02,904 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-28 04:03:02,904 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-28 04:03:02,904 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-28 04:03:02,904 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-28 04:03:02,904 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-28 04:03:02,904 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-28 04:03:02,908 INFO L124 PetriNetUnfolderBase]: 1000/2003 cut-off events. [2024-11-28 04:03:02,908 INFO L125 PetriNetUnfolderBase]: For 1123/1230 co-relation queries the response was YES. [2024-11-28 04:03:02,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4692 conditions, 2003 events. 1000/2003 cut-off events. For 1123/1230 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 13358 event pairs, 391 based on Foata normal form. 14/1767 useless extension candidates. Maximal degree in co-relation 2415. Up to 731 conditions per place. [2024-11-28 04:03:02,934 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 32 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2024-11-28 04:03:02,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 59 transitions, 287 flow [2024-11-28 04:03:02,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:03:02,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 04:03:02,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2024-11-28 04:03:02,938 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.751937984496124 [2024-11-28 04:03:02,940 INFO L175 Difference]: Start difference. First operand has 49 places, 46 transitions, 174 flow. Second operand 3 states and 97 transitions. [2024-11-28 04:03:02,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 59 transitions, 287 flow [2024-11-28 04:03:02,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 59 transitions, 281 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 04:03:02,948 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 190 flow [2024-11-28 04:03:02,948 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=190, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2024-11-28 04:03:02,949 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 6 predicate places. [2024-11-28 04:03:02,950 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 190 flow [2024-11-28 04:03:02,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:03:02,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:03:02,951 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:03:02,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 04:03:02,951 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-28 04:03:02,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:03:02,952 INFO L85 PathProgramCache]: Analyzing trace with hash -764290904, now seen corresponding path program 1 times [2024-11-28 04:03:02,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:03:02,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430167700] [2024-11-28 04:03:02,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:03:02,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:03:02,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:03:03,374 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:03:03,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:03:03,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430167700] [2024-11-28 04:03:03,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430167700] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:03:03,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914243907] [2024-11-28 04:03:03,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:03:03,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:03:03,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4fc147d-e4bd-4c32-b9b0-5f02eca7a27d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:03:03,381 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4fc147d-e4bd-4c32-b9b0-5f02eca7a27d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:03:03,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4fc147d-e4bd-4c32-b9b0-5f02eca7a27d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 04:03:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:03:03,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-28 04:03:03,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:03:03,833 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-28 04:03:03,834 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:03:04,079 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:03:04,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914243907] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:03:04,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:03:04,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 6] total 11 [2024-11-28 04:03:04,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959651571] [2024-11-28 04:03:04,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:03:04,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 04:03:04,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:03:04,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 04:03:04,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-28 04:03:04,105 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2024-11-28 04:03:04,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 190 flow. Second operand has 11 states, 11 states have (on average 20.818181818181817) internal successors, (229), 11 states have internal predecessors, (229), 0 states have call successors, (0), 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-28 04:03:04,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:03:04,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2024-11-28 04:03:04,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:03:05,387 INFO L124 PetriNetUnfolderBase]: 3111/5711 cut-off events. [2024-11-28 04:03:05,387 INFO L125 PetriNetUnfolderBase]: For 4487/4531 co-relation queries the response was YES. [2024-11-28 04:03:05,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14719 conditions, 5711 events. 3111/5711 cut-off events. For 4487/4531 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 40375 event pairs, 201 based on Foata normal form. 160/5587 useless extension candidates. Maximal degree in co-relation 9174. Up to 1315 conditions per place. [2024-11-28 04:03:05,431 INFO L140 encePairwiseOnDemand]: 31/43 looper letters, 55 selfloop transitions, 20 changer transitions 22/114 dead transitions. [2024-11-28 04:03:05,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 114 transitions, 627 flow [2024-11-28 04:03:05,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 04:03:05,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-28 04:03:05,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 240 transitions. [2024-11-28 04:03:05,436 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6201550387596899 [2024-11-28 04:03:05,436 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 190 flow. Second operand 9 states and 240 transitions. [2024-11-28 04:03:05,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 114 transitions, 627 flow [2024-11-28 04:03:05,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 114 transitions, 621 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 04:03:05,449 INFO L231 Difference]: Finished difference. Result has 63 places, 61 transitions, 361 flow [2024-11-28 04:03:05,449 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=361, PETRI_PLACES=63, PETRI_TRANSITIONS=61} [2024-11-28 04:03:05,453 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 18 predicate places. [2024-11-28 04:03:05,453 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 61 transitions, 361 flow [2024-11-28 04:03:05,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 20.818181818181817) internal successors, (229), 11 states have internal predecessors, (229), 0 states have call successors, (0), 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-28 04:03:05,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:03:05,453 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:03:05,466 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4fc147d-e4bd-4c32-b9b0-5f02eca7a27d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-28 04:03:05,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4fc147d-e4bd-4c32-b9b0-5f02eca7a27d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:03:05,655 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-28 04:03:05,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:03:05,656 INFO L85 PathProgramCache]: Analyzing trace with hash -956305885, now seen corresponding path program 1 times [2024-11-28 04:03:05,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:03:05,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854574569] [2024-11-28 04:03:05,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:03:05,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:03:05,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:03:06,082 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-28 04:03:06,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:03:06,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854574569] [2024-11-28 04:03:06,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854574569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:03:06,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:03:06,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 04:03:06,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218034163] [2024-11-28 04:03:06,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:03:06,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:03:06,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:03:06,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:03:06,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:03:06,142 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 43 [2024-11-28 04:03:06,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 61 transitions, 361 flow. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 0 states have call successors, (0), 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-28 04:03:06,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:03:06,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 43 [2024-11-28 04:03:06,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:03:06,891 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([254] L57-->L60-1: Formula: (= v_~pos~0_5 (+ v_~pos~0_6 2)) InVars {~pos~0=v_~pos~0_6} OutVars{~pos~0=v_~pos~0_5} AuxVars[] AssignedVars[~pos~0][67], [Black: 61#true, 281#true, 26#L46-2true, Black: 66#true, 41#L87-4true, Black: 73#(<= 1 (mod ~d1~0 256)), Black: 274#(and (or (= ~v_assert~0 1) (= ~v_assert~0 0)) (or (< 0 (+ ~pos~0 1)) (= ~v_assert~0 0))), Black: 93#(or (= ~v_assert~0 1) (= ~v_assert~0 0)), Black: 97#(and (= ~pos~0 0) (= ~v_assert~0 1)), Black: 272#(and (<= 2 ~pos~0) (= ~v_assert~0 1)), Black: 270#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 144#(= ~v_assert~0 1), 23#L60-1true]) [2024-11-28 04:03:06,891 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-11-28 04:03:06,891 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-28 04:03:06,892 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-11-28 04:03:06,892 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-28 04:03:06,979 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([254] L57-->L60-1: Formula: (= v_~pos~0_5 (+ v_~pos~0_6 2)) InVars {~pos~0=v_~pos~0_6} OutVars{~pos~0=v_~pos~0_5} AuxVars[] AssignedVars[~pos~0][67], [281#true, Black: 61#true, 26#L46-2true, Black: 66#true, 3#L88-3true, Black: 73#(<= 1 (mod ~d1~0 256)), Black: 274#(and (or (= ~v_assert~0 1) (= ~v_assert~0 0)) (or (< 0 (+ ~pos~0 1)) (= ~v_assert~0 0))), Black: 93#(or (= ~v_assert~0 1) (= ~v_assert~0 0)), Black: 97#(and (= ~pos~0 0) (= ~v_assert~0 1)), Black: 272#(and (<= 2 ~pos~0) (= ~v_assert~0 1)), Black: 270#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 144#(= ~v_assert~0 1), 23#L60-1true]) [2024-11-28 04:03:06,980 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-28 04:03:06,980 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-28 04:03:06,980 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-28 04:03:06,980 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 04:03:07,046 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([254] L57-->L60-1: Formula: (= v_~pos~0_5 (+ v_~pos~0_6 2)) InVars {~pos~0=v_~pos~0_6} OutVars{~pos~0=v_~pos~0_5} AuxVars[] AssignedVars[~pos~0][67], [281#true, Black: 61#true, 42#L88-4true, 26#L46-2true, 20#$Ultimate##0true, Black: 66#true, Black: 73#(<= 1 (mod ~d1~0 256)), Black: 274#(and (or (= ~v_assert~0 1) (= ~v_assert~0 0)) (or (< 0 (+ ~pos~0 1)) (= ~v_assert~0 0))), Black: 93#(or (= ~v_assert~0 1) (= ~v_assert~0 0)), Black: 97#(and (= ~pos~0 0) (= ~v_assert~0 1)), Black: 272#(and (<= 2 ~pos~0) (= ~v_assert~0 1)), Black: 270#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 144#(= ~v_assert~0 1), 23#L60-1true]) [2024-11-28 04:03:07,047 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-28 04:03:07,047 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-28 04:03:07,047 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-28 04:03:07,047 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-28 04:03:07,062 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([240] L41-3-->L41-1: Formula: (not (= (mod v_~v_assert~0_1 256) 0)) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1} AuxVars[] AssignedVars[][9], [281#true, Black: 61#true, Black: 68#(<= 1 (mod ~d2~0 256)), 16#L55-1true, 41#L87-4true, Black: 73#(<= 1 (mod ~d1~0 256)), Black: 274#(and (or (= ~v_assert~0 1) (= ~v_assert~0 0)) (or (< 0 (+ ~pos~0 1)) (= ~v_assert~0 0))), Black: 93#(or (= ~v_assert~0 1) (= ~v_assert~0 0)), Black: 97#(and (= ~pos~0 0) (= ~v_assert~0 1)), Black: 272#(and (<= 2 ~pos~0) (= ~v_assert~0 1)), 28#L41-1true, Black: 270#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 144#(= ~v_assert~0 1)]) [2024-11-28 04:03:07,062 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2024-11-28 04:03:07,063 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-28 04:03:07,063 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-28 04:03:07,063 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-28 04:03:07,127 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([254] L57-->L60-1: Formula: (= v_~pos~0_5 (+ v_~pos~0_6 2)) InVars {~pos~0=v_~pos~0_6} OutVars{~pos~0=v_~pos~0_5} AuxVars[] AssignedVars[~pos~0][67], [281#true, Black: 61#true, 26#L46-2true, 20#$Ultimate##0true, Black: 66#true, Black: 73#(<= 1 (mod ~d1~0 256)), 5#L89true, Black: 274#(and (or (= ~v_assert~0 1) (= ~v_assert~0 0)) (or (< 0 (+ ~pos~0 1)) (= ~v_assert~0 0))), Black: 93#(or (= ~v_assert~0 1) (= ~v_assert~0 0)), Black: 97#(and (= ~pos~0 0) (= ~v_assert~0 1)), Black: 272#(and (<= 2 ~pos~0) (= ~v_assert~0 1)), Black: 270#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 144#(= ~v_assert~0 1), 23#L60-1true]) [2024-11-28 04:03:07,127 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-28 04:03:07,127 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-28 04:03:07,127 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-28 04:03:07,128 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-28 04:03:07,139 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([240] L41-3-->L41-1: Formula: (not (= (mod v_~v_assert~0_1 256) 0)) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1} AuxVars[] AssignedVars[][9], [281#true, Black: 61#true, Black: 68#(<= 1 (mod ~d2~0 256)), 16#L55-1true, 3#L88-3true, Black: 73#(<= 1 (mod ~d1~0 256)), Black: 274#(and (or (= ~v_assert~0 1) (= ~v_assert~0 0)) (or (< 0 (+ ~pos~0 1)) (= ~v_assert~0 0))), Black: 93#(or (= ~v_assert~0 1) (= ~v_assert~0 0)), Black: 97#(and (= ~pos~0 0) (= ~v_assert~0 1)), Black: 272#(and (<= 2 ~pos~0) (= ~v_assert~0 1)), Black: 270#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 28#L41-1true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 144#(= ~v_assert~0 1)]) [2024-11-28 04:03:07,139 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2024-11-28 04:03:07,139 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-28 04:03:07,139 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-28 04:03:07,140 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-28 04:03:07,185 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([240] L41-3-->L41-1: Formula: (not (= (mod v_~v_assert~0_1 256) 0)) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1} AuxVars[] AssignedVars[][9], [281#true, Black: 61#true, 42#L88-4true, 20#$Ultimate##0true, Black: 68#(<= 1 (mod ~d2~0 256)), 16#L55-1true, Black: 73#(<= 1 (mod ~d1~0 256)), Black: 274#(and (or (= ~v_assert~0 1) (= ~v_assert~0 0)) (or (< 0 (+ ~pos~0 1)) (= ~v_assert~0 0))), Black: 93#(or (= ~v_assert~0 1) (= ~v_assert~0 0)), Black: 97#(and (= ~pos~0 0) (= ~v_assert~0 1)), Black: 272#(and (<= 2 ~pos~0) (= ~v_assert~0 1)), 28#L41-1true, Black: 270#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 144#(= ~v_assert~0 1)]) [2024-11-28 04:03:07,185 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2024-11-28 04:03:07,186 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-28 04:03:07,186 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-28 04:03:07,186 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-28 04:03:07,223 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([240] L41-3-->L41-1: Formula: (not (= (mod v_~v_assert~0_1 256) 0)) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1} AuxVars[] AssignedVars[][9], [Black: 61#true, 281#true, 20#$Ultimate##0true, Black: 68#(<= 1 (mod ~d2~0 256)), 16#L55-1true, Black: 73#(<= 1 (mod ~d1~0 256)), 5#L89true, Black: 274#(and (or (= ~v_assert~0 1) (= ~v_assert~0 0)) (or (< 0 (+ ~pos~0 1)) (= ~v_assert~0 0))), Black: 93#(or (= ~v_assert~0 1) (= ~v_assert~0 0)), Black: 97#(and (= ~pos~0 0) (= ~v_assert~0 1)), Black: 272#(and (<= 2 ~pos~0) (= ~v_assert~0 1)), 28#L41-1true, Black: 270#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 144#(= ~v_assert~0 1)]) [2024-11-28 04:03:07,223 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-28 04:03:07,223 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-28 04:03:07,223 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-28 04:03:07,225 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-28 04:03:07,355 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([244] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][41], [Black: 61#true, 281#true, 42#L88-4true, Black: 68#(<= 1 (mod ~d2~0 256)), Black: 71#true, Black: 274#(and (or (= ~v_assert~0 1) (= ~v_assert~0 0)) (or (< 0 (+ ~pos~0 1)) (= ~v_assert~0 0))), Black: 93#(or (= ~v_assert~0 1) (= ~v_assert~0 0)), Black: 97#(and (= ~pos~0 0) (= ~v_assert~0 1)), Black: 144#(= ~v_assert~0 1), Black: 272#(and (<= 2 ~pos~0) (= ~v_assert~0 1)), 12#thread3EXITtrue, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 13#L43-2true, Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 270#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 23#L60-1true]) [2024-11-28 04:03:07,356 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-11-28 04:03:07,356 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-28 04:03:07,356 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-28 04:03:07,356 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-28 04:03:07,371 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([244] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][41], [Black: 61#true, 281#true, Black: 68#(<= 1 (mod ~d2~0 256)), Black: 71#true, 5#L89true, Black: 274#(and (or (= ~v_assert~0 1) (= ~v_assert~0 0)) (or (< 0 (+ ~pos~0 1)) (= ~v_assert~0 0))), Black: 93#(or (= ~v_assert~0 1) (= ~v_assert~0 0)), Black: 97#(and (= ~pos~0 0) (= ~v_assert~0 1)), Black: 144#(= ~v_assert~0 1), Black: 272#(and (<= 2 ~pos~0) (= ~v_assert~0 1)), 12#thread3EXITtrue, 13#L43-2true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), Black: 55#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 270#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 23#L60-1true]) [2024-11-28 04:03:07,371 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2024-11-28 04:03:07,371 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-28 04:03:07,371 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-28 04:03:07,371 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-28 04:03:07,395 INFO L124 PetriNetUnfolderBase]: 2753/5676 cut-off events. [2024-11-28 04:03:07,395 INFO L125 PetriNetUnfolderBase]: For 15441/15869 co-relation queries the response was YES. [2024-11-28 04:03:07,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18066 conditions, 5676 events. 2753/5676 cut-off events. For 15441/15869 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 45201 event pairs, 448 based on Foata normal form. 179/5117 useless extension candidates. Maximal degree in co-relation 14675. Up to 1945 conditions per place. [2024-11-28 04:03:07,465 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 44 selfloop transitions, 21 changer transitions 42/129 dead transitions. [2024-11-28 04:03:07,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 129 transitions, 1031 flow [2024-11-28 04:03:07,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 04:03:07,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-28 04:03:07,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 199 transitions. [2024-11-28 04:03:07,468 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6611295681063123 [2024-11-28 04:03:07,468 INFO L175 Difference]: Start difference. First operand has 63 places, 61 transitions, 361 flow. Second operand 7 states and 199 transitions. [2024-11-28 04:03:07,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 129 transitions, 1031 flow [2024-11-28 04:03:07,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 129 transitions, 886 flow, removed 71 selfloop flow, removed 3 redundant places. [2024-11-28 04:03:07,519 INFO L231 Difference]: Finished difference. Result has 69 places, 74 transitions, 531 flow [2024-11-28 04:03:07,520 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=531, PETRI_PLACES=69, PETRI_TRANSITIONS=74} [2024-11-28 04:03:07,520 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 24 predicate places. [2024-11-28 04:03:07,521 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 74 transitions, 531 flow [2024-11-28 04:03:07,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 0 states have call successors, (0), 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-28 04:03:07,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:03:07,522 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 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-28 04:03:07,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 04:03:07,522 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-28 04:03:07,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:03:07,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1536218106, now seen corresponding path program 2 times [2024-11-28 04:03:07,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:03:07,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354966456] [2024-11-28 04:03:07,524 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:03:07,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:03:07,567 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:03:07,567 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:03:07,772 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:03:07,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:03:07,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354966456] [2024-11-28 04:03:07,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354966456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:03:07,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:03:07,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:03:07,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825538414] [2024-11-28 04:03:07,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:03:07,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:03:07,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:03:07,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:03:07,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:03:07,782 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 43 [2024-11-28 04:03:07,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 74 transitions, 531 flow. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 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-28 04:03:07,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:03:07,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 43 [2024-11-28 04:03:07,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:03:08,772 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([250] L55-3-->L55-1: Formula: (not (= (mod v_~v_assert~0_3 256) 0)) InVars {~v_assert~0=v_~v_assert~0_3} OutVars{~v_assert~0=v_~v_assert~0_3} AuxVars[] AssignedVars[][14], [281#true, Black: 61#true, Black: 289#(and (<= 1 ~v_assert~0) (<= 1 ~pos~0) (<= (div ~v_assert~0 256) 0)), 42#L88-4true, Black: 283#(<= 0 ~pos~0), 298#(and (<= (div ~d2~0 256) 0) (<= 1 ~d2~0)), Black: 284#(<= 1 ~pos~0), Black: 285#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 68#(<= 1 (mod ~d2~0 256)), Black: 287#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 16#L55-1true, Black: 73#(<= 1 (mod ~d1~0 256)), Black: 274#(and (or (= ~v_assert~0 1) (= ~v_assert~0 0)) (or (< 0 (+ ~pos~0 1)) (= ~v_assert~0 0))), Black: 93#(or (= ~v_assert~0 1) (= ~v_assert~0 0)), Black: 97#(and (= ~pos~0 0) (= ~v_assert~0 1)), Black: 144#(= ~v_assert~0 1), Black: 272#(and (<= 2 ~pos~0) (= ~v_assert~0 1)), 28#L41-1true, 11#L69-1true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), 270#(and (= ~v_assert~0 1) (<= 0 ~pos~0))]) [2024-11-28 04:03:08,772 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2024-11-28 04:03:08,772 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-28 04:03:08,772 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-28 04:03:08,773 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-28 04:03:08,835 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([250] L55-3-->L55-1: Formula: (not (= (mod v_~v_assert~0_3 256) 0)) InVars {~v_assert~0=v_~v_assert~0_3} OutVars{~v_assert~0=v_~v_assert~0_3} AuxVars[] AssignedVars[][14], [281#true, Black: 61#true, Black: 289#(and (<= 1 ~v_assert~0) (<= 1 ~pos~0) (<= (div ~v_assert~0 256) 0)), Black: 283#(<= 0 ~pos~0), Black: 284#(<= 1 ~pos~0), 298#(and (<= (div ~d2~0 256) 0) (<= 1 ~d2~0)), Black: 285#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 68#(<= 1 (mod ~d2~0 256)), Black: 287#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 16#L55-1true, Black: 73#(<= 1 (mod ~d1~0 256)), 5#L89true, Black: 274#(and (or (= ~v_assert~0 1) (= ~v_assert~0 0)) (or (< 0 (+ ~pos~0 1)) (= ~v_assert~0 0))), Black: 93#(or (= ~v_assert~0 1) (= ~v_assert~0 0)), Black: 97#(and (= ~pos~0 0) (= ~v_assert~0 1)), Black: 144#(= ~v_assert~0 1), Black: 272#(and (<= 2 ~pos~0) (= ~v_assert~0 1)), 28#L41-1true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 11#L69-1true, Black: 54#(<= 0 ~pos~0), 270#(and (= ~v_assert~0 1) (<= 0 ~pos~0))]) [2024-11-28 04:03:08,835 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-11-28 04:03:08,835 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-11-28 04:03:08,835 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-28 04:03:08,835 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-28 04:03:08,840 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([245] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][55], [281#true, Black: 61#true, Black: 289#(and (<= 1 ~v_assert~0) (<= 1 ~pos~0) (<= (div ~v_assert~0 256) 0)), 42#L88-4true, 26#L46-2true, Black: 283#(<= 0 ~pos~0), Black: 284#(<= 1 ~pos~0), 298#(and (<= (div ~d2~0 256) 0) (<= 1 ~d2~0)), Black: 285#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 68#(<= 1 (mod ~d2~0 256)), Black: 287#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 73#(<= 1 (mod ~d1~0 256)), 36#L55-3true, Black: 274#(and (or (= ~v_assert~0 1) (= ~v_assert~0 0)) (or (< 0 (+ ~pos~0 1)) (= ~v_assert~0 0))), Black: 93#(or (= ~v_assert~0 1) (= ~v_assert~0 0)), Black: 97#(and (= ~pos~0 0) (= ~v_assert~0 1)), Black: 272#(and (<= 2 ~pos~0) (= ~v_assert~0 1)), Black: 270#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 11#L69-1true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), 144#(= ~v_assert~0 1)]) [2024-11-28 04:03:08,840 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-11-28 04:03:08,840 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-11-28 04:03:08,840 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-28 04:03:08,840 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-28 04:03:08,840 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([245] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][54], [Black: 61#true, 281#true, Black: 289#(and (<= 1 ~v_assert~0) (<= 1 ~pos~0) (<= (div ~v_assert~0 256) 0)), 42#L88-4true, Black: 283#(<= 0 ~pos~0), 26#L46-2true, Black: 284#(<= 1 ~pos~0), Black: 285#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 287#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 68#(<= 1 (mod ~d2~0 256)), Black: 73#(<= 1 (mod ~d1~0 256)), 297#(= (mod ~d2~0 256) 0), Black: 274#(and (or (= ~v_assert~0 1) (= ~v_assert~0 0)) (or (< 0 (+ ~pos~0 1)) (= ~v_assert~0 0))), Black: 93#(or (= ~v_assert~0 1) (= ~v_assert~0 0)), Black: 97#(and (= ~pos~0 0) (= ~v_assert~0 1)), Black: 272#(and (<= 2 ~pos~0) (= ~v_assert~0 1)), 12#thread3EXITtrue, Black: 270#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), 144#(= ~v_assert~0 1), 23#L60-1true]) [2024-11-28 04:03:08,841 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-11-28 04:03:08,841 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-11-28 04:03:08,841 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-11-28 04:03:08,841 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-28 04:03:08,841 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([244] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][40], [Black: 61#true, 281#true, Black: 289#(and (<= 1 ~v_assert~0) (<= 1 ~pos~0) (<= (div ~v_assert~0 256) 0)), 42#L88-4true, Black: 283#(<= 0 ~pos~0), Black: 284#(<= 1 ~pos~0), 298#(and (<= (div ~d2~0 256) 0) (<= 1 ~d2~0)), Black: 285#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 287#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 68#(<= 1 (mod ~d2~0 256)), Black: 71#true, 36#L55-3true, Black: 274#(and (or (= ~v_assert~0 1) (= ~v_assert~0 0)) (or (< 0 (+ ~pos~0 1)) (= ~v_assert~0 0))), Black: 93#(or (= ~v_assert~0 1) (= ~v_assert~0 0)), Black: 97#(and (= ~pos~0 0) (= ~v_assert~0 1)), Black: 144#(= ~v_assert~0 1), Black: 272#(and (<= 2 ~pos~0) (= ~v_assert~0 1)), 11#L69-1true, 13#L43-2true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), 270#(and (= ~v_assert~0 1) (<= 0 ~pos~0))]) [2024-11-28 04:03:08,841 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2024-11-28 04:03:08,841 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-28 04:03:08,841 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-28 04:03:08,842 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2024-11-28 04:03:08,966 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([245] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][55], [Black: 61#true, 281#true, Black: 289#(and (<= 1 ~v_assert~0) (<= 1 ~pos~0) (<= (div ~v_assert~0 256) 0)), 26#L46-2true, Black: 283#(<= 0 ~pos~0), 298#(and (<= (div ~d2~0 256) 0) (<= 1 ~d2~0)), Black: 284#(<= 1 ~pos~0), Black: 285#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 68#(<= 1 (mod ~d2~0 256)), Black: 287#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 73#(<= 1 (mod ~d1~0 256)), 36#L55-3true, 5#L89true, Black: 274#(and (or (= ~v_assert~0 1) (= ~v_assert~0 0)) (or (< 0 (+ ~pos~0 1)) (= ~v_assert~0 0))), Black: 93#(or (= ~v_assert~0 1) (= ~v_assert~0 0)), Black: 97#(and (= ~pos~0 0) (= ~v_assert~0 1)), Black: 272#(and (<= 2 ~pos~0) (= ~v_assert~0 1)), Black: 270#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 11#L69-1true, Black: 54#(<= 0 ~pos~0), 144#(= ~v_assert~0 1)]) [2024-11-28 04:03:08,967 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-11-28 04:03:08,967 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-28 04:03:08,967 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-11-28 04:03:08,967 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-28 04:03:08,967 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([245] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][54], [Black: 61#true, 281#true, Black: 289#(and (<= 1 ~v_assert~0) (<= 1 ~pos~0) (<= (div ~v_assert~0 256) 0)), Black: 283#(<= 0 ~pos~0), 26#L46-2true, Black: 284#(<= 1 ~pos~0), Black: 285#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 68#(<= 1 (mod ~d2~0 256)), Black: 287#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 73#(<= 1 (mod ~d1~0 256)), 5#L89true, Black: 274#(and (or (= ~v_assert~0 1) (= ~v_assert~0 0)) (or (< 0 (+ ~pos~0 1)) (= ~v_assert~0 0))), 297#(= (mod ~d2~0 256) 0), Black: 93#(or (= ~v_assert~0 1) (= ~v_assert~0 0)), Black: 97#(and (= ~pos~0 0) (= ~v_assert~0 1)), Black: 272#(and (<= 2 ~pos~0) (= ~v_assert~0 1)), Black: 270#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 12#thread3EXITtrue, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), 144#(= ~v_assert~0 1), 23#L60-1true]) [2024-11-28 04:03:08,967 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-11-28 04:03:08,968 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-11-28 04:03:08,968 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-28 04:03:08,968 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-11-28 04:03:08,968 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([244] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][40], [281#true, Black: 61#true, Black: 289#(and (<= 1 ~v_assert~0) (<= 1 ~pos~0) (<= (div ~v_assert~0 256) 0)), Black: 283#(<= 0 ~pos~0), 298#(and (<= (div ~d2~0 256) 0) (<= 1 ~d2~0)), Black: 284#(<= 1 ~pos~0), Black: 285#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 68#(<= 1 (mod ~d2~0 256)), Black: 287#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 36#L55-3true, Black: 71#true, 5#L89true, Black: 274#(and (or (= ~v_assert~0 1) (= ~v_assert~0 0)) (or (< 0 (+ ~pos~0 1)) (= ~v_assert~0 0))), Black: 93#(or (= ~v_assert~0 1) (= ~v_assert~0 0)), Black: 97#(and (= ~pos~0 0) (= ~v_assert~0 1)), Black: 144#(= ~v_assert~0 1), Black: 272#(and (<= 2 ~pos~0) (= ~v_assert~0 1)), 13#L43-2true, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 11#L69-1true, Black: 54#(<= 0 ~pos~0), 270#(and (= ~v_assert~0 1) (<= 0 ~pos~0))]) [2024-11-28 04:03:08,968 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2024-11-28 04:03:08,968 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-11-28 04:03:08,968 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-28 04:03:08,968 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-11-28 04:03:09,093 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([244] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][23], [281#true, Black: 61#true, Black: 289#(and (<= 1 ~v_assert~0) (<= 1 ~pos~0) (<= (div ~v_assert~0 256) 0)), Black: 283#(<= 0 ~pos~0), Black: 284#(<= 1 ~pos~0), Black: 285#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 66#true, Black: 287#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 71#true, 295#true, 5#L89true, Black: 274#(and (or (= ~v_assert~0 1) (= ~v_assert~0 0)) (or (< 0 (+ ~pos~0 1)) (= ~v_assert~0 0))), Black: 93#(or (= ~v_assert~0 1) (= ~v_assert~0 0)), Black: 97#(and (= ~pos~0 0) (= ~v_assert~0 1)), Black: 144#(= ~v_assert~0 1), Black: 270#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 12#thread3EXITtrue, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 13#L43-2true, Black: 54#(<= 0 ~pos~0), 272#(and (<= 2 ~pos~0) (= ~v_assert~0 1)), 23#L60-1true]) [2024-11-28 04:03:09,093 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2024-11-28 04:03:09,094 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-28 04:03:09,094 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-28 04:03:09,094 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-11-28 04:03:09,094 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([245] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][91], [281#true, Black: 61#true, Black: 289#(and (<= 1 ~v_assert~0) (<= 1 ~pos~0) (<= (div ~v_assert~0 256) 0)), Black: 283#(<= 0 ~pos~0), 26#L46-2true, Black: 284#(<= 1 ~pos~0), Black: 285#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 66#true, Black: 287#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 73#(<= 1 (mod ~d1~0 256)), 295#true, 5#L89true, Black: 274#(and (or (= ~v_assert~0 1) (= ~v_assert~0 0)) (or (< 0 (+ ~pos~0 1)) (= ~v_assert~0 0))), Black: 93#(or (= ~v_assert~0 1) (= ~v_assert~0 0)), Black: 97#(and (= ~pos~0 0) (= ~v_assert~0 1)), Black: 144#(= ~v_assert~0 1), Black: 272#(and (<= 2 ~pos~0) (= ~v_assert~0 1)), 12#thread3EXITtrue, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 54#(<= 0 ~pos~0), 270#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 23#L60-1true]) [2024-11-28 04:03:09,094 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2024-11-28 04:03:09,094 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-28 04:03:09,095 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-11-28 04:03:09,095 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-11-28 04:03:09,113 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([244] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][23], [281#true, Black: 61#true, Black: 289#(and (<= 1 ~v_assert~0) (<= 1 ~pos~0) (<= (div ~v_assert~0 256) 0)), Black: 283#(<= 0 ~pos~0), Black: 284#(<= 1 ~pos~0), Black: 285#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 66#true, Black: 287#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 71#true, 295#true, 5#L89true, Black: 274#(and (or (= ~v_assert~0 1) (= ~v_assert~0 0)) (or (< 0 (+ ~pos~0 1)) (= ~v_assert~0 0))), Black: 93#(or (= ~v_assert~0 1) (= ~v_assert~0 0)), Black: 97#(and (= ~pos~0 0) (= ~v_assert~0 1)), Black: 272#(and (<= 2 ~pos~0) (= ~v_assert~0 1)), Black: 270#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 12#thread3EXITtrue, Black: 57#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 13#L43-2true, Black: 54#(<= 0 ~pos~0), 144#(= ~v_assert~0 1), 23#L60-1true]) [2024-11-28 04:03:09,114 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2024-11-28 04:03:09,114 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-11-28 04:03:09,114 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-11-28 04:03:09,114 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2024-11-28 04:03:09,118 INFO L124 PetriNetUnfolderBase]: 3253/5968 cut-off events. [2024-11-28 04:03:09,119 INFO L125 PetriNetUnfolderBase]: For 22381/23300 co-relation queries the response was YES. [2024-11-28 04:03:09,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21557 conditions, 5968 events. 3253/5968 cut-off events. For 22381/23300 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 43681 event pairs, 1026 based on Foata normal form. 87/4952 useless extension candidates. Maximal degree in co-relation 20810. Up to 1709 conditions per place. [2024-11-28 04:03:09,298 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 75 selfloop transitions, 5 changer transitions 0/117 dead transitions. [2024-11-28 04:03:09,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 117 transitions, 1029 flow [2024-11-28 04:03:09,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:03:09,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-28 04:03:09,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2024-11-28 04:03:09,301 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7674418604651163 [2024-11-28 04:03:09,301 INFO L175 Difference]: Start difference. First operand has 69 places, 74 transitions, 531 flow. Second operand 4 states and 132 transitions. [2024-11-28 04:03:09,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 117 transitions, 1029 flow [2024-11-28 04:03:09,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 117 transitions, 969 flow, removed 30 selfloop flow, removed 2 redundant places. [2024-11-28 04:03:09,387 INFO L231 Difference]: Finished difference. Result has 70 places, 76 transitions, 543 flow [2024-11-28 04:03:09,388 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=507, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=543, PETRI_PLACES=70, PETRI_TRANSITIONS=76} [2024-11-28 04:03:09,389 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 25 predicate places. [2024-11-28 04:03:09,389 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 76 transitions, 543 flow [2024-11-28 04:03:09,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 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-28 04:03:09,390 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:03:09,390 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:03:09,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 04:03:09,391 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-28 04:03:09,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:03:09,392 INFO L85 PathProgramCache]: Analyzing trace with hash 77218060, now seen corresponding path program 2 times [2024-11-28 04:03:09,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:03:09,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008879300] [2024-11-28 04:03:09,392 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:03:09,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:03:09,442 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:03:09,442 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:03:09,709 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-28 04:03:09,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:03:09,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008879300] [2024-11-28 04:03:09,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008879300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:03:09,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:03:09,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:03:09,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623940712] [2024-11-28 04:03:09,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:03:09,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:03:09,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:03:09,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:03:09,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:03:09,734 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 43 [2024-11-28 04:03:09,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 76 transitions, 543 flow. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 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-28 04:03:09,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:03:09,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 43 [2024-11-28 04:03:09,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:03:09,919 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([244] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][25], [Black: 61#true, Black: 289#(and (<= 1 ~v_assert~0) (<= 1 ~pos~0) (<= (div ~v_assert~0 256) 0)), Black: 283#(<= 0 ~pos~0), 20#$Ultimate##0true, Black: 66#true, Black: 287#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 302#true, Black: 297#(= (mod ~d2~0 256) 0), 284#(<= 1 ~pos~0), Black: 71#true, Black: 298#(and (<= (div ~d2~0 256) 0) (<= 1 ~d2~0)), 54#(<= 0 ~pos~0), 295#true, 5#L89true, Black: 274#(and (or (= ~v_assert~0 1) (= ~v_assert~0 0)) (or (< 0 (+ ~pos~0 1)) (= ~v_assert~0 0))), Black: 93#(or (= ~v_assert~0 1) (= ~v_assert~0 0)), Black: 97#(and (= ~pos~0 0) (= ~v_assert~0 1)), Black: 144#(= ~v_assert~0 1), Black: 270#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 13#L43-2true, 272#(and (<= 2 ~pos~0) (= ~v_assert~0 1)), 23#L60-1true]) [2024-11-28 04:03:09,919 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-11-28 04:03:09,919 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-28 04:03:09,919 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-28 04:03:09,919 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-28 04:03:10,093 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([244] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][25], [Black: 61#true, 281#true, Black: 289#(and (<= 1 ~v_assert~0) (<= 1 ~pos~0) (<= (div ~v_assert~0 256) 0)), Black: 283#(<= 0 ~pos~0), 298#(and (<= (div ~d2~0 256) 0) (<= 1 ~d2~0)), 20#$Ultimate##0true, Black: 284#(<= 1 ~pos~0), Black: 66#true, Black: 287#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 302#true, Black: 297#(= (mod ~d2~0 256) 0), Black: 71#true, Black: 295#true, 5#L89true, Black: 274#(and (or (= ~v_assert~0 1) (= ~v_assert~0 0)) (or (< 0 (+ ~pos~0 1)) (= ~v_assert~0 0))), Black: 93#(or (= ~v_assert~0 1) (= ~v_assert~0 0)), Black: 97#(and (= ~pos~0 0) (= ~v_assert~0 1)), Black: 144#(= ~v_assert~0 1), Black: 270#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 13#L43-2true, Black: 54#(<= 0 ~pos~0), 272#(and (<= 2 ~pos~0) (= ~v_assert~0 1)), 23#L60-1true]) [2024-11-28 04:03:10,093 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-28 04:03:10,093 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 04:03:10,093 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-11-28 04:03:10,093 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-28 04:03:10,172 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([244] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][25], [281#true, Black: 61#true, Black: 289#(and (<= 1 ~v_assert~0) (<= 1 ~pos~0) (<= (div ~v_assert~0 256) 0)), Black: 283#(<= 0 ~pos~0), 298#(and (<= (div ~d2~0 256) 0) (<= 1 ~d2~0)), Black: 284#(<= 1 ~pos~0), Black: 66#true, Black: 287#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 302#true, Black: 71#true, Black: 297#(= (mod ~d2~0 256) 0), Black: 295#true, 5#L89true, Black: 274#(and (or (= ~v_assert~0 1) (= ~v_assert~0 0)) (or (< 0 (+ ~pos~0 1)) (= ~v_assert~0 0))), Black: 93#(or (= ~v_assert~0 1) (= ~v_assert~0 0)), Black: 97#(and (= ~pos~0 0) (= ~v_assert~0 1)), Black: 144#(= ~v_assert~0 1), Black: 270#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 11#L69-1true, 13#L43-2true, Black: 54#(<= 0 ~pos~0), 272#(and (<= 2 ~pos~0) (= ~v_assert~0 1)), 23#L60-1true]) [2024-11-28 04:03:10,172 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-28 04:03:10,173 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-28 04:03:10,173 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-28 04:03:10,173 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-28 04:03:10,499 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([245] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][66], [Black: 61#true, 281#true, Black: 289#(and (<= 1 ~v_assert~0) (<= 1 ~pos~0) (<= (div ~v_assert~0 256) 0)), 42#L88-4true, 26#L46-2true, Black: 283#(<= 0 ~pos~0), Black: 284#(<= 1 ~pos~0), 298#(and (<= (div ~d2~0 256) 0) (<= 1 ~d2~0)), Black: 66#true, Black: 287#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 304#(= (mod ~d1~0 256) 0), Black: 73#(<= 1 (mod ~d1~0 256)), Black: 297#(= (mod ~d2~0 256) 0), Black: 295#true, Black: 274#(and (or (= ~v_assert~0 1) (= ~v_assert~0 0)) (or (< 0 (+ ~pos~0 1)) (= ~v_assert~0 0))), Black: 93#(or (= ~v_assert~0 1) (= ~v_assert~0 0)), Black: 97#(and (= ~pos~0 0) (= ~v_assert~0 1)), Black: 144#(= ~v_assert~0 1), Black: 272#(and (<= 2 ~pos~0) (= ~v_assert~0 1)), 12#thread3EXITtrue, Black: 54#(<= 0 ~pos~0), 270#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 23#L60-1true]) [2024-11-28 04:03:10,499 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2024-11-28 04:03:10,499 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-28 04:03:10,499 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-28 04:03:10,499 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-28 04:03:10,552 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([245] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][66], [Black: 61#true, 281#true, Black: 289#(and (<= 1 ~v_assert~0) (<= 1 ~pos~0) (<= (div ~v_assert~0 256) 0)), Black: 283#(<= 0 ~pos~0), 26#L46-2true, 298#(and (<= (div ~d2~0 256) 0) (<= 1 ~d2~0)), Black: 284#(<= 1 ~pos~0), Black: 66#true, Black: 287#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 304#(= (mod ~d1~0 256) 0), Black: 73#(<= 1 (mod ~d1~0 256)), Black: 297#(= (mod ~d2~0 256) 0), Black: 295#true, 5#L89true, Black: 274#(and (or (= ~v_assert~0 1) (= ~v_assert~0 0)) (or (< 0 (+ ~pos~0 1)) (= ~v_assert~0 0))), Black: 93#(or (= ~v_assert~0 1) (= ~v_assert~0 0)), Black: 97#(and (= ~pos~0 0) (= ~v_assert~0 1)), Black: 144#(= ~v_assert~0 1), Black: 272#(and (<= 2 ~pos~0) (= ~v_assert~0 1)), 12#thread3EXITtrue, Black: 54#(<= 0 ~pos~0), 270#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 23#L60-1true]) [2024-11-28 04:03:10,552 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2024-11-28 04:03:10,553 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-28 04:03:10,553 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-28 04:03:10,553 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-11-28 04:03:10,841 INFO L124 PetriNetUnfolderBase]: 1759/3965 cut-off events. [2024-11-28 04:03:10,842 INFO L125 PetriNetUnfolderBase]: For 9584/10098 co-relation queries the response was YES. [2024-11-28 04:03:10,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13321 conditions, 3965 events. 1759/3965 cut-off events. For 9584/10098 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 30055 event pairs, 538 based on Foata normal form. 102/3762 useless extension candidates. Maximal degree in co-relation 9431. Up to 912 conditions per place. [2024-11-28 04:03:10,894 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 53 selfloop transitions, 5 changer transitions 0/97 dead transitions. [2024-11-28 04:03:10,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 97 transitions, 744 flow [2024-11-28 04:03:10,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:03:10,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-28 04:03:10,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2024-11-28 04:03:10,897 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7441860465116279 [2024-11-28 04:03:10,897 INFO L175 Difference]: Start difference. First operand has 70 places, 76 transitions, 543 flow. Second operand 4 states and 128 transitions. [2024-11-28 04:03:10,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 97 transitions, 744 flow [2024-11-28 04:03:10,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 97 transitions, 732 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-11-28 04:03:10,921 INFO L231 Difference]: Finished difference. Result has 75 places, 76 transitions, 553 flow [2024-11-28 04:03:10,922 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=553, PETRI_PLACES=75, PETRI_TRANSITIONS=76} [2024-11-28 04:03:10,922 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 30 predicate places. [2024-11-28 04:03:10,923 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 76 transitions, 553 flow [2024-11-28 04:03:10,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 0 states have call successors, (0), 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-28 04:03:10,923 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:03:10,923 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:03:10,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 04:03:10,924 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-28 04:03:10,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:03:10,925 INFO L85 PathProgramCache]: Analyzing trace with hash 471147471, now seen corresponding path program 1 times [2024-11-28 04:03:10,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:03:10,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213050103] [2024-11-28 04:03:10,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:03:10,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:03:10,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:03:11,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:03:11,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:03:11,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213050103] [2024-11-28 04:03:11,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213050103] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:03:11,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580111263] [2024-11-28 04:03:11,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:03:11,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:03:11,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4fc147d-e4bd-4c32-b9b0-5f02eca7a27d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:03:11,290 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4fc147d-e4bd-4c32-b9b0-5f02eca7a27d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:03:11,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4fc147d-e4bd-4c32-b9b0-5f02eca7a27d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 04:03:11,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:03:11,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-28 04:03:11,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:03:11,633 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:03:11,634 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:03:11,820 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:03:11,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580111263] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:03:11,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:03:11,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 7] total 12 [2024-11-28 04:03:11,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285520998] [2024-11-28 04:03:11,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:03:11,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 04:03:11,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:03:11,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 04:03:11,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-28 04:03:11,885 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 43 [2024-11-28 04:03:11,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 76 transitions, 553 flow. Second operand has 12 states, 12 states have (on average 18.25) internal successors, (219), 12 states have internal predecessors, (219), 0 states have call successors, (0), 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-28 04:03:11,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:03:11,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 43 [2024-11-28 04:03:11,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:03:15,501 INFO L124 PetriNetUnfolderBase]: 9663/17137 cut-off events. [2024-11-28 04:03:15,501 INFO L125 PetriNetUnfolderBase]: For 53362/53402 co-relation queries the response was YES. [2024-11-28 04:03:15,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64651 conditions, 17137 events. 9663/17137 cut-off events. For 53362/53402 co-relation queries the response was YES. Maximal size of possible extension queue 535. Compared 130081 event pairs, 895 based on Foata normal form. 324/17379 useless extension candidates. Maximal degree in co-relation 47202. Up to 3376 conditions per place. [2024-11-28 04:03:15,661 INFO L140 encePairwiseOnDemand]: 30/43 looper letters, 98 selfloop transitions, 56 changer transitions 129/297 dead transitions. [2024-11-28 04:03:15,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 297 transitions, 2624 flow [2024-11-28 04:03:15,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 04:03:15,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-28 04:03:15,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 384 transitions. [2024-11-28 04:03:15,664 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5581395348837209 [2024-11-28 04:03:15,665 INFO L175 Difference]: Start difference. First operand has 75 places, 76 transitions, 553 flow. Second operand 16 states and 384 transitions. [2024-11-28 04:03:15,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 297 transitions, 2624 flow [2024-11-28 04:03:15,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 297 transitions, 2624 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 04:03:15,859 INFO L231 Difference]: Finished difference. Result has 100 places, 109 transitions, 1121 flow [2024-11-28 04:03:15,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1121, PETRI_PLACES=100, PETRI_TRANSITIONS=109} [2024-11-28 04:03:15,860 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 55 predicate places. [2024-11-28 04:03:15,861 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 109 transitions, 1121 flow [2024-11-28 04:03:15,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 18.25) internal successors, (219), 12 states have internal predecessors, (219), 0 states have call successors, (0), 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-28 04:03:15,861 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:03:15,861 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:03:15,877 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4fc147d-e4bd-4c32-b9b0-5f02eca7a27d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 04:03:16,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4fc147d-e4bd-4c32-b9b0-5f02eca7a27d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:03:16,063 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-28 04:03:16,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:03:16,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1180513923, now seen corresponding path program 2 times [2024-11-28 04:03:16,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:03:16,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588733626] [2024-11-28 04:03:16,068 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:03:16,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:03:16,239 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:03:16,239 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:03:16,523 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-28 04:03:16,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:03:16,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588733626] [2024-11-28 04:03:16,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588733626] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:03:16,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868687197] [2024-11-28 04:03:16,524 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:03:16,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:03:16,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4fc147d-e4bd-4c32-b9b0-5f02eca7a27d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:03:16,527 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4fc147d-e4bd-4c32-b9b0-5f02eca7a27d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:03:16,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4fc147d-e4bd-4c32-b9b0-5f02eca7a27d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 04:03:16,624 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:03:16,624 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:03:16,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-28 04:03:16,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:03:16,747 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-28 04:03:16,751 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:03:16,902 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-28 04:03:16,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868687197] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:03:16,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:03:16,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 10 [2024-11-28 04:03:16,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549368537] [2024-11-28 04:03:16,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:03:16,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 04:03:16,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:03:16,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 04:03:16,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-28 04:03:16,933 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2024-11-28 04:03:16,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 109 transitions, 1121 flow. Second operand has 10 states, 10 states have (on average 21.2) internal successors, (212), 10 states have internal predecessors, (212), 0 states have call successors, (0), 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-28 04:03:16,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:03:16,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2024-11-28 04:03:16,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:03:18,642 INFO L124 PetriNetUnfolderBase]: 2813/6176 cut-off events. [2024-11-28 04:03:18,642 INFO L125 PetriNetUnfolderBase]: For 41130/41272 co-relation queries the response was YES. [2024-11-28 04:03:18,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26504 conditions, 6176 events. 2813/6176 cut-off events. For 41130/41272 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 49127 event pairs, 143 based on Foata normal form. 290/6426 useless extension candidates. Maximal degree in co-relation 26447. Up to 1658 conditions per place. [2024-11-28 04:03:18,722 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 0 selfloop transitions, 0 changer transitions 193/193 dead transitions. [2024-11-28 04:03:18,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 193 transitions, 2218 flow [2024-11-28 04:03:18,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 04:03:18,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-28 04:03:18,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 293 transitions. [2024-11-28 04:03:18,726 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5678294573643411 [2024-11-28 04:03:18,727 INFO L175 Difference]: Start difference. First operand has 100 places, 109 transitions, 1121 flow. Second operand 12 states and 293 transitions. [2024-11-28 04:03:18,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 193 transitions, 2218 flow [2024-11-28 04:03:18,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 193 transitions, 1957 flow, removed 85 selfloop flow, removed 12 redundant places. [2024-11-28 04:03:18,874 INFO L231 Difference]: Finished difference. Result has 87 places, 0 transitions, 0 flow [2024-11-28 04:03:18,875 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=911, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=0, PETRI_PLACES=87, PETRI_TRANSITIONS=0} [2024-11-28 04:03:18,876 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 42 predicate places. [2024-11-28 04:03:18,876 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 0 transitions, 0 flow [2024-11-28 04:03:18,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 21.2) internal successors, (212), 10 states have internal predecessors, (212), 0 states have call successors, (0), 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-28 04:03:18,882 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 5 remaining) [2024-11-28 04:03:18,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2024-11-28 04:03:18,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-11-28 04:03:18,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-11-28 04:03:18,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-11-28 04:03:18,897 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4fc147d-e4bd-4c32-b9b0-5f02eca7a27d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-28 04:03:19,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4fc147d-e4bd-4c32-b9b0-5f02eca7a27d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:03:19,088 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1] [2024-11-28 04:03:19,101 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-28 04:03:19,101 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 04:03:19,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 04:03:19 BasicIcfg [2024-11-28 04:03:19,129 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 04:03:19,132 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 04:03:19,132 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 04:03:19,132 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 04:03:19,137 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:02:58" (3/4) ... [2024-11-28 04:03:19,145 INFO L146 WitnessPrinter]: Generating witness for correct program [2024-11-28 04:03:19,151 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-28 04:03:19,151 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-28 04:03:19,151 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-28 04:03:19,157 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 54 nodes and edges [2024-11-28 04:03:19,158 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-11-28 04:03:19,158 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-28 04:03:19,158 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-28 04:03:19,279 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4fc147d-e4bd-4c32-b9b0-5f02eca7a27d/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-28 04:03:19,280 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4fc147d-e4bd-4c32-b9b0-5f02eca7a27d/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-28 04:03:19,281 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 04:03:19,282 INFO L158 Benchmark]: Toolchain (without parser) took 21646.29ms. Allocated memory was 117.4MB in the beginning and 973.1MB in the end (delta: 855.6MB). Free memory was 92.4MB in the beginning and 511.9MB in the end (delta: -419.5MB). Peak memory consumption was 433.2MB. Max. memory is 16.1GB. [2024-11-28 04:03:19,283 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 117.4MB. Free memory is still 73.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 04:03:19,284 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.31ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 81.0MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 04:03:19,286 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.98ms. Allocated memory is still 117.4MB. Free memory was 81.0MB in the beginning and 79.6MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 04:03:19,286 INFO L158 Benchmark]: Boogie Preprocessor took 54.92ms. Allocated memory is still 117.4MB. Free memory was 79.6MB in the beginning and 77.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 04:03:19,287 INFO L158 Benchmark]: RCFGBuilder took 868.44ms. Allocated memory is still 117.4MB. Free memory was 77.9MB in the beginning and 58.0MB in the end (delta: 20.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 04:03:19,288 INFO L158 Benchmark]: TraceAbstraction took 20157.46ms. Allocated memory was 117.4MB in the beginning and 973.1MB in the end (delta: 855.6MB). Free memory was 57.4MB in the beginning and 518.6MB in the end (delta: -461.2MB). Peak memory consumption was 399.6MB. Max. memory is 16.1GB. [2024-11-28 04:03:19,288 INFO L158 Benchmark]: Witness Printer took 149.32ms. Allocated memory is still 973.1MB. Free memory was 518.6MB in the beginning and 511.9MB in the end (delta: 6.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 04:03:19,293 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.41ms. Allocated memory is still 117.4MB. Free memory is still 73.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 360.31ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 81.0MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.98ms. Allocated memory is still 117.4MB. Free memory was 81.0MB in the beginning and 79.6MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.92ms. Allocated memory is still 117.4MB. Free memory was 79.6MB in the beginning and 77.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 868.44ms. Allocated memory is still 117.4MB. Free memory was 77.9MB in the beginning and 58.0MB in the end (delta: 20.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 20157.46ms. Allocated memory was 117.4MB in the beginning and 973.1MB in the end (delta: 855.6MB). Free memory was 57.4MB in the beginning and 518.6MB in the end (delta: -461.2MB). Peak memory consumption was 399.6MB. Max. memory is 16.1GB. * Witness Printer took 149.32ms. Allocated memory is still 973.1MB. Free memory was 518.6MB in the beginning and 511.9MB in the end (delta: 6.7MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 74]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 63 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 19.9s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 13.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 541 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 502 mSDsluCounter, 104 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 64 mSDsCounter, 89 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1353 IncrementalHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 89 mSolverCounterUnsat, 40 mSDtfsCounter, 1353 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 305 GetRequests, 224 SyntacticMatches, 13 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1121occurred in iteration=9, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 433 NumberOfCodeBlocks, 433 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 530 ConstructedInterpolants, 0 QuantifiedInterpolants, 1406 SizeOfPredicates, 17 NumberOfNonLiveVariables, 494 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 16 InterpolantComputations, 7 PerfectInterpolantSequences, 25/36 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-28 04:03:19,325 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4fc147d-e4bd-4c32-b9b0-5f02eca7a27d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE