./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/goblint-regression/36-apron_21-traces-cluster-based_true.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c855d1da-864a-4d4a-bdd4-18f058fefa14/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c855d1da-864a-4d4a-bdd4-18f058fefa14/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c855d1da-864a-4d4a-bdd4-18f058fefa14/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c855d1da-864a-4d4a-bdd4-18f058fefa14/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/goblint-regression/36-apron_21-traces-cluster-based_true.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c855d1da-864a-4d4a-bdd4-18f058fefa14/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c855d1da-864a-4d4a-bdd4-18f058fefa14/bin/uautomizer-verify-uCwYo4JHxu --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cec155e54548239c459fec40910e358deb5fad2ceffa658bfdeefddd1bc9e166 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 08:01:47,293 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 08:01:47,410 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c855d1da-864a-4d4a-bdd4-18f058fefa14/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-19 08:01:47,421 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 08:01:47,422 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 08:01:47,469 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 08:01:47,470 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 08:01:47,470 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 08:01:47,471 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 08:01:47,476 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 08:01:47,477 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 08:01:47,477 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 08:01:47,478 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 08:01:47,480 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 08:01:47,480 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 08:01:47,480 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 08:01:47,481 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 08:01:47,481 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 08:01:47,482 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 08:01:47,482 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 08:01:47,483 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 08:01:47,483 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 08:01:47,483 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 08:01:47,485 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 08:01:47,485 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 08:01:47,486 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 08:01:47,487 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 08:01:47,487 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 08:01:47,488 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 08:01:47,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:01:47,489 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 08:01:47,489 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 08:01:47,490 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 08:01:47,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 08:01:47,490 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 08:01:47,490 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 08:01:47,490 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 08:01:47,491 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 08:01:47,491 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_c855d1da-864a-4d4a-bdd4-18f058fefa14/bin/uautomizer-verify-uCwYo4JHxu/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_c855d1da-864a-4d4a-bdd4-18f058fefa14/bin/uautomizer-verify-uCwYo4JHxu Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cec155e54548239c459fec40910e358deb5fad2ceffa658bfdeefddd1bc9e166 [2023-11-19 08:01:47,788 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 08:01:47,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 08:01:47,826 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 08:01:47,827 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 08:01:47,828 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 08:01:47,830 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c855d1da-864a-4d4a-bdd4-18f058fefa14/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/goblint-regression/36-apron_21-traces-cluster-based_true.i [2023-11-19 08:01:51,004 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 08:01:51,276 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 08:01:51,277 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c855d1da-864a-4d4a-bdd4-18f058fefa14/sv-benchmarks/c/goblint-regression/36-apron_21-traces-cluster-based_true.i [2023-11-19 08:01:51,302 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c855d1da-864a-4d4a-bdd4-18f058fefa14/bin/uautomizer-verify-uCwYo4JHxu/data/8ddb7da66/931e5ae808224d1cb1dcfe0aef8efc3a/FLAG82385bc34 [2023-11-19 08:01:51,320 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c855d1da-864a-4d4a-bdd4-18f058fefa14/bin/uautomizer-verify-uCwYo4JHxu/data/8ddb7da66/931e5ae808224d1cb1dcfe0aef8efc3a [2023-11-19 08:01:51,325 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 08:01:51,328 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 08:01:51,333 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 08:01:51,333 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 08:01:51,339 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 08:01:51,340 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:01:51" (1/1) ... [2023-11-19 08:01:51,343 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f3bf14c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:51, skipping insertion in model container [2023-11-19 08:01:51,343 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:01:51" (1/1) ... [2023-11-19 08:01:51,412 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 08:01:51,781 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:01:51,804 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 08:01:51,891 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:01:51,942 INFO L206 MainTranslator]: Completed translation [2023-11-19 08:01:51,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:51 WrapperNode [2023-11-19 08:01:51,942 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 08:01:51,943 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 08:01:51,944 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 08:01:51,944 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 08:01:51,952 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:51" (1/1) ... [2023-11-19 08:01:51,989 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:51" (1/1) ... [2023-11-19 08:01:52,029 INFO L138 Inliner]: procedures = 165, calls = 46, calls flagged for inlining = 7, calls inlined = 10, statements flattened = 146 [2023-11-19 08:01:52,030 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 08:01:52,030 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 08:01:52,031 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 08:01:52,031 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 08:01:52,040 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:51" (1/1) ... [2023-11-19 08:01:52,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:51" (1/1) ... [2023-11-19 08:01:52,057 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:51" (1/1) ... [2023-11-19 08:01:52,062 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:51" (1/1) ... [2023-11-19 08:01:52,069 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:51" (1/1) ... [2023-11-19 08:01:52,082 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:51" (1/1) ... [2023-11-19 08:01:52,085 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:51" (1/1) ... [2023-11-19 08:01:52,086 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:51" (1/1) ... [2023-11-19 08:01:52,099 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 08:01:52,100 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 08:01:52,100 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 08:01:52,100 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 08:01:52,101 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:51" (1/1) ... [2023-11-19 08:01:52,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:01:52,133 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c855d1da-864a-4d4a-bdd4-18f058fefa14/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:01:52,147 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c855d1da-864a-4d4a-bdd4-18f058fefa14/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 08:01:52,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c855d1da-864a-4d4a-bdd4-18f058fefa14/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 08:01:52,183 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2023-11-19 08:01:52,184 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2023-11-19 08:01:52,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 08:01:52,184 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-19 08:01:52,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 08:01:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 08:01:52,185 INFO L130 BoogieDeclarations]: Found specification of procedure t3_fun [2023-11-19 08:01:52,185 INFO L138 BoogieDeclarations]: Found implementation of procedure t3_fun [2023-11-19 08:01:52,186 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-11-19 08:01:52,186 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-11-19 08:01:52,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 08:01:52,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 08:01:52,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 08:01:52,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 08:01:52,188 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 08:01:52,331 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 08:01:52,334 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 08:01:52,656 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 08:01:52,668 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 08:01:52,669 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 08:01:52,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:01:52 BoogieIcfgContainer [2023-11-19 08:01:52,674 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 08:01:52,677 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 08:01:52,678 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 08:01:52,681 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 08:01:52,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:01:51" (1/3) ... [2023-11-19 08:01:52,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e722996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:01:52, skipping insertion in model container [2023-11-19 08:01:52,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:01:51" (2/3) ... [2023-11-19 08:01:52,683 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e722996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:01:52, skipping insertion in model container [2023-11-19 08:01:52,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:01:52" (3/3) ... [2023-11-19 08:01:52,685 INFO L112 eAbstractionObserver]: Analyzing ICFG 36-apron_21-traces-cluster-based_true.i [2023-11-19 08:01:52,705 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 08:01:52,706 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-19 08:01:52,706 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 08:01:52,798 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 08:01:52,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 201 places, 200 transitions, 412 flow [2023-11-19 08:01:52,996 INFO L124 PetriNetUnfolderBase]: 9/197 cut-off events. [2023-11-19 08:01:52,997 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:01:53,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 197 events. 9/197 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 411 event pairs, 0 based on Foata normal form. 0/177 useless extension candidates. Maximal degree in co-relation 159. Up to 2 conditions per place. [2023-11-19 08:01:53,008 INFO L82 GeneralOperation]: Start removeDead. Operand has 201 places, 200 transitions, 412 flow [2023-11-19 08:01:53,016 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 198 places, 197 transitions, 403 flow [2023-11-19 08:01:53,020 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 08:01:53,031 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 198 places, 197 transitions, 403 flow [2023-11-19 08:01:53,034 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 198 places, 197 transitions, 403 flow [2023-11-19 08:01:53,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 197 transitions, 403 flow [2023-11-19 08:01:53,111 INFO L124 PetriNetUnfolderBase]: 9/197 cut-off events. [2023-11-19 08:01:53,111 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:01:53,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 197 events. 9/197 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 411 event pairs, 0 based on Foata normal form. 0/177 useless extension candidates. Maximal degree in co-relation 159. Up to 2 conditions per place. [2023-11-19 08:01:53,125 INFO L119 LiptonReduction]: Number of co-enabled transitions 15122 [2023-11-19 08:02:00,409 INFO L134 LiptonReduction]: Checked pairs total: 29697 [2023-11-19 08:02:00,412 INFO L136 LiptonReduction]: Total number of compositions: 218 [2023-11-19 08:02:00,439 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 08:02:00,453 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;@5cede9bd, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 08:02:00,453 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-19 08:02:00,456 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 08:02:00,456 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-19 08:02:00,456 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:02:00,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:00,457 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-19 08:02:00,458 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 08:02:00,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:00,467 INFO L85 PathProgramCache]: Analyzing trace with hash 773, now seen corresponding path program 1 times [2023-11-19 08:02:00,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:00,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322555007] [2023-11-19 08:02:00,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:00,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:00,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:00,613 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-19 08:02:00,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:00,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322555007] [2023-11-19 08:02:00,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322555007] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:00,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:00,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-19 08:02:00,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633226119] [2023-11-19 08:02:00,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:00,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 08:02:00,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:00,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 08:02:00,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 08:02:00,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 418 [2023-11-19 08:02:00,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 101 flow. Second operand has 2 states, 2 states have (on average 185.5) internal successors, (371), 2 states have internal predecessors, (371), 0 states have call successors, (0), 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-19 08:02:00,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:00,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 418 [2023-11-19 08:02:00,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:01,610 INFO L124 PetriNetUnfolderBase]: 4001/5962 cut-off events. [2023-11-19 08:02:01,611 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-11-19 08:02:01,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11651 conditions, 5962 events. 4001/5962 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 36683 event pairs, 3677 based on Foata normal form. 150/4466 useless extension candidates. Maximal degree in co-relation 11640. Up to 5623 conditions per place. [2023-11-19 08:02:01,675 INFO L140 encePairwiseOnDemand]: 415/418 looper letters, 33 selfloop transitions, 0 changer transitions 0/43 dead transitions. [2023-11-19 08:02:01,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 43 transitions, 161 flow [2023-11-19 08:02:01,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 08:02:01,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-19 08:02:01,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 406 transitions. [2023-11-19 08:02:01,695 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48564593301435405 [2023-11-19 08:02:01,696 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 406 transitions. [2023-11-19 08:02:01,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 406 transitions. [2023-11-19 08:02:01,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:01,702 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 406 transitions. [2023-11-19 08:02:01,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 203.0) internal successors, (406), 2 states have internal predecessors, (406), 0 states have call successors, (0), 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-19 08:02:01,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 418.0) internal successors, (1254), 3 states have internal predecessors, (1254), 0 states have call successors, (0), 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-19 08:02:01,714 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 418.0) internal successors, (1254), 3 states have internal predecessors, (1254), 0 states have call successors, (0), 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-19 08:02:01,716 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 101 flow. Second operand 2 states and 406 transitions. [2023-11-19 08:02:01,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 43 transitions, 161 flow [2023-11-19 08:02:01,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 43 transitions, 158 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-19 08:02:01,723 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 92 flow [2023-11-19 08:02:01,726 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=418, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=92, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2023-11-19 08:02:01,729 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -4 predicate places. [2023-11-19 08:02:01,730 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 92 flow [2023-11-19 08:02:01,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 185.5) internal successors, (371), 2 states have internal predecessors, (371), 0 states have call successors, (0), 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-19 08:02:01,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:01,731 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-19 08:02:01,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 08:02:01,731 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 08:02:01,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:01,732 INFO L85 PathProgramCache]: Analyzing trace with hash 758846, now seen corresponding path program 1 times [2023-11-19 08:02:01,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:01,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242516910] [2023-11-19 08:02:01,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:01,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:01,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:02,132 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-19 08:02:02,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:02,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242516910] [2023-11-19 08:02:02,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242516910] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:02,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:02,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 08:02:02,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299173594] [2023-11-19 08:02:02,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:02,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:02:02,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:02,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:02:02,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:02:02,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 418 [2023-11-19 08:02:02,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 181.0) internal successors, (543), 3 states have internal predecessors, (543), 0 states have call successors, (0), 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-19 08:02:02,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:02,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 418 [2023-11-19 08:02:02,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:02,973 INFO L124 PetriNetUnfolderBase]: 3996/5947 cut-off events. [2023-11-19 08:02:02,973 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:02:02,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11624 conditions, 5947 events. 3996/5947 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 36663 event pairs, 2943 based on Foata normal form. 0/4307 useless extension candidates. Maximal degree in co-relation 11621. Up to 4522 conditions per place. [2023-11-19 08:02:03,027 INFO L140 encePairwiseOnDemand]: 414/418 looper letters, 43 selfloop transitions, 3 changer transitions 0/56 dead transitions. [2023-11-19 08:02:03,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 56 transitions, 210 flow [2023-11-19 08:02:03,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:02:03,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:02:03,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 587 transitions. [2023-11-19 08:02:03,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46810207336523124 [2023-11-19 08:02:03,031 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 587 transitions. [2023-11-19 08:02:03,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 587 transitions. [2023-11-19 08:02:03,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:03,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 587 transitions. [2023-11-19 08:02:03,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 195.66666666666666) internal successors, (587), 3 states have internal predecessors, (587), 0 states have call successors, (0), 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-19 08:02:03,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 418.0) internal successors, (1672), 4 states have internal predecessors, (1672), 0 states have call successors, (0), 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-19 08:02:03,041 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 418.0) internal successors, (1672), 4 states have internal predecessors, (1672), 0 states have call successors, (0), 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-19 08:02:03,041 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 92 flow. Second operand 3 states and 587 transitions. [2023-11-19 08:02:03,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 56 transitions, 210 flow [2023-11-19 08:02:03,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 56 transitions, 210 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 08:02:03,044 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 96 flow [2023-11-19 08:02:03,044 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=418, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2023-11-19 08:02:03,045 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places. [2023-11-19 08:02:03,045 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 96 flow [2023-11-19 08:02:03,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.0) internal successors, (543), 3 states have internal predecessors, (543), 0 states have call successors, (0), 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-19 08:02:03,046 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:03,046 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-19 08:02:03,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 08:02:03,047 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 08:02:03,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:03,048 INFO L85 PathProgramCache]: Analyzing trace with hash 758847, now seen corresponding path program 1 times [2023-11-19 08:02:03,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:03,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032582878] [2023-11-19 08:02:03,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:03,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:03,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:03,178 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-19 08:02:03,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:03,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032582878] [2023-11-19 08:02:03,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032582878] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:03,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:03,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 08:02:03,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079410003] [2023-11-19 08:02:03,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:03,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:02:03,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:03,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:02:03,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:02:03,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 418 [2023-11-19 08:02:03,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 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-19 08:02:03,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:03,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 418 [2023-11-19 08:02:03,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:04,123 INFO L124 PetriNetUnfolderBase]: 3991/5932 cut-off events. [2023-11-19 08:02:04,124 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:02:04,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11901 conditions, 5932 events. 3991/5932 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 36562 event pairs, 2939 based on Foata normal form. 0/4448 useless extension candidates. Maximal degree in co-relation 11897. Up to 4512 conditions per place. [2023-11-19 08:02:04,180 INFO L140 encePairwiseOnDemand]: 414/418 looper letters, 42 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2023-11-19 08:02:04,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 55 transitions, 212 flow [2023-11-19 08:02:04,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:02:04,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:02:04,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 574 transitions. [2023-11-19 08:02:04,186 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45773524720893144 [2023-11-19 08:02:04,186 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 574 transitions. [2023-11-19 08:02:04,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 574 transitions. [2023-11-19 08:02:04,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:04,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 574 transitions. [2023-11-19 08:02:04,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 191.33333333333334) internal successors, (574), 3 states have internal predecessors, (574), 0 states have call successors, (0), 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-19 08:02:04,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 418.0) internal successors, (1672), 4 states have internal predecessors, (1672), 0 states have call successors, (0), 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-19 08:02:04,194 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 418.0) internal successors, (1672), 4 states have internal predecessors, (1672), 0 states have call successors, (0), 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-19 08:02:04,194 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 96 flow. Second operand 3 states and 574 transitions. [2023-11-19 08:02:04,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 55 transitions, 212 flow [2023-11-19 08:02:04,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 55 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 08:02:04,231 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 94 flow [2023-11-19 08:02:04,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=418, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2023-11-19 08:02:04,234 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -4 predicate places. [2023-11-19 08:02:04,238 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 94 flow [2023-11-19 08:02:04,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 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-19 08:02:04,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:04,240 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 08:02:04,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 08:02:04,240 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 08:02:04,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:04,241 INFO L85 PathProgramCache]: Analyzing trace with hash 729266943, now seen corresponding path program 1 times [2023-11-19 08:02:04,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:04,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245457001] [2023-11-19 08:02:04,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:04,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:04,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:04,326 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-19 08:02:04,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:04,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245457001] [2023-11-19 08:02:04,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245457001] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:04,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:04,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 08:02:04,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271476874] [2023-11-19 08:02:04,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:04,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:02:04,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:04,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:02:04,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:02:04,384 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 418 [2023-11-19 08:02:04,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:04,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:04,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 418 [2023-11-19 08:02:04,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:05,203 INFO L124 PetriNetUnfolderBase]: 3946/5857 cut-off events. [2023-11-19 08:02:05,203 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:02:05,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11756 conditions, 5857 events. 3946/5857 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 36003 event pairs, 2899 based on Foata normal form. 0/4410 useless extension candidates. Maximal degree in co-relation 11752. Up to 4442 conditions per place. [2023-11-19 08:02:05,247 INFO L140 encePairwiseOnDemand]: 414/418 looper letters, 41 selfloop transitions, 3 changer transitions 0/54 dead transitions. [2023-11-19 08:02:05,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 54 transitions, 208 flow [2023-11-19 08:02:05,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:02:05,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:02:05,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 573 transitions. [2023-11-19 08:02:05,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4569377990430622 [2023-11-19 08:02:05,252 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 573 transitions. [2023-11-19 08:02:05,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 573 transitions. [2023-11-19 08:02:05,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:05,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 573 transitions. [2023-11-19 08:02:05,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 0 states have call successors, (0), 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-19 08:02:05,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 418.0) internal successors, (1672), 4 states have internal predecessors, (1672), 0 states have call successors, (0), 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-19 08:02:05,261 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 418.0) internal successors, (1672), 4 states have internal predecessors, (1672), 0 states have call successors, (0), 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-19 08:02:05,261 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 94 flow. Second operand 3 states and 573 transitions. [2023-11-19 08:02:05,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 54 transitions, 208 flow [2023-11-19 08:02:05,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 54 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 08:02:05,281 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 92 flow [2023-11-19 08:02:05,281 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=418, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2023-11-19 08:02:05,283 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -5 predicate places. [2023-11-19 08:02:05,283 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 92 flow [2023-11-19 08:02:05,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:05,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:05,284 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 08:02:05,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 08:02:05,285 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 08:02:05,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:05,286 INFO L85 PathProgramCache]: Analyzing trace with hash 729266944, now seen corresponding path program 1 times [2023-11-19 08:02:05,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:05,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080832615] [2023-11-19 08:02:05,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:05,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:05,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:05,428 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-19 08:02:05,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:05,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080832615] [2023-11-19 08:02:05,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080832615] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:05,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:05,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 08:02:05,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70460414] [2023-11-19 08:02:05,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:05,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:02:05,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:05,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:02:05,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:02:05,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 418 [2023-11-19 08:02:05,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 0 states have call successors, (0), 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-19 08:02:05,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:05,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 418 [2023-11-19 08:02:05,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:06,259 INFO L124 PetriNetUnfolderBase]: 3901/5782 cut-off events. [2023-11-19 08:02:06,266 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:02:06,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11611 conditions, 5782 events. 3901/5782 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 35657 event pairs, 2859 based on Foata normal form. 0/4372 useless extension candidates. Maximal degree in co-relation 11607. Up to 4372 conditions per place. [2023-11-19 08:02:06,316 INFO L140 encePairwiseOnDemand]: 414/418 looper letters, 40 selfloop transitions, 3 changer transitions 0/53 dead transitions. [2023-11-19 08:02:06,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 53 transitions, 204 flow [2023-11-19 08:02:06,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:02:06,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:02:06,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 584 transitions. [2023-11-19 08:02:06,320 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46570972886762363 [2023-11-19 08:02:06,320 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 584 transitions. [2023-11-19 08:02:06,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 584 transitions. [2023-11-19 08:02:06,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:06,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 584 transitions. [2023-11-19 08:02:06,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 0 states have call successors, (0), 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-19 08:02:06,327 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 418.0) internal successors, (1672), 4 states have internal predecessors, (1672), 0 states have call successors, (0), 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-19 08:02:06,329 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 418.0) internal successors, (1672), 4 states have internal predecessors, (1672), 0 states have call successors, (0), 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-19 08:02:06,329 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 92 flow. Second operand 3 states and 584 transitions. [2023-11-19 08:02:06,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 53 transitions, 204 flow [2023-11-19 08:02:06,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 53 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 08:02:06,342 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 90 flow [2023-11-19 08:02:06,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=418, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2023-11-19 08:02:06,344 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -6 predicate places. [2023-11-19 08:02:06,344 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 90 flow [2023-11-19 08:02:06,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 0 states have call successors, (0), 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-19 08:02:06,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:06,345 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:02:06,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 08:02:06,345 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 08:02:06,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:06,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1648846576, now seen corresponding path program 1 times [2023-11-19 08:02:06,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:06,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748235995] [2023-11-19 08:02:06,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:06,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:06,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:06,448 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-19 08:02:06,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:06,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748235995] [2023-11-19 08:02:06,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748235995] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:06,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:06,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:02:06,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212118407] [2023-11-19 08:02:06,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:06,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 08:02:06,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:06,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 08:02:06,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:02:06,490 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 418 [2023-11-19 08:02:06,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 177.6) internal successors, (888), 5 states have internal predecessors, (888), 0 states have call successors, (0), 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-19 08:02:06,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:06,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 418 [2023-11-19 08:02:06,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:07,785 INFO L124 PetriNetUnfolderBase]: 6643/10086 cut-off events. [2023-11-19 08:02:07,786 INFO L125 PetriNetUnfolderBase]: For 234/234 co-relation queries the response was YES. [2023-11-19 08:02:07,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20185 conditions, 10086 events. 6643/10086 cut-off events. For 234/234 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 68503 event pairs, 1261 based on Foata normal form. 0/8117 useless extension candidates. Maximal degree in co-relation 20181. Up to 4245 conditions per place. [2023-11-19 08:02:07,856 INFO L140 encePairwiseOnDemand]: 411/418 looper letters, 137 selfloop transitions, 10 changer transitions 0/155 dead transitions. [2023-11-19 08:02:07,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 155 transitions, 654 flow [2023-11-19 08:02:07,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 08:02:07,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-19 08:02:07,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1558 transitions. [2023-11-19 08:02:07,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4659090909090909 [2023-11-19 08:02:07,864 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1558 transitions. [2023-11-19 08:02:07,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1558 transitions. [2023-11-19 08:02:07,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:07,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1558 transitions. [2023-11-19 08:02:07,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 194.75) internal successors, (1558), 8 states have internal predecessors, (1558), 0 states have call successors, (0), 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-19 08:02:07,885 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 418.0) internal successors, (3762), 9 states have internal predecessors, (3762), 0 states have call successors, (0), 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-19 08:02:07,887 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 418.0) internal successors, (3762), 9 states have internal predecessors, (3762), 0 states have call successors, (0), 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-19 08:02:07,887 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 90 flow. Second operand 8 states and 1558 transitions. [2023-11-19 08:02:07,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 155 transitions, 654 flow [2023-11-19 08:02:07,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 155 transitions, 624 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 08:02:07,899 INFO L231 Difference]: Finished difference. Result has 59 places, 47 transitions, 153 flow [2023-11-19 08:02:07,900 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=418, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=153, PETRI_PLACES=59, PETRI_TRANSITIONS=47} [2023-11-19 08:02:07,903 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 5 predicate places. [2023-11-19 08:02:07,903 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 47 transitions, 153 flow [2023-11-19 08:02:07,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 177.6) internal successors, (888), 5 states have internal predecessors, (888), 0 states have call successors, (0), 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-19 08:02:07,904 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:07,904 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:02:07,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 08:02:07,905 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 08:02:07,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:07,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1678825284, now seen corresponding path program 1 times [2023-11-19 08:02:07,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:07,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248800084] [2023-11-19 08:02:07,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:07,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:07,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:08,076 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-19 08:02:08,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:08,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248800084] [2023-11-19 08:02:08,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248800084] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:08,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:08,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:02:08,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251796165] [2023-11-19 08:02:08,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:08,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 08:02:08,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:08,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 08:02:08,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:02:08,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 418 [2023-11-19 08:02:08,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 153 flow. Second operand has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 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-19 08:02:08,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:08,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 418 [2023-11-19 08:02:08,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:09,586 INFO L124 PetriNetUnfolderBase]: 7409/11128 cut-off events. [2023-11-19 08:02:09,586 INFO L125 PetriNetUnfolderBase]: For 7753/8158 co-relation queries the response was YES. [2023-11-19 08:02:09,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27435 conditions, 11128 events. 7409/11128 cut-off events. For 7753/8158 co-relation queries the response was YES. Maximal size of possible extension queue 637. Compared 72562 event pairs, 1329 based on Foata normal form. 177/9622 useless extension candidates. Maximal degree in co-relation 27426. Up to 3871 conditions per place. [2023-11-19 08:02:09,662 INFO L140 encePairwiseOnDemand]: 409/418 looper letters, 110 selfloop transitions, 23 changer transitions 0/142 dead transitions. [2023-11-19 08:02:09,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 142 transitions, 725 flow [2023-11-19 08:02:09,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 08:02:09,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-19 08:02:09,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1513 transitions. [2023-11-19 08:02:09,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45245215311004783 [2023-11-19 08:02:09,669 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1513 transitions. [2023-11-19 08:02:09,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1513 transitions. [2023-11-19 08:02:09,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:09,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1513 transitions. [2023-11-19 08:02:09,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 189.125) internal successors, (1513), 8 states have internal predecessors, (1513), 0 states have call successors, (0), 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-19 08:02:09,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 418.0) internal successors, (3762), 9 states have internal predecessors, (3762), 0 states have call successors, (0), 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-19 08:02:09,686 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 418.0) internal successors, (3762), 9 states have internal predecessors, (3762), 0 states have call successors, (0), 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-19 08:02:09,687 INFO L175 Difference]: Start difference. First operand has 59 places, 47 transitions, 153 flow. Second operand 8 states and 1513 transitions. [2023-11-19 08:02:09,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 142 transitions, 725 flow [2023-11-19 08:02:09,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 142 transitions, 725 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 08:02:09,780 INFO L231 Difference]: Finished difference. Result has 72 places, 65 transitions, 352 flow [2023-11-19 08:02:09,780 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=418, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=352, PETRI_PLACES=72, PETRI_TRANSITIONS=65} [2023-11-19 08:02:09,781 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 18 predicate places. [2023-11-19 08:02:09,781 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 65 transitions, 352 flow [2023-11-19 08:02:09,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 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-19 08:02:09,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:09,783 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:02:09,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 08:02:09,784 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 08:02:09,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:09,784 INFO L85 PathProgramCache]: Analyzing trace with hash -957797905, now seen corresponding path program 1 times [2023-11-19 08:02:09,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:09,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687514273] [2023-11-19 08:02:09,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:09,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:09,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:09,873 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-19 08:02:09,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:09,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687514273] [2023-11-19 08:02:09,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687514273] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:09,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:09,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:02:09,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275356335] [2023-11-19 08:02:09,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:09,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:02:09,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:09,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:02:09,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:02:09,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 418 [2023-11-19 08:02:09,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 65 transitions, 352 flow. Second operand has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 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-19 08:02:09,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:09,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 418 [2023-11-19 08:02:09,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:10,877 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([516] L693-->L694: Formula: (= |v_#pthreadsMutex_23| (store |v_#pthreadsMutex_24| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_24| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_24|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_23|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][72], [Black: 244#(= ~h~0 |ULTIMATE.start_main_~x~3#1|), Black: 249#(and (= ~h~0 ~g~0) (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|) (= ~h~0 |ULTIMATE.start_main_~x~3#1|)), t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, 102#L694true, 259#true, t_funThread1of1ForFork1InUse, Black: 225#(<= ~h~0 ~g~0), 117#L736true, 87#t3_funEXITtrue, Black: 231#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 233#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 226#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 223#true, 227#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), 245#(= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|), Black: 251#(and (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|) (= ~h~0 |ULTIMATE.start_main_~x~3#1|)), 196#t2_funEXITtrue, Black: 241#true, 204#true, Black: 243#(= ~h~0 ~g~0)]) [2023-11-19 08:02:10,877 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-19 08:02:10,877 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 08:02:10,877 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 08:02:10,877 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 08:02:10,878 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([516] L693-->L694: Formula: (= |v_#pthreadsMutex_23| (store |v_#pthreadsMutex_24| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_24| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_24|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_23|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][72], [Black: 244#(= ~h~0 |ULTIMATE.start_main_~x~3#1|), Black: 249#(and (= ~h~0 ~g~0) (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|) (= ~h~0 |ULTIMATE.start_main_~x~3#1|)), t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, 102#L694true, 62#t3_funErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 259#true, t_funThread1of1ForFork1InUse, Black: 225#(<= ~h~0 ~g~0), 117#L736true, Black: 231#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 233#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 226#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 223#true, 227#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), 245#(= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|), 196#t2_funEXITtrue, Black: 251#(and (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|) (= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 241#true, 204#true, Black: 243#(= ~h~0 ~g~0)]) [2023-11-19 08:02:10,878 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-19 08:02:10,878 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 08:02:10,878 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 08:02:10,878 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 08:02:10,954 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([516] L693-->L694: Formula: (= |v_#pthreadsMutex_23| (store |v_#pthreadsMutex_24| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_24| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_24|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_23|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][72], [Black: 244#(= ~h~0 |ULTIMATE.start_main_~x~3#1|), Black: 249#(and (= ~h~0 ~g~0) (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|) (= ~h~0 |ULTIMATE.start_main_~x~3#1|)), t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, 102#L694true, 259#true, t_funThread1of1ForFork1InUse, Black: 225#(<= ~h~0 ~g~0), 117#L736true, 87#t3_funEXITtrue, Black: 231#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 233#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 226#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 223#true, 227#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), 245#(= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|), Black: 251#(and (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|) (= ~h~0 |ULTIMATE.start_main_~x~3#1|)), 196#t2_funEXITtrue, Black: 241#true, 204#true, Black: 243#(= ~h~0 ~g~0)]) [2023-11-19 08:02:10,954 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-19 08:02:10,954 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 08:02:10,954 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 08:02:10,954 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 08:02:10,954 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 08:02:10,955 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([516] L693-->L694: Formula: (= |v_#pthreadsMutex_23| (store |v_#pthreadsMutex_24| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_24| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_24|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_23|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][72], [Black: 244#(= ~h~0 |ULTIMATE.start_main_~x~3#1|), Black: 249#(and (= ~h~0 ~g~0) (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|) (= ~h~0 |ULTIMATE.start_main_~x~3#1|)), t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, 102#L694true, 62#t3_funErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 259#true, t_funThread1of1ForFork1InUse, Black: 225#(<= ~h~0 ~g~0), 117#L736true, Black: 231#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 233#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 226#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 223#true, 227#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), 245#(= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|), Black: 251#(and (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|) (= ~h~0 |ULTIMATE.start_main_~x~3#1|)), 196#t2_funEXITtrue, Black: 241#true, 204#true, Black: 243#(= ~h~0 ~g~0)]) [2023-11-19 08:02:10,955 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-19 08:02:10,955 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 08:02:10,955 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 08:02:10,955 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 08:02:10,955 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 08:02:10,963 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([516] L693-->L694: Formula: (= |v_#pthreadsMutex_23| (store |v_#pthreadsMutex_24| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_24| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_24|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_23|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][72], [Black: 244#(= ~h~0 |ULTIMATE.start_main_~x~3#1|), Black: 249#(and (= ~h~0 ~g~0) (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|) (= ~h~0 |ULTIMATE.start_main_~x~3#1|)), t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, 102#L694true, t_funThread1of1ForFork1InUse, 259#true, Black: 225#(<= ~h~0 ~g~0), 87#t3_funEXITtrue, Black: 231#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 233#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 226#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 223#true, 227#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), 185#L19-6true, 245#(= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|), Black: 251#(and (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|) (= ~h~0 |ULTIMATE.start_main_~x~3#1|)), 196#t2_funEXITtrue, Black: 241#true, 204#true, Black: 243#(= ~h~0 ~g~0)]) [2023-11-19 08:02:10,963 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-11-19 08:02:10,963 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 08:02:10,964 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 08:02:10,964 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 08:02:10,964 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([516] L693-->L694: Formula: (= |v_#pthreadsMutex_23| (store |v_#pthreadsMutex_24| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_24| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_24|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_23|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][72], [Black: 244#(= ~h~0 |ULTIMATE.start_main_~x~3#1|), Black: 249#(and (= ~h~0 ~g~0) (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|) (= ~h~0 |ULTIMATE.start_main_~x~3#1|)), t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, 102#L694true, 62#t3_funErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 259#true, t_funThread1of1ForFork1InUse, Black: 225#(<= ~h~0 ~g~0), Black: 231#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 233#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 226#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 223#true, 227#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), 185#L19-6true, 245#(= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|), 196#t2_funEXITtrue, Black: 251#(and (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|) (= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 241#true, 204#true, Black: 243#(= ~h~0 ~g~0)]) [2023-11-19 08:02:10,965 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-11-19 08:02:10,965 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 08:02:10,965 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 08:02:10,965 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 08:02:11,037 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([516] L693-->L694: Formula: (= |v_#pthreadsMutex_23| (store |v_#pthreadsMutex_24| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_24| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_24|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_23|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][72], [Black: 244#(= ~h~0 |ULTIMATE.start_main_~x~3#1|), Black: 249#(and (= ~h~0 ~g~0) (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|) (= ~h~0 |ULTIMATE.start_main_~x~3#1|)), t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, 102#L694true, 259#true, t_funThread1of1ForFork1InUse, Black: 225#(<= ~h~0 ~g~0), 87#t3_funEXITtrue, Black: 231#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 233#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 226#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 223#true, 227#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), 185#L19-6true, 245#(= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|), Black: 251#(and (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|) (= ~h~0 |ULTIMATE.start_main_~x~3#1|)), 196#t2_funEXITtrue, Black: 241#true, 204#true, Black: 243#(= ~h~0 ~g~0)]) [2023-11-19 08:02:11,038 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-11-19 08:02:11,038 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 08:02:11,038 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 08:02:11,038 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 08:02:11,038 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 08:02:11,039 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([516] L693-->L694: Formula: (= |v_#pthreadsMutex_23| (store |v_#pthreadsMutex_24| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_24| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_24|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_23|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][72], [Black: 244#(= ~h~0 |ULTIMATE.start_main_~x~3#1|), Black: 249#(and (= ~h~0 ~g~0) (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|) (= ~h~0 |ULTIMATE.start_main_~x~3#1|)), t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, 102#L694true, 62#t3_funErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 259#true, t_funThread1of1ForFork1InUse, Black: 225#(<= ~h~0 ~g~0), Black: 231#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 233#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 226#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 223#true, 227#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), 185#L19-6true, 245#(= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|), Black: 251#(and (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|) (= ~h~0 |ULTIMATE.start_main_~x~3#1|)), 196#t2_funEXITtrue, Black: 241#true, 204#true, Black: 243#(= ~h~0 ~g~0)]) [2023-11-19 08:02:11,039 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-11-19 08:02:11,039 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 08:02:11,039 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 08:02:11,039 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 08:02:11,039 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 08:02:11,044 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([516] L693-->L694: Formula: (= |v_#pthreadsMutex_23| (store |v_#pthreadsMutex_24| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_24| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_24|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_23|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][72], [Black: 244#(= ~h~0 |ULTIMATE.start_main_~x~3#1|), Black: 249#(and (= ~h~0 ~g~0) (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|) (= ~h~0 |ULTIMATE.start_main_~x~3#1|)), 24#ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAKtrue, t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, 102#L694true, t_funThread1of1ForFork1InUse, 259#true, Black: 225#(<= ~h~0 ~g~0), 87#t3_funEXITtrue, Black: 231#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 233#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 226#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 223#true, 227#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), 245#(= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|), Black: 251#(and (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|) (= ~h~0 |ULTIMATE.start_main_~x~3#1|)), 196#t2_funEXITtrue, Black: 241#true, 204#true, Black: 243#(= ~h~0 ~g~0)]) [2023-11-19 08:02:11,044 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-11-19 08:02:11,044 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 08:02:11,044 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 08:02:11,045 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 08:02:11,045 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([516] L693-->L694: Formula: (= |v_#pthreadsMutex_23| (store |v_#pthreadsMutex_24| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_24| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_24|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_23|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][72], [Black: 244#(= ~h~0 |ULTIMATE.start_main_~x~3#1|), Black: 249#(and (= ~h~0 ~g~0) (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|) (= ~h~0 |ULTIMATE.start_main_~x~3#1|)), t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, 102#L694true, t_funThread1of1ForFork1InUse, 259#true, Black: 225#(<= ~h~0 ~g~0), 87#t3_funEXITtrue, Black: 231#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 233#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 226#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 223#true, 227#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), 245#(= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|), 48#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 251#(and (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|) (= ~h~0 |ULTIMATE.start_main_~x~3#1|)), 196#t2_funEXITtrue, Black: 241#true, 204#true, Black: 243#(= ~h~0 ~g~0)]) [2023-11-19 08:02:11,045 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-11-19 08:02:11,045 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 08:02:11,045 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 08:02:11,045 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 08:02:11,046 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([516] L693-->L694: Formula: (= |v_#pthreadsMutex_23| (store |v_#pthreadsMutex_24| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_24| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_24|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_23|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][72], [Black: 244#(= ~h~0 |ULTIMATE.start_main_~x~3#1|), Black: 249#(and (= ~h~0 ~g~0) (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|) (= ~h~0 |ULTIMATE.start_main_~x~3#1|)), 24#ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAKtrue, t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, 102#L694true, 62#t3_funErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, t_funThread1of1ForFork1InUse, 259#true, Black: 225#(<= ~h~0 ~g~0), Black: 231#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 233#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 226#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 223#true, 227#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), 245#(= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|), 196#t2_funEXITtrue, Black: 251#(and (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|) (= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 241#true, 204#true, Black: 243#(= ~h~0 ~g~0)]) [2023-11-19 08:02:11,046 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-11-19 08:02:11,046 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 08:02:11,046 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 08:02:11,046 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 08:02:11,046 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([516] L693-->L694: Formula: (= |v_#pthreadsMutex_23| (store |v_#pthreadsMutex_24| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_24| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_24|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_23|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][72], [Black: 244#(= ~h~0 |ULTIMATE.start_main_~x~3#1|), Black: 249#(and (= ~h~0 ~g~0) (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|) (= ~h~0 |ULTIMATE.start_main_~x~3#1|)), t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, 102#L694true, 62#t3_funErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, t_funThread1of1ForFork1InUse, 259#true, Black: 225#(<= ~h~0 ~g~0), Black: 231#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 233#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 226#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 223#true, 227#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), 48#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, 245#(= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|), 196#t2_funEXITtrue, Black: 251#(and (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|) (= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 241#true, 204#true, Black: 243#(= ~h~0 ~g~0)]) [2023-11-19 08:02:11,047 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-11-19 08:02:11,047 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 08:02:11,047 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 08:02:11,047 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 08:02:11,111 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([516] L693-->L694: Formula: (= |v_#pthreadsMutex_23| (store |v_#pthreadsMutex_24| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_24| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_24|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_23|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][72], [Black: 244#(= ~h~0 |ULTIMATE.start_main_~x~3#1|), Black: 249#(and (= ~h~0 ~g~0) (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|) (= ~h~0 |ULTIMATE.start_main_~x~3#1|)), 24#ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAKtrue, t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, 102#L694true, 259#true, t_funThread1of1ForFork1InUse, Black: 225#(<= ~h~0 ~g~0), 87#t3_funEXITtrue, Black: 231#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 233#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 226#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 223#true, 227#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), 245#(= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|), Black: 251#(and (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|) (= ~h~0 |ULTIMATE.start_main_~x~3#1|)), 196#t2_funEXITtrue, Black: 241#true, 204#true, Black: 243#(= ~h~0 ~g~0)]) [2023-11-19 08:02:11,111 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-11-19 08:02:11,111 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 08:02:11,111 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 08:02:11,111 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 08:02:11,111 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 08:02:11,111 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([516] L693-->L694: Formula: (= |v_#pthreadsMutex_23| (store |v_#pthreadsMutex_24| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_24| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_24|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_23|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][72], [Black: 244#(= ~h~0 |ULTIMATE.start_main_~x~3#1|), Black: 249#(and (= ~h~0 ~g~0) (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|) (= ~h~0 |ULTIMATE.start_main_~x~3#1|)), t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, 102#L694true, 259#true, t_funThread1of1ForFork1InUse, Black: 225#(<= ~h~0 ~g~0), 87#t3_funEXITtrue, Black: 231#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 233#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 226#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 223#true, 227#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), 245#(= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|), 48#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 251#(and (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|) (= ~h~0 |ULTIMATE.start_main_~x~3#1|)), 196#t2_funEXITtrue, Black: 241#true, 204#true, Black: 243#(= ~h~0 ~g~0)]) [2023-11-19 08:02:11,111 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-11-19 08:02:11,112 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 08:02:11,112 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 08:02:11,112 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 08:02:11,112 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 08:02:11,112 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([516] L693-->L694: Formula: (= |v_#pthreadsMutex_23| (store |v_#pthreadsMutex_24| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_24| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_24|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_23|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][72], [Black: 244#(= ~h~0 |ULTIMATE.start_main_~x~3#1|), Black: 249#(and (= ~h~0 ~g~0) (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|) (= ~h~0 |ULTIMATE.start_main_~x~3#1|)), 24#ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAKtrue, t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, 102#L694true, 62#t3_funErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 259#true, t_funThread1of1ForFork1InUse, Black: 225#(<= ~h~0 ~g~0), Black: 231#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 233#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 226#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 223#true, 227#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), 245#(= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|), Black: 251#(and (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|) (= ~h~0 |ULTIMATE.start_main_~x~3#1|)), 196#t2_funEXITtrue, Black: 241#true, 204#true, Black: 243#(= ~h~0 ~g~0)]) [2023-11-19 08:02:11,112 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-11-19 08:02:11,112 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 08:02:11,112 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 08:02:11,113 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 08:02:11,113 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 08:02:11,113 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([516] L693-->L694: Formula: (= |v_#pthreadsMutex_23| (store |v_#pthreadsMutex_24| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_24| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_24|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_23|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][72], [Black: 244#(= ~h~0 |ULTIMATE.start_main_~x~3#1|), Black: 249#(and (= ~h~0 ~g~0) (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|) (= ~h~0 |ULTIMATE.start_main_~x~3#1|)), t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, 102#L694true, 62#t3_funErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 259#true, t_funThread1of1ForFork1InUse, Black: 225#(<= ~h~0 ~g~0), Black: 231#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 233#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 226#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 223#true, 227#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), 245#(= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|), 48#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 251#(and (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|) (= ~h~0 |ULTIMATE.start_main_~x~3#1|)), 196#t2_funEXITtrue, Black: 241#true, 204#true, Black: 243#(= ~h~0 ~g~0)]) [2023-11-19 08:02:11,113 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-11-19 08:02:11,113 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 08:02:11,113 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 08:02:11,113 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 08:02:11,113 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-19 08:02:11,231 INFO L124 PetriNetUnfolderBase]: 6688/11240 cut-off events. [2023-11-19 08:02:11,231 INFO L125 PetriNetUnfolderBase]: For 10447/10837 co-relation queries the response was YES. [2023-11-19 08:02:11,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30084 conditions, 11240 events. 6688/11240 cut-off events. For 10447/10837 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 81686 event pairs, 2746 based on Foata normal form. 1249/10929 useless extension candidates. Maximal degree in co-relation 30069. Up to 6354 conditions per place. [2023-11-19 08:02:11,310 INFO L140 encePairwiseOnDemand]: 403/418 looper letters, 67 selfloop transitions, 16 changer transitions 0/100 dead transitions. [2023-11-19 08:02:11,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 100 transitions, 671 flow [2023-11-19 08:02:11,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:02:11,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:02:11,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 579 transitions. [2023-11-19 08:02:11,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46172248803827753 [2023-11-19 08:02:11,314 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 579 transitions. [2023-11-19 08:02:11,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 579 transitions. [2023-11-19 08:02:11,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:11,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 579 transitions. [2023-11-19 08:02:11,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 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-19 08:02:11,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 418.0) internal successors, (1672), 4 states have internal predecessors, (1672), 0 states have call successors, (0), 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-19 08:02:11,320 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 418.0) internal successors, (1672), 4 states have internal predecessors, (1672), 0 states have call successors, (0), 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-19 08:02:11,320 INFO L175 Difference]: Start difference. First operand has 72 places, 65 transitions, 352 flow. Second operand 3 states and 579 transitions. [2023-11-19 08:02:11,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 100 transitions, 671 flow [2023-11-19 08:02:11,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 100 transitions, 667 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-11-19 08:02:11,472 INFO L231 Difference]: Finished difference. Result has 75 places, 74 transitions, 434 flow [2023-11-19 08:02:11,472 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=418, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=434, PETRI_PLACES=75, PETRI_TRANSITIONS=74} [2023-11-19 08:02:11,475 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 21 predicate places. [2023-11-19 08:02:11,476 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 74 transitions, 434 flow [2023-11-19 08:02:11,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 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-19 08:02:11,476 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:11,477 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:02:11,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 08:02:11,477 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 08:02:11,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:11,477 INFO L85 PathProgramCache]: Analyzing trace with hash -819680003, now seen corresponding path program 1 times [2023-11-19 08:02:11,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:11,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441688301] [2023-11-19 08:02:11,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:11,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:11,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:11,619 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-19 08:02:11,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:11,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441688301] [2023-11-19 08:02:11,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441688301] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:11,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:11,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:02:11,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588490278] [2023-11-19 08:02:11,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:11,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 08:02:11,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:11,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 08:02:11,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:02:11,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 418 [2023-11-19 08:02:11,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 74 transitions, 434 flow. Second operand has 5 states, 5 states have (on average 178.2) internal successors, (891), 5 states have internal predecessors, (891), 0 states have call successors, (0), 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-19 08:02:11,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:11,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 418 [2023-11-19 08:02:11,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:13,029 INFO L124 PetriNetUnfolderBase]: 6781/11466 cut-off events. [2023-11-19 08:02:13,030 INFO L125 PetriNetUnfolderBase]: For 18441/18904 co-relation queries the response was YES. [2023-11-19 08:02:13,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38479 conditions, 11466 events. 6781/11466 cut-off events. For 18441/18904 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 81809 event pairs, 1586 based on Foata normal form. 167/10312 useless extension candidates. Maximal degree in co-relation 38462. Up to 4740 conditions per place. [2023-11-19 08:02:13,124 INFO L140 encePairwiseOnDemand]: 411/418 looper letters, 140 selfloop transitions, 36 changer transitions 1/193 dead transitions. [2023-11-19 08:02:13,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 193 transitions, 1484 flow [2023-11-19 08:02:13,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 08:02:13,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-19 08:02:13,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1521 transitions. [2023-11-19 08:02:13,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4548444976076555 [2023-11-19 08:02:13,133 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1521 transitions. [2023-11-19 08:02:13,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1521 transitions. [2023-11-19 08:02:13,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:13,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1521 transitions. [2023-11-19 08:02:13,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 190.125) internal successors, (1521), 8 states have internal predecessors, (1521), 0 states have call successors, (0), 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-19 08:02:13,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 418.0) internal successors, (3762), 9 states have internal predecessors, (3762), 0 states have call successors, (0), 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-19 08:02:13,150 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 418.0) internal successors, (3762), 9 states have internal predecessors, (3762), 0 states have call successors, (0), 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-19 08:02:13,150 INFO L175 Difference]: Start difference. First operand has 75 places, 74 transitions, 434 flow. Second operand 8 states and 1521 transitions. [2023-11-19 08:02:13,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 193 transitions, 1484 flow [2023-11-19 08:02:13,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 193 transitions, 1436 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 08:02:13,342 INFO L231 Difference]: Finished difference. Result has 87 places, 99 transitions, 804 flow [2023-11-19 08:02:13,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=418, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=804, PETRI_PLACES=87, PETRI_TRANSITIONS=99} [2023-11-19 08:02:13,344 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 33 predicate places. [2023-11-19 08:02:13,344 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 99 transitions, 804 flow [2023-11-19 08:02:13,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 178.2) internal successors, (891), 5 states have internal predecessors, (891), 0 states have call successors, (0), 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-19 08:02:13,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:13,345 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:02:13,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 08:02:13,346 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 08:02:13,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:13,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1047820154, now seen corresponding path program 1 times [2023-11-19 08:02:13,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:13,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58646259] [2023-11-19 08:02:13,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:13,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:13,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:13,514 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-19 08:02:13,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:13,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58646259] [2023-11-19 08:02:13,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58646259] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:13,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:13,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 08:02:13,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361888006] [2023-11-19 08:02:13,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:13,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:02:13,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:13,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:02:13,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:02:13,603 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 418 [2023-11-19 08:02:13,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 99 transitions, 804 flow. Second operand has 6 states, 6 states have (on average 176.83333333333334) internal successors, (1061), 6 states have internal predecessors, (1061), 0 states have call successors, (0), 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-19 08:02:13,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:13,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 418 [2023-11-19 08:02:13,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:15,988 INFO L124 PetriNetUnfolderBase]: 8666/14400 cut-off events. [2023-11-19 08:02:15,988 INFO L125 PetriNetUnfolderBase]: For 31997/32240 co-relation queries the response was YES. [2023-11-19 08:02:16,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49707 conditions, 14400 events. 8666/14400 cut-off events. For 31997/32240 co-relation queries the response was YES. Maximal size of possible extension queue 704. Compared 104133 event pairs, 2092 based on Foata normal form. 419/13478 useless extension candidates. Maximal degree in co-relation 49685. Up to 5887 conditions per place. [2023-11-19 08:02:16,124 INFO L140 encePairwiseOnDemand]: 412/418 looper letters, 172 selfloop transitions, 41 changer transitions 0/229 dead transitions. [2023-11-19 08:02:16,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 229 transitions, 1894 flow [2023-11-19 08:02:16,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 08:02:16,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 08:02:16,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1354 transitions. [2023-11-19 08:02:16,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46274777853725224 [2023-11-19 08:02:16,138 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1354 transitions. [2023-11-19 08:02:16,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1354 transitions. [2023-11-19 08:02:16,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:16,142 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1354 transitions. [2023-11-19 08:02:16,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 193.42857142857142) internal successors, (1354), 7 states have internal predecessors, (1354), 0 states have call successors, (0), 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-19 08:02:16,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 418.0) internal successors, (3344), 8 states have internal predecessors, (3344), 0 states have call successors, (0), 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-19 08:02:16,159 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 418.0) internal successors, (3344), 8 states have internal predecessors, (3344), 0 states have call successors, (0), 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-19 08:02:16,159 INFO L175 Difference]: Start difference. First operand has 87 places, 99 transitions, 804 flow. Second operand 7 states and 1354 transitions. [2023-11-19 08:02:16,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 229 transitions, 1894 flow [2023-11-19 08:02:16,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 229 transitions, 1886 flow, removed 4 selfloop flow, removed 0 redundant places. [2023-11-19 08:02:16,476 INFO L231 Difference]: Finished difference. Result has 97 places, 103 transitions, 928 flow [2023-11-19 08:02:16,476 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=418, PETRI_DIFFERENCE_MINUEND_FLOW=796, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=928, PETRI_PLACES=97, PETRI_TRANSITIONS=103} [2023-11-19 08:02:16,477 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 43 predicate places. [2023-11-19 08:02:16,477 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 103 transitions, 928 flow [2023-11-19 08:02:16,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 176.83333333333334) internal successors, (1061), 6 states have internal predecessors, (1061), 0 states have call successors, (0), 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-19 08:02:16,478 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:16,478 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:02:16,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 08:02:16,478 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 08:02:16,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:16,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1009877243, now seen corresponding path program 1 times [2023-11-19 08:02:16,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:16,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846286557] [2023-11-19 08:02:16,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:16,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:16,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:16,556 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-19 08:02:16,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:16,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846286557] [2023-11-19 08:02:16,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846286557] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:16,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:16,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:02:16,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012372739] [2023-11-19 08:02:16,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:16,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 08:02:16,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:16,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 08:02:16,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 08:02:16,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 418 [2023-11-19 08:02:16,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 103 transitions, 928 flow. Second operand has 4 states, 4 states have (on average 178.25) internal successors, (713), 4 states have internal predecessors, (713), 0 states have call successors, (0), 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-19 08:02:16,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:16,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 418 [2023-11-19 08:02:16,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:17,606 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([650] L19-5-->L736: Formula: (= |v_#pthreadsMutex_81| (store |v_#pthreadsMutex_82| |v_~#B~0.base_37| (store (select |v_#pthreadsMutex_82| |v_~#B~0.base_37|) |v_~#B~0.offset_37| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_82|, ~#B~0.base=|v_~#B~0.base_37|, ~#B~0.offset=|v_~#B~0.offset_37|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_81|, ~#B~0.base=|v_~#B~0.base_37|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_33|, ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_45|, ~#B~0.offset=|v_~#B~0.offset_37|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start___VERIFIER_assert_#in~cond#1, ULTIMATE.start___VERIFIER_assert_~cond#1][95], [Black: 244#(= ~h~0 |ULTIMATE.start_main_~x~3#1|), Black: 249#(and (= ~h~0 ~g~0) (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|) (= ~h~0 |ULTIMATE.start_main_~x~3#1|)), t3_funThread1of1ForFork2InUse, Black: 261#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1), t2_funThread1of1ForFork0InUse, 304#(= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|), 102#L694true, t_funThread1of1ForFork1InUse, 87#t3_funEXITtrue, Black: 274#(and (= |t3_funThread1of1ForFork2_~x~2#1| ~h~0) (= |t3_funThread1of1ForFork2_~x~2#1| |t3_funThread1of1ForFork2_~y~1#1|)), Black: 266#(= ~h~0 ~g~0), Black: 267#(= |t3_funThread1of1ForFork2_~x~2#1| ~h~0), Black: 264#true, Black: 272#(and (= ~h~0 ~g~0) (= |t3_funThread1of1ForFork2_~x~2#1| ~h~0) (= |t3_funThread1of1ForFork2_~x~2#1| |t3_funThread1of1ForFork2_~y~1#1|)), 245#(= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|), 196#t2_funEXITtrue, 204#true, 289#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0)), Black: 292#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0) (<= (+ ~h~0 17) |t2_funThread1of1ForFork0_~x~1#1|)), 117#L736true, Black: 225#(<= ~h~0 ~g~0), Black: 294#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0) (<= (+ ~h~0 17) |t2_funThread1of1ForFork0_~x~1#1|) (<= (+ |t2_funThread1of1ForFork0_~y~0#1| 17) |t2_funThread1of1ForFork0_~x~1#1|)), Black: 296#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ |t2_funThread1of1ForFork0_~y~0#1| 17) |t2_funThread1of1ForFork0_~x~1#1|)), Black: 231#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 233#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 226#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 223#true, 227#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), 268#(= |t3_funThread1of1ForFork2_~x~2#1| |t3_funThread1of1ForFork2_~y~1#1|), Black: 251#(and (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|) (= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 241#true, Black: 243#(= ~h~0 ~g~0)]) [2023-11-19 08:02:17,606 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-19 08:02:17,606 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 08:02:17,606 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 08:02:17,606 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-19 08:02:17,630 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([568] L704-1-->L706: Formula: (= |v_t2_funThread1of1ForFork0_~x~1#1_9| v_~g~0_8) InVars {~g~0=v_~g~0_8} OutVars{t2_funThread1of1ForFork0_~x~1#1=|v_t2_funThread1of1ForFork0_~x~1#1_9|, t2_funThread1of1ForFork0_#t~nondet7#1=|v_t2_funThread1of1ForFork0_#t~nondet7#1_7|, ~g~0=v_~g~0_8} AuxVars[] AssignedVars[t2_funThread1of1ForFork0_~x~1#1, t2_funThread1of1ForFork0_#t~nondet7#1][102], [Black: 244#(= ~h~0 |ULTIMATE.start_main_~x~3#1|), Black: 249#(and (= ~h~0 ~g~0) (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|) (= ~h~0 |ULTIMATE.start_main_~x~3#1|)), 292#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0) (<= (+ ~h~0 17) |t2_funThread1of1ForFork0_~x~1#1|)), t3_funThread1of1ForFork2InUse, t2_funThread1of1ForFork0InUse, 304#(= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|), t_funThread1of1ForFork1InUse, 87#t3_funEXITtrue, 158#L706true, Black: 274#(and (= |t3_funThread1of1ForFork2_~x~2#1| ~h~0) (= |t3_funThread1of1ForFork2_~x~2#1| |t3_funThread1of1ForFork2_~y~1#1|)), Black: 266#(= ~h~0 ~g~0), Black: 267#(= |t3_funThread1of1ForFork2_~x~2#1| ~h~0), Black: 264#true, Black: 272#(and (= ~h~0 ~g~0) (= |t3_funThread1of1ForFork2_~x~2#1| ~h~0) (= |t3_funThread1of1ForFork2_~x~2#1| |t3_funThread1of1ForFork2_~y~1#1|)), 48#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, 245#(= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|), 223#true, 204#true, 261#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1), 162#L693true, Black: 289#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0)), Black: 225#(<= ~h~0 ~g~0), Black: 227#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), Black: 294#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0) (<= (+ ~h~0 17) |t2_funThread1of1ForFork0_~x~1#1|) (<= (+ |t2_funThread1of1ForFork0_~y~0#1| 17) |t2_funThread1of1ForFork0_~x~1#1|)), Black: 231#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 296#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ |t2_funThread1of1ForFork0_~y~0#1| 17) |t2_funThread1of1ForFork0_~x~1#1|)), Black: 233#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 226#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), 268#(= |t3_funThread1of1ForFork2_~x~2#1| |t3_funThread1of1ForFork2_~y~1#1|), Black: 251#(and (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|) (= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 241#true, Black: 243#(= ~h~0 ~g~0)]) [2023-11-19 08:02:17,630 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is not cut-off event [2023-11-19 08:02:17,630 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is not cut-off event [2023-11-19 08:02:17,630 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is not cut-off event [2023-11-19 08:02:17,631 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is not cut-off event [2023-11-19 08:02:17,632 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([568] L704-1-->L706: Formula: (= |v_t2_funThread1of1ForFork0_~x~1#1_9| v_~g~0_8) InVars {~g~0=v_~g~0_8} OutVars{t2_funThread1of1ForFork0_~x~1#1=|v_t2_funThread1of1ForFork0_~x~1#1_9|, t2_funThread1of1ForFork0_#t~nondet7#1=|v_t2_funThread1of1ForFork0_#t~nondet7#1_7|, ~g~0=v_~g~0_8} AuxVars[] AssignedVars[t2_funThread1of1ForFork0_~x~1#1, t2_funThread1of1ForFork0_#t~nondet7#1][102], [Black: 244#(= ~h~0 |ULTIMATE.start_main_~x~3#1|), Black: 249#(and (= ~h~0 ~g~0) (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|) (= ~h~0 |ULTIMATE.start_main_~x~3#1|)), t3_funThread1of1ForFork2InUse, 292#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0) (<= (+ ~h~0 17) |t2_funThread1of1ForFork0_~x~1#1|)), Black: 261#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1), t2_funThread1of1ForFork0InUse, 304#(= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|), t_funThread1of1ForFork1InUse, 87#t3_funEXITtrue, 158#L706true, Black: 274#(and (= |t3_funThread1of1ForFork2_~x~2#1| ~h~0) (= |t3_funThread1of1ForFork2_~x~2#1| |t3_funThread1of1ForFork2_~y~1#1|)), Black: 266#(= ~h~0 ~g~0), Black: 267#(= |t3_funThread1of1ForFork2_~x~2#1| ~h~0), Black: 264#true, Black: 272#(and (= ~h~0 ~g~0) (= |t3_funThread1of1ForFork2_~x~2#1| ~h~0) (= |t3_funThread1of1ForFork2_~x~2#1| |t3_funThread1of1ForFork2_~y~1#1|)), 48#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, 245#(= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|), 223#true, 204#true, 162#L693true, Black: 289#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0)), Black: 225#(<= ~h~0 ~g~0), Black: 227#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), Black: 294#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0) (<= (+ ~h~0 17) |t2_funThread1of1ForFork0_~x~1#1|) (<= (+ |t2_funThread1of1ForFork0_~y~0#1| 17) |t2_funThread1of1ForFork0_~x~1#1|)), Black: 231#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 296#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ |t2_funThread1of1ForFork0_~y~0#1| 17) |t2_funThread1of1ForFork0_~x~1#1|)), Black: 233#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 226#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), 268#(= |t3_funThread1of1ForFork2_~x~2#1| |t3_funThread1of1ForFork2_~y~1#1|), Black: 251#(and (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|) (= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 241#true, Black: 243#(= ~h~0 ~g~0)]) [2023-11-19 08:02:17,632 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is not cut-off event [2023-11-19 08:02:17,632 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is not cut-off event [2023-11-19 08:02:17,632 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is not cut-off event [2023-11-19 08:02:17,633 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is not cut-off event [2023-11-19 08:02:17,781 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([588] L694-1-->L696: Formula: (= v_t_funThread1of1ForFork1_~x~0_23 v_~h~0_7) InVars {t_funThread1of1ForFork1_~x~0=v_t_funThread1of1ForFork1_~x~0_23} OutVars{t_funThread1of1ForFork1_~x~0=v_t_funThread1of1ForFork1_~x~0_23, t_funThread1of1ForFork1_#t~nondet4=|v_t_funThread1of1ForFork1_#t~nondet4_7|, ~h~0=v_~h~0_7} AuxVars[] AssignedVars[t_funThread1of1ForFork1_#t~nondet4, ~h~0][121], [Black: 244#(= ~h~0 |ULTIMATE.start_main_~x~3#1|), Black: 249#(and (= ~h~0 ~g~0) (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|) (= ~h~0 |ULTIMATE.start_main_~x~3#1|)), t3_funThread1of1ForFork2InUse, 88#L696true, t2_funThread1of1ForFork0InUse, t_funThread1of1ForFork1InUse, 284#(<= t_funThread1of1ForFork1_~x~0 ~g~0), 87#t3_funEXITtrue, Black: 274#(and (= |t3_funThread1of1ForFork2_~x~2#1| ~h~0) (= |t3_funThread1of1ForFork2_~x~2#1| |t3_funThread1of1ForFork2_~y~1#1|)), Black: 266#(= ~h~0 ~g~0), Black: 267#(= |t3_funThread1of1ForFork2_~x~2#1| ~h~0), Black: 264#true, Black: 272#(and (= ~h~0 ~g~0) (= |t3_funThread1of1ForFork2_~x~2#1| ~h~0) (= |t3_funThread1of1ForFork2_~x~2#1| |t3_funThread1of1ForFork2_~y~1#1|)), 245#(= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|), 196#t2_funEXITtrue, 204#true, 261#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1), Black: 289#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0)), Black: 292#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0) (<= (+ ~h~0 17) |t2_funThread1of1ForFork0_~x~1#1|)), Black: 225#(<= ~h~0 ~g~0), Black: 294#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0) (<= (+ ~h~0 17) |t2_funThread1of1ForFork0_~x~1#1|) (<= (+ |t2_funThread1of1ForFork0_~y~0#1| 17) |t2_funThread1of1ForFork0_~x~1#1|)), Black: 296#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ |t2_funThread1of1ForFork0_~y~0#1| 17) |t2_funThread1of1ForFork0_~x~1#1|)), Black: 231#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 233#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 226#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 223#true, 227#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), 268#(= |t3_funThread1of1ForFork2_~x~2#1| |t3_funThread1of1ForFork2_~y~1#1|), 135#L19-5true, Black: 251#(and (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|) (= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 241#true, 307#(and (not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0)) (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 243#(= ~h~0 ~g~0)]) [2023-11-19 08:02:17,781 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-11-19 08:02:17,782 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 08:02:17,782 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 08:02:17,782 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 08:02:17,849 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([688] L719-->t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= (ite (= |v_t3_funThread1of1ForFork2_~x~2#1_21| |v_t3_funThread1of1ForFork2_~y~1#1_17|) 1 0) |v_t3_funThread1of1ForFork2___VERIFIER_assert_#in~cond#1_23|) (= |v_t3_funThread1of1ForFork2___VERIFIER_assert_~cond#1_45| |v_t3_funThread1of1ForFork2___VERIFIER_assert_#in~cond#1_23|) (= |v_#pthreadsMutex_93| (store |v_#pthreadsMutex_94| |v_~#B~0.base_43| (store (select |v_#pthreadsMutex_94| |v_~#B~0.base_43|) |v_~#B~0.offset_43| 0))) (= |v_t3_funThread1of1ForFork2___VERIFIER_assert_~cond#1_45| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_94|, ~#B~0.base=|v_~#B~0.base_43|, t3_funThread1of1ForFork2_~x~2#1=|v_t3_funThread1of1ForFork2_~x~2#1_21|, t3_funThread1of1ForFork2_~y~1#1=|v_t3_funThread1of1ForFork2_~y~1#1_17|, ~#B~0.offset=|v_~#B~0.offset_43|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_93|, ~#B~0.base=|v_~#B~0.base_43|, t3_funThread1of1ForFork2___VERIFIER_assert_#in~cond#1=|v_t3_funThread1of1ForFork2___VERIFIER_assert_#in~cond#1_23|, t3_funThread1of1ForFork2_~x~2#1=|v_t3_funThread1of1ForFork2_~x~2#1_21|, t3_funThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_t3_funThread1of1ForFork2_reach_error_#t~nondet0#1.base_29|, t3_funThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_t3_funThread1of1ForFork2_reach_error_#t~nondet0#1.offset_29|, t3_funThread1of1ForFork2___VERIFIER_assert_~cond#1=|v_t3_funThread1of1ForFork2___VERIFIER_assert_~cond#1_45|, t3_funThread1of1ForFork2_~y~1#1=|v_t3_funThread1of1ForFork2_~y~1#1_17|, ~#B~0.offset=|v_~#B~0.offset_43|} AuxVars[] AssignedVars[#pthreadsMutex, t3_funThread1of1ForFork2___VERIFIER_assert_#in~cond#1, t3_funThread1of1ForFork2_reach_error_#t~nondet0#1.base, t3_funThread1of1ForFork2_reach_error_#t~nondet0#1.offset, t3_funThread1of1ForFork2___VERIFIER_assert_~cond#1][155], [Black: 244#(= ~h~0 |ULTIMATE.start_main_~x~3#1|), Black: 249#(and (= ~h~0 ~g~0) (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|) (= ~h~0 |ULTIMATE.start_main_~x~3#1|)), t3_funThread1of1ForFork2InUse, Black: 261#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1), t2_funThread1of1ForFork0InUse, 304#(= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|), t_funThread1of1ForFork1InUse, Black: 268#(= |t3_funThread1of1ForFork2_~x~2#1| |t3_funThread1of1ForFork2_~y~1#1|), Black: 274#(and (= |t3_funThread1of1ForFork2_~x~2#1| ~h~0) (= |t3_funThread1of1ForFork2_~x~2#1| |t3_funThread1of1ForFork2_~y~1#1|)), Black: 266#(= ~h~0 ~g~0), Black: 267#(= |t3_funThread1of1ForFork2_~x~2#1| ~h~0), Black: 272#(and (= ~h~0 ~g~0) (= |t3_funThread1of1ForFork2_~x~2#1| ~h~0) (= |t3_funThread1of1ForFork2_~x~2#1| |t3_funThread1of1ForFork2_~y~1#1|)), 48#ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAKtrue, 245#(= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|), 196#t2_funEXITtrue, 264#true, 204#true, 289#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0)), 162#L693true, 62#t3_funErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 225#(<= ~h~0 ~g~0), Black: 292#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0) (<= (+ ~h~0 17) |t2_funThread1of1ForFork0_~x~1#1|)), Black: 294#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0) (<= (+ ~h~0 17) |t2_funThread1of1ForFork0_~x~1#1|) (<= (+ |t2_funThread1of1ForFork0_~y~0#1| 17) |t2_funThread1of1ForFork0_~x~1#1|)), Black: 231#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 296#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ |t2_funThread1of1ForFork0_~y~0#1| 17) |t2_funThread1of1ForFork0_~x~1#1|)), Black: 233#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 226#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 223#true, 227#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), Black: 251#(and (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|) (= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 241#true, Black: 243#(= ~h~0 ~g~0)]) [2023-11-19 08:02:17,849 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-11-19 08:02:17,849 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 08:02:17,849 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 08:02:17,849 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-19 08:02:17,902 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([650] L19-5-->L736: Formula: (= |v_#pthreadsMutex_81| (store |v_#pthreadsMutex_82| |v_~#B~0.base_37| (store (select |v_#pthreadsMutex_82| |v_~#B~0.base_37|) |v_~#B~0.offset_37| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_82|, ~#B~0.base=|v_~#B~0.base_37|, ~#B~0.offset=|v_~#B~0.offset_37|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_81|, ~#B~0.base=|v_~#B~0.base_37|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_33|, ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_45|, ~#B~0.offset=|v_~#B~0.offset_37|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start___VERIFIER_assert_#in~cond#1, ULTIMATE.start___VERIFIER_assert_~cond#1][30], [Black: 244#(= ~h~0 |ULTIMATE.start_main_~x~3#1|), Black: 249#(and (= ~h~0 ~g~0) (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|) (= ~h~0 |ULTIMATE.start_main_~x~3#1|)), t3_funThread1of1ForFork2InUse, Black: 261#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1), t2_funThread1of1ForFork0InUse, 304#(= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|), t_funThread1of1ForFork1InUse, 87#t3_funEXITtrue, Black: 274#(and (= |t3_funThread1of1ForFork2_~x~2#1| ~h~0) (= |t3_funThread1of1ForFork2_~x~2#1| |t3_funThread1of1ForFork2_~y~1#1|)), Black: 266#(= ~h~0 ~g~0), Black: 267#(= |t3_funThread1of1ForFork2_~x~2#1| ~h~0), Black: 264#true, Black: 272#(and (= ~h~0 ~g~0) (= |t3_funThread1of1ForFork2_~x~2#1| ~h~0) (= |t3_funThread1of1ForFork2_~x~2#1| |t3_funThread1of1ForFork2_~y~1#1|)), 98#L694-1true, 245#(= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|), 196#t2_funEXITtrue, 204#true, 289#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0)), 117#L736true, Black: 292#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0) (<= (+ ~h~0 17) |t2_funThread1of1ForFork0_~x~1#1|)), Black: 225#(<= ~h~0 ~g~0), Black: 294#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ ~h~0 17) ~g~0) (<= (+ ~h~0 17) |t2_funThread1of1ForFork0_~x~1#1|) (<= (+ |t2_funThread1of1ForFork0_~y~0#1| 17) |t2_funThread1of1ForFork0_~x~1#1|)), Black: 296#(and (<= t_funThread1of1ForFork1_~x~0 ~g~0) (<= (+ |t2_funThread1of1ForFork0_~y~0#1| 17) |t2_funThread1of1ForFork0_~x~1#1|)), Black: 231#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= ~h~0 ~g~0) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 233#(and (<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|) (<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|)), Black: 226#(<= ~h~0 |t2_funThread1of1ForFork0_~x~1#1|), Black: 223#true, 227#(<= |t2_funThread1of1ForFork0_~y~0#1| |t2_funThread1of1ForFork0_~x~1#1|), 268#(= |t3_funThread1of1ForFork2_~x~2#1| |t3_funThread1of1ForFork2_~y~1#1|), Black: 251#(and (= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|) (= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 241#true, Black: 243#(= ~h~0 ~g~0)]) [2023-11-19 08:02:17,902 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is not cut-off event [2023-11-19 08:02:17,902 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2023-11-19 08:02:17,902 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2023-11-19 08:02:17,902 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is not cut-off event [2023-11-19 08:02:18,141 INFO L124 PetriNetUnfolderBase]: 6293/10990 cut-off events. [2023-11-19 08:02:18,142 INFO L125 PetriNetUnfolderBase]: For 32593/33033 co-relation queries the response was YES. [2023-11-19 08:02:18,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40615 conditions, 10990 events. 6293/10990 cut-off events. For 32593/33033 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 81901 event pairs, 1581 based on Foata normal form. 194/10716 useless extension candidates. Maximal degree in co-relation 40588. Up to 4691 conditions per place. [2023-11-19 08:02:18,213 INFO L140 encePairwiseOnDemand]: 412/418 looper letters, 123 selfloop transitions, 10 changer transitions 0/166 dead transitions. [2023-11-19 08:02:18,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 166 transitions, 1688 flow [2023-11-19 08:02:18,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 08:02:18,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 08:02:18,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 759 transitions. [2023-11-19 08:02:18,216 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45394736842105265 [2023-11-19 08:02:18,216 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 759 transitions. [2023-11-19 08:02:18,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 759 transitions. [2023-11-19 08:02:18,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:18,217 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 759 transitions. [2023-11-19 08:02:18,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 189.75) internal successors, (759), 4 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:02:18,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 418.0) internal successors, (2090), 5 states have internal predecessors, (2090), 0 states have call successors, (0), 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-19 08:02:18,223 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 418.0) internal successors, (2090), 5 states have internal predecessors, (2090), 0 states have call successors, (0), 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-19 08:02:18,223 INFO L175 Difference]: Start difference. First operand has 97 places, 103 transitions, 928 flow. Second operand 4 states and 759 transitions. [2023-11-19 08:02:18,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 166 transitions, 1688 flow [2023-11-19 08:02:18,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 166 transitions, 1600 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-19 08:02:18,403 INFO L231 Difference]: Finished difference. Result has 97 places, 102 transitions, 886 flow [2023-11-19 08:02:18,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=418, PETRI_DIFFERENCE_MINUEND_FLOW=866, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=886, PETRI_PLACES=97, PETRI_TRANSITIONS=102} [2023-11-19 08:02:18,404 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 43 predicate places. [2023-11-19 08:02:18,404 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 102 transitions, 886 flow [2023-11-19 08:02:18,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 178.25) internal successors, (713), 4 states have internal predecessors, (713), 0 states have call successors, (0), 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-19 08:02:18,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:18,405 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:02:18,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 08:02:18,405 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 08:02:18,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:18,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1009877316, now seen corresponding path program 1 times [2023-11-19 08:02:18,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:18,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418044516] [2023-11-19 08:02:18,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:18,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:18,732 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-19 08:02:18,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:18,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418044516] [2023-11-19 08:02:18,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418044516] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:18,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:18,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 08:02:18,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678665281] [2023-11-19 08:02:18,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:18,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:02:18,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:18,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:02:18,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:02:18,802 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 418 [2023-11-19 08:02:18,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 102 transitions, 886 flow. Second operand has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 0 states have call successors, (0), 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-19 08:02:18,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:18,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 418 [2023-11-19 08:02:18,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:19,867 INFO L124 PetriNetUnfolderBase]: 4275/7896 cut-off events. [2023-11-19 08:02:19,867 INFO L125 PetriNetUnfolderBase]: For 27241/27575 co-relation queries the response was YES. [2023-11-19 08:02:19,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30984 conditions, 7896 events. 4275/7896 cut-off events. For 27241/27575 co-relation queries the response was YES. Maximal size of possible extension queue 469. Compared 60337 event pairs, 1775 based on Foata normal form. 749/8207 useless extension candidates. Maximal degree in co-relation 30957. Up to 4460 conditions per place. [2023-11-19 08:02:19,924 INFO L140 encePairwiseOnDemand]: 415/418 looper letters, 90 selfloop transitions, 4 changer transitions 1/133 dead transitions. [2023-11-19 08:02:19,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 133 transitions, 1307 flow [2023-11-19 08:02:19,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:02:19,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:02:19,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 570 transitions. [2023-11-19 08:02:19,927 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2023-11-19 08:02:19,928 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 570 transitions. [2023-11-19 08:02:19,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 570 transitions. [2023-11-19 08:02:19,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:19,928 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 570 transitions. [2023-11-19 08:02:19,930 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 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-19 08:02:19,932 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 418.0) internal successors, (1672), 4 states have internal predecessors, (1672), 0 states have call successors, (0), 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-19 08:02:19,933 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 418.0) internal successors, (1672), 4 states have internal predecessors, (1672), 0 states have call successors, (0), 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-19 08:02:19,933 INFO L175 Difference]: Start difference. First operand has 97 places, 102 transitions, 886 flow. Second operand 3 states and 570 transitions. [2023-11-19 08:02:19,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 133 transitions, 1307 flow [2023-11-19 08:02:20,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 133 transitions, 1289 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-19 08:02:20,128 INFO L231 Difference]: Finished difference. Result has 95 places, 101 transitions, 872 flow [2023-11-19 08:02:20,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=418, PETRI_DIFFERENCE_MINUEND_FLOW=864, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=872, PETRI_PLACES=95, PETRI_TRANSITIONS=101} [2023-11-19 08:02:20,129 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 41 predicate places. [2023-11-19 08:02:20,129 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 101 transitions, 872 flow [2023-11-19 08:02:20,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 0 states have call successors, (0), 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-19 08:02:20,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:20,130 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:02:20,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 08:02:20,130 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 08:02:20,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:20,131 INFO L85 PathProgramCache]: Analyzing trace with hash 216183868, now seen corresponding path program 1 times [2023-11-19 08:02:20,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:20,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006681889] [2023-11-19 08:02:20,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:20,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:20,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:20,292 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-19 08:02:20,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:20,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006681889] [2023-11-19 08:02:20,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006681889] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:20,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:20,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:02:20,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649887457] [2023-11-19 08:02:20,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:20,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 08:02:20,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:20,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 08:02:20,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:02:20,372 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 418 [2023-11-19 08:02:20,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 101 transitions, 872 flow. Second operand has 5 states, 5 states have (on average 174.2) internal successors, (871), 5 states have internal predecessors, (871), 0 states have call successors, (0), 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-19 08:02:20,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:20,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 418 [2023-11-19 08:02:20,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:20,888 INFO L124 PetriNetUnfolderBase]: 1608/3410 cut-off events. [2023-11-19 08:02:20,888 INFO L125 PetriNetUnfolderBase]: For 11276/11472 co-relation queries the response was YES. [2023-11-19 08:02:20,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12981 conditions, 3410 events. 1608/3410 cut-off events. For 11276/11472 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 24359 event pairs, 306 based on Foata normal form. 438/3716 useless extension candidates. Maximal degree in co-relation 12954. Up to 2118 conditions per place. [2023-11-19 08:02:20,905 INFO L140 encePairwiseOnDemand]: 408/418 looper letters, 64 selfloop transitions, 17 changer transitions 4/111 dead transitions. [2023-11-19 08:02:20,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 111 transitions, 1039 flow [2023-11-19 08:02:20,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 08:02:20,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 08:02:20,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 735 transitions. [2023-11-19 08:02:20,908 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4395933014354067 [2023-11-19 08:02:20,909 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 735 transitions. [2023-11-19 08:02:20,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 735 transitions. [2023-11-19 08:02:20,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:20,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 735 transitions. [2023-11-19 08:02:20,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 183.75) internal successors, (735), 4 states have internal predecessors, (735), 0 states have call successors, (0), 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-19 08:02:20,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 418.0) internal successors, (2090), 5 states have internal predecessors, (2090), 0 states have call successors, (0), 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-19 08:02:20,916 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 418.0) internal successors, (2090), 5 states have internal predecessors, (2090), 0 states have call successors, (0), 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-19 08:02:20,917 INFO L175 Difference]: Start difference. First operand has 95 places, 101 transitions, 872 flow. Second operand 4 states and 735 transitions. [2023-11-19 08:02:20,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 111 transitions, 1039 flow [2023-11-19 08:02:20,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 111 transitions, 1003 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-11-19 08:02:20,968 INFO L231 Difference]: Finished difference. Result has 93 places, 89 transitions, 729 flow [2023-11-19 08:02:20,969 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=418, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=729, PETRI_PLACES=93, PETRI_TRANSITIONS=89} [2023-11-19 08:02:20,969 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 39 predicate places. [2023-11-19 08:02:20,969 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 89 transitions, 729 flow [2023-11-19 08:02:20,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 174.2) internal successors, (871), 5 states have internal predecessors, (871), 0 states have call successors, (0), 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-19 08:02:20,970 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:20,970 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:02:20,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 08:02:20,971 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 08:02:20,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:20,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1100700346, now seen corresponding path program 1 times [2023-11-19 08:02:20,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:20,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581691491] [2023-11-19 08:02:20,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:20,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:20,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:21,072 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-19 08:02:21,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:21,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581691491] [2023-11-19 08:02:21,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581691491] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:21,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:21,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 08:02:21,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946602381] [2023-11-19 08:02:21,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:21,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:02:21,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:21,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:02:21,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:02:21,137 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 418 [2023-11-19 08:02:21,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 89 transitions, 729 flow. Second operand has 6 states, 6 states have (on average 177.16666666666666) internal successors, (1063), 6 states have internal predecessors, (1063), 0 states have call successors, (0), 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-19 08:02:21,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:21,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 418 [2023-11-19 08:02:21,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:21,930 INFO L124 PetriNetUnfolderBase]: 1552/3343 cut-off events. [2023-11-19 08:02:21,930 INFO L125 PetriNetUnfolderBase]: For 9569/9711 co-relation queries the response was YES. [2023-11-19 08:02:21,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13091 conditions, 3343 events. 1552/3343 cut-off events. For 9569/9711 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 24359 event pairs, 176 based on Foata normal form. 162/3432 useless extension candidates. Maximal degree in co-relation 13066. Up to 1280 conditions per place. [2023-11-19 08:02:21,949 INFO L140 encePairwiseOnDemand]: 410/418 looper letters, 166 selfloop transitions, 42 changer transitions 11/233 dead transitions. [2023-11-19 08:02:21,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 233 transitions, 2003 flow [2023-11-19 08:02:21,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-19 08:02:21,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-19 08:02:21,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2425 transitions. [2023-11-19 08:02:21,959 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44626426205373576 [2023-11-19 08:02:21,959 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2425 transitions. [2023-11-19 08:02:21,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2425 transitions. [2023-11-19 08:02:21,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:21,962 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2425 transitions. [2023-11-19 08:02:21,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 186.53846153846155) internal successors, (2425), 13 states have internal predecessors, (2425), 0 states have call successors, (0), 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-19 08:02:21,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 418.0) internal successors, (5852), 14 states have internal predecessors, (5852), 0 states have call successors, (0), 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-19 08:02:21,981 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 418.0) internal successors, (5852), 14 states have internal predecessors, (5852), 0 states have call successors, (0), 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-19 08:02:21,982 INFO L175 Difference]: Start difference. First operand has 93 places, 89 transitions, 729 flow. Second operand 13 states and 2425 transitions. [2023-11-19 08:02:21,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 233 transitions, 2003 flow [2023-11-19 08:02:22,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 233 transitions, 1914 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-11-19 08:02:22,026 INFO L231 Difference]: Finished difference. Result has 107 places, 96 transitions, 914 flow [2023-11-19 08:02:22,026 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=418, PETRI_DIFFERENCE_MINUEND_FLOW=708, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=914, PETRI_PLACES=107, PETRI_TRANSITIONS=96} [2023-11-19 08:02:22,027 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 53 predicate places. [2023-11-19 08:02:22,027 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 96 transitions, 914 flow [2023-11-19 08:02:22,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 177.16666666666666) internal successors, (1063), 6 states have internal predecessors, (1063), 0 states have call successors, (0), 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-19 08:02:22,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:22,028 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:02:22,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 08:02:22,028 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 08:02:22,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:22,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1235083783, now seen corresponding path program 1 times [2023-11-19 08:02:22,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:22,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644783301] [2023-11-19 08:02:22,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:22,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:22,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:22,166 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-19 08:02:22,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:22,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644783301] [2023-11-19 08:02:22,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644783301] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:22,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:22,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 08:02:22,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574066193] [2023-11-19 08:02:22,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:22,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 08:02:22,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:22,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 08:02:22,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:02:22,261 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 418 [2023-11-19 08:02:22,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 96 transitions, 914 flow. Second operand has 5 states, 5 states have (on average 173.4) internal successors, (867), 5 states have internal predecessors, (867), 0 states have call successors, (0), 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-19 08:02:22,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:22,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 418 [2023-11-19 08:02:22,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:22,536 INFO L124 PetriNetUnfolderBase]: 377/1185 cut-off events. [2023-11-19 08:02:22,537 INFO L125 PetriNetUnfolderBase]: For 2799/2865 co-relation queries the response was YES. [2023-11-19 08:02:22,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4534 conditions, 1185 events. 377/1185 cut-off events. For 2799/2865 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 8106 event pairs, 110 based on Foata normal form. 77/1232 useless extension candidates. Maximal degree in co-relation 4505. Up to 649 conditions per place. [2023-11-19 08:02:22,541 INFO L140 encePairwiseOnDemand]: 407/418 looper letters, 45 selfloop transitions, 14 changer transitions 2/76 dead transitions. [2023-11-19 08:02:22,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 76 transitions, 711 flow [2023-11-19 08:02:22,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 08:02:22,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 08:02:22,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 724 transitions. [2023-11-19 08:02:22,544 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43301435406698563 [2023-11-19 08:02:22,544 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 724 transitions. [2023-11-19 08:02:22,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 724 transitions. [2023-11-19 08:02:22,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:22,545 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 724 transitions. [2023-11-19 08:02:22,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 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-19 08:02:22,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 418.0) internal successors, (2090), 5 states have internal predecessors, (2090), 0 states have call successors, (0), 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-19 08:02:22,550 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 418.0) internal successors, (2090), 5 states have internal predecessors, (2090), 0 states have call successors, (0), 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-19 08:02:22,550 INFO L175 Difference]: Start difference. First operand has 107 places, 96 transitions, 914 flow. Second operand 4 states and 724 transitions. [2023-11-19 08:02:22,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 76 transitions, 711 flow [2023-11-19 08:02:22,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 76 transitions, 576 flow, removed 21 selfloop flow, removed 21 redundant places. [2023-11-19 08:02:22,564 INFO L231 Difference]: Finished difference. Result has 84 places, 66 transitions, 431 flow [2023-11-19 08:02:22,564 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=418, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=431, PETRI_PLACES=84, PETRI_TRANSITIONS=66} [2023-11-19 08:02:22,565 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 30 predicate places. [2023-11-19 08:02:22,565 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 66 transitions, 431 flow [2023-11-19 08:02:22,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 173.4) internal successors, (867), 5 states have internal predecessors, (867), 0 states have call successors, (0), 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-19 08:02:22,566 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:22,566 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:02:22,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-19 08:02:22,566 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 08:02:22,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:22,567 INFO L85 PathProgramCache]: Analyzing trace with hash 771601366, now seen corresponding path program 1 times [2023-11-19 08:02:22,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:22,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020070723] [2023-11-19 08:02:22,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:22,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:22,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:22,706 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-19 08:02:22,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:22,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020070723] [2023-11-19 08:02:22,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020070723] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:22,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:22,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 08:02:22,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460002073] [2023-11-19 08:02:22,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:22,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:02:22,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:22,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:02:22,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:02:22,772 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 418 [2023-11-19 08:02:22,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 66 transitions, 431 flow. Second operand has 6 states, 6 states have (on average 175.5) internal successors, (1053), 6 states have internal predecessors, (1053), 0 states have call successors, (0), 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-19 08:02:22,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:22,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 418 [2023-11-19 08:02:22,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:23,215 INFO L124 PetriNetUnfolderBase]: 430/1253 cut-off events. [2023-11-19 08:02:23,215 INFO L125 PetriNetUnfolderBase]: For 1790/1790 co-relation queries the response was YES. [2023-11-19 08:02:23,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4404 conditions, 1253 events. 430/1253 cut-off events. For 1790/1790 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 8142 event pairs, 120 based on Foata normal form. 24/1274 useless extension candidates. Maximal degree in co-relation 4388. Up to 358 conditions per place. [2023-11-19 08:02:23,223 INFO L140 encePairwiseOnDemand]: 409/418 looper letters, 72 selfloop transitions, 20 changer transitions 32/133 dead transitions. [2023-11-19 08:02:23,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 133 transitions, 1047 flow [2023-11-19 08:02:23,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-19 08:02:23,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-19 08:02:23,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2174 transitions. [2023-11-19 08:02:23,233 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43341307814992025 [2023-11-19 08:02:23,233 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2174 transitions. [2023-11-19 08:02:23,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2174 transitions. [2023-11-19 08:02:23,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:23,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2174 transitions. [2023-11-19 08:02:23,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 181.16666666666666) internal successors, (2174), 12 states have internal predecessors, (2174), 0 states have call successors, (0), 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-19 08:02:23,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 418.0) internal successors, (5434), 13 states have internal predecessors, (5434), 0 states have call successors, (0), 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-19 08:02:23,254 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 418.0) internal successors, (5434), 13 states have internal predecessors, (5434), 0 states have call successors, (0), 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-19 08:02:23,254 INFO L175 Difference]: Start difference. First operand has 84 places, 66 transitions, 431 flow. Second operand 12 states and 2174 transitions. [2023-11-19 08:02:23,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 133 transitions, 1047 flow [2023-11-19 08:02:23,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 133 transitions, 1000 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-11-19 08:02:23,262 INFO L231 Difference]: Finished difference. Result has 90 places, 57 transitions, 366 flow [2023-11-19 08:02:23,263 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=418, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=366, PETRI_PLACES=90, PETRI_TRANSITIONS=57} [2023-11-19 08:02:23,263 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 36 predicate places. [2023-11-19 08:02:23,263 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 57 transitions, 366 flow [2023-11-19 08:02:23,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 175.5) internal successors, (1053), 6 states have internal predecessors, (1053), 0 states have call successors, (0), 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-19 08:02:23,264 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:02:23,264 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:02:23,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-19 08:02:23,265 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK === [t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK, t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 08:02:23,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:02:23,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1056098821, now seen corresponding path program 1 times [2023-11-19 08:02:23,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:02:23,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892932419] [2023-11-19 08:02:23,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:02:23,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:02:23,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:02:23,453 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-19 08:02:23,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:02:23,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892932419] [2023-11-19 08:02:23,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892932419] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:02:23,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:02:23,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 08:02:23,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938668342] [2023-11-19 08:02:23,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:02:23,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:02:23,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:02:23,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:02:23,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:02:23,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 418 [2023-11-19 08:02:23,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 57 transitions, 366 flow. Second operand has 6 states, 6 states have (on average 177.66666666666666) internal successors, (1066), 6 states have internal predecessors, (1066), 0 states have call successors, (0), 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-19 08:02:23,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:02:23,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 418 [2023-11-19 08:02:23,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:02:23,750 INFO L124 PetriNetUnfolderBase]: 231/696 cut-off events. [2023-11-19 08:02:23,750 INFO L125 PetriNetUnfolderBase]: For 1233/1245 co-relation queries the response was YES. [2023-11-19 08:02:23,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2351 conditions, 696 events. 231/696 cut-off events. For 1233/1245 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3776 event pairs, 96 based on Foata normal form. 28/722 useless extension candidates. Maximal degree in co-relation 2336. Up to 282 conditions per place. [2023-11-19 08:02:23,753 INFO L140 encePairwiseOnDemand]: 412/418 looper letters, 0 selfloop transitions, 0 changer transitions 80/80 dead transitions. [2023-11-19 08:02:23,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 80 transitions, 607 flow [2023-11-19 08:02:23,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 08:02:23,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 08:02:23,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1278 transitions. [2023-11-19 08:02:23,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43677375256322626 [2023-11-19 08:02:23,759 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1278 transitions. [2023-11-19 08:02:23,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1278 transitions. [2023-11-19 08:02:23,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:02:23,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1278 transitions. [2023-11-19 08:02:23,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 182.57142857142858) internal successors, (1278), 7 states have internal predecessors, (1278), 0 states have call successors, (0), 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-19 08:02:23,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 418.0) internal successors, (3344), 8 states have internal predecessors, (3344), 0 states have call successors, (0), 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-19 08:02:23,769 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 418.0) internal successors, (3344), 8 states have internal predecessors, (3344), 0 states have call successors, (0), 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-19 08:02:23,769 INFO L175 Difference]: Start difference. First operand has 90 places, 57 transitions, 366 flow. Second operand 7 states and 1278 transitions. [2023-11-19 08:02:23,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 80 transitions, 607 flow [2023-11-19 08:02:23,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 80 transitions, 556 flow, removed 5 selfloop flow, removed 11 redundant places. [2023-11-19 08:02:23,774 INFO L231 Difference]: Finished difference. Result has 79 places, 0 transitions, 0 flow [2023-11-19 08:02:23,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=418, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=79, PETRI_TRANSITIONS=0} [2023-11-19 08:02:23,774 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 25 predicate places. [2023-11-19 08:02:23,775 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 0 transitions, 0 flow [2023-11-19 08:02:23,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 177.66666666666666) internal successors, (1066), 6 states have internal predecessors, (1066), 0 states have call successors, (0), 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-19 08:02:23,778 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-19 08:02:23,781 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-19 08:02:23,783 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-19 08:02:23,783 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-19 08:02:23,783 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-19 08:02:23,784 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-19 08:02:23,784 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-19 08:02:23,784 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-19 08:02:23,784 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (7 of 16 remaining) [2023-11-19 08:02:23,784 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (6 of 16 remaining) [2023-11-19 08:02:23,784 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-19 08:02:23,785 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-19 08:02:23,785 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-19 08:02:23,785 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-19 08:02:23,785 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 16 remaining) [2023-11-19 08:02:23,785 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t3_funErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-19 08:02:23,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-19 08:02:23,786 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:02:23,792 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 08:02:23,792 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 08:02:23,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:02:23 BasicIcfg [2023-11-19 08:02:23,796 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 08:02:23,797 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 08:02:23,797 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 08:02:23,797 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 08:02:23,798 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:01:52" (3/4) ... [2023-11-19 08:02:23,799 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-19 08:02:23,803 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure t2_fun [2023-11-19 08:02:23,803 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure t3_fun [2023-11-19 08:02:23,804 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure t_fun [2023-11-19 08:02:23,812 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2023-11-19 08:02:23,812 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-11-19 08:02:23,813 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-19 08:02:23,813 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-19 08:02:23,926 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c855d1da-864a-4d4a-bdd4-18f058fefa14/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml [2023-11-19 08:02:23,927 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c855d1da-864a-4d4a-bdd4-18f058fefa14/bin/uautomizer-verify-uCwYo4JHxu/witness.yml [2023-11-19 08:02:23,927 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 08:02:23,928 INFO L158 Benchmark]: Toolchain (without parser) took 32600.04ms. Allocated memory was 142.6MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 102.5MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 735.7MB. Max. memory is 16.1GB. [2023-11-19 08:02:23,928 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 142.6MB. Free memory is still 114.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 08:02:23,928 INFO L158 Benchmark]: CACSL2BoogieTranslator took 609.46ms. Allocated memory is still 142.6MB. Free memory was 102.5MB in the beginning and 82.6MB in the end (delta: 20.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-19 08:02:23,929 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.51ms. Allocated memory is still 142.6MB. Free memory was 82.6MB in the beginning and 80.0MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-19 08:02:23,929 INFO L158 Benchmark]: Boogie Preprocessor took 68.53ms. Allocated memory is still 142.6MB. Free memory was 80.0MB in the beginning and 78.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 08:02:23,929 INFO L158 Benchmark]: RCFGBuilder took 574.55ms. Allocated memory is still 142.6MB. Free memory was 78.4MB in the beginning and 58.9MB in the end (delta: 19.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-19 08:02:23,930 INFO L158 Benchmark]: TraceAbstraction took 31119.00ms. Allocated memory was 142.6MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 58.4MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 687.4MB. Max. memory is 16.1GB. [2023-11-19 08:02:23,930 INFO L158 Benchmark]: Witness Printer took 129.97ms. Allocated memory is still 2.3GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-19 08:02:23,935 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 142.6MB. Free memory is still 114.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 609.46ms. Allocated memory is still 142.6MB. Free memory was 102.5MB in the beginning and 82.6MB in the end (delta: 20.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.51ms. Allocated memory is still 142.6MB. Free memory was 82.6MB in the beginning and 80.0MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.53ms. Allocated memory is still 142.6MB. Free memory was 80.0MB in the beginning and 78.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 574.55ms. Allocated memory is still 142.6MB. Free memory was 78.4MB in the beginning and 58.9MB in the end (delta: 19.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 31119.00ms. Allocated memory was 142.6MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 58.4MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 687.4MB. Max. memory is 16.1GB. * Witness Printer took 129.97ms. Allocated memory is still 2.3GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.4s, 198 PlacesBefore, 54 PlacesAfterwards, 197 TransitionsBefore, 46 TransitionsAfterwards, 15122 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 133 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 7 ChoiceCompositions, 218 TotalNumberOfCompositions, 29697 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 14394, independent: 14003, independent conditional: 0, independent unconditional: 14003, dependent: 391, dependent conditional: 0, dependent unconditional: 391, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 8481, independent: 8423, independent conditional: 0, independent unconditional: 8423, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 14394, independent: 5580, independent conditional: 0, independent unconditional: 5580, dependent: 333, dependent conditional: 0, dependent unconditional: 333, unknown: 8481, unknown conditional: 0, unknown unconditional: 8481] , Statistics on independence cache: Total cache size (in pairs): 155, Positive cache size: 128, Positive conditional cache size: 0, Positive unconditional cache size: 128, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - PositiveResult [Line: 18]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 18]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 18]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 723]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 279 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 30.9s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 20.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1751 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1266 mSDsluCounter, 387 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 215 mSDsCounter, 133 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3287 IncrementalHoareTripleChecker+Invalid, 3420 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 133 mSolverCounterUnsat, 172 mSDtfsCounter, 3287 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=928occurred in iteration=10, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 188 NumberOfCodeBlocks, 188 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 171 ConstructedInterpolants, 0 QuantifiedInterpolants, 870 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 11 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-19 08:02:23,987 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c855d1da-864a-4d4a-bdd4-18f058fefa14/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE