./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe000_rmo.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b 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_423a9331-c205-4075-9a17-36407a7b33ff/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_423a9331-c205-4075-9a17-36407a7b33ff/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_423a9331-c205-4075-9a17-36407a7b33ff/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_423a9331-c205-4075-9a17-36407a7b33ff/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe000_rmo.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_423a9331-c205-4075-9a17-36407a7b33ff/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_423a9331-c205-4075-9a17-36407a7b33ff/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8451e3cb8884fa2b6b1e99bbb0d2794206f3a8d471135f07f1c96b53a42300f5 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:48:56,868 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:48:57,008 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_423a9331-c205-4075-9a17-36407a7b33ff/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 22:48:57,016 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:48:57,017 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:48:57,052 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:48:57,053 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:48:57,054 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:48:57,055 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:48:57,056 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:48:57,057 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:48:57,058 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:48:57,059 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:48:57,060 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:48:57,060 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:48:57,061 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:48:57,062 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:48:57,068 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:48:57,069 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:48:57,070 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:48:57,070 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:48:57,073 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:48:57,074 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:48:57,074 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:48:57,075 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:48:57,076 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:48:57,076 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:48:57,077 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:48:57,078 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:48:57,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:48:57,079 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:48:57,079 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:48:57,080 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:48:57,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:48:57,081 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:48:57,082 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:48:57,082 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:48:57,083 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:48:57,083 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_423a9331-c205-4075-9a17-36407a7b33ff/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_423a9331-c205-4075-9a17-36407a7b33ff/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8451e3cb8884fa2b6b1e99bbb0d2794206f3a8d471135f07f1c96b53a42300f5 [2023-11-06 22:48:57,507 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:48:57,547 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:48:57,550 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:48:57,551 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:48:57,552 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:48:57,554 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_423a9331-c205-4075-9a17-36407a7b33ff/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/safe000_rmo.i [2023-11-06 22:49:01,110 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:49:01,535 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:49:01,536 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_423a9331-c205-4075-9a17-36407a7b33ff/sv-benchmarks/c/pthread-wmm/safe000_rmo.i [2023-11-06 22:49:01,561 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_423a9331-c205-4075-9a17-36407a7b33ff/bin/uautomizer-verify-WvqO1wxjHP/data/95afd31f9/8c20dbb4179244d9ab5a33aacb869451/FLAG9dac38f61 [2023-11-06 22:49:01,579 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_423a9331-c205-4075-9a17-36407a7b33ff/bin/uautomizer-verify-WvqO1wxjHP/data/95afd31f9/8c20dbb4179244d9ab5a33aacb869451 [2023-11-06 22:49:01,583 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:49:01,585 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:49:01,587 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:49:01,587 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:49:01,596 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:49:01,601 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:49:01" (1/1) ... [2023-11-06 22:49:01,604 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c0c48b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:01, skipping insertion in model container [2023-11-06 22:49:01,604 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:49:01" (1/1) ... [2023-11-06 22:49:01,714 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:49:02,485 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:49:02,507 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:49:02,638 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:49:02,707 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:49:02,707 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:49:02,717 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:49:02,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:02 WrapperNode [2023-11-06 22:49:02,718 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:49:02,719 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:49:02,720 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:49:02,720 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:49:02,731 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:02" (1/1) ... [2023-11-06 22:49:02,785 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:02" (1/1) ... [2023-11-06 22:49:02,858 INFO L138 Inliner]: procedures = 176, calls = 83, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 172 [2023-11-06 22:49:02,859 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:49:02,860 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:49:02,861 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:49:02,861 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:49:02,901 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:02" (1/1) ... [2023-11-06 22:49:02,901 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:02" (1/1) ... [2023-11-06 22:49:02,922 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:02" (1/1) ... [2023-11-06 22:49:02,928 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:02" (1/1) ... [2023-11-06 22:49:02,963 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:02" (1/1) ... [2023-11-06 22:49:02,966 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:02" (1/1) ... [2023-11-06 22:49:02,984 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:02" (1/1) ... [2023-11-06 22:49:02,987 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:02" (1/1) ... [2023-11-06 22:49:02,992 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:49:02,993 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:49:02,993 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:49:02,994 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:49:02,994 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:02" (1/1) ... [2023-11-06 22:49:03,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:49:03,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_423a9331-c205-4075-9a17-36407a7b33ff/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:49:03,041 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_423a9331-c205-4075-9a17-36407a7b33ff/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:49:03,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_423a9331-c205-4075-9a17-36407a7b33ff/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:49:03,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:49:03,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:49:03,098 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:49:03,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:49:03,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:49:03,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:49:03,100 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:49:03,100 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:49:03,101 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:49:03,101 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:49:03,101 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:49:03,101 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:49:03,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:49:03,102 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:49:03,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:49:03,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:49:03,107 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:49:03,345 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:49:03,348 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:49:04,354 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:49:05,305 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:49:05,305 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:49:05,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:49:05 BoogieIcfgContainer [2023-11-06 22:49:05,308 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:49:05,314 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:49:05,315 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:49:05,318 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:49:05,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:49:01" (1/3) ... [2023-11-06 22:49:05,319 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2883a0ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:49:05, skipping insertion in model container [2023-11-06 22:49:05,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:02" (2/3) ... [2023-11-06 22:49:05,321 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2883a0ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:49:05, skipping insertion in model container [2023-11-06 22:49:05,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:49:05" (3/3) ... [2023-11-06 22:49:05,324 INFO L112 eAbstractionObserver]: Analyzing ICFG safe000_rmo.i [2023-11-06 22:49:05,347 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:49:05,347 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2023-11-06 22:49:05,348 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:49:05,521 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:49:05,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 204 places, 197 transitions, 406 flow [2023-11-06 22:49:05,701 INFO L124 PetriNetUnfolderBase]: 3/194 cut-off events. [2023-11-06 22:49:05,701 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:49:05,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 3/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 359 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 137. Up to 2 conditions per place. [2023-11-06 22:49:05,711 INFO L82 GeneralOperation]: Start removeDead. Operand has 204 places, 197 transitions, 406 flow [2023-11-06 22:49:05,728 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 201 places, 194 transitions, 397 flow [2023-11-06 22:49:05,732 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:49:05,753 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 201 places, 194 transitions, 397 flow [2023-11-06 22:49:05,758 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 201 places, 194 transitions, 397 flow [2023-11-06 22:49:05,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 201 places, 194 transitions, 397 flow [2023-11-06 22:49:05,872 INFO L124 PetriNetUnfolderBase]: 3/194 cut-off events. [2023-11-06 22:49:05,873 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:49:05,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 3/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 137. Up to 2 conditions per place. [2023-11-06 22:49:05,886 INFO L119 LiptonReduction]: Number of co-enabled transitions 9508 [2023-11-06 22:49:38,142 INFO L134 LiptonReduction]: Checked pairs total: 44602 [2023-11-06 22:49:38,143 INFO L136 LiptonReduction]: Total number of compositions: 171 [2023-11-06 22:49:38,159 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:49:38,166 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;@26428a1f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:49:38,167 INFO L358 AbstractCegarLoop]: Starting to check reachability of 101 error locations. [2023-11-06 22:49:38,169 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:49:38,169 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 22:49:38,169 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:49:38,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:49:38,170 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 22:49:38,171 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-11-06 22:49:38,176 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:38,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1232, now seen corresponding path program 1 times [2023-11-06 22:49:38,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:38,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233104716] [2023-11-06 22:49:38,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:38,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:38,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:38,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:49:38,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:49:38,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233104716] [2023-11-06 22:49:38,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233104716] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:49:38,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:49:38,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 22:49:38,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565520113] [2023-11-06 22:49:38,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:49:38,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:49:38,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:49:38,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:49:38,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:49:38,366 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 368 [2023-11-06 22:49:38,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 89 transitions, 187 flow. Second operand has 2 states, 2 states have (on average 134.5) internal successors, (269), 2 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:38,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:49:38,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 368 [2023-11-06 22:49:38,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:49:44,393 INFO L124 PetriNetUnfolderBase]: 17324/24431 cut-off events. [2023-11-06 22:49:44,393 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-06 22:49:44,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48788 conditions, 24431 events. 17324/24431 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 2184. Compared 170043 event pairs, 17324 based on Foata normal form. 0/9836 useless extension candidates. Maximal degree in co-relation 48777. Up to 24261 conditions per place. [2023-11-06 22:49:44,628 INFO L140 encePairwiseOnDemand]: 330/368 looper letters, 44 selfloop transitions, 0 changer transitions 0/50 dead transitions. [2023-11-06 22:49:44,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 50 transitions, 197 flow [2023-11-06 22:49:44,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:49:44,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:49:44,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 350 transitions. [2023-11-06 22:49:44,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47554347826086957 [2023-11-06 22:49:44,654 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 350 transitions. [2023-11-06 22:49:44,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 350 transitions. [2023-11-06 22:49:44,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:49:44,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 350 transitions. [2023-11-06 22:49:44,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 175.0) internal successors, (350), 2 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:44,676 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 368.0) internal successors, (1104), 3 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:44,678 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 368.0) internal successors, (1104), 3 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:44,680 INFO L175 Difference]: Start difference. First operand has 98 places, 89 transitions, 187 flow. Second operand 2 states and 350 transitions. [2023-11-06 22:49:44,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 50 transitions, 197 flow [2023-11-06 22:49:44,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 50 transitions, 194 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 22:49:44,693 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 106 flow [2023-11-06 22:49:44,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=106, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2023-11-06 22:49:44,703 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -40 predicate places. [2023-11-06 22:49:44,703 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 106 flow [2023-11-06 22:49:44,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 134.5) internal successors, (269), 2 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:44,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:49:44,704 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-06 22:49:44,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:49:44,705 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-11-06 22:49:44,718 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:44,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1217879, now seen corresponding path program 1 times [2023-11-06 22:49:44,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:44,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355482358] [2023-11-06 22:49:44,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:44,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:44,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:44,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:49:44,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:49:44,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355482358] [2023-11-06 22:49:44,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355482358] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:49:44,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:49:44,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:49:44,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51315458] [2023-11-06 22:49:44,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:49:44,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:49:44,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:49:44,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:49:44,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:49:45,042 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 368 [2023-11-06 22:49:45,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:45,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:49:45,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 368 [2023-11-06 22:49:45,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:49:48,975 INFO L124 PetriNetUnfolderBase]: 14651/21557 cut-off events. [2023-11-06 22:49:48,975 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:49:49,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43054 conditions, 21557 events. 14651/21557 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1305. Compared 142471 event pairs, 9093 based on Foata normal form. 0/12074 useless extension candidates. Maximal degree in co-relation 43051. Up to 13154 conditions per place. [2023-11-06 22:49:49,246 INFO L140 encePairwiseOnDemand]: 346/368 looper letters, 53 selfloop transitions, 11 changer transitions 0/66 dead transitions. [2023-11-06 22:49:49,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 66 transitions, 266 flow [2023-11-06 22:49:49,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:49:49,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:49:49,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 453 transitions. [2023-11-06 22:49:49,253 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41032608695652173 [2023-11-06 22:49:49,253 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 453 transitions. [2023-11-06 22:49:49,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 453 transitions. [2023-11-06 22:49:49,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:49:49,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 453 transitions. [2023-11-06 22:49:49,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:49,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 368.0) internal successors, (1472), 4 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:49,263 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 368.0) internal successors, (1472), 4 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:49,266 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 106 flow. Second operand 3 states and 453 transitions. [2023-11-06 22:49:49,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 66 transitions, 266 flow [2023-11-06 22:49:49,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 66 transitions, 266 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:49:49,271 INFO L231 Difference]: Finished difference. Result has 59 places, 56 transitions, 196 flow [2023-11-06 22:49:49,272 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=196, PETRI_PLACES=59, PETRI_TRANSITIONS=56} [2023-11-06 22:49:49,273 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -39 predicate places. [2023-11-06 22:49:49,274 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 56 transitions, 196 flow [2023-11-06 22:49:49,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:49,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:49:49,281 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-06 22:49:49,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:49:49,282 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-11-06 22:49:49,285 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:49,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1217880, now seen corresponding path program 1 times [2023-11-06 22:49:49,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:49,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771245060] [2023-11-06 22:49:49,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:49,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:49,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:49,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:49:49,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:49:49,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771245060] [2023-11-06 22:49:49,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771245060] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:49:49,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:49:49,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:49:49,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413253537] [2023-11-06 22:49:49,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:49:49,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:49:49,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:49:49,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:49:49,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:49:49,543 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 368 [2023-11-06 22:49:49,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 56 transitions, 196 flow. Second operand has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:49,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:49:49,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 368 [2023-11-06 22:49:49,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:49:51,230 INFO L124 PetriNetUnfolderBase]: 4833/7601 cut-off events. [2023-11-06 22:49:51,231 INFO L125 PetriNetUnfolderBase]: For 2672/2843 co-relation queries the response was YES. [2023-11-06 22:49:51,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21451 conditions, 7601 events. 4833/7601 cut-off events. For 2672/2843 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 49599 event pairs, 3378 based on Foata normal form. 1962/8403 useless extension candidates. Maximal degree in co-relation 21446. Up to 6720 conditions per place. [2023-11-06 22:49:51,302 INFO L140 encePairwiseOnDemand]: 357/368 looper letters, 38 selfloop transitions, 1 changer transitions 0/46 dead transitions. [2023-11-06 22:49:51,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 46 transitions, 254 flow [2023-11-06 22:49:51,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:49:51,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:49:51,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2023-11-06 22:49:51,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39402173913043476 [2023-11-06 22:49:51,305 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 435 transitions. [2023-11-06 22:49:51,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 435 transitions. [2023-11-06 22:49:51,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:49:51,307 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 435 transitions. [2023-11-06 22:49:51,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:51,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 368.0) internal successors, (1472), 4 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:51,313 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 368.0) internal successors, (1472), 4 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:51,313 INFO L175 Difference]: Start difference. First operand has 59 places, 56 transitions, 196 flow. Second operand 3 states and 435 transitions. [2023-11-06 22:49:51,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 46 transitions, 254 flow [2023-11-06 22:49:51,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 46 transitions, 232 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:49:51,344 INFO L231 Difference]: Finished difference. Result has 49 places, 46 transitions, 156 flow [2023-11-06 22:49:51,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=49, PETRI_TRANSITIONS=46} [2023-11-06 22:49:51,345 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -49 predicate places. [2023-11-06 22:49:51,346 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 46 transitions, 156 flow [2023-11-06 22:49:51,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:51,346 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:49:51,347 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:49:51,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:49:51,351 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-11-06 22:49:51,352 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:51,352 INFO L85 PathProgramCache]: Analyzing trace with hash 404400095, now seen corresponding path program 1 times [2023-11-06 22:49:51,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:51,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931440244] [2023-11-06 22:49:51,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:51,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:51,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:51,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:49:51,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:49:51,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931440244] [2023-11-06 22:49:51,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931440244] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:49:51,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:49:51,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:49:51,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281345278] [2023-11-06 22:49:51,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:49:51,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:49:51,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:49:51,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:49:51,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:49:51,682 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 368 [2023-11-06 22:49:51,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 46 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:51,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:49:51,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 368 [2023-11-06 22:49:51,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:49:53,409 INFO L124 PetriNetUnfolderBase]: 4649/7619 cut-off events. [2023-11-06 22:49:53,409 INFO L125 PetriNetUnfolderBase]: For 1077/1201 co-relation queries the response was YES. [2023-11-06 22:49:53,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19276 conditions, 7619 events. 4649/7619 cut-off events. For 1077/1201 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 53144 event pairs, 1867 based on Foata normal form. 0/5621 useless extension candidates. Maximal degree in co-relation 19271. Up to 4127 conditions per place. [2023-11-06 22:49:53,455 INFO L140 encePairwiseOnDemand]: 364/368 looper letters, 67 selfloop transitions, 3 changer transitions 0/77 dead transitions. [2023-11-06 22:49:53,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 77 transitions, 398 flow [2023-11-06 22:49:53,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:49:53,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:49:53,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 458 transitions. [2023-11-06 22:49:53,458 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4148550724637681 [2023-11-06 22:49:53,458 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 458 transitions. [2023-11-06 22:49:53,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 458 transitions. [2023-11-06 22:49:53,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:49:53,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 458 transitions. [2023-11-06 22:49:53,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:53,464 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 368.0) internal successors, (1472), 4 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:53,465 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 368.0) internal successors, (1472), 4 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:53,465 INFO L175 Difference]: Start difference. First operand has 49 places, 46 transitions, 156 flow. Second operand 3 states and 458 transitions. [2023-11-06 22:49:53,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 77 transitions, 398 flow [2023-11-06 22:49:53,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 77 transitions, 397 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:49:53,468 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 168 flow [2023-11-06 22:49:53,469 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2023-11-06 22:49:53,470 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -47 predicate places. [2023-11-06 22:49:53,470 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 168 flow [2023-11-06 22:49:53,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:53,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:49:53,471 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:49:53,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:49:53,471 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-11-06 22:49:53,472 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:53,472 INFO L85 PathProgramCache]: Analyzing trace with hash 404400492, now seen corresponding path program 1 times [2023-11-06 22:49:53,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:53,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141759379] [2023-11-06 22:49:53,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:53,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:53,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:54,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:49:54,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:49:54,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141759379] [2023-11-06 22:49:54,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141759379] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:49:54,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:49:54,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:49:54,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585672201] [2023-11-06 22:49:54,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:49:54,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:49:54,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:49:54,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:49:54,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:49:54,032 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 368 [2023-11-06 22:49:54,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:54,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:49:54,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 368 [2023-11-06 22:49:54,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:49:55,117 INFO L124 PetriNetUnfolderBase]: 4574/7329 cut-off events. [2023-11-06 22:49:55,117 INFO L125 PetriNetUnfolderBase]: For 1801/1861 co-relation queries the response was YES. [2023-11-06 22:49:55,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20153 conditions, 7329 events. 4574/7329 cut-off events. For 1801/1861 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 48502 event pairs, 1893 based on Foata normal form. 0/5732 useless extension candidates. Maximal degree in co-relation 20147. Up to 5896 conditions per place. [2023-11-06 22:49:55,172 INFO L140 encePairwiseOnDemand]: 364/368 looper letters, 62 selfloop transitions, 5 changer transitions 0/74 dead transitions. [2023-11-06 22:49:55,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 74 transitions, 402 flow [2023-11-06 22:49:55,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:49:55,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:49:55,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2023-11-06 22:49:55,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41394927536231885 [2023-11-06 22:49:55,182 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 457 transitions. [2023-11-06 22:49:55,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 457 transitions. [2023-11-06 22:49:55,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:49:55,183 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 457 transitions. [2023-11-06 22:49:55,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:55,195 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 368.0) internal successors, (1472), 4 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:55,197 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 368.0) internal successors, (1472), 4 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:55,197 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 168 flow. Second operand 3 states and 457 transitions. [2023-11-06 22:49:55,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 74 transitions, 402 flow [2023-11-06 22:49:55,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 74 transitions, 392 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:49:55,204 INFO L231 Difference]: Finished difference. Result has 52 places, 50 transitions, 205 flow [2023-11-06 22:49:55,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=205, PETRI_PLACES=52, PETRI_TRANSITIONS=50} [2023-11-06 22:49:55,208 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -46 predicate places. [2023-11-06 22:49:55,208 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 50 transitions, 205 flow [2023-11-06 22:49:55,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:55,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:49:55,209 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:49:55,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:49:55,209 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-11-06 22:49:55,210 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:55,210 INFO L85 PathProgramCache]: Analyzing trace with hash -348488947, now seen corresponding path program 1 times [2023-11-06 22:49:55,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:55,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860144353] [2023-11-06 22:49:55,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:55,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:55,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:55,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:49:55,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:49:55,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860144353] [2023-11-06 22:49:55,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860144353] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:49:55,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:49:55,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:49:55,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597873899] [2023-11-06 22:49:55,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:49:55,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:49:55,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:49:55,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:49:55,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:49:55,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 368 [2023-11-06 22:49:55,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 205 flow. Second operand has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:55,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:49:55,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 368 [2023-11-06 22:49:55,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:49:57,609 INFO L124 PetriNetUnfolderBase]: 4569/7284 cut-off events. [2023-11-06 22:49:57,609 INFO L125 PetriNetUnfolderBase]: For 2148/2188 co-relation queries the response was YES. [2023-11-06 22:49:57,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20709 conditions, 7284 events. 4569/7284 cut-off events. For 2148/2188 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 47843 event pairs, 1626 based on Foata normal form. 10/5873 useless extension candidates. Maximal degree in co-relation 20702. Up to 5042 conditions per place. [2023-11-06 22:49:57,665 INFO L140 encePairwiseOnDemand]: 365/368 looper letters, 58 selfloop transitions, 5 changer transitions 0/70 dead transitions. [2023-11-06 22:49:57,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 70 transitions, 399 flow [2023-11-06 22:49:57,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:49:57,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:49:57,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 449 transitions. [2023-11-06 22:49:57,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4067028985507246 [2023-11-06 22:49:57,669 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 449 transitions. [2023-11-06 22:49:57,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 449 transitions. [2023-11-06 22:49:57,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:49:57,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 449 transitions. [2023-11-06 22:49:57,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:57,676 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 368.0) internal successors, (1472), 4 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:57,677 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 368.0) internal successors, (1472), 4 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:57,677 INFO L175 Difference]: Start difference. First operand has 52 places, 50 transitions, 205 flow. Second operand 3 states and 449 transitions. [2023-11-06 22:49:57,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 70 transitions, 399 flow [2023-11-06 22:49:57,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 70 transitions, 394 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:49:57,684 INFO L231 Difference]: Finished difference. Result has 54 places, 50 transitions, 217 flow [2023-11-06 22:49:57,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=217, PETRI_PLACES=54, PETRI_TRANSITIONS=50} [2023-11-06 22:49:57,686 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -44 predicate places. [2023-11-06 22:49:57,686 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 50 transitions, 217 flow [2023-11-06 22:49:57,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:57,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:49:57,687 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:49:57,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:49:57,688 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-11-06 22:49:57,688 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:57,688 INFO L85 PathProgramCache]: Analyzing trace with hash 938099520, now seen corresponding path program 1 times [2023-11-06 22:49:57,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:57,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301491533] [2023-11-06 22:49:57,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:57,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:57,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:57,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:49:57,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:49:57,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301491533] [2023-11-06 22:49:57,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301491533] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:49:57,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:49:57,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:49:57,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357049806] [2023-11-06 22:49:57,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:49:57,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:49:57,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:49:57,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:49:57,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:49:58,073 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 368 [2023-11-06 22:49:58,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 50 transitions, 217 flow. Second operand has 5 states, 5 states have (on average 124.4) internal successors, (622), 5 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:58,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:49:58,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 368 [2023-11-06 22:49:58,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:49:59,603 INFO L124 PetriNetUnfolderBase]: 4805/7536 cut-off events. [2023-11-06 22:49:59,603 INFO L125 PetriNetUnfolderBase]: For 2454/2454 co-relation queries the response was YES. [2023-11-06 22:49:59,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22401 conditions, 7536 events. 4805/7536 cut-off events. For 2454/2454 co-relation queries the response was YES. Maximal size of possible extension queue 558. Compared 48309 event pairs, 1893 based on Foata normal form. 0/6194 useless extension candidates. Maximal degree in co-relation 22393. Up to 2886 conditions per place. [2023-11-06 22:49:59,646 INFO L140 encePairwiseOnDemand]: 357/368 looper letters, 74 selfloop transitions, 13 changer transitions 0/88 dead transitions. [2023-11-06 22:49:59,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 88 transitions, 517 flow [2023-11-06 22:49:59,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:49:59,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:49:59,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 565 transitions. [2023-11-06 22:49:59,650 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38383152173913043 [2023-11-06 22:49:59,651 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 565 transitions. [2023-11-06 22:49:59,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 565 transitions. [2023-11-06 22:49:59,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:49:59,652 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 565 transitions. [2023-11-06 22:49:59,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 141.25) internal successors, (565), 4 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:59,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 368.0) internal successors, (1840), 5 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:59,658 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 368.0) internal successors, (1840), 5 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:59,658 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 217 flow. Second operand 4 states and 565 transitions. [2023-11-06 22:49:59,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 88 transitions, 517 flow [2023-11-06 22:49:59,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 88 transitions, 507 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:49:59,663 INFO L231 Difference]: Finished difference. Result has 56 places, 57 transitions, 299 flow [2023-11-06 22:49:59,663 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=299, PETRI_PLACES=56, PETRI_TRANSITIONS=57} [2023-11-06 22:49:59,664 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -42 predicate places. [2023-11-06 22:49:59,664 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 57 transitions, 299 flow [2023-11-06 22:49:59,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.4) internal successors, (622), 5 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:49:59,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:49:59,665 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:49:59,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:49:59,665 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-11-06 22:49:59,666 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:49:59,666 INFO L85 PathProgramCache]: Analyzing trace with hash -348489343, now seen corresponding path program 1 times [2023-11-06 22:49:59,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:49:59,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891073203] [2023-11-06 22:49:59,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:49:59,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:49:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:49:59,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:49:59,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:49:59,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891073203] [2023-11-06 22:49:59,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891073203] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:49:59,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:49:59,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:49:59,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468774515] [2023-11-06 22:49:59,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:49:59,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:49:59,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:49:59,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:49:59,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:50:00,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 368 [2023-11-06 22:50:00,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 57 transitions, 299 flow. Second operand has 5 states, 5 states have (on average 127.4) internal successors, (637), 5 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:00,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:50:00,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 368 [2023-11-06 22:50:00,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:50:01,753 INFO L124 PetriNetUnfolderBase]: 6942/10896 cut-off events. [2023-11-06 22:50:01,754 INFO L125 PetriNetUnfolderBase]: For 9726/9726 co-relation queries the response was YES. [2023-11-06 22:50:01,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35029 conditions, 10896 events. 6942/10896 cut-off events. For 9726/9726 co-relation queries the response was YES. Maximal size of possible extension queue 819. Compared 74971 event pairs, 3280 based on Foata normal form. 50/9769 useless extension candidates. Maximal degree in co-relation 35019. Up to 6079 conditions per place. [2023-11-06 22:50:01,826 INFO L140 encePairwiseOnDemand]: 363/368 looper letters, 83 selfloop transitions, 7 changer transitions 0/93 dead transitions. [2023-11-06 22:50:01,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 93 transitions, 645 flow [2023-11-06 22:50:01,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:50:01,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:50:01,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 562 transitions. [2023-11-06 22:50:01,830 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38179347826086957 [2023-11-06 22:50:01,830 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 562 transitions. [2023-11-06 22:50:01,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 562 transitions. [2023-11-06 22:50:01,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:50:01,831 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 562 transitions. [2023-11-06 22:50:01,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.5) internal successors, (562), 4 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:01,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 368.0) internal successors, (1840), 5 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:01,836 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 368.0) internal successors, (1840), 5 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:01,837 INFO L175 Difference]: Start difference. First operand has 56 places, 57 transitions, 299 flow. Second operand 4 states and 562 transitions. [2023-11-06 22:50:01,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 93 transitions, 645 flow [2023-11-06 22:50:01,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 93 transitions, 637 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-06 22:50:01,910 INFO L231 Difference]: Finished difference. Result has 59 places, 59 transitions, 323 flow [2023-11-06 22:50:01,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=323, PETRI_PLACES=59, PETRI_TRANSITIONS=59} [2023-11-06 22:50:01,911 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -39 predicate places. [2023-11-06 22:50:01,911 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 59 transitions, 323 flow [2023-11-06 22:50:01,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.4) internal successors, (637), 5 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:01,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:50:01,912 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:50:01,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:50:01,913 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-11-06 22:50:01,913 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:01,913 INFO L85 PathProgramCache]: Analyzing trace with hash 971055701, now seen corresponding path program 2 times [2023-11-06 22:50:01,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:50:01,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833906015] [2023-11-06 22:50:01,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:01,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:50:01,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:02,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:50:02,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:50:02,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833906015] [2023-11-06 22:50:02,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833906015] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:50:02,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:50:02,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:50:02,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702365080] [2023-11-06 22:50:02,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:50:02,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:50:02,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:50:02,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:50:02,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:50:02,268 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 368 [2023-11-06 22:50:02,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 59 transitions, 323 flow. Second operand has 6 states, 6 states have (on average 127.0) internal successors, (762), 6 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:02,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:50:02,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 368 [2023-11-06 22:50:02,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:50:04,060 INFO L124 PetriNetUnfolderBase]: 6837/10739 cut-off events. [2023-11-06 22:50:04,061 INFO L125 PetriNetUnfolderBase]: For 11935/11935 co-relation queries the response was YES. [2023-11-06 22:50:04,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35123 conditions, 10739 events. 6837/10739 cut-off events. For 11935/11935 co-relation queries the response was YES. Maximal size of possible extension queue 808. Compared 73858 event pairs, 3317 based on Foata normal form. 50/9609 useless extension candidates. Maximal degree in co-relation 35112. Up to 7537 conditions per place. [2023-11-06 22:50:04,119 INFO L140 encePairwiseOnDemand]: 365/368 looper letters, 74 selfloop transitions, 5 changer transitions 0/82 dead transitions. [2023-11-06 22:50:04,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 82 transitions, 557 flow [2023-11-06 22:50:04,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:50:04,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:50:04,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 560 transitions. [2023-11-06 22:50:04,126 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3804347826086957 [2023-11-06 22:50:04,126 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 560 transitions. [2023-11-06 22:50:04,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 560 transitions. [2023-11-06 22:50:04,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:50:04,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 560 transitions. [2023-11-06 22:50:04,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:04,132 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 368.0) internal successors, (1840), 5 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:04,132 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 368.0) internal successors, (1840), 5 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:04,132 INFO L175 Difference]: Start difference. First operand has 59 places, 59 transitions, 323 flow. Second operand 4 states and 560 transitions. [2023-11-06 22:50:04,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 82 transitions, 557 flow [2023-11-06 22:50:04,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 82 transitions, 544 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 22:50:04,173 INFO L231 Difference]: Finished difference. Result has 58 places, 58 transitions, 314 flow [2023-11-06 22:50:04,173 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=314, PETRI_PLACES=58, PETRI_TRANSITIONS=58} [2023-11-06 22:50:04,173 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -40 predicate places. [2023-11-06 22:50:04,173 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 58 transitions, 314 flow [2023-11-06 22:50:04,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.0) internal successors, (762), 6 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:04,174 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:50:04,174 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:50:04,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:50:04,175 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-11-06 22:50:04,175 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:04,175 INFO L85 PathProgramCache]: Analyzing trace with hash -348430543, now seen corresponding path program 1 times [2023-11-06 22:50:04,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:50:04,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343694785] [2023-11-06 22:50:04,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:04,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:50:04,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:04,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:50:04,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:50:04,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343694785] [2023-11-06 22:50:04,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343694785] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:50:04,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:50:04,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:50:04,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25998216] [2023-11-06 22:50:04,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:50:04,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:50:04,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:50:04,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:50:04,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:50:04,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 368 [2023-11-06 22:50:04,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 58 transitions, 314 flow. Second operand has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:04,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:50:04,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 368 [2023-11-06 22:50:04,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:50:06,161 INFO L124 PetriNetUnfolderBase]: 6337/10097 cut-off events. [2023-11-06 22:50:06,161 INFO L125 PetriNetUnfolderBase]: For 13687/13734 co-relation queries the response was YES. [2023-11-06 22:50:06,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32855 conditions, 10097 events. 6337/10097 cut-off events. For 13687/13734 co-relation queries the response was YES. Maximal size of possible extension queue 783. Compared 72524 event pairs, 1867 based on Foata normal form. 17/8856 useless extension candidates. Maximal degree in co-relation 32845. Up to 7868 conditions per place. [2023-11-06 22:50:06,230 INFO L140 encePairwiseOnDemand]: 365/368 looper letters, 82 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2023-11-06 22:50:06,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 93 transitions, 686 flow [2023-11-06 22:50:06,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:50:06,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:50:06,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2023-11-06 22:50:06,232 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40398550724637683 [2023-11-06 22:50:06,232 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2023-11-06 22:50:06,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2023-11-06 22:50:06,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:50:06,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2023-11-06 22:50:06,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:06,237 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 368.0) internal successors, (1472), 4 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:06,237 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 368.0) internal successors, (1472), 4 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:06,237 INFO L175 Difference]: Start difference. First operand has 58 places, 58 transitions, 314 flow. Second operand 3 states and 446 transitions. [2023-11-06 22:50:06,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 93 transitions, 686 flow [2023-11-06 22:50:06,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 93 transitions, 676 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:50:06,278 INFO L231 Difference]: Finished difference. Result has 59 places, 58 transitions, 316 flow [2023-11-06 22:50:06,279 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=316, PETRI_PLACES=59, PETRI_TRANSITIONS=58} [2023-11-06 22:50:06,279 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -39 predicate places. [2023-11-06 22:50:06,279 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 58 transitions, 316 flow [2023-11-06 22:50:06,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:06,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:50:06,280 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:50:06,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:50:06,281 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-11-06 22:50:06,281 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:06,281 INFO L85 PathProgramCache]: Analyzing trace with hash 2083553860, now seen corresponding path program 1 times [2023-11-06 22:50:06,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:50:06,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437703593] [2023-11-06 22:50:06,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:06,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:50:06,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:06,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:50:06,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:50:06,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437703593] [2023-11-06 22:50:06,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437703593] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:50:06,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:50:06,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:50:06,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201269924] [2023-11-06 22:50:06,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:50:06,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:50:06,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:50:06,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:50:06,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:50:06,850 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 368 [2023-11-06 22:50:06,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 58 transitions, 316 flow. Second operand has 5 states, 5 states have (on average 132.6) internal successors, (663), 5 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:06,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:50:06,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 368 [2023-11-06 22:50:06,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:50:10,240 INFO L124 PetriNetUnfolderBase]: 12101/18888 cut-off events. [2023-11-06 22:50:10,241 INFO L125 PetriNetUnfolderBase]: For 20960/21655 co-relation queries the response was YES. [2023-11-06 22:50:10,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60989 conditions, 18888 events. 12101/18888 cut-off events. For 20960/21655 co-relation queries the response was YES. Maximal size of possible extension queue 1305. Compared 141710 event pairs, 2884 based on Foata normal form. 449/16655 useless extension candidates. Maximal degree in co-relation 60978. Up to 7652 conditions per place. [2023-11-06 22:50:10,402 INFO L140 encePairwiseOnDemand]: 364/368 looper letters, 106 selfloop transitions, 3 changer transitions 0/117 dead transitions. [2023-11-06 22:50:10,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 117 transitions, 807 flow [2023-11-06 22:50:10,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:50:10,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:50:10,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 598 transitions. [2023-11-06 22:50:10,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2023-11-06 22:50:10,406 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 598 transitions. [2023-11-06 22:50:10,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 598 transitions. [2023-11-06 22:50:10,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:50:10,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 598 transitions. [2023-11-06 22:50:10,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 149.5) internal successors, (598), 4 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:10,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 368.0) internal successors, (1840), 5 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:10,414 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 368.0) internal successors, (1840), 5 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:10,414 INFO L175 Difference]: Start difference. First operand has 59 places, 58 transitions, 316 flow. Second operand 4 states and 598 transitions. [2023-11-06 22:50:10,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 117 transitions, 807 flow [2023-11-06 22:50:10,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 117 transitions, 801 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:50:10,517 INFO L231 Difference]: Finished difference. Result has 62 places, 59 transitions, 331 flow [2023-11-06 22:50:10,518 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=331, PETRI_PLACES=62, PETRI_TRANSITIONS=59} [2023-11-06 22:50:10,519 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -36 predicate places. [2023-11-06 22:50:10,519 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 59 transitions, 331 flow [2023-11-06 22:50:10,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.6) internal successors, (663), 5 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:10,520 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:50:10,520 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:50:10,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:50:10,520 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-11-06 22:50:10,521 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:10,521 INFO L85 PathProgramCache]: Analyzing trace with hash 2081827469, now seen corresponding path program 1 times [2023-11-06 22:50:10,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:50:10,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917632347] [2023-11-06 22:50:10,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:10,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:50:10,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:10,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:50:10,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:50:10,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917632347] [2023-11-06 22:50:10,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917632347] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:50:10,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:50:10,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:50:10,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795676727] [2023-11-06 22:50:10,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:50:10,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:50:10,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:50:10,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:50:10,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:50:10,966 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 368 [2023-11-06 22:50:10,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 59 transitions, 331 flow. Second operand has 5 states, 5 states have (on average 123.6) internal successors, (618), 5 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:10,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:50:10,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 368 [2023-11-06 22:50:10,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:50:13,088 INFO L124 PetriNetUnfolderBase]: 9126/14228 cut-off events. [2023-11-06 22:50:13,088 INFO L125 PetriNetUnfolderBase]: For 11803/11835 co-relation queries the response was YES. [2023-11-06 22:50:13,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47831 conditions, 14228 events. 9126/14228 cut-off events. For 11803/11835 co-relation queries the response was YES. Maximal size of possible extension queue 1012. Compared 98243 event pairs, 3707 based on Foata normal form. 270/12800 useless extension candidates. Maximal degree in co-relation 47818. Up to 6261 conditions per place. [2023-11-06 22:50:13,190 INFO L140 encePairwiseOnDemand]: 350/368 looper letters, 68 selfloop transitions, 20 changer transitions 0/89 dead transitions. [2023-11-06 22:50:13,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 89 transitions, 687 flow [2023-11-06 22:50:13,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:50:13,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:50:13,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 548 transitions. [2023-11-06 22:50:13,194 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37228260869565216 [2023-11-06 22:50:13,195 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 548 transitions. [2023-11-06 22:50:13,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 548 transitions. [2023-11-06 22:50:13,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:50:13,196 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 548 transitions. [2023-11-06 22:50:13,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:13,201 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 368.0) internal successors, (1840), 5 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:13,202 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 368.0) internal successors, (1840), 5 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:13,202 INFO L175 Difference]: Start difference. First operand has 62 places, 59 transitions, 331 flow. Second operand 4 states and 548 transitions. [2023-11-06 22:50:13,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 89 transitions, 687 flow [2023-11-06 22:50:13,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 89 transitions, 681 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:50:13,254 INFO L231 Difference]: Finished difference. Result has 65 places, 71 transitions, 525 flow [2023-11-06 22:50:13,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=525, PETRI_PLACES=65, PETRI_TRANSITIONS=71} [2023-11-06 22:50:13,255 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -33 predicate places. [2023-11-06 22:50:13,255 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 71 transitions, 525 flow [2023-11-06 22:50:13,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.6) internal successors, (618), 5 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:13,256 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:50:13,256 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:50:13,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:50:13,257 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-11-06 22:50:13,257 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:13,257 INFO L85 PathProgramCache]: Analyzing trace with hash -818550905, now seen corresponding path program 1 times [2023-11-06 22:50:13,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:50:13,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787277257] [2023-11-06 22:50:13,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:13,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:50:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:14,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:50:14,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:50:14,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787277257] [2023-11-06 22:50:14,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787277257] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:50:14,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:50:14,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:50:14,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8510044] [2023-11-06 22:50:14,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:50:14,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:50:14,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:50:14,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:50:14,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:50:14,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 368 [2023-11-06 22:50:14,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 71 transitions, 525 flow. Second operand has 9 states, 9 states have (on average 117.66666666666667) internal successors, (1059), 9 states have internal predecessors, (1059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:14,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:50:14,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 368 [2023-11-06 22:50:14,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:50:17,315 INFO L124 PetriNetUnfolderBase]: 6815/11075 cut-off events. [2023-11-06 22:50:17,315 INFO L125 PetriNetUnfolderBase]: For 17672/18006 co-relation queries the response was YES. [2023-11-06 22:50:17,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41509 conditions, 11075 events. 6815/11075 cut-off events. For 17672/18006 co-relation queries the response was YES. Maximal size of possible extension queue 804. Compared 80456 event pairs, 2803 based on Foata normal form. 80/10101 useless extension candidates. Maximal degree in co-relation 41495. Up to 6493 conditions per place. [2023-11-06 22:50:17,402 INFO L140 encePairwiseOnDemand]: 360/368 looper letters, 122 selfloop transitions, 20 changer transitions 0/155 dead transitions. [2023-11-06 22:50:17,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 155 transitions, 1301 flow [2023-11-06 22:50:17,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:50:17,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 22:50:17,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1142 transitions. [2023-11-06 22:50:17,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34480676328502413 [2023-11-06 22:50:17,408 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1142 transitions. [2023-11-06 22:50:17,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1142 transitions. [2023-11-06 22:50:17,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:50:17,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1142 transitions. [2023-11-06 22:50:17,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 126.88888888888889) internal successors, (1142), 9 states have internal predecessors, (1142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:17,420 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 368.0) internal successors, (3680), 10 states have internal predecessors, (3680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:17,421 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 368.0) internal successors, (3680), 10 states have internal predecessors, (3680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:17,421 INFO L175 Difference]: Start difference. First operand has 65 places, 71 transitions, 525 flow. Second operand 9 states and 1142 transitions. [2023-11-06 22:50:17,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 155 transitions, 1301 flow [2023-11-06 22:50:17,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 155 transitions, 1294 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:50:17,583 INFO L231 Difference]: Finished difference. Result has 78 places, 84 transitions, 736 flow [2023-11-06 22:50:17,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=736, PETRI_PLACES=78, PETRI_TRANSITIONS=84} [2023-11-06 22:50:17,585 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -20 predicate places. [2023-11-06 22:50:17,585 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 84 transitions, 736 flow [2023-11-06 22:50:17,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 117.66666666666667) internal successors, (1059), 9 states have internal predecessors, (1059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:17,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:50:17,586 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:50:17,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:50:17,587 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-11-06 22:50:17,587 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:17,587 INFO L85 PathProgramCache]: Analyzing trace with hash 112142391, now seen corresponding path program 1 times [2023-11-06 22:50:17,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:50:17,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651442089] [2023-11-06 22:50:17,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:17,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:50:17,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:17,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:50:17,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:50:17,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651442089] [2023-11-06 22:50:17,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651442089] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:50:17,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:50:17,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:50:17,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022824742] [2023-11-06 22:50:17,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:50:17,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:50:17,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:50:17,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:50:17,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:50:18,155 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 368 [2023-11-06 22:50:18,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 84 transitions, 736 flow. Second operand has 8 states, 8 states have (on average 117.75) internal successors, (942), 8 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:18,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:50:18,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 368 [2023-11-06 22:50:18,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:50:19,964 INFO L124 PetriNetUnfolderBase]: 5740/9311 cut-off events. [2023-11-06 22:50:19,965 INFO L125 PetriNetUnfolderBase]: For 18572/18596 co-relation queries the response was YES. [2023-11-06 22:50:20,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36773 conditions, 9311 events. 5740/9311 cut-off events. For 18572/18596 co-relation queries the response was YES. Maximal size of possible extension queue 607. Compared 64982 event pairs, 647 based on Foata normal form. 262/9167 useless extension candidates. Maximal degree in co-relation 36752. Up to 3649 conditions per place. [2023-11-06 22:50:20,046 INFO L140 encePairwiseOnDemand]: 348/368 looper letters, 123 selfloop transitions, 36 changer transitions 0/160 dead transitions. [2023-11-06 22:50:20,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 160 transitions, 1618 flow [2023-11-06 22:50:20,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:50:20,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:50:20,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 900 transitions. [2023-11-06 22:50:20,051 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34937888198757766 [2023-11-06 22:50:20,051 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 900 transitions. [2023-11-06 22:50:20,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 900 transitions. [2023-11-06 22:50:20,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:50:20,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 900 transitions. [2023-11-06 22:50:20,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.57142857142858) internal successors, (900), 7 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:20,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 368.0) internal successors, (2944), 8 states have internal predecessors, (2944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:20,062 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 368.0) internal successors, (2944), 8 states have internal predecessors, (2944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:20,062 INFO L175 Difference]: Start difference. First operand has 78 places, 84 transitions, 736 flow. Second operand 7 states and 900 transitions. [2023-11-06 22:50:20,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 160 transitions, 1618 flow [2023-11-06 22:50:20,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 160 transitions, 1602 flow, removed 8 selfloop flow, removed 0 redundant places. [2023-11-06 22:50:20,227 INFO L231 Difference]: Finished difference. Result has 87 places, 104 transitions, 1101 flow [2023-11-06 22:50:20,227 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1101, PETRI_PLACES=87, PETRI_TRANSITIONS=104} [2023-11-06 22:50:20,228 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -11 predicate places. [2023-11-06 22:50:20,228 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 104 transitions, 1101 flow [2023-11-06 22:50:20,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 117.75) internal successors, (942), 8 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:20,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:50:20,230 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:50:20,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:50:20,230 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-11-06 22:50:20,230 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:20,231 INFO L85 PathProgramCache]: Analyzing trace with hash 562798625, now seen corresponding path program 1 times [2023-11-06 22:50:20,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:50:20,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027600638] [2023-11-06 22:50:20,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:20,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:50:20,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:22,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:50:22,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:50:22,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027600638] [2023-11-06 22:50:22,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027600638] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:50:22,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:50:22,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:50:22,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048502574] [2023-11-06 22:50:22,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:50:22,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:50:22,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:50:22,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:50:22,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:50:22,589 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 368 [2023-11-06 22:50:22,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 104 transitions, 1101 flow. Second operand has 6 states, 6 states have (on average 127.33333333333333) internal successors, (764), 6 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:22,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:50:22,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 368 [2023-11-06 22:50:22,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:50:25,014 INFO L124 PetriNetUnfolderBase]: 6398/10382 cut-off events. [2023-11-06 22:50:25,014 INFO L125 PetriNetUnfolderBase]: For 26454/26492 co-relation queries the response was YES. [2023-11-06 22:50:25,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46145 conditions, 10382 events. 6398/10382 cut-off events. For 26454/26492 co-relation queries the response was YES. Maximal size of possible extension queue 679. Compared 72670 event pairs, 2720 based on Foata normal form. 54/9982 useless extension candidates. Maximal degree in co-relation 46121. Up to 7875 conditions per place. [2023-11-06 22:50:25,111 INFO L140 encePairwiseOnDemand]: 361/368 looper letters, 129 selfloop transitions, 32 changer transitions 0/164 dead transitions. [2023-11-06 22:50:25,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 164 transitions, 1935 flow [2023-11-06 22:50:25,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:50:25,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:50:25,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 698 transitions. [2023-11-06 22:50:25,115 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3793478260869565 [2023-11-06 22:50:25,115 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 698 transitions. [2023-11-06 22:50:25,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 698 transitions. [2023-11-06 22:50:25,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:50:25,116 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 698 transitions. [2023-11-06 22:50:25,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.6) internal successors, (698), 5 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:25,122 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 368.0) internal successors, (2208), 6 states have internal predecessors, (2208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:25,123 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 368.0) internal successors, (2208), 6 states have internal predecessors, (2208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:25,124 INFO L175 Difference]: Start difference. First operand has 87 places, 104 transitions, 1101 flow. Second operand 5 states and 698 transitions. [2023-11-06 22:50:25,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 164 transitions, 1935 flow [2023-11-06 22:50:25,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 164 transitions, 1898 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:50:25,528 INFO L231 Difference]: Finished difference. Result has 90 places, 116 transitions, 1308 flow [2023-11-06 22:50:25,529 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=1079, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1308, PETRI_PLACES=90, PETRI_TRANSITIONS=116} [2023-11-06 22:50:25,529 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -8 predicate places. [2023-11-06 22:50:25,529 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 116 transitions, 1308 flow [2023-11-06 22:50:25,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.33333333333333) internal successors, (764), 6 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:25,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:50:25,530 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:50:25,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:50:25,530 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-11-06 22:50:25,531 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:25,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1537220476, now seen corresponding path program 1 times [2023-11-06 22:50:25,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:50:25,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254417648] [2023-11-06 22:50:25,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:25,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:50:25,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:26,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:50:26,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:50:26,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254417648] [2023-11-06 22:50:26,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254417648] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:50:26,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:50:26,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:50:26,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993552313] [2023-11-06 22:50:26,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:50:26,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:50:26,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:50:26,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:50:26,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:50:26,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 368 [2023-11-06 22:50:26,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 116 transitions, 1308 flow. Second operand has 9 states, 9 states have (on average 118.77777777777777) internal successors, (1069), 9 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:26,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:50:26,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 368 [2023-11-06 22:50:26,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:50:30,619 INFO L124 PetriNetUnfolderBase]: 8217/13421 cut-off events. [2023-11-06 22:50:30,620 INFO L125 PetriNetUnfolderBase]: For 52216/53112 co-relation queries the response was YES. [2023-11-06 22:50:30,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63148 conditions, 13421 events. 8217/13421 cut-off events. For 52216/53112 co-relation queries the response was YES. Maximal size of possible extension queue 840. Compared 100167 event pairs, 2310 based on Foata normal form. 109/12856 useless extension candidates. Maximal degree in co-relation 63122. Up to 6734 conditions per place. [2023-11-06 22:50:30,762 INFO L140 encePairwiseOnDemand]: 360/368 looper letters, 162 selfloop transitions, 35 changer transitions 0/222 dead transitions. [2023-11-06 22:50:30,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 222 transitions, 2667 flow [2023-11-06 22:50:30,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:50:30,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 22:50:30,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1140 transitions. [2023-11-06 22:50:30,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3442028985507246 [2023-11-06 22:50:30,768 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1140 transitions. [2023-11-06 22:50:30,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1140 transitions. [2023-11-06 22:50:30,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:50:30,769 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1140 transitions. [2023-11-06 22:50:30,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 126.66666666666667) internal successors, (1140), 9 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:30,778 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 368.0) internal successors, (3680), 10 states have internal predecessors, (3680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:30,780 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 368.0) internal successors, (3680), 10 states have internal predecessors, (3680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:30,780 INFO L175 Difference]: Start difference. First operand has 90 places, 116 transitions, 1308 flow. Second operand 9 states and 1140 transitions. [2023-11-06 22:50:30,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 222 transitions, 2667 flow [2023-11-06 22:50:31,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 222 transitions, 2634 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:50:31,894 INFO L231 Difference]: Finished difference. Result has 99 places, 140 transitions, 1691 flow [2023-11-06 22:50:31,894 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=1291, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1691, PETRI_PLACES=99, PETRI_TRANSITIONS=140} [2023-11-06 22:50:31,895 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 1 predicate places. [2023-11-06 22:50:31,895 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 140 transitions, 1691 flow [2023-11-06 22:50:31,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 118.77777777777777) internal successors, (1069), 9 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:31,895 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:50:31,896 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:50:31,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 22:50:31,896 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-11-06 22:50:31,896 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:31,896 INFO L85 PathProgramCache]: Analyzing trace with hash 247342356, now seen corresponding path program 1 times [2023-11-06 22:50:31,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:50:31,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746674850] [2023-11-06 22:50:31,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:31,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:50:31,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:33,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:50:33,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:50:33,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746674850] [2023-11-06 22:50:33,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746674850] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:50:33,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:50:33,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:50:33,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331921839] [2023-11-06 22:50:33,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:50:33,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:50:33,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:50:33,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:50:33,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:50:34,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 368 [2023-11-06 22:50:34,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 140 transitions, 1691 flow. Second operand has 9 states, 9 states have (on average 113.66666666666667) internal successors, (1023), 9 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:34,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:50:34,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 368 [2023-11-06 22:50:34,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:50:39,538 INFO L124 PetriNetUnfolderBase]: 12848/20439 cut-off events. [2023-11-06 22:50:39,538 INFO L125 PetriNetUnfolderBase]: For 80144/80246 co-relation queries the response was YES. [2023-11-06 22:50:39,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97802 conditions, 20439 events. 12848/20439 cut-off events. For 80144/80246 co-relation queries the response was YES. Maximal size of possible extension queue 1240. Compared 155439 event pairs, 1945 based on Foata normal form. 194/19963 useless extension candidates. Maximal degree in co-relation 97773. Up to 9743 conditions per place. [2023-11-06 22:50:39,751 INFO L140 encePairwiseOnDemand]: 357/368 looper letters, 263 selfloop transitions, 105 changer transitions 0/369 dead transitions. [2023-11-06 22:50:39,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 369 transitions, 4928 flow [2023-11-06 22:50:39,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 22:50:39,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-06 22:50:39,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1715 transitions. [2023-11-06 22:50:39,759 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3328804347826087 [2023-11-06 22:50:39,759 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1715 transitions. [2023-11-06 22:50:39,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1715 transitions. [2023-11-06 22:50:39,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:50:39,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1715 transitions. [2023-11-06 22:50:39,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 122.5) internal successors, (1715), 14 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:39,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 368.0) internal successors, (5520), 15 states have internal predecessors, (5520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:39,777 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 368.0) internal successors, (5520), 15 states have internal predecessors, (5520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:39,777 INFO L175 Difference]: Start difference. First operand has 99 places, 140 transitions, 1691 flow. Second operand 14 states and 1715 transitions. [2023-11-06 22:50:39,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 369 transitions, 4928 flow [2023-11-06 22:50:45,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 369 transitions, 4896 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:50:45,313 INFO L231 Difference]: Finished difference. Result has 120 places, 229 transitions, 3285 flow [2023-11-06 22:50:45,313 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=1674, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3285, PETRI_PLACES=120, PETRI_TRANSITIONS=229} [2023-11-06 22:50:45,314 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 22 predicate places. [2023-11-06 22:50:45,314 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 229 transitions, 3285 flow [2023-11-06 22:50:45,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 113.66666666666667) internal successors, (1023), 9 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:45,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:50:45,315 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:50:45,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 22:50:45,316 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-11-06 22:50:45,316 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:45,317 INFO L85 PathProgramCache]: Analyzing trace with hash -818548450, now seen corresponding path program 1 times [2023-11-06 22:50:45,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:50:45,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901657465] [2023-11-06 22:50:45,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:45,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:50:45,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:45,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:50:45,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:50:45,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901657465] [2023-11-06 22:50:45,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901657465] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:50:45,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:50:45,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:50:45,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279595340] [2023-11-06 22:50:45,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:50:45,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:50:45,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:50:45,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:50:45,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:50:45,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 368 [2023-11-06 22:50:45,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 229 transitions, 3285 flow. Second operand has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:45,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:50:45,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 368 [2023-11-06 22:50:45,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:50:50,232 INFO L124 PetriNetUnfolderBase]: 11667/17917 cut-off events. [2023-11-06 22:50:50,232 INFO L125 PetriNetUnfolderBase]: For 100054/100098 co-relation queries the response was YES. [2023-11-06 22:50:50,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93764 conditions, 17917 events. 11667/17917 cut-off events. For 100054/100098 co-relation queries the response was YES. Maximal size of possible extension queue 1015. Compared 126038 event pairs, 5687 based on Foata normal form. 414/17951 useless extension candidates. Maximal degree in co-relation 93724. Up to 14078 conditions per place. [2023-11-06 22:50:50,402 INFO L140 encePairwiseOnDemand]: 349/368 looper letters, 59 selfloop transitions, 39 changer transitions 147/246 dead transitions. [2023-11-06 22:50:50,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 246 transitions, 4012 flow [2023-11-06 22:50:50,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:50:50,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:50:50,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 546 transitions. [2023-11-06 22:50:50,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37092391304347827 [2023-11-06 22:50:50,405 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 546 transitions. [2023-11-06 22:50:50,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 546 transitions. [2023-11-06 22:50:50,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:50:50,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 546 transitions. [2023-11-06 22:50:50,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 136.5) internal successors, (546), 4 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:50,410 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 368.0) internal successors, (1840), 5 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:50,411 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 368.0) internal successors, (1840), 5 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:50,411 INFO L175 Difference]: Start difference. First operand has 120 places, 229 transitions, 3285 flow. Second operand 4 states and 546 transitions. [2023-11-06 22:50:50,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 246 transitions, 4012 flow [2023-11-06 22:50:53,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 246 transitions, 3959 flow, removed 25 selfloop flow, removed 1 redundant places. [2023-11-06 22:50:53,554 INFO L231 Difference]: Finished difference. Result has 122 places, 96 transitions, 1299 flow [2023-11-06 22:50:53,554 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=3224, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1299, PETRI_PLACES=122, PETRI_TRANSITIONS=96} [2023-11-06 22:50:53,555 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 24 predicate places. [2023-11-06 22:50:53,555 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 96 transitions, 1299 flow [2023-11-06 22:50:53,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:53,555 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:50:53,555 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:50:53,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 22:50:53,555 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-11-06 22:50:53,555 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:53,556 INFO L85 PathProgramCache]: Analyzing trace with hash 791528499, now seen corresponding path program 1 times [2023-11-06 22:50:53,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:50:53,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727147326] [2023-11-06 22:50:53,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:53,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:50:53,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:54,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:50:54,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:50:54,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727147326] [2023-11-06 22:50:54,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727147326] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:50:54,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:50:54,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:50:54,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646541530] [2023-11-06 22:50:54,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:50:54,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:50:54,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:50:54,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:50:54,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:50:54,689 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 368 [2023-11-06 22:50:54,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 96 transitions, 1299 flow. Second operand has 9 states, 9 states have (on average 115.88888888888889) internal successors, (1043), 9 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:54,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:50:54,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 368 [2023-11-06 22:50:54,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:50:56,542 INFO L124 PetriNetUnfolderBase]: 4236/6977 cut-off events. [2023-11-06 22:50:56,542 INFO L125 PetriNetUnfolderBase]: For 32886/33734 co-relation queries the response was YES. [2023-11-06 22:50:56,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29690 conditions, 6977 events. 4236/6977 cut-off events. For 32886/33734 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 46166 event pairs, 3008 based on Foata normal form. 220/6958 useless extension candidates. Maximal degree in co-relation 29648. Up to 2762 conditions per place. [2023-11-06 22:50:56,596 INFO L140 encePairwiseOnDemand]: 360/368 looper letters, 74 selfloop transitions, 8 changer transitions 49/163 dead transitions. [2023-11-06 22:50:56,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 163 transitions, 2136 flow [2023-11-06 22:50:56,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:50:56,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 22:50:56,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1103 transitions. [2023-11-06 22:50:56,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33303140096618356 [2023-11-06 22:50:56,601 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1103 transitions. [2023-11-06 22:50:56,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1103 transitions. [2023-11-06 22:50:56,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:50:56,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1103 transitions. [2023-11-06 22:50:56,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 122.55555555555556) internal successors, (1103), 9 states have internal predecessors, (1103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:56,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 368.0) internal successors, (3680), 10 states have internal predecessors, (3680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:56,608 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 368.0) internal successors, (3680), 10 states have internal predecessors, (3680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:56,608 INFO L175 Difference]: Start difference. First operand has 122 places, 96 transitions, 1299 flow. Second operand 9 states and 1103 transitions. [2023-11-06 22:50:56,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 163 transitions, 2136 flow [2023-11-06 22:50:56,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 163 transitions, 1768 flow, removed 30 selfloop flow, removed 21 redundant places. [2023-11-06 22:50:56,808 INFO L231 Difference]: Finished difference. Result has 107 places, 98 transitions, 1104 flow [2023-11-06 22:50:56,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=1020, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1104, PETRI_PLACES=107, PETRI_TRANSITIONS=98} [2023-11-06 22:50:56,808 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 9 predicate places. [2023-11-06 22:50:56,809 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 98 transitions, 1104 flow [2023-11-06 22:50:56,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 115.88888888888889) internal successors, (1043), 9 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:56,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:50:56,809 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:50:56,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-06 22:50:56,810 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-11-06 22:50:56,810 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:56,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1071750709, now seen corresponding path program 1 times [2023-11-06 22:50:56,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:50:56,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712141235] [2023-11-06 22:50:56,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:56,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:50:56,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:57,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:50:57,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:50:57,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712141235] [2023-11-06 22:50:57,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712141235] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:50:57,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:50:57,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:50:57,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860697900] [2023-11-06 22:50:57,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:50:57,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:50:57,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:50:57,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:50:57,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:50:57,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 368 [2023-11-06 22:50:57,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 98 transitions, 1104 flow. Second operand has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:57,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:50:57,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 368 [2023-11-06 22:50:57,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:50:57,942 INFO L124 PetriNetUnfolderBase]: 1706/3101 cut-off events. [2023-11-06 22:50:57,942 INFO L125 PetriNetUnfolderBase]: For 7935/8461 co-relation queries the response was YES. [2023-11-06 22:50:57,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11492 conditions, 3101 events. 1706/3101 cut-off events. For 7935/8461 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 20291 event pairs, 609 based on Foata normal form. 76/3104 useless extension candidates. Maximal degree in co-relation 11457. Up to 2733 conditions per place. [2023-11-06 22:50:57,961 INFO L140 encePairwiseOnDemand]: 363/368 looper letters, 80 selfloop transitions, 4 changer transitions 0/119 dead transitions. [2023-11-06 22:50:57,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 119 transitions, 1436 flow [2023-11-06 22:50:57,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:50:57,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:50:57,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 432 transitions. [2023-11-06 22:50:57,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.391304347826087 [2023-11-06 22:50:57,964 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 432 transitions. [2023-11-06 22:50:57,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 432 transitions. [2023-11-06 22:50:57,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:50:57,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 432 transitions. [2023-11-06 22:50:57,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:57,970 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 368.0) internal successors, (1472), 4 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:57,970 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 368.0) internal successors, (1472), 4 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:57,970 INFO L175 Difference]: Start difference. First operand has 107 places, 98 transitions, 1104 flow. Second operand 3 states and 432 transitions. [2023-11-06 22:50:57,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 119 transitions, 1436 flow [2023-11-06 22:50:58,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 119 transitions, 1352 flow, removed 30 selfloop flow, removed 10 redundant places. [2023-11-06 22:50:58,005 INFO L231 Difference]: Finished difference. Result has 95 places, 101 transitions, 1068 flow [2023-11-06 22:50:58,005 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=1042, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1068, PETRI_PLACES=95, PETRI_TRANSITIONS=101} [2023-11-06 22:50:58,005 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -3 predicate places. [2023-11-06 22:50:58,005 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 101 transitions, 1068 flow [2023-11-06 22:50:58,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:50:58,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:50:58,006 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:50:58,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-06 22:50:58,006 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-11-06 22:50:58,006 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:58,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1784149325, now seen corresponding path program 1 times [2023-11-06 22:50:58,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:50:58,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116987659] [2023-11-06 22:50:58,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:58,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:50:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:00,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:51:00,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:00,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116987659] [2023-11-06 22:51:00,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116987659] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:00,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:00,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:51:00,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686885681] [2023-11-06 22:51:00,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:00,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:51:00,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:00,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:51:00,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:51:00,312 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 368 [2023-11-06 22:51:00,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 101 transitions, 1068 flow. Second operand has 8 states, 8 states have (on average 127.125) internal successors, (1017), 8 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:00,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:51:00,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 368 [2023-11-06 22:51:00,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:51:01,678 INFO L124 PetriNetUnfolderBase]: 3031/5300 cut-off events. [2023-11-06 22:51:01,678 INFO L125 PetriNetUnfolderBase]: For 10770/10770 co-relation queries the response was YES. [2023-11-06 22:51:01,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21841 conditions, 5300 events. 3031/5300 cut-off events. For 10770/10770 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 35132 event pairs, 779 based on Foata normal form. 12/5274 useless extension candidates. Maximal degree in co-relation 21814. Up to 3311 conditions per place. [2023-11-06 22:51:01,712 INFO L140 encePairwiseOnDemand]: 358/368 looper letters, 139 selfloop transitions, 48 changer transitions 0/192 dead transitions. [2023-11-06 22:51:01,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 192 transitions, 2289 flow [2023-11-06 22:51:01,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:51:01,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:51:01,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 828 transitions. [2023-11-06 22:51:01,715 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2023-11-06 22:51:01,715 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 828 transitions. [2023-11-06 22:51:01,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 828 transitions. [2023-11-06 22:51:01,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:51:01,717 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 828 transitions. [2023-11-06 22:51:01,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 138.0) internal successors, (828), 6 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:01,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 368.0) internal successors, (2576), 7 states have internal predecessors, (2576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:01,722 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 368.0) internal successors, (2576), 7 states have internal predecessors, (2576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:01,723 INFO L175 Difference]: Start difference. First operand has 95 places, 101 transitions, 1068 flow. Second operand 6 states and 828 transitions. [2023-11-06 22:51:01,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 192 transitions, 2289 flow [2023-11-06 22:51:01,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 192 transitions, 2280 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:51:01,790 INFO L231 Difference]: Finished difference. Result has 100 places, 128 transitions, 1558 flow [2023-11-06 22:51:01,791 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=1056, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1558, PETRI_PLACES=100, PETRI_TRANSITIONS=128} [2023-11-06 22:51:01,791 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 2 predicate places. [2023-11-06 22:51:01,791 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 128 transitions, 1558 flow [2023-11-06 22:51:01,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 127.125) internal successors, (1017), 8 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:01,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:51:01,792 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:01,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-06 22:51:01,792 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-11-06 22:51:01,793 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:01,793 INFO L85 PathProgramCache]: Analyzing trace with hash 555542553, now seen corresponding path program 1 times [2023-11-06 22:51:01,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:01,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533463217] [2023-11-06 22:51:01,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:01,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:01,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:02,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:51:02,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:02,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533463217] [2023-11-06 22:51:02,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533463217] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:02,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:02,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:51:02,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743925485] [2023-11-06 22:51:02,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:02,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:51:02,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:02,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:51:02,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:51:02,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 368 [2023-11-06 22:51:02,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 128 transitions, 1558 flow. Second operand has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:02,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:51:02,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 368 [2023-11-06 22:51:02,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:51:02,675 INFO L124 PetriNetUnfolderBase]: 823/1824 cut-off events. [2023-11-06 22:51:02,675 INFO L125 PetriNetUnfolderBase]: For 4154/4270 co-relation queries the response was YES. [2023-11-06 22:51:02,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7660 conditions, 1824 events. 823/1824 cut-off events. For 4154/4270 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 12569 event pairs, 79 based on Foata normal form. 174/1983 useless extension candidates. Maximal degree in co-relation 7631. Up to 1069 conditions per place. [2023-11-06 22:51:02,687 INFO L140 encePairwiseOnDemand]: 363/368 looper letters, 91 selfloop transitions, 7 changer transitions 1/131 dead transitions. [2023-11-06 22:51:02,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 131 transitions, 1493 flow [2023-11-06 22:51:02,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:51:02,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:51:02,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 571 transitions. [2023-11-06 22:51:02,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38790760869565216 [2023-11-06 22:51:02,689 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 571 transitions. [2023-11-06 22:51:02,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 571 transitions. [2023-11-06 22:51:02,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:51:02,689 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 571 transitions. [2023-11-06 22:51:02,690 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:02,692 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 368.0) internal successors, (1840), 5 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:02,692 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 368.0) internal successors, (1840), 5 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:02,692 INFO L175 Difference]: Start difference. First operand has 100 places, 128 transitions, 1558 flow. Second operand 4 states and 571 transitions. [2023-11-06 22:51:02,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 131 transitions, 1493 flow [2023-11-06 22:51:02,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 131 transitions, 1436 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-11-06 22:51:02,707 INFO L231 Difference]: Finished difference. Result has 97 places, 100 transitions, 1031 flow [2023-11-06 22:51:02,708 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=991, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1031, PETRI_PLACES=97, PETRI_TRANSITIONS=100} [2023-11-06 22:51:02,708 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -1 predicate places. [2023-11-06 22:51:02,708 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 100 transitions, 1031 flow [2023-11-06 22:51:02,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:02,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:51:02,709 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-06 22:51:02,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-06 22:51:02,709 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-11-06 22:51:02,710 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:02,710 INFO L85 PathProgramCache]: Analyzing trace with hash -360952822, now seen corresponding path program 1 times [2023-11-06 22:51:02,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:02,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711056906] [2023-11-06 22:51:02,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:02,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:02,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:05,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:51:05,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:05,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711056906] [2023-11-06 22:51:05,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711056906] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:05,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:05,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:51:05,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047212011] [2023-11-06 22:51:05,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:05,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:51:05,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:05,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:51:05,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:51:05,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 368 [2023-11-06 22:51:05,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 100 transitions, 1031 flow. Second operand has 10 states, 10 states have (on average 117.8) internal successors, (1178), 10 states have internal predecessors, (1178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:05,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:51:05,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 368 [2023-11-06 22:51:05,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:51:06,483 INFO L124 PetriNetUnfolderBase]: 1062/2196 cut-off events. [2023-11-06 22:51:06,483 INFO L125 PetriNetUnfolderBase]: For 6743/6743 co-relation queries the response was YES. [2023-11-06 22:51:06,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10639 conditions, 2196 events. 1062/2196 cut-off events. For 6743/6743 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 14271 event pairs, 212 based on Foata normal form. 1/2193 useless extension candidates. Maximal degree in co-relation 10612. Up to 1385 conditions per place. [2023-11-06 22:51:06,500 INFO L140 encePairwiseOnDemand]: 357/368 looper letters, 118 selfloop transitions, 50 changer transitions 0/171 dead transitions. [2023-11-06 22:51:06,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 171 transitions, 1988 flow [2023-11-06 22:51:06,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:51:06,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:51:06,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1010 transitions. [2023-11-06 22:51:06,508 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.343070652173913 [2023-11-06 22:51:06,508 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1010 transitions. [2023-11-06 22:51:06,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1010 transitions. [2023-11-06 22:51:06,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:51:06,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1010 transitions. [2023-11-06 22:51:06,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 126.25) internal successors, (1010), 8 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:06,513 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 368.0) internal successors, (3312), 9 states have internal predecessors, (3312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:06,513 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 368.0) internal successors, (3312), 9 states have internal predecessors, (3312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:06,513 INFO L175 Difference]: Start difference. First operand has 97 places, 100 transitions, 1031 flow. Second operand 8 states and 1010 transitions. [2023-11-06 22:51:06,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 171 transitions, 1988 flow [2023-11-06 22:51:06,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 171 transitions, 1953 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-11-06 22:51:06,537 INFO L231 Difference]: Finished difference. Result has 106 places, 122 transitions, 1470 flow [2023-11-06 22:51:06,537 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=1017, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1470, PETRI_PLACES=106, PETRI_TRANSITIONS=122} [2023-11-06 22:51:06,537 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 8 predicate places. [2023-11-06 22:51:06,538 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 122 transitions, 1470 flow [2023-11-06 22:51:06,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 117.8) internal successors, (1178), 10 states have internal predecessors, (1178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:06,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:51:06,538 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-06 22:51:06,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-06 22:51:06,539 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-11-06 22:51:06,539 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:06,539 INFO L85 PathProgramCache]: Analyzing trace with hash -22465254, now seen corresponding path program 2 times [2023-11-06 22:51:06,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:06,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501583982] [2023-11-06 22:51:06,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:06,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:06,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:09,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:51:09,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:09,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501583982] [2023-11-06 22:51:09,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501583982] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:09,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:09,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:51:09,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308716318] [2023-11-06 22:51:09,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:09,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:51:09,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:09,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:51:09,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:51:09,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 368 [2023-11-06 22:51:09,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 122 transitions, 1470 flow. Second operand has 7 states, 7 states have (on average 127.57142857142857) internal successors, (893), 7 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:09,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:51:09,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 368 [2023-11-06 22:51:09,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:51:10,552 INFO L124 PetriNetUnfolderBase]: 1779/3518 cut-off events. [2023-11-06 22:51:10,553 INFO L125 PetriNetUnfolderBase]: For 12847/12847 co-relation queries the response was YES. [2023-11-06 22:51:10,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17441 conditions, 3518 events. 1779/3518 cut-off events. For 12847/12847 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 24358 event pairs, 662 based on Foata normal form. 3/3515 useless extension candidates. Maximal degree in co-relation 17410. Up to 2240 conditions per place. [2023-11-06 22:51:10,578 INFO L140 encePairwiseOnDemand]: 359/368 looper letters, 163 selfloop transitions, 25 changer transitions 1/194 dead transitions. [2023-11-06 22:51:10,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 194 transitions, 2468 flow [2023-11-06 22:51:10,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:51:10,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:51:10,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 941 transitions. [2023-11-06 22:51:10,580 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3652950310559006 [2023-11-06 22:51:10,580 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 941 transitions. [2023-11-06 22:51:10,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 941 transitions. [2023-11-06 22:51:10,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:51:10,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 941 transitions. [2023-11-06 22:51:10,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 134.42857142857142) internal successors, (941), 7 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:10,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 368.0) internal successors, (2944), 8 states have internal predecessors, (2944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:10,586 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 368.0) internal successors, (2944), 8 states have internal predecessors, (2944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:10,586 INFO L175 Difference]: Start difference. First operand has 106 places, 122 transitions, 1470 flow. Second operand 7 states and 941 transitions. [2023-11-06 22:51:10,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 194 transitions, 2468 flow [2023-11-06 22:51:10,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 194 transitions, 2438 flow, removed 12 selfloop flow, removed 2 redundant places. [2023-11-06 22:51:10,641 INFO L231 Difference]: Finished difference. Result has 114 places, 144 transitions, 1817 flow [2023-11-06 22:51:10,641 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=1445, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1817, PETRI_PLACES=114, PETRI_TRANSITIONS=144} [2023-11-06 22:51:10,641 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 16 predicate places. [2023-11-06 22:51:10,641 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 144 transitions, 1817 flow [2023-11-06 22:51:10,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 127.57142857142857) internal successors, (893), 7 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:10,642 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:51:10,642 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] [2023-11-06 22:51:10,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-06 22:51:10,642 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-11-06 22:51:10,642 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:10,642 INFO L85 PathProgramCache]: Analyzing trace with hash 2133017187, now seen corresponding path program 1 times [2023-11-06 22:51:10,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:10,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672824586] [2023-11-06 22:51:10,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:10,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:10,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:10,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:51:10,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:10,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672824586] [2023-11-06 22:51:10,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672824586] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:10,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:10,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:51:10,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701312568] [2023-11-06 22:51:10,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:10,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:51:10,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:10,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:51:10,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:51:10,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 368 [2023-11-06 22:51:10,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 144 transitions, 1817 flow. Second operand has 5 states, 5 states have (on average 133.4) internal successors, (667), 5 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:10,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:51:10,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 368 [2023-11-06 22:51:10,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:51:11,478 INFO L124 PetriNetUnfolderBase]: 880/1903 cut-off events. [2023-11-06 22:51:11,478 INFO L125 PetriNetUnfolderBase]: For 7579/7720 co-relation queries the response was YES. [2023-11-06 22:51:11,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9202 conditions, 1903 events. 880/1903 cut-off events. For 7579/7720 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 14013 event pairs, 46 based on Foata normal form. 201/2074 useless extension candidates. Maximal degree in co-relation 9167. Up to 815 conditions per place. [2023-11-06 22:51:11,491 INFO L140 encePairwiseOnDemand]: 363/368 looper letters, 95 selfloop transitions, 10 changer transitions 1/134 dead transitions. [2023-11-06 22:51:11,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 134 transitions, 1694 flow [2023-11-06 22:51:11,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:51:11,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:51:11,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 697 transitions. [2023-11-06 22:51:11,493 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37880434782608696 [2023-11-06 22:51:11,493 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 697 transitions. [2023-11-06 22:51:11,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 697 transitions. [2023-11-06 22:51:11,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:51:11,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 697 transitions. [2023-11-06 22:51:11,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.4) internal successors, (697), 5 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:11,498 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 368.0) internal successors, (2208), 6 states have internal predecessors, (2208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:11,498 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 368.0) internal successors, (2208), 6 states have internal predecessors, (2208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:11,498 INFO L175 Difference]: Start difference. First operand has 114 places, 144 transitions, 1817 flow. Second operand 5 states and 697 transitions. [2023-11-06 22:51:11,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 134 transitions, 1694 flow [2023-11-06 22:51:11,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 134 transitions, 1558 flow, removed 50 selfloop flow, removed 10 redundant places. [2023-11-06 22:51:11,516 INFO L231 Difference]: Finished difference. Result has 100 places, 91 transitions, 953 flow [2023-11-06 22:51:11,516 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=368, PETRI_DIFFERENCE_MINUEND_FLOW=925, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=953, PETRI_PLACES=100, PETRI_TRANSITIONS=91} [2023-11-06 22:51:11,516 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 2 predicate places. [2023-11-06 22:51:11,516 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 91 transitions, 953 flow [2023-11-06 22:51:11,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.4) internal successors, (667), 5 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:11,517 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:51:11,517 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, 1] [2023-11-06 22:51:11,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-06 22:51:11,517 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-11-06 22:51:11,517 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:11,517 INFO L85 PathProgramCache]: Analyzing trace with hash -376356012, now seen corresponding path program 1 times [2023-11-06 22:51:11,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:11,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743189733] [2023-11-06 22:51:11,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:11,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:11,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:51:11,642 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:51:11,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:51:11,772 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:51:11,772 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:51:11,773 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (100 of 101 remaining) [2023-11-06 22:51:11,775 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 101 remaining) [2023-11-06 22:51:11,776 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 101 remaining) [2023-11-06 22:51:11,776 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 101 remaining) [2023-11-06 22:51:11,776 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 101 remaining) [2023-11-06 22:51:11,776 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 101 remaining) [2023-11-06 22:51:11,776 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 101 remaining) [2023-11-06 22:51:11,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 101 remaining) [2023-11-06 22:51:11,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 101 remaining) [2023-11-06 22:51:11,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 101 remaining) [2023-11-06 22:51:11,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 101 remaining) [2023-11-06 22:51:11,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 101 remaining) [2023-11-06 22:51:11,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 101 remaining) [2023-11-06 22:51:11,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 101 remaining) [2023-11-06 22:51:11,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 101 remaining) [2023-11-06 22:51:11,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 101 remaining) [2023-11-06 22:51:11,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 101 remaining) [2023-11-06 22:51:11,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 101 remaining) [2023-11-06 22:51:11,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 101 remaining) [2023-11-06 22:51:11,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 101 remaining) [2023-11-06 22:51:11,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 101 remaining) [2023-11-06 22:51:11,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 101 remaining) [2023-11-06 22:51:11,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 101 remaining) [2023-11-06 22:51:11,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 101 remaining) [2023-11-06 22:51:11,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 101 remaining) [2023-11-06 22:51:11,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 101 remaining) [2023-11-06 22:51:11,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 101 remaining) [2023-11-06 22:51:11,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 101 remaining) [2023-11-06 22:51:11,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 101 remaining) [2023-11-06 22:51:11,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 101 remaining) [2023-11-06 22:51:11,783 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 101 remaining) [2023-11-06 22:51:11,785 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 101 remaining) [2023-11-06 22:51:11,785 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 101 remaining) [2023-11-06 22:51:11,786 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 101 remaining) [2023-11-06 22:51:11,786 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 101 remaining) [2023-11-06 22:51:11,786 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 101 remaining) [2023-11-06 22:51:11,786 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 101 remaining) [2023-11-06 22:51:11,786 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 101 remaining) [2023-11-06 22:51:11,786 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 101 remaining) [2023-11-06 22:51:11,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 101 remaining) [2023-11-06 22:51:11,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 101 remaining) [2023-11-06 22:51:11,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 101 remaining) [2023-11-06 22:51:11,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 101 remaining) [2023-11-06 22:51:11,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 101 remaining) [2023-11-06 22:51:11,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 101 remaining) [2023-11-06 22:51:11,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 101 remaining) [2023-11-06 22:51:11,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 101 remaining) [2023-11-06 22:51:11,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 101 remaining) [2023-11-06 22:51:11,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 101 remaining) [2023-11-06 22:51:11,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 101 remaining) [2023-11-06 22:51:11,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 101 remaining) [2023-11-06 22:51:11,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 101 remaining) [2023-11-06 22:51:11,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 101 remaining) [2023-11-06 22:51:11,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 101 remaining) [2023-11-06 22:51:11,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 101 remaining) [2023-11-06 22:51:11,790 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 101 remaining) [2023-11-06 22:51:11,790 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 101 remaining) [2023-11-06 22:51:11,790 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 101 remaining) [2023-11-06 22:51:11,790 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 101 remaining) [2023-11-06 22:51:11,790 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 101 remaining) [2023-11-06 22:51:11,790 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 101 remaining) [2023-11-06 22:51:11,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK (39 of 101 remaining) [2023-11-06 22:51:11,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 101 remaining) [2023-11-06 22:51:11,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 101 remaining) [2023-11-06 22:51:11,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 101 remaining) [2023-11-06 22:51:11,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 101 remaining) [2023-11-06 22:51:11,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 101 remaining) [2023-11-06 22:51:11,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 101 remaining) [2023-11-06 22:51:11,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 101 remaining) [2023-11-06 22:51:11,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 101 remaining) [2023-11-06 22:51:11,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 101 remaining) [2023-11-06 22:51:11,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 101 remaining) [2023-11-06 22:51:11,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 101 remaining) [2023-11-06 22:51:11,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 101 remaining) [2023-11-06 22:51:11,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 101 remaining) [2023-11-06 22:51:11,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 101 remaining) [2023-11-06 22:51:11,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 101 remaining) [2023-11-06 22:51:11,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 101 remaining) [2023-11-06 22:51:11,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 101 remaining) [2023-11-06 22:51:11,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 101 remaining) [2023-11-06 22:51:11,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 101 remaining) [2023-11-06 22:51:11,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 101 remaining) [2023-11-06 22:51:11,795 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 101 remaining) [2023-11-06 22:51:11,795 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 101 remaining) [2023-11-06 22:51:11,795 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 101 remaining) [2023-11-06 22:51:11,795 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 101 remaining) [2023-11-06 22:51:11,795 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 101 remaining) [2023-11-06 22:51:11,795 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 101 remaining) [2023-11-06 22:51:11,796 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 101 remaining) [2023-11-06 22:51:11,796 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 101 remaining) [2023-11-06 22:51:11,796 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 101 remaining) [2023-11-06 22:51:11,796 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 101 remaining) [2023-11-06 22:51:11,796 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 101 remaining) [2023-11-06 22:51:11,796 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 101 remaining) [2023-11-06 22:51:11,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 101 remaining) [2023-11-06 22:51:11,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 101 remaining) [2023-11-06 22:51:11,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 101 remaining) [2023-11-06 22:51:11,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 101 remaining) [2023-11-06 22:51:11,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 101 remaining) [2023-11-06 22:51:11,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 101 remaining) [2023-11-06 22:51:11,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 101 remaining) [2023-11-06 22:51:11,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-06 22:51:11,799 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:11,806 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:51:11,807 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:51:11,960 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:51:11 BasicIcfg [2023-11-06 22:51:11,960 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:51:11,961 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:51:11,961 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:51:11,961 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:51:11,961 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:49:05" (3/4) ... [2023-11-06 22:51:11,963 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:51:11,964 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:51:11,965 INFO L158 Benchmark]: Toolchain (without parser) took 130380.65ms. Allocated memory was 167.8MB in the beginning and 5.6GB in the end (delta: 5.5GB). Free memory was 137.3MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 3.6GB. Max. memory is 16.1GB. [2023-11-06 22:51:11,965 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 130.0MB. Free memory is still 102.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:51:11,966 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1131.87ms. Allocated memory is still 167.8MB. Free memory was 137.1MB in the beginning and 115.1MB in the end (delta: 22.1MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. [2023-11-06 22:51:11,966 INFO L158 Benchmark]: Boogie Procedure Inliner took 140.16ms. Allocated memory is still 167.8MB. Free memory was 115.1MB in the beginning and 111.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:51:11,966 INFO L158 Benchmark]: Boogie Preprocessor took 132.30ms. Allocated memory is still 167.8MB. Free memory was 111.7MB in the beginning and 135.2MB in the end (delta: -23.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:51:11,967 INFO L158 Benchmark]: RCFGBuilder took 2315.04ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 135.2MB in the beginning and 138.9MB in the end (delta: -3.8MB). Peak memory consumption was 105.7MB. Max. memory is 16.1GB. [2023-11-06 22:51:11,967 INFO L158 Benchmark]: TraceAbstraction took 126646.18ms. Allocated memory was 201.3MB in the beginning and 5.6GB in the end (delta: 5.4GB). Free memory was 137.9MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 3.6GB. Max. memory is 16.1GB. [2023-11-06 22:51:11,968 INFO L158 Benchmark]: Witness Printer took 3.87ms. Allocated memory is still 5.6GB. Free memory is still 2.0GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:51:11,974 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.31ms. Allocated memory is still 130.0MB. Free memory is still 102.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1131.87ms. Allocated memory is still 167.8MB. Free memory was 137.1MB in the beginning and 115.1MB in the end (delta: 22.1MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 140.16ms. Allocated memory is still 167.8MB. Free memory was 115.1MB in the beginning and 111.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 132.30ms. Allocated memory is still 167.8MB. Free memory was 111.7MB in the beginning and 135.2MB in the end (delta: -23.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 2315.04ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 135.2MB in the beginning and 138.9MB in the end (delta: -3.8MB). Peak memory consumption was 105.7MB. Max. memory is 16.1GB. * TraceAbstraction took 126646.18ms. Allocated memory was 201.3MB in the beginning and 5.6GB in the end (delta: 5.4GB). Free memory was 137.9MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 3.6GB. Max. memory is 16.1GB. * Witness Printer took 3.87ms. Allocated memory is still 5.6GB. Free memory is still 2.0GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 32.4s, 201 PlacesBefore, 98 PlacesAfterwards, 194 TransitionsBefore, 89 TransitionsAfterwards, 9508 CoEnabledTransitionPairs, 7 FixpointIterations, 69 TrivialSequentialCompositions, 92 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 171 TotalNumberOfCompositions, 44602 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11014, independent: 10345, independent conditional: 0, independent unconditional: 10345, dependent: 669, dependent conditional: 0, dependent unconditional: 669, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3534, independent: 3432, independent conditional: 0, independent unconditional: 3432, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 11014, independent: 6913, independent conditional: 0, independent unconditional: 6913, dependent: 567, dependent conditional: 0, dependent unconditional: 567, unknown: 3534, unknown conditional: 0, unknown unconditional: 3534] , Statistics on independence cache: Total cache size (in pairs): 456, Positive cache size: 383, Positive conditional cache size: 0, Positive unconditional cache size: 383, Negative cache size: 73, Negative conditional cache size: 0, Negative unconditional cache size: 73, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L852] 0 pthread_t t1789; [L853] FCALL, FORK 0 pthread_create(&t1789, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1789, ((void *)0), P0, ((void *)0))=-2, t1789={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L854] 0 pthread_t t1790; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1789={6:0}, t1790={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] EXPR 1 \read(y) [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L766] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L767] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L768] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L769] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L771] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L773] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L774] EXPR 1 \read(y) [L774] 1 __unbuffered_p0_EAX = y [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] EXPR 1 \read(y) [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] 1 y = y$flush_delayed ? y$mem_tmp : y [L776] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L779] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L855] FCALL, FORK 0 pthread_create(&t1790, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1790, ((void *)0), P1, ((void *)0))=-1, t1789={6:0}, t1790={7:0}, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L791] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L856] 0 pthread_t t1791; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1789={6:0}, t1790={7:0}, t1791={5:0}, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L794] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L797] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L797] EXPR 2 \read(y) [L797] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L797] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L798] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L799] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L800] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L801] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L857] FCALL, FORK 0 pthread_create(&t1791, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1791, ((void *)0), P2, ((void *)0))=0, t1789={6:0}, t1790={7:0}, t1791={5:0}, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L811] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L812] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L813] 3 y$flush_delayed = weak$$choice2 [L814] EXPR 3 \read(y) [L814] 3 y$mem_tmp = y [L815] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L815] EXPR 3 \read(y) [L815] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L815] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L816] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L817] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L818] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L819] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L821] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] EXPR 3 \read(y) [L822] 3 __unbuffered_p2_EAX = y [L823] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L823] 3 y = y$flush_delayed ? y$mem_tmp : y [L824] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L827] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L830] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L830] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L830] EXPR 3 \read(y) [L830] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L830] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L830] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L831] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L832] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L833] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L834] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L837] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L839] 3 return 0; [L859] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L861] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L861] RET 0 assume_abort_if_not(main$tmp_guard0) [L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L863] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L863] EXPR 0 \read(y) [L863] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L863] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L865] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L866] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L867] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1789={6:0}, t1790={7:0}, t1791={5:0}, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L870] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L871] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L872] 0 y$flush_delayed = weak$$choice2 [L873] EXPR 0 \read(y) [L873] 0 y$mem_tmp = y [L874] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L874] EXPR 0 \read(y) [L874] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L874] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L876] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L877] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L878] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L880] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L882] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L882] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L882] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] EXPR 0 \read(y) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L884] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$flush_delayed = (_Bool)0 [L887] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe000_rmo.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 257 locations, 101 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: 126.2s, OverallIterations: 26, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 74.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 32.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3152 SdHoareTripleChecker+Valid, 10.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2452 mSDsluCounter, 1042 SdHoareTripleChecker+Invalid, 8.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 846 mSDsCounter, 510 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7664 IncrementalHoareTripleChecker+Invalid, 8174 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 510 mSolverCounterUnsat, 196 mSDtfsCounter, 7664 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3285occurred in iteration=17, InterpolantAutomatonStates: 130, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 17.5s InterpolantComputationTime, 357 NumberOfCodeBlocks, 357 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 310 ConstructedInterpolants, 0 QuantifiedInterpolants, 4320 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-06 22:51:12,045 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_423a9331-c205-4075-9a17-36407a7b33ff/bin/uautomizer-verify-WvqO1wxjHP/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_423a9331-c205-4075-9a17-36407a7b33ff/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_423a9331-c205-4075-9a17-36407a7b33ff/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_423a9331-c205-4075-9a17-36407a7b33ff/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_423a9331-c205-4075-9a17-36407a7b33ff/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe000_rmo.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_423a9331-c205-4075-9a17-36407a7b33ff/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_423a9331-c205-4075-9a17-36407a7b33ff/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8451e3cb8884fa2b6b1e99bbb0d2794206f3a8d471135f07f1c96b53a42300f5 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:51:14,906 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:51:15,030 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_423a9331-c205-4075-9a17-36407a7b33ff/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-06 22:51:15,038 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:51:15,049 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:51:15,099 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:51:15,100 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:51:15,101 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:51:15,102 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:51:15,108 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:51:15,109 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:51:15,109 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:51:15,110 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:51:15,112 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:51:15,112 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:51:15,113 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:51:15,113 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:51:15,114 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:51:15,114 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:51:15,115 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:51:15,116 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:51:15,116 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:51:15,117 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:51:15,117 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:51:15,118 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:51:15,118 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:51:15,118 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:51:15,119 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:51:15,120 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:51:15,120 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:51:15,122 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:51:15,122 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:51:15,122 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:51:15,123 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:51:15,123 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:51:15,124 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:51:15,124 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:51:15,124 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:51:15,124 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:51:15,125 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:51:15,126 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:51:15,126 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_423a9331-c205-4075-9a17-36407a7b33ff/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_423a9331-c205-4075-9a17-36407a7b33ff/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8451e3cb8884fa2b6b1e99bbb0d2794206f3a8d471135f07f1c96b53a42300f5 [2023-11-06 22:51:15,569 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:51:15,599 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:51:15,602 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:51:15,603 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:51:15,605 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:51:15,606 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_423a9331-c205-4075-9a17-36407a7b33ff/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/safe000_rmo.i [2023-11-06 22:51:18,713 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:51:19,104 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:51:19,105 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_423a9331-c205-4075-9a17-36407a7b33ff/sv-benchmarks/c/pthread-wmm/safe000_rmo.i [2023-11-06 22:51:19,122 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_423a9331-c205-4075-9a17-36407a7b33ff/bin/uautomizer-verify-WvqO1wxjHP/data/64c64113c/ec0008c168964ec0b530855d8b96bfd4/FLAG8518c869c [2023-11-06 22:51:19,137 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_423a9331-c205-4075-9a17-36407a7b33ff/bin/uautomizer-verify-WvqO1wxjHP/data/64c64113c/ec0008c168964ec0b530855d8b96bfd4 [2023-11-06 22:51:19,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:51:19,141 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:51:19,143 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:51:19,143 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:51:19,148 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:51:19,149 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:51:19" (1/1) ... [2023-11-06 22:51:19,151 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37a1bdd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:19, skipping insertion in model container [2023-11-06 22:51:19,151 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:51:19" (1/1) ... [2023-11-06 22:51:19,204 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:51:19,739 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:51:19,783 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:51:19,887 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:51:19,963 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:51:19,963 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:51:19,971 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:51:19,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:19 WrapperNode [2023-11-06 22:51:19,972 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:51:19,973 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:51:19,973 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:51:19,973 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:51:19,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:19" (1/1) ... [2023-11-06 22:51:20,029 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:19" (1/1) ... [2023-11-06 22:51:20,073 INFO L138 Inliner]: procedures = 180, calls = 83, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 173 [2023-11-06 22:51:20,075 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:51:20,077 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:51:20,077 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:51:20,077 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:51:20,087 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:19" (1/1) ... [2023-11-06 22:51:20,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:19" (1/1) ... [2023-11-06 22:51:20,108 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:19" (1/1) ... [2023-11-06 22:51:20,111 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:19" (1/1) ... [2023-11-06 22:51:20,138 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:19" (1/1) ... [2023-11-06 22:51:20,140 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:19" (1/1) ... [2023-11-06 22:51:20,158 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:19" (1/1) ... [2023-11-06 22:51:20,161 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:19" (1/1) ... [2023-11-06 22:51:20,167 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:51:20,168 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:51:20,172 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:51:20,173 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:51:20,174 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:19" (1/1) ... [2023-11-06 22:51:20,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:51:20,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_423a9331-c205-4075-9a17-36407a7b33ff/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:51:20,229 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_423a9331-c205-4075-9a17-36407a7b33ff/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:51:20,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_423a9331-c205-4075-9a17-36407a7b33ff/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:51:20,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-06 22:51:20,279 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:51:20,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:51:20,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:51:20,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:51:20,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 22:51:20,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:51:20,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-11-06 22:51:20,280 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:51:20,281 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:51:20,281 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:51:20,281 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:51:20,283 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:51:20,284 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:51:20,284 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:51:20,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:51:20,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:51:20,286 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:51:20,487 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:51:20,490 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:51:21,428 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:51:22,385 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:51:22,385 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:51:22,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:51:22 BoogieIcfgContainer [2023-11-06 22:51:22,388 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:51:22,390 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:51:22,390 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:51:22,394 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:51:22,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:51:19" (1/3) ... [2023-11-06 22:51:22,395 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69884b99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:51:22, skipping insertion in model container [2023-11-06 22:51:22,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:19" (2/3) ... [2023-11-06 22:51:22,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69884b99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:51:22, skipping insertion in model container [2023-11-06 22:51:22,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:51:22" (3/3) ... [2023-11-06 22:51:22,397 INFO L112 eAbstractionObserver]: Analyzing ICFG safe000_rmo.i [2023-11-06 22:51:22,417 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:51:22,417 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2023-11-06 22:51:22,418 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:51:22,613 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:51:22,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 205 places, 198 transitions, 408 flow [2023-11-06 22:51:22,776 INFO L124 PetriNetUnfolderBase]: 3/195 cut-off events. [2023-11-06 22:51:22,777 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:51:22,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 195 events. 3/195 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 359 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 137. Up to 2 conditions per place. [2023-11-06 22:51:22,787 INFO L82 GeneralOperation]: Start removeDead. Operand has 205 places, 198 transitions, 408 flow [2023-11-06 22:51:22,803 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 202 places, 195 transitions, 399 flow [2023-11-06 22:51:22,807 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:51:22,825 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 202 places, 195 transitions, 399 flow [2023-11-06 22:51:22,833 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 202 places, 195 transitions, 399 flow [2023-11-06 22:51:22,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 202 places, 195 transitions, 399 flow [2023-11-06 22:51:22,959 INFO L124 PetriNetUnfolderBase]: 3/195 cut-off events. [2023-11-06 22:51:22,961 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:51:22,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 195 events. 3/195 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 360 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 137. Up to 2 conditions per place. [2023-11-06 22:51:22,989 INFO L119 LiptonReduction]: Number of co-enabled transitions 9508 [2023-11-06 22:51:32,500 WARN L293 SmtUtils]: Spent 5.77s on a formula simplification. DAG size of input: 188 DAG size of output: 186 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-11-06 22:51:42,654 WARN L293 SmtUtils]: Spent 7.14s on a formula simplification. DAG size of input: 215 DAG size of output: 213 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition)