./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-ext/40_barrier_vf.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c17f0c3-d521-47ff-9fed-0f0a7efcffaf/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c17f0c3-d521-47ff-9fed-0f0a7efcffaf/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c17f0c3-d521-47ff-9fed-0f0a7efcffaf/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c17f0c3-d521-47ff-9fed-0f0a7efcffaf/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-ext/40_barrier_vf.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c17f0c3-d521-47ff-9fed-0f0a7efcffaf/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c17f0c3-d521-47ff-9fed-0f0a7efcffaf/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G 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 5eef73b6b2655059556d731e3a5babc181132142f2417a2cf863165dd8efda84 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:14:33,082 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:14:33,198 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c17f0c3-d521-47ff-9fed-0f0a7efcffaf/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 22:14:33,209 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:14:33,209 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:14:33,249 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:14:33,250 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:14:33,251 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:14:33,252 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:14:33,252 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:14:33,253 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:14:33,254 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:14:33,254 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:14:33,255 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:14:33,256 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:14:33,256 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:14:33,257 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:14:33,257 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:14:33,258 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:14:33,258 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:14:33,259 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:14:33,259 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:14:33,260 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:14:33,260 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:14:33,261 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:14:33,261 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:14:33,262 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:14:33,262 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:14:33,263 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:14:33,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:14:33,264 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:14:33,264 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:14:33,265 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:14:33,265 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:14:33,265 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:14:33,266 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:14:33,266 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:14:33,267 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:14:33,267 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c17f0c3-d521-47ff-9fed-0f0a7efcffaf/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c17f0c3-d521-47ff-9fed-0f0a7efcffaf/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> 5eef73b6b2655059556d731e3a5babc181132142f2417a2cf863165dd8efda84 [2023-11-06 22:14:33,597 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:14:33,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:14:33,633 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:14:33,634 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:14:33,635 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:14:33,637 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c17f0c3-d521-47ff-9fed-0f0a7efcffaf/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-ext/40_barrier_vf.i [2023-11-06 22:14:36,788 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:14:37,142 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:14:37,143 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c17f0c3-d521-47ff-9fed-0f0a7efcffaf/sv-benchmarks/c/pthread-ext/40_barrier_vf.i [2023-11-06 22:14:37,166 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c17f0c3-d521-47ff-9fed-0f0a7efcffaf/bin/uautomizer-verify-WvqO1wxjHP/data/e7c553aaf/dde230338ac541fca00d435b65786c74/FLAG2c8c19101 [2023-11-06 22:14:37,193 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c17f0c3-d521-47ff-9fed-0f0a7efcffaf/bin/uautomizer-verify-WvqO1wxjHP/data/e7c553aaf/dde230338ac541fca00d435b65786c74 [2023-11-06 22:14:37,197 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:14:37,199 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:14:37,200 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:14:37,208 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:14:37,214 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:14:37,215 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:14:37" (1/1) ... [2023-11-06 22:14:37,216 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36df90aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:37, skipping insertion in model container [2023-11-06 22:14:37,216 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:14:37" (1/1) ... [2023-11-06 22:14:37,285 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:14:37,496 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-06 22:14:37,681 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:14:37,698 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:14:37,727 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-06 22:14:37,762 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:14:37,816 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:14:37,816 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:14:37,816 WARN L672 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:14:37,824 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:14:37,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:37 WrapperNode [2023-11-06 22:14:37,825 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:14:37,827 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:14:37,827 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:14:37,827 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:14:37,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:37" (1/1) ... [2023-11-06 22:14:37,872 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:37" (1/1) ... [2023-11-06 22:14:37,906 INFO L138 Inliner]: procedures = 174, calls = 26, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 80 [2023-11-06 22:14:37,906 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:14:37,907 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:14:37,907 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:14:37,908 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:14:37,915 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:37" (1/1) ... [2023-11-06 22:14:37,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:37" (1/1) ... [2023-11-06 22:14:37,918 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:37" (1/1) ... [2023-11-06 22:14:37,919 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:37" (1/1) ... [2023-11-06 22:14:37,931 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:37" (1/1) ... [2023-11-06 22:14:37,935 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:37" (1/1) ... [2023-11-06 22:14:37,937 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:37" (1/1) ... [2023-11-06 22:14:37,938 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:37" (1/1) ... [2023-11-06 22:14:37,942 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:14:37,943 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:14:37,952 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:14:37,953 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:14:37,954 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:37" (1/1) ... [2023-11-06 22:14:37,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:14:37,973 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c17f0c3-d521-47ff-9fed-0f0a7efcffaf/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:14:37,988 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c17f0c3-d521-47ff-9fed-0f0a7efcffaf/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:14:38,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c17f0c3-d521-47ff-9fed-0f0a7efcffaf/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:14:38,037 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-06 22:14:38,037 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-06 22:14:38,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:14:38,038 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:14:38,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:14:38,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:14:38,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:14:38,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:14:38,038 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:14:38,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:14:38,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:14:38,040 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:14:38,177 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:14:38,180 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:14:38,360 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:14:38,474 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:14:38,474 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-06 22:14:38,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:14:38 BoogieIcfgContainer [2023-11-06 22:14:38,477 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:14:38,479 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:14:38,480 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:14:38,500 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:14:38,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:14:37" (1/3) ... [2023-11-06 22:14:38,501 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a89b129 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:14:38, skipping insertion in model container [2023-11-06 22:14:38,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:14:37" (2/3) ... [2023-11-06 22:14:38,501 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a89b129 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:14:38, skipping insertion in model container [2023-11-06 22:14:38,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:14:38" (3/3) ... [2023-11-06 22:14:38,503 INFO L112 eAbstractionObserver]: Analyzing ICFG 40_barrier_vf.i [2023-11-06 22:14:38,526 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:14:38,526 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-11-06 22:14:38,527 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:14:38,572 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:14:38,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 60 transitions, 124 flow [2023-11-06 22:14:38,648 INFO L124 PetriNetUnfolderBase]: 5/76 cut-off events. [2023-11-06 22:14:38,648 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:14:38,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 76 events. 5/76 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 127 event pairs, 0 based on Foata normal form. 0/62 useless extension candidates. Maximal degree in co-relation 45. Up to 4 conditions per place. [2023-11-06 22:14:38,654 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 60 transitions, 124 flow [2023-11-06 22:14:38,659 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 60 transitions, 124 flow [2023-11-06 22:14:38,663 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:14:38,674 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 60 transitions, 124 flow [2023-11-06 22:14:38,677 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 60 transitions, 124 flow [2023-11-06 22:14:38,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 60 transitions, 124 flow [2023-11-06 22:14:38,700 INFO L124 PetriNetUnfolderBase]: 5/76 cut-off events. [2023-11-06 22:14:38,701 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:14:38,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 76 events. 5/76 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 127 event pairs, 0 based on Foata normal form. 0/62 useless extension candidates. Maximal degree in co-relation 45. Up to 4 conditions per place. [2023-11-06 22:14:38,704 INFO L119 LiptonReduction]: Number of co-enabled transitions 1026 [2023-11-06 22:14:41,536 INFO L134 LiptonReduction]: Checked pairs total: 947 [2023-11-06 22:14:41,536 INFO L136 LiptonReduction]: Total number of compositions: 66 [2023-11-06 22:14:41,574 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:14:41,582 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@49073067, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:14:41,582 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-06 22:14:41,586 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:14:41,587 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-11-06 22:14:41,587 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:14:41,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:14:41,588 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-06 22:14:41,588 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-11-06 22:14:41,594 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:41,594 INFO L85 PathProgramCache]: Analyzing trace with hash 11887, now seen corresponding path program 1 times [2023-11-06 22:14:41,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:41,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592595548] [2023-11-06 22:14:41,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:41,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:41,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:41,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:14:41,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:41,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592595548] [2023-11-06 22:14:41,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592595548] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:14:41,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:14:41,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:14:41,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371450241] [2023-11-06 22:14:41,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:14:41,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:14:41,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:41,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:14:41,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:14:41,936 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 126 [2023-11-06 22:14:41,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 14 places, 11 transitions, 26 flow. Second operand has 2 states, 2 states have (on average 49.0) internal successors, (98), 2 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) [2023-11-06 22:14:41,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:14:41,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 126 [2023-11-06 22:14:41,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:14:41,979 INFO L124 PetriNetUnfolderBase]: 4/19 cut-off events. [2023-11-06 22:14:41,979 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:14:41,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 19 events. 4/19 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 31 event pairs, 4 based on Foata normal form. 0/13 useless extension candidates. Maximal degree in co-relation 26. Up to 19 conditions per place. [2023-11-06 22:14:41,981 INFO L140 encePairwiseOnDemand]: 123/126 looper letters, 7 selfloop transitions, 0 changer transitions 0/8 dead transitions. [2023-11-06 22:14:41,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 12 places, 8 transitions, 34 flow [2023-11-06 22:14:41,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:14:41,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:14:41,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 106 transitions. [2023-11-06 22:14:42,000 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42063492063492064 [2023-11-06 22:14:42,001 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 106 transitions. [2023-11-06 22:14:42,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 106 transitions. [2023-11-06 22:14:42,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:14:42,008 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 106 transitions. [2023-11-06 22:14:42,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 53.0) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:42,026 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:42,027 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:42,030 INFO L175 Difference]: Start difference. First operand has 14 places, 11 transitions, 26 flow. Second operand 2 states and 106 transitions. [2023-11-06 22:14:42,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 12 places, 8 transitions, 34 flow [2023-11-06 22:14:42,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 12 places, 8 transitions, 34 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:14:42,038 INFO L231 Difference]: Finished difference. Result has 12 places, 8 transitions, 20 flow [2023-11-06 22:14:42,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=20, PETRI_DIFFERENCE_MINUEND_PLACES=11, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=8, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=20, PETRI_PLACES=12, PETRI_TRANSITIONS=8} [2023-11-06 22:14:42,047 INFO L281 CegarLoopForPetriNet]: 14 programPoint places, -2 predicate places. [2023-11-06 22:14:42,048 INFO L495 AbstractCegarLoop]: Abstraction has has 12 places, 8 transitions, 20 flow [2023-11-06 22:14:42,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 49.0) internal successors, (98), 2 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) [2023-11-06 22:14:42,049 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:14:42,049 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-06 22:14:42,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:14:42,050 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-11-06 22:14:42,051 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:42,051 INFO L85 PathProgramCache]: Analyzing trace with hash 11897, now seen corresponding path program 1 times [2023-11-06 22:14:42,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:42,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475647164] [2023-11-06 22:14:42,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:42,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:42,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:42,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:14:42,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:42,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475647164] [2023-11-06 22:14:42,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475647164] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:14:42,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:14:42,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:14:42,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399191878] [2023-11-06 22:14:42,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:14:42,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:14:42,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:42,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:14:42,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:14:42,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 126 [2023-11-06 22:14:42,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 12 places, 8 transitions, 20 flow. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:42,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:14:42,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 126 [2023-11-06 22:14:42,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:14:42,381 INFO L124 PetriNetUnfolderBase]: 3/15 cut-off events. [2023-11-06 22:14:42,382 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:14:42,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 15 events. 3/15 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 18 event pairs, 3 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 31. Up to 14 conditions per place. [2023-11-06 22:14:42,383 INFO L140 encePairwiseOnDemand]: 124/126 looper letters, 5 selfloop transitions, 1 changer transitions 0/7 dead transitions. [2023-11-06 22:14:42,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 13 places, 7 transitions, 30 flow [2023-11-06 22:14:42,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:14:42,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:14:42,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 136 transitions. [2023-11-06 22:14:42,393 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35978835978835977 [2023-11-06 22:14:42,393 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 136 transitions. [2023-11-06 22:14:42,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 136 transitions. [2023-11-06 22:14:42,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:14:42,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 136 transitions. [2023-11-06 22:14:42,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:42,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:42,401 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:42,402 INFO L175 Difference]: Start difference. First operand has 12 places, 8 transitions, 20 flow. Second operand 3 states and 136 transitions. [2023-11-06 22:14:42,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 13 places, 7 transitions, 30 flow [2023-11-06 22:14:42,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 13 places, 7 transitions, 30 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:14:42,403 INFO L231 Difference]: Finished difference. Result has 13 places, 7 transitions, 20 flow [2023-11-06 22:14:42,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=18, PETRI_DIFFERENCE_MINUEND_PLACES=11, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=7, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=6, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=20, PETRI_PLACES=13, PETRI_TRANSITIONS=7} [2023-11-06 22:14:42,405 INFO L281 CegarLoopForPetriNet]: 14 programPoint places, -1 predicate places. [2023-11-06 22:14:42,405 INFO L495 AbstractCegarLoop]: Abstraction has has 13 places, 7 transitions, 20 flow [2023-11-06 22:14:42,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:42,406 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:14:42,406 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-06 22:14:42,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:14:42,407 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-11-06 22:14:42,407 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:42,407 INFO L85 PathProgramCache]: Analyzing trace with hash 11896, now seen corresponding path program 1 times [2023-11-06 22:14:42,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:42,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089320942] [2023-11-06 22:14:42,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:42,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:42,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:42,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:14:42,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:42,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089320942] [2023-11-06 22:14:42,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089320942] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:14:42,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:14:42,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:14:42,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623985831] [2023-11-06 22:14:42,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:14:42,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:14:42,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:42,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:14:42,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:14:42,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 126 [2023-11-06 22:14:42,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 13 places, 7 transitions, 20 flow. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:42,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:14:42,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 126 [2023-11-06 22:14:42,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:14:42,522 INFO L124 PetriNetUnfolderBase]: 2/11 cut-off events. [2023-11-06 22:14:42,522 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:14:42,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 11 events. 2/11 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 9 event pairs, 2 based on Foata normal form. 0/11 useless extension candidates. Maximal degree in co-relation 24. Up to 10 conditions per place. [2023-11-06 22:14:42,523 INFO L140 encePairwiseOnDemand]: 124/126 looper letters, 4 selfloop transitions, 1 changer transitions 0/6 dead transitions. [2023-11-06 22:14:42,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 14 places, 6 transitions, 28 flow [2023-11-06 22:14:42,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:14:42,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:14:42,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2023-11-06 22:14:42,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3412698412698413 [2023-11-06 22:14:42,527 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 129 transitions. [2023-11-06 22:14:42,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 129 transitions. [2023-11-06 22:14:42,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:14:42,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 129 transitions. [2023-11-06 22:14:42,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:42,531 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:42,532 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:42,532 INFO L175 Difference]: Start difference. First operand has 13 places, 7 transitions, 20 flow. Second operand 3 states and 129 transitions. [2023-11-06 22:14:42,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 14 places, 6 transitions, 28 flow [2023-11-06 22:14:42,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 13 places, 6 transitions, 27 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:14:42,533 INFO L231 Difference]: Finished difference. Result has 13 places, 6 transitions, 19 flow [2023-11-06 22:14:42,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=17, PETRI_DIFFERENCE_MINUEND_PLACES=11, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=6, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=5, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=19, PETRI_PLACES=13, PETRI_TRANSITIONS=6} [2023-11-06 22:14:42,535 INFO L281 CegarLoopForPetriNet]: 14 programPoint places, -1 predicate places. [2023-11-06 22:14:42,535 INFO L495 AbstractCegarLoop]: Abstraction has has 13 places, 6 transitions, 19 flow [2023-11-06 22:14:42,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:42,536 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:14:42,536 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-11-06 22:14:42,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:14:42,536 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-11-06 22:14:42,537 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:42,537 INFO L85 PathProgramCache]: Analyzing trace with hash 11440152, now seen corresponding path program 1 times [2023-11-06 22:14:42,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:42,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581660743] [2023-11-06 22:14:42,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:42,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:42,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:42,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:14:42,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:42,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581660743] [2023-11-06 22:14:42,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581660743] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:14:42,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:14:42,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:14:42,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457459778] [2023-11-06 22:14:42,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:14:42,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:14:42,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:42,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:14:42,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:14:42,706 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 126 [2023-11-06 22:14:42,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 13 places, 6 transitions, 19 flow. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:42,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:14:42,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 126 [2023-11-06 22:14:42,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:14:42,718 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-11-06 22:14:42,718 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:14:42,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20 conditions, 6 events. 0/6 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1. Compared 0 event pairs, 0 based on Foata normal form. 3/9 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2023-11-06 22:14:42,718 INFO L140 encePairwiseOnDemand]: 124/126 looper letters, 3 selfloop transitions, 1 changer transitions 0/5 dead transitions. [2023-11-06 22:14:42,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 14 places, 5 transitions, 25 flow [2023-11-06 22:14:42,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:14:42,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:14:42,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2023-11-06 22:14:42,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37037037037037035 [2023-11-06 22:14:42,721 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 140 transitions. [2023-11-06 22:14:42,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 140 transitions. [2023-11-06 22:14:42,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:14:42,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 140 transitions. [2023-11-06 22:14:42,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:42,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:42,725 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:42,725 INFO L175 Difference]: Start difference. First operand has 13 places, 6 transitions, 19 flow. Second operand 3 states and 140 transitions. [2023-11-06 22:14:42,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 14 places, 5 transitions, 25 flow [2023-11-06 22:14:42,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 13 places, 5 transitions, 24 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:14:42,726 INFO L231 Difference]: Finished difference. Result has 13 places, 5 transitions, 18 flow [2023-11-06 22:14:42,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=16, PETRI_DIFFERENCE_MINUEND_PLACES=11, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=5, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=4, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=18, PETRI_PLACES=13, PETRI_TRANSITIONS=5} [2023-11-06 22:14:42,728 INFO L281 CegarLoopForPetriNet]: 14 programPoint places, -1 predicate places. [2023-11-06 22:14:42,728 INFO L495 AbstractCegarLoop]: Abstraction has has 13 places, 5 transitions, 18 flow [2023-11-06 22:14:42,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:42,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:14:42,729 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-11-06 22:14:42,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:14:42,729 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-11-06 22:14:42,730 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:42,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1890960982, now seen corresponding path program 1 times [2023-11-06 22:14:42,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:42,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610180628] [2023-11-06 22:14:42,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:42,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:42,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:14:42,745 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:14:42,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:14:42,774 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:14:42,775 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:14:42,776 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2023-11-06 22:14:42,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining) [2023-11-06 22:14:42,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 6 remaining) [2023-11-06 22:14:42,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 6 remaining) [2023-11-06 22:14:42,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (1 of 6 remaining) [2023-11-06 22:14:42,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining) [2023-11-06 22:14:42,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:14:42,781 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-06 22:14:42,784 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-06 22:14:42,784 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-06 22:14:42,805 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:14:42,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 88 transitions, 186 flow [2023-11-06 22:14:42,835 INFO L124 PetriNetUnfolderBase]: 9/122 cut-off events. [2023-11-06 22:14:42,835 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-06 22:14:42,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 122 events. 9/122 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 313 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 77. Up to 6 conditions per place. [2023-11-06 22:14:42,837 INFO L82 GeneralOperation]: Start removeDead. Operand has 86 places, 88 transitions, 186 flow [2023-11-06 22:14:42,839 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 88 transitions, 186 flow [2023-11-06 22:14:42,839 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:14:42,840 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 88 transitions, 186 flow [2023-11-06 22:14:42,840 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 88 transitions, 186 flow [2023-11-06 22:14:42,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 88 transitions, 186 flow [2023-11-06 22:14:42,864 INFO L124 PetriNetUnfolderBase]: 9/122 cut-off events. [2023-11-06 22:14:42,864 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-06 22:14:42,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 122 events. 9/122 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 313 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 77. Up to 6 conditions per place. [2023-11-06 22:14:42,870 INFO L119 LiptonReduction]: Number of co-enabled transitions 3564 [2023-11-06 22:14:44,244 INFO L134 LiptonReduction]: Checked pairs total: 11283 [2023-11-06 22:14:44,247 INFO L136 LiptonReduction]: Total number of compositions: 74 [2023-11-06 22:14:44,250 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:14:44,251 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@49073067, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:14:44,251 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-06 22:14:44,253 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:14:44,253 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-11-06 22:14:44,253 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:14:44,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:14:44,253 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-06 22:14:44,254 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2023-11-06 22:14:44,254 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:44,254 INFO L85 PathProgramCache]: Analyzing trace with hash 18057, now seen corresponding path program 1 times [2023-11-06 22:14:44,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:44,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655380232] [2023-11-06 22:14:44,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:44,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:44,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:44,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:14:44,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:44,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655380232] [2023-11-06 22:14:44,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655380232] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:14:44,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:14:44,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:14:44,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365460463] [2023-11-06 22:14:44,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:14:44,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:14:44,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:44,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:14:44,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:14:44,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 162 [2023-11-06 22:14:44,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 88 flow. Second operand has 2 states, 2 states have (on average 67.0) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:44,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:14:44,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 162 [2023-11-06 22:14:44,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:14:44,554 INFO L124 PetriNetUnfolderBase]: 561/1074 cut-off events. [2023-11-06 22:14:44,554 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2023-11-06 22:14:44,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2005 conditions, 1074 events. 561/1074 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 6931 event pairs, 485 based on Foata normal form. 0/797 useless extension candidates. Maximal degree in co-relation 824. Up to 902 conditions per place. [2023-11-06 22:14:44,571 INFO L140 encePairwiseOnDemand]: 158/162 looper letters, 22 selfloop transitions, 0 changer transitions 0/35 dead transitions. [2023-11-06 22:14:44,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 35 transitions, 124 flow [2023-11-06 22:14:44,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:14:44,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:14:44,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 158 transitions. [2023-11-06 22:14:44,576 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4876543209876543 [2023-11-06 22:14:44,577 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 158 transitions. [2023-11-06 22:14:44,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 158 transitions. [2023-11-06 22:14:44,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:14:44,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 158 transitions. [2023-11-06 22:14:44,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 79.0) internal successors, (158), 2 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:44,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:44,585 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:44,585 INFO L175 Difference]: Start difference. First operand has 42 places, 39 transitions, 88 flow. Second operand 2 states and 158 transitions. [2023-11-06 22:14:44,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 35 transitions, 124 flow [2023-11-06 22:14:44,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 35 transitions, 124 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:14:44,588 INFO L231 Difference]: Finished difference. Result has 39 places, 35 transitions, 80 flow [2023-11-06 22:14:44,588 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=80, PETRI_PLACES=39, PETRI_TRANSITIONS=35} [2023-11-06 22:14:44,594 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2023-11-06 22:14:44,594 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 35 transitions, 80 flow [2023-11-06 22:14:44,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 67.0) internal successors, (134), 2 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:44,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:14:44,595 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-06 22:14:44,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:14:44,595 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2023-11-06 22:14:44,596 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:44,596 INFO L85 PathProgramCache]: Analyzing trace with hash 18067, now seen corresponding path program 1 times [2023-11-06 22:14:44,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:44,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655891175] [2023-11-06 22:14:44,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:44,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:44,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:44,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:14:44,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:44,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655891175] [2023-11-06 22:14:44,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655891175] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:14:44,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:14:44,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:14:44,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212128393] [2023-11-06 22:14:44,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:14:44,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:14:44,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:44,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:14:44,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:14:44,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 162 [2023-11-06 22:14:44,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 35 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:44,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:14:44,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 162 [2023-11-06 22:14:44,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:14:44,850 INFO L124 PetriNetUnfolderBase]: 402/791 cut-off events. [2023-11-06 22:14:44,850 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2023-11-06 22:14:44,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1479 conditions, 791 events. 402/791 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4800 event pairs, 345 based on Foata normal form. 0/623 useless extension candidates. Maximal degree in co-relation 1474. Up to 657 conditions per place. [2023-11-06 22:14:44,859 INFO L140 encePairwiseOnDemand]: 160/162 looper letters, 20 selfloop transitions, 1 changer transitions 0/34 dead transitions. [2023-11-06 22:14:44,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 34 transitions, 120 flow [2023-11-06 22:14:44,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:14:44,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:14:44,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 205 transitions. [2023-11-06 22:14:44,861 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4218106995884774 [2023-11-06 22:14:44,861 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 205 transitions. [2023-11-06 22:14:44,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 205 transitions. [2023-11-06 22:14:44,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:14:44,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 205 transitions. [2023-11-06 22:14:44,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:44,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:44,866 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:44,866 INFO L175 Difference]: Start difference. First operand has 39 places, 35 transitions, 80 flow. Second operand 3 states and 205 transitions. [2023-11-06 22:14:44,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 34 transitions, 120 flow [2023-11-06 22:14:44,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 34 transitions, 120 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:14:44,868 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 80 flow [2023-11-06 22:14:44,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2023-11-06 22:14:44,869 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2023-11-06 22:14:44,870 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 80 flow [2023-11-06 22:14:44,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:44,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:14:44,870 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-06 22:14:44,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:14:44,871 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2023-11-06 22:14:44,871 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:44,871 INFO L85 PathProgramCache]: Analyzing trace with hash 18066, now seen corresponding path program 1 times [2023-11-06 22:14:44,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:44,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487735571] [2023-11-06 22:14:44,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:44,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:44,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:44,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:14:44,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:44,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487735571] [2023-11-06 22:14:44,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487735571] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:14:44,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:14:44,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:14:44,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667910663] [2023-11-06 22:14:44,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:14:44,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:14:44,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:44,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:14:44,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:14:44,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 162 [2023-11-06 22:14:44,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:44,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:14:44,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 162 [2023-11-06 22:14:44,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:14:45,112 INFO L124 PetriNetUnfolderBase]: 243/508 cut-off events. [2023-11-06 22:14:45,113 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2023-11-06 22:14:45,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 954 conditions, 508 events. 243/508 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2822 event pairs, 205 based on Foata normal form. 0/449 useless extension candidates. Maximal degree in co-relation 948. Up to 413 conditions per place. [2023-11-06 22:14:45,118 INFO L140 encePairwiseOnDemand]: 160/162 looper letters, 19 selfloop transitions, 1 changer transitions 0/33 dead transitions. [2023-11-06 22:14:45,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 33 transitions, 118 flow [2023-11-06 22:14:45,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:14:45,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:14:45,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 198 transitions. [2023-11-06 22:14:45,120 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4074074074074074 [2023-11-06 22:14:45,120 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 198 transitions. [2023-11-06 22:14:45,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 198 transitions. [2023-11-06 22:14:45,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:14:45,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 198 transitions. [2023-11-06 22:14:45,122 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:45,125 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:45,125 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:45,126 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 80 flow. Second operand 3 states and 198 transitions. [2023-11-06 22:14:45,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 33 transitions, 118 flow [2023-11-06 22:14:45,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 33 transitions, 117 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:14:45,129 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 79 flow [2023-11-06 22:14:45,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=79, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2023-11-06 22:14:45,131 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2023-11-06 22:14:45,132 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 79 flow [2023-11-06 22:14:45,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:45,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:14:45,133 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-11-06 22:14:45,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:14:45,133 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2023-11-06 22:14:45,133 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:45,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1176721479, now seen corresponding path program 1 times [2023-11-06 22:14:45,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:45,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254007797] [2023-11-06 22:14:45,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:45,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:45,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:14:45,165 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:14:45,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:14:45,190 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:14:45,190 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:14:45,190 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2023-11-06 22:14:45,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2023-11-06 22:14:45,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 7 remaining) [2023-11-06 22:14:45,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 7 remaining) [2023-11-06 22:14:45,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (2 of 7 remaining) [2023-11-06 22:14:45,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2023-11-06 22:14:45,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2023-11-06 22:14:45,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:14:45,193 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-06 22:14:45,194 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-06 22:14:45,194 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-06 22:14:45,219 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:14:45,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 116 transitions, 250 flow [2023-11-06 22:14:45,247 INFO L124 PetriNetUnfolderBase]: 13/168 cut-off events. [2023-11-06 22:14:45,248 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-06 22:14:45,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 168 events. 13/168 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 503 event pairs, 0 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 126. Up to 8 conditions per place. [2023-11-06 22:14:45,249 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 116 transitions, 250 flow [2023-11-06 22:14:45,251 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 116 transitions, 250 flow [2023-11-06 22:14:45,251 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:14:45,252 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 116 transitions, 250 flow [2023-11-06 22:14:45,252 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 116 transitions, 250 flow [2023-11-06 22:14:45,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 116 transitions, 250 flow [2023-11-06 22:14:45,275 INFO L124 PetriNetUnfolderBase]: 13/168 cut-off events. [2023-11-06 22:14:45,275 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-06 22:14:45,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 168 events. 13/168 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 503 event pairs, 0 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 126. Up to 8 conditions per place. [2023-11-06 22:14:45,283 INFO L119 LiptonReduction]: Number of co-enabled transitions 7614 [2023-11-06 22:14:46,729 INFO L134 LiptonReduction]: Checked pairs total: 26798 [2023-11-06 22:14:46,729 INFO L136 LiptonReduction]: Total number of compositions: 95 [2023-11-06 22:14:46,734 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:14:46,735 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@49073067, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:14:46,735 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-11-06 22:14:46,737 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:14:46,737 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-11-06 22:14:46,737 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:14:46,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:14:46,737 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-06 22:14:46,737 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-11-06 22:14:46,738 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:46,738 INFO L85 PathProgramCache]: Analyzing trace with hash 25698, now seen corresponding path program 1 times [2023-11-06 22:14:46,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:46,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660144103] [2023-11-06 22:14:46,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:46,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:46,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:46,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:14:46,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:46,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660144103] [2023-11-06 22:14:46,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660144103] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:14:46,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:14:46,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:14:46,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665500619] [2023-11-06 22:14:46,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:14:46,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:14:46,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:46,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:14:46,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:14:46,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 211 [2023-11-06 22:14:46,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 54 transitions, 126 flow. Second operand has 2 states, 2 states have (on average 85.0) internal successors, (170), 2 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:46,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:14:46,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 211 [2023-11-06 22:14:46,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:14:48,535 INFO L124 PetriNetUnfolderBase]: 7162/11374 cut-off events. [2023-11-06 22:14:48,535 INFO L125 PetriNetUnfolderBase]: For 529/529 co-relation queries the response was YES. [2023-11-06 22:14:48,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21551 conditions, 11374 events. 7162/11374 cut-off events. For 529/529 co-relation queries the response was YES. Maximal size of possible extension queue 659. Compared 85374 event pairs, 6210 based on Foata normal form. 0/9152 useless extension candidates. Maximal degree in co-relation 1818. Up to 9879 conditions per place. [2023-11-06 22:14:48,682 INFO L140 encePairwiseOnDemand]: 206/211 looper letters, 30 selfloop transitions, 0 changer transitions 0/49 dead transitions. [2023-11-06 22:14:48,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 49 transitions, 176 flow [2023-11-06 22:14:48,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:14:48,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:14:48,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 203 transitions. [2023-11-06 22:14:48,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48104265402843605 [2023-11-06 22:14:48,685 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 203 transitions. [2023-11-06 22:14:48,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 203 transitions. [2023-11-06 22:14:48,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:14:48,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 203 transitions. [2023-11-06 22:14:48,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 101.5) internal successors, (203), 2 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:48,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:48,688 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:48,688 INFO L175 Difference]: Start difference. First operand has 58 places, 54 transitions, 126 flow. Second operand 2 states and 203 transitions. [2023-11-06 22:14:48,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 49 transitions, 176 flow [2023-11-06 22:14:48,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 49 transitions, 174 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-11-06 22:14:48,693 INFO L231 Difference]: Finished difference. Result has 54 places, 49 transitions, 114 flow [2023-11-06 22:14:48,693 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=114, PETRI_PLACES=54, PETRI_TRANSITIONS=49} [2023-11-06 22:14:48,694 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -4 predicate places. [2023-11-06 22:14:48,694 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 49 transitions, 114 flow [2023-11-06 22:14:48,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 85.0) internal successors, (170), 2 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:48,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:14:48,695 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-06 22:14:48,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:14:48,695 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-11-06 22:14:48,696 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:48,696 INFO L85 PathProgramCache]: Analyzing trace with hash 25712, now seen corresponding path program 1 times [2023-11-06 22:14:48,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:48,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650030867] [2023-11-06 22:14:48,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:48,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:48,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:48,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:14:48,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:48,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650030867] [2023-11-06 22:14:48,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650030867] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:14:48,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:14:48,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:14:48,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785632414] [2023-11-06 22:14:48,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:14:48,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:14:48,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:48,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:14:48,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:14:48,806 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 211 [2023-11-06 22:14:48,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 49 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:48,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:14:48,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 211 [2023-11-06 22:14:48,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:14:50,044 INFO L124 PetriNetUnfolderBase]: 5221/8413 cut-off events. [2023-11-06 22:14:50,044 INFO L125 PetriNetUnfolderBase]: For 333/333 co-relation queries the response was YES. [2023-11-06 22:14:50,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15904 conditions, 8413 events. 5221/8413 cut-off events. For 333/333 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 61307 event pairs, 4507 based on Foata normal form. 0/7063 useless extension candidates. Maximal degree in co-relation 15898. Up to 7258 conditions per place. [2023-11-06 22:14:50,121 INFO L140 encePairwiseOnDemand]: 209/211 looper letters, 28 selfloop transitions, 1 changer transitions 0/48 dead transitions. [2023-11-06 22:14:50,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 48 transitions, 170 flow [2023-11-06 22:14:50,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:14:50,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:14:50,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 267 transitions. [2023-11-06 22:14:50,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4218009478672986 [2023-11-06 22:14:50,124 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 267 transitions. [2023-11-06 22:14:50,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 267 transitions. [2023-11-06 22:14:50,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:14:50,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 267 transitions. [2023-11-06 22:14:50,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:50,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:50,129 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:50,129 INFO L175 Difference]: Start difference. First operand has 54 places, 49 transitions, 114 flow. Second operand 3 states and 267 transitions. [2023-11-06 22:14:50,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 48 transitions, 170 flow [2023-11-06 22:14:50,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 48 transitions, 170 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:14:50,136 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 114 flow [2023-11-06 22:14:50,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2023-11-06 22:14:50,138 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2023-11-06 22:14:50,138 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 114 flow [2023-11-06 22:14:50,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:50,139 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:14:50,139 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-06 22:14:50,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:14:50,139 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-11-06 22:14:50,140 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:50,140 INFO L85 PathProgramCache]: Analyzing trace with hash 25714, now seen corresponding path program 1 times [2023-11-06 22:14:50,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:50,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035889797] [2023-11-06 22:14:50,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:50,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:50,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:50,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:14:50,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:50,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035889797] [2023-11-06 22:14:50,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035889797] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:14:50,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:14:50,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:14:50,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963654409] [2023-11-06 22:14:50,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:14:50,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:14:50,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:50,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:14:50,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:14:50,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 211 [2023-11-06 22:14:50,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:50,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:14:50,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 211 [2023-11-06 22:14:50,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:14:50,989 INFO L124 PetriNetUnfolderBase]: 3280/5452 cut-off events. [2023-11-06 22:14:50,990 INFO L125 PetriNetUnfolderBase]: For 333/333 co-relation queries the response was YES. [2023-11-06 22:14:51,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10325 conditions, 5452 events. 3280/5452 cut-off events. For 333/333 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 38227 event pairs, 2804 based on Foata normal form. 0/4974 useless extension candidates. Maximal degree in co-relation 10318. Up to 4638 conditions per place. [2023-11-06 22:14:51,043 INFO L140 encePairwiseOnDemand]: 209/211 looper letters, 27 selfloop transitions, 1 changer transitions 0/47 dead transitions. [2023-11-06 22:14:51,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 47 transitions, 168 flow [2023-11-06 22:14:51,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:14:51,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:14:51,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 260 transitions. [2023-11-06 22:14:51,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4107424960505529 [2023-11-06 22:14:51,046 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 260 transitions. [2023-11-06 22:14:51,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 260 transitions. [2023-11-06 22:14:51,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:14:51,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 260 transitions. [2023-11-06 22:14:51,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:51,050 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:51,053 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:51,053 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 114 flow. Second operand 3 states and 260 transitions. [2023-11-06 22:14:51,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 47 transitions, 168 flow [2023-11-06 22:14:51,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 47 transitions, 167 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:14:51,057 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 113 flow [2023-11-06 22:14:51,058 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2023-11-06 22:14:51,060 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2023-11-06 22:14:51,061 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 113 flow [2023-11-06 22:14:51,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:51,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:14:51,061 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:14:51,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:14:51,062 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-11-06 22:14:51,062 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:51,063 INFO L85 PathProgramCache]: Analyzing trace with hash -568896821, now seen corresponding path program 1 times [2023-11-06 22:14:51,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:51,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089786312] [2023-11-06 22:14:51,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:51,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:51,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:51,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:14:51,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:51,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089786312] [2023-11-06 22:14:51,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089786312] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:14:51,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:14:51,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:14:51,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687796563] [2023-11-06 22:14:51,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:14:51,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:14:51,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:51,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:14:51,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:14:51,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 211 [2023-11-06 22:14:51,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:51,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:14:51,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 211 [2023-11-06 22:14:51,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:14:53,632 INFO L124 PetriNetUnfolderBase]: 12355/19121 cut-off events. [2023-11-06 22:14:53,633 INFO L125 PetriNetUnfolderBase]: For 705/705 co-relation queries the response was YES. [2023-11-06 22:14:53,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37590 conditions, 19121 events. 12355/19121 cut-off events. For 705/705 co-relation queries the response was YES. Maximal size of possible extension queue 1107. Compared 145180 event pairs, 2185 based on Foata normal form. 280/18732 useless extension candidates. Maximal degree in co-relation 37583. Up to 7379 conditions per place. [2023-11-06 22:14:53,898 INFO L140 encePairwiseOnDemand]: 199/211 looper letters, 130 selfloop transitions, 26 changer transitions 0/168 dead transitions. [2023-11-06 22:14:53,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 168 transitions, 707 flow [2023-11-06 22:14:53,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:14:53,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:14:53,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 657 transitions. [2023-11-06 22:14:53,902 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4448205822613406 [2023-11-06 22:14:53,903 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 657 transitions. [2023-11-06 22:14:53,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 657 transitions. [2023-11-06 22:14:53,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:14:53,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 657 transitions. [2023-11-06 22:14:53,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 93.85714285714286) internal successors, (657), 7 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:53,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 211.0) internal successors, (1688), 8 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:53,910 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 211.0) internal successors, (1688), 8 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:53,910 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 113 flow. Second operand 7 states and 657 transitions. [2023-11-06 22:14:53,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 168 transitions, 707 flow [2023-11-06 22:14:53,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 168 transitions, 706 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:14:53,916 INFO L231 Difference]: Finished difference. Result has 66 places, 77 transitions, 326 flow [2023-11-06 22:14:53,916 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=326, PETRI_PLACES=66, PETRI_TRANSITIONS=77} [2023-11-06 22:14:53,917 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 8 predicate places. [2023-11-06 22:14:53,917 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 77 transitions, 326 flow [2023-11-06 22:14:53,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:53,917 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:14:53,918 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:14:53,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:14:53,918 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-11-06 22:14:53,918 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:53,919 INFO L85 PathProgramCache]: Analyzing trace with hash -331992690, now seen corresponding path program 1 times [2023-11-06 22:14:53,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:53,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973212336] [2023-11-06 22:14:53,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:53,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:53,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:53,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:14:53,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:53,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973212336] [2023-11-06 22:14:53,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973212336] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:14:53,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:14:53,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:14:53,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165474259] [2023-11-06 22:14:53,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:14:53,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:14:53,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:53,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:14:53,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:14:54,004 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 211 [2023-11-06 22:14:54,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 77 transitions, 326 flow. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:54,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:14:54,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 211 [2023-11-06 22:14:54,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:14:55,330 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([702] L719-1-->L724: Formula: (not (= (mod v_~count~0_83 4294967296) 3)) InVars {~count~0=v_~count~0_83} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_17|, ~count~0=v_~count~0_83} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [8#L733-5true, 104#L724true, 145#(= ~COND~0 0), Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, 17#L724-6true, thr1Thread3of3ForFork0InUse, 7#L725true, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-06 22:14:55,330 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-06 22:14:55,330 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 22:14:55,330 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 22:14:55,330 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 22:14:55,336 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([701] L719-1-->L721: Formula: (= 3 (mod v_~count~0_81 4294967296)) InVars {~count~0=v_~count~0_81} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_81} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [8#L733-5true, 145#(= ~COND~0 0), Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, 17#L724-6true, 51#L721true, thr1Thread3of3ForFork0InUse, 7#L725true, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-06 22:14:55,336 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-06 22:14:55,337 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 22:14:55,337 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 22:14:55,337 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 22:14:55,381 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([700] L719-1-->L724: Formula: (not (= 3 (mod v_~count~0_79 4294967296))) InVars {~count~0=v_~count~0_79} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_19|, ~count~0=v_~count~0_79} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][39], [8#L733-5true, 44#L725true, 145#(= ~COND~0 0), Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, 17#L724-6true, thr1Thread3of3ForFork0InUse, 48#L724true, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-06 22:14:55,382 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-06 22:14:55,382 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 22:14:55,382 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 22:14:55,383 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 22:14:55,383 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([699] L719-1-->L721: Formula: (= (mod v_~count~0_77 4294967296) 3) InVars {~count~0=v_~count~0_77} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_17|, ~count~0=v_~count~0_77} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][40], [8#L733-5true, 44#L725true, 145#(= ~COND~0 0), Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), 54#L721true, Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, 17#L724-6true, thr1Thread3of3ForFork0InUse, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-06 22:14:55,383 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-06 22:14:55,383 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 22:14:55,383 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 22:14:55,384 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-06 22:14:55,527 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([702] L719-1-->L724: Formula: (not (= (mod v_~count~0_83 4294967296) 3)) InVars {~count~0=v_~count~0_83} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_17|, ~count~0=v_~count~0_83} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [8#L733-5true, 104#L724true, 145#(= ~COND~0 0), 107#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, 17#L724-6true, thr1Thread3of3ForFork0InUse, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-06 22:14:55,527 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-06 22:14:55,527 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 22:14:55,527 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 22:14:55,527 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 22:14:55,534 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([701] L719-1-->L721: Formula: (= 3 (mod v_~count~0_81 4294967296)) InVars {~count~0=v_~count~0_81} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_81} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [8#L733-5true, 145#(= ~COND~0 0), 107#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, 17#L724-6true, 51#L721true, thr1Thread3of3ForFork0InUse, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-06 22:14:55,534 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-06 22:14:55,534 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 22:14:55,534 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 22:14:55,535 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 22:14:55,578 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([700] L719-1-->L724: Formula: (not (= 3 (mod v_~count~0_79 4294967296))) InVars {~count~0=v_~count~0_79} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_19|, ~count~0=v_~count~0_79} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][39], [8#L733-5true, 145#(= ~COND~0 0), Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), 53#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, 17#L724-6true, thr1Thread3of3ForFork0InUse, 48#L724true, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-06 22:14:55,578 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-06 22:14:55,579 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 22:14:55,579 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 22:14:55,579 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 22:14:55,579 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([699] L719-1-->L721: Formula: (= (mod v_~count~0_77 4294967296) 3) InVars {~count~0=v_~count~0_77} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_17|, ~count~0=v_~count~0_77} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][40], [8#L733-5true, 145#(= ~COND~0 0), Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), 53#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), 54#L721true, Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, 17#L724-6true, thr1Thread3of3ForFork0InUse, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-06 22:14:55,580 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-06 22:14:55,580 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 22:14:55,580 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 22:14:55,580 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 22:14:55,594 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([702] L719-1-->L724: Formula: (not (= (mod v_~count~0_83 4294967296) 3)) InVars {~count~0=v_~count~0_83} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_17|, ~count~0=v_~count~0_83} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [8#L733-5true, 104#L724true, 145#(= ~COND~0 0), 107#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, 17#L724-6true, thr1Thread3of3ForFork0InUse, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-06 22:14:55,594 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-06 22:14:55,594 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 22:14:55,594 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 22:14:55,594 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 22:14:55,595 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 22:14:55,595 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([701] L719-1-->L721: Formula: (= 3 (mod v_~count~0_81 4294967296)) InVars {~count~0=v_~count~0_81} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_81} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [8#L733-5true, 145#(= ~COND~0 0), 107#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, 17#L724-6true, 51#L721true, thr1Thread3of3ForFork0InUse, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-06 22:14:55,595 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-11-06 22:14:55,595 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 22:14:55,595 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 22:14:55,595 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 22:14:55,596 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-11-06 22:14:55,872 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([702] L719-1-->L724: Formula: (not (= (mod v_~count~0_83 4294967296) 3)) InVars {~count~0=v_~count~0_83} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_17|, ~count~0=v_~count~0_83} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [104#L724true, 145#(= ~COND~0 0), Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, 17#L724-6true, 25#L733-4true, thr1Thread3of3ForFork0InUse, 7#L725true, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-06 22:14:55,872 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-06 22:14:55,872 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 22:14:55,872 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 22:14:55,872 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 22:14:55,873 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([701] L719-1-->L721: Formula: (= 3 (mod v_~count~0_81 4294967296)) InVars {~count~0=v_~count~0_81} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_81} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [145#(= ~COND~0 0), Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, 51#L721true, 17#L724-6true, thr1Thread3of3ForFork0InUse, 25#L733-4true, 7#L725true, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-06 22:14:55,873 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-06 22:14:55,873 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 22:14:55,873 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 22:14:55,873 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 22:14:55,926 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([702] L719-1-->L724: Formula: (not (= (mod v_~count~0_83 4294967296) 3)) InVars {~count~0=v_~count~0_83} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_17|, ~count~0=v_~count~0_83} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [75#L725true, 8#L733-5true, 104#L724true, 145#(= ~COND~0 0), 107#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, thr1Thread3of3ForFork0InUse, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-06 22:14:55,926 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-06 22:14:55,926 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 22:14:55,926 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 22:14:55,926 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 22:14:55,926 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([701] L719-1-->L721: Formula: (= 3 (mod v_~count~0_81 4294967296)) InVars {~count~0=v_~count~0_81} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_81} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [75#L725true, 8#L733-5true, 145#(= ~COND~0 0), 107#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, 51#L721true, thr1Thread3of3ForFork0InUse, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-06 22:14:55,926 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-06 22:14:55,926 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 22:14:55,926 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 22:14:55,926 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-06 22:14:55,983 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([700] L719-1-->L724: Formula: (not (= 3 (mod v_~count~0_79 4294967296))) InVars {~count~0=v_~count~0_79} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_19|, ~count~0=v_~count~0_79} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][39], [44#L725true, 145#(= ~COND~0 0), Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, 17#L724-6true, 25#L733-4true, thr1Thread3of3ForFork0InUse, 48#L724true, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-06 22:14:55,983 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-06 22:14:55,983 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 22:14:55,983 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 22:14:55,983 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 22:14:55,984 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([699] L719-1-->L721: Formula: (= (mod v_~count~0_77 4294967296) 3) InVars {~count~0=v_~count~0_77} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_17|, ~count~0=v_~count~0_77} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][40], [44#L725true, 145#(= ~COND~0 0), Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), 54#L721true, Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, 17#L724-6true, thr1Thread3of3ForFork0InUse, 25#L733-4true, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-06 22:14:55,984 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-06 22:14:55,984 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 22:14:55,984 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 22:14:55,984 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 22:14:56,001 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([702] L719-1-->L724: Formula: (not (= (mod v_~count~0_83 4294967296) 3)) InVars {~count~0=v_~count~0_83} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_17|, ~count~0=v_~count~0_83} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [104#L724true, 145#(= ~COND~0 0), 107#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, 17#L724-6true, 25#L733-4true, thr1Thread3of3ForFork0InUse, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-06 22:14:56,001 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-06 22:14:56,001 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:14:56,001 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:14:56,001 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:14:56,002 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([701] L719-1-->L721: Formula: (= 3 (mod v_~count~0_81 4294967296)) InVars {~count~0=v_~count~0_81} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_81} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [145#(= ~COND~0 0), 107#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, 51#L721true, 17#L724-6true, thr1Thread3of3ForFork0InUse, 25#L733-4true, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-06 22:14:56,002 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-06 22:14:56,002 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:14:56,002 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:14:56,002 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:14:56,058 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([702] L719-1-->L724: Formula: (not (= (mod v_~count~0_83 4294967296) 3)) InVars {~count~0=v_~count~0_83} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_17|, ~count~0=v_~count~0_83} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [8#L733-5true, 104#L724true, 145#(= ~COND~0 0), 107#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), 47#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, thr1Thread3of3ForFork0InUse, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-06 22:14:56,058 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-06 22:14:56,058 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 22:14:56,059 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 22:14:56,059 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 22:14:56,059 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([701] L719-1-->L721: Formula: (= 3 (mod v_~count~0_81 4294967296)) InVars {~count~0=v_~count~0_81} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_81} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [8#L733-5true, 145#(= ~COND~0 0), 107#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, 47#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, 51#L721true, thr1Thread3of3ForFork0InUse, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-06 22:14:56,059 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-06 22:14:56,059 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 22:14:56,059 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 22:14:56,060 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-06 22:14:56,141 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([700] L719-1-->L724: Formula: (not (= 3 (mod v_~count~0_79 4294967296))) InVars {~count~0=v_~count~0_79} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_19|, ~count~0=v_~count~0_79} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][39], [145#(= ~COND~0 0), Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), 53#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, 17#L724-6true, 25#L733-4true, thr1Thread3of3ForFork0InUse, 48#L724true, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-06 22:14:56,141 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-06 22:14:56,141 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:14:56,141 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:14:56,142 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:14:56,142 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([699] L719-1-->L721: Formula: (= (mod v_~count~0_77 4294967296) 3) InVars {~count~0=v_~count~0_77} OutVars{thr1Thread3of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread3of3ForFork0_Barrier2_#t~post4#1_17|, ~count~0=v_~count~0_77} AuxVars[] AssignedVars[thr1Thread3of3ForFork0_Barrier2_#t~post4#1][40], [145#(= ~COND~0 0), Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), 53#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), 54#L721true, Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, 17#L724-6true, thr1Thread3of3ForFork0InUse, 25#L733-4true, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-06 22:14:56,142 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-06 22:14:56,142 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:14:56,142 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:14:56,143 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:14:56,153 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([702] L719-1-->L724: Formula: (not (= (mod v_~count~0_83 4294967296) 3)) InVars {~count~0=v_~count~0_83} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_17|, ~count~0=v_~count~0_83} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [145#(= ~COND~0 0), 104#L724true, 107#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, 17#L724-6true, thr1Thread3of3ForFork0InUse, 25#L733-4true, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-06 22:14:56,153 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-06 22:14:56,154 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:14:56,154 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:14:56,154 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:14:56,154 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:14:56,154 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([701] L719-1-->L721: Formula: (= 3 (mod v_~count~0_81 4294967296)) InVars {~count~0=v_~count~0_81} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_81} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [145#(= ~COND~0 0), 107#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, 51#L721true, 17#L724-6true, thr1Thread3of3ForFork0InUse, 25#L733-4true, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-06 22:14:56,154 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-06 22:14:56,154 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:14:56,155 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:14:56,155 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:14:56,155 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-06 22:14:56,264 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([702] L719-1-->L724: Formula: (not (= (mod v_~count~0_83 4294967296) 3)) InVars {~count~0=v_~count~0_83} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_17|, ~count~0=v_~count~0_83} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [75#L725true, 104#L724true, 145#(= ~COND~0 0), 107#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, thr1Thread3of3ForFork0InUse, 25#L733-4true, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-06 22:14:56,265 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-06 22:14:56,265 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 22:14:56,265 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 22:14:56,265 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 22:14:56,265 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([701] L719-1-->L721: Formula: (= 3 (mod v_~count~0_81 4294967296)) InVars {~count~0=v_~count~0_81} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_81} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [75#L725true, 145#(= ~COND~0 0), 107#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, 51#L721true, thr1Thread3of3ForFork0InUse, 25#L733-4true, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-06 22:14:56,266 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-06 22:14:56,266 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 22:14:56,266 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 22:14:56,266 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-06 22:14:56,341 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([702] L719-1-->L724: Formula: (not (= (mod v_~count~0_83 4294967296) 3)) InVars {~count~0=v_~count~0_83} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_17|, ~count~0=v_~count~0_83} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][33], [104#L724true, 145#(= ~COND~0 0), 107#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), 47#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, thr1Thread3of3ForFork0InUse, 25#L733-4true, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-06 22:14:56,341 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-06 22:14:56,342 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 22:14:56,342 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 22:14:56,342 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 22:14:56,342 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([701] L719-1-->L721: Formula: (= 3 (mod v_~count~0_81 4294967296)) InVars {~count~0=v_~count~0_81} OutVars{thr1Thread1of3ForFork0_Barrier2_#t~post4#1=|v_thr1Thread1of3ForFork0_Barrier2_#t~post4#1_15|, ~count~0=v_~count~0_81} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_Barrier2_#t~post4#1][34], [145#(= ~COND~0 0), 107#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, 47#thr1Err0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 130#(= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0), Black: 135#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 131#(and (<= 0 (div ~count~0 4294967296)) (<= ~count~0 1)), Black: 133#(and (= ~count~0 0) (= |thr1Thread1of3ForFork0_Barrier2_#t~post4#1| 0)), Black: 129#(= ~count~0 0), 125#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), thr1Thread1of3ForFork0InUse, thr1Thread2of3ForFork0InUse, 116#true, 51#L721true, thr1Thread3of3ForFork0InUse, 25#L733-4true, 127#true, 121#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#t~0#1.base|)))]) [2023-11-06 22:14:56,342 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-06 22:14:56,343 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 22:14:56,343 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 22:14:56,343 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-06 22:14:56,543 INFO L124 PetriNetUnfolderBase]: 13844/21481 cut-off events. [2023-11-06 22:14:56,543 INFO L125 PetriNetUnfolderBase]: For 13605/15222 co-relation queries the response was YES. [2023-11-06 22:14:56,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50616 conditions, 21481 events. 13844/21481 cut-off events. For 13605/15222 co-relation queries the response was YES. Maximal size of possible extension queue 1401. Compared 168587 event pairs, 5116 based on Foata normal form. 1145/21859 useless extension candidates. Maximal degree in co-relation 50604. Up to 9908 conditions per place. [2023-11-06 22:14:56,764 INFO L140 encePairwiseOnDemand]: 201/211 looper letters, 75 selfloop transitions, 7 changer transitions 0/115 dead transitions. [2023-11-06 22:14:56,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 115 transitions, 627 flow [2023-11-06 22:14:56,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:14:56,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:14:56,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2023-11-06 22:14:56,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4676145339652449 [2023-11-06 22:14:56,767 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 296 transitions. [2023-11-06 22:14:56,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 296 transitions. [2023-11-06 22:14:56,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:14:56,768 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 296 transitions. [2023-11-06 22:14:56,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:56,770 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:56,771 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:56,771 INFO L175 Difference]: Start difference. First operand has 66 places, 77 transitions, 326 flow. Second operand 3 states and 296 transitions. [2023-11-06 22:14:56,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 115 transitions, 627 flow [2023-11-06 22:14:56,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 115 transitions, 627 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:14:56,821 INFO L231 Difference]: Finished difference. Result has 70 places, 83 transitions, 384 flow [2023-11-06 22:14:56,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=384, PETRI_PLACES=70, PETRI_TRANSITIONS=83} [2023-11-06 22:14:56,822 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 12 predicate places. [2023-11-06 22:14:56,822 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 83 transitions, 384 flow [2023-11-06 22:14:56,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:56,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:14:56,823 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2023-11-06 22:14:56,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:14:56,824 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2023-11-06 22:14:56,824 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:56,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1051817941, now seen corresponding path program 1 times [2023-11-06 22:14:56,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:56,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912890458] [2023-11-06 22:14:56,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:56,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:56,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:14:56,836 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:14:56,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:14:56,849 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:14:56,850 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:14:56,850 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2023-11-06 22:14:56,850 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2023-11-06 22:14:56,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 8 remaining) [2023-11-06 22:14:56,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 8 remaining) [2023-11-06 22:14:56,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (3 of 8 remaining) [2023-11-06 22:14:56,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (2 of 8 remaining) [2023-11-06 22:14:56,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 8 remaining) [2023-11-06 22:14:56,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2023-11-06 22:14:56,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:14:56,852 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-06 22:14:56,853 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-06 22:14:56,853 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-11-06 22:14:56,877 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:14:56,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 144 transitions, 316 flow [2023-11-06 22:14:56,916 INFO L124 PetriNetUnfolderBase]: 17/214 cut-off events. [2023-11-06 22:14:56,916 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-06 22:14:56,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 214 events. 17/214 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 687 event pairs, 0 based on Foata normal form. 0/173 useless extension candidates. Maximal degree in co-relation 176. Up to 10 conditions per place. [2023-11-06 22:14:56,918 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 144 transitions, 316 flow [2023-11-06 22:14:56,920 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 144 transitions, 316 flow [2023-11-06 22:14:56,920 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:14:56,920 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 144 transitions, 316 flow [2023-11-06 22:14:56,921 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 144 transitions, 316 flow [2023-11-06 22:14:56,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 144 transitions, 316 flow [2023-11-06 22:14:56,953 INFO L124 PetriNetUnfolderBase]: 17/214 cut-off events. [2023-11-06 22:14:56,953 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-06 22:14:56,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 214 events. 17/214 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 687 event pairs, 0 based on Foata normal form. 0/173 useless extension candidates. Maximal degree in co-relation 176. Up to 10 conditions per place. [2023-11-06 22:14:56,967 INFO L119 LiptonReduction]: Number of co-enabled transitions 13176 [2023-11-06 22:14:58,355 INFO L134 LiptonReduction]: Checked pairs total: 48221 [2023-11-06 22:14:58,355 INFO L136 LiptonReduction]: Total number of compositions: 113 [2023-11-06 22:14:58,357 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:14:58,357 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@49073067, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:14:58,357 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-11-06 22:14:58,358 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:14:58,359 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-11-06 22:14:58,359 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:14:58,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:14:58,359 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-06 22:14:58,359 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-11-06 22:14:58,359 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:14:58,360 INFO L85 PathProgramCache]: Analyzing trace with hash 34812, now seen corresponding path program 1 times [2023-11-06 22:14:58,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:14:58,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142167438] [2023-11-06 22:14:58,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:14:58,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:14:58,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:14:58,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:14:58,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:14:58,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142167438] [2023-11-06 22:14:58,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142167438] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:14:58,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:14:58,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:14:58,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374767321] [2023-11-06 22:14:58,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:14:58,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:14:58,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:14:58,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:14:58,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:14:58,373 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 257 [2023-11-06 22:14:58,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 69 transitions, 166 flow. Second operand has 2 states, 2 states have (on average 103.0) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:14:58,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:14:58,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 257 [2023-11-06 22:14:58,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:15:09,253 INFO L124 PetriNetUnfolderBase]: 78973/112782 cut-off events. [2023-11-06 22:15:09,253 INFO L125 PetriNetUnfolderBase]: For 7449/7449 co-relation queries the response was YES. [2023-11-06 22:15:09,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216434 conditions, 112782 events. 78973/112782 cut-off events. For 7449/7449 co-relation queries the response was YES. Maximal size of possible extension queue 4755. Compared 914592 event pairs, 68637 based on Foata normal form. 0/94939 useless extension candidates. Maximal degree in co-relation 19526. Up to 100698 conditions per place. [2023-11-06 22:15:10,080 INFO L140 encePairwiseOnDemand]: 251/257 looper letters, 38 selfloop transitions, 0 changer transitions 0/63 dead transitions. [2023-11-06 22:15:10,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 63 transitions, 230 flow [2023-11-06 22:15:10,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:15:10,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:15:10,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 248 transitions. [2023-11-06 22:15:10,083 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48249027237354086 [2023-11-06 22:15:10,083 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 248 transitions. [2023-11-06 22:15:10,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 248 transitions. [2023-11-06 22:15:10,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:15:10,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 248 transitions. [2023-11-06 22:15:10,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 124.0) internal successors, (248), 2 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:15:10,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:15:10,087 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:15:10,087 INFO L175 Difference]: Start difference. First operand has 74 places, 69 transitions, 166 flow. Second operand 2 states and 248 transitions. [2023-11-06 22:15:10,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 63 transitions, 230 flow [2023-11-06 22:15:10,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 63 transitions, 224 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-11-06 22:15:10,095 INFO L231 Difference]: Finished difference. Result has 69 places, 63 transitions, 148 flow [2023-11-06 22:15:10,095 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=148, PETRI_PLACES=69, PETRI_TRANSITIONS=63} [2023-11-06 22:15:10,097 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -5 predicate places. [2023-11-06 22:15:10,097 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 63 transitions, 148 flow [2023-11-06 22:15:10,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 103.0) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:15:10,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:15:10,098 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-06 22:15:10,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 22:15:10,098 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-11-06 22:15:10,098 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:15:10,098 INFO L85 PathProgramCache]: Analyzing trace with hash 34825, now seen corresponding path program 1 times [2023-11-06 22:15:10,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:15:10,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505537217] [2023-11-06 22:15:10,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:15:10,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:15:10,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:10,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:15:10,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:15:10,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505537217] [2023-11-06 22:15:10,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505537217] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:15:10,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:15:10,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:15:10,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806369] [2023-11-06 22:15:10,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:15:10,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:15:10,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:15:10,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:15:10,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:15:10,153 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 257 [2023-11-06 22:15:10,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 63 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:15:10,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:15:10,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 257 [2023-11-06 22:15:10,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:15:17,286 INFO L124 PetriNetUnfolderBase]: 58024/83640 cut-off events. [2023-11-06 22:15:17,287 INFO L125 PetriNetUnfolderBase]: For 3616/3616 co-relation queries the response was YES. [2023-11-06 22:15:17,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159784 conditions, 83640 events. 58024/83640 cut-off events. For 3616/3616 co-relation queries the response was YES. Maximal size of possible extension queue 3530. Compared 666467 event pairs, 50272 based on Foata normal form. 0/72786 useless extension candidates. Maximal degree in co-relation 159777. Up to 74317 conditions per place. [2023-11-06 22:15:17,852 INFO L140 encePairwiseOnDemand]: 255/257 looper letters, 36 selfloop transitions, 1 changer transitions 0/62 dead transitions. [2023-11-06 22:15:17,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 62 transitions, 220 flow [2023-11-06 22:15:17,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:15:17,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:15:17,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 329 transitions. [2023-11-06 22:15:17,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4267185473411154 [2023-11-06 22:15:17,855 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 329 transitions. [2023-11-06 22:15:17,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 329 transitions. [2023-11-06 22:15:17,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:15:17,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 329 transitions. [2023-11-06 22:15:17,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:15:17,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:15:17,859 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:15:17,859 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 148 flow. Second operand 3 states and 329 transitions. [2023-11-06 22:15:17,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 62 transitions, 220 flow [2023-11-06 22:15:17,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 62 transitions, 220 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:15:17,868 INFO L231 Difference]: Finished difference. Result has 70 places, 62 transitions, 148 flow [2023-11-06 22:15:17,868 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=70, PETRI_TRANSITIONS=62} [2023-11-06 22:15:17,869 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -4 predicate places. [2023-11-06 22:15:17,869 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 62 transitions, 148 flow [2023-11-06 22:15:17,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:15:17,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:15:17,870 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-06 22:15:17,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 22:15:17,870 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-11-06 22:15:17,870 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:15:17,871 INFO L85 PathProgramCache]: Analyzing trace with hash 34824, now seen corresponding path program 1 times [2023-11-06 22:15:17,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:15:17,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315877709] [2023-11-06 22:15:17,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:15:17,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:15:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:17,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:15:17,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:15:17,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315877709] [2023-11-06 22:15:17,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315877709] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:15:17,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:15:17,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:15:17,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625205398] [2023-11-06 22:15:17,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:15:17,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:15:17,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:15:17,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:15:17,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:15:17,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 257 [2023-11-06 22:15:17,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 62 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:15:17,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:15:17,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 257 [2023-11-06 22:15:17,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:15:22,416 INFO L124 PetriNetUnfolderBase]: 37075/54498 cut-off events. [2023-11-06 22:15:22,416 INFO L125 PetriNetUnfolderBase]: For 3616/3616 co-relation queries the response was YES. [2023-11-06 22:15:22,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104264 conditions, 54498 events. 37075/54498 cut-off events. For 3616/3616 co-relation queries the response was YES. Maximal size of possible extension queue 2332. Compared 425884 event pairs, 31907 based on Foata normal form. 0/50633 useless extension candidates. Maximal degree in co-relation 104256. Up to 47937 conditions per place. [2023-11-06 22:15:23,071 INFO L140 encePairwiseOnDemand]: 255/257 looper letters, 35 selfloop transitions, 1 changer transitions 0/61 dead transitions. [2023-11-06 22:15:23,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 61 transitions, 218 flow [2023-11-06 22:15:23,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:15:23,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:15:23,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 322 transitions. [2023-11-06 22:15:23,074 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4176394293125811 [2023-11-06 22:15:23,074 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 322 transitions. [2023-11-06 22:15:23,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 322 transitions. [2023-11-06 22:15:23,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:15:23,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 322 transitions. [2023-11-06 22:15:23,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:15:23,078 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:15:23,079 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:15:23,079 INFO L175 Difference]: Start difference. First operand has 70 places, 62 transitions, 148 flow. Second operand 3 states and 322 transitions. [2023-11-06 22:15:23,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 61 transitions, 218 flow [2023-11-06 22:15:23,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 61 transitions, 217 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:15:23,089 INFO L231 Difference]: Finished difference. Result has 70 places, 61 transitions, 147 flow [2023-11-06 22:15:23,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=147, PETRI_PLACES=70, PETRI_TRANSITIONS=61} [2023-11-06 22:15:23,090 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -4 predicate places. [2023-11-06 22:15:23,090 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 61 transitions, 147 flow [2023-11-06 22:15:23,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:15:23,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:15:23,091 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:15:23,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 22:15:23,091 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-11-06 22:15:23,092 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:15:23,092 INFO L85 PathProgramCache]: Analyzing trace with hash 142165112, now seen corresponding path program 1 times [2023-11-06 22:15:23,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:15:23,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019644719] [2023-11-06 22:15:23,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:15:23,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:15:23,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:15:23,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:15:23,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:15:23,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019644719] [2023-11-06 22:15:23,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019644719] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:15:23,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:15:23,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:15:23,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155779671] [2023-11-06 22:15:23,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:15:23,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:15:23,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:15:23,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:15:23,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:15:23,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 257 [2023-11-06 22:15:23,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 61 transitions, 147 flow. Second operand has 5 states, 5 states have (on average 87.0) internal successors, (435), 5 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:15:23,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:15:23,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 257 [2023-11-06 22:15:23,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand