./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c365565b-ac55-4d3b-b053-e83092452f2c/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c365565b-ac55-4d3b-b053-e83092452f2c/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c365565b-ac55-4d3b-b053-e83092452f2c/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c365565b-ac55-4d3b-b053-e83092452f2c/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c365565b-ac55-4d3b-b053-e83092452f2c/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c365565b-ac55-4d3b-b053-e83092452f2c/bin/uautomizer-verify-uCwYo4JHxu --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9a8131f8693d82039b4018f716a17d0a3e1038ace11c7bb21b12bc911efac3c1 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:50:45,000 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:50:45,094 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c365565b-ac55-4d3b-b053-e83092452f2c/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-19 07:50:45,099 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:50:45,100 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:50:45,128 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:50:45,129 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:50:45,130 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:50:45,132 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:50:45,137 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:50:45,138 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:50:45,139 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:50:45,140 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:50:45,142 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:50:45,142 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:50:45,143 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:50:45,143 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:50:45,144 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:50:45,144 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 07:50:45,145 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 07:50:45,145 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 07:50:45,146 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:50:45,146 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 07:50:45,147 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 07:50:45,147 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:50:45,148 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:50:45,149 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:50:45,149 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:50:45,150 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:50:45,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:50:45,152 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:50:45,152 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:50:45,152 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:50:45,153 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:50:45,153 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:50:45,153 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:50:45,154 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:50:45,154 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:50:45,154 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_c365565b-ac55-4d3b-b053-e83092452f2c/bin/uautomizer-verify-uCwYo4JHxu/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c365565b-ac55-4d3b-b053-e83092452f2c/bin/uautomizer-verify-uCwYo4JHxu Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9a8131f8693d82039b4018f716a17d0a3e1038ace11c7bb21b12bc911efac3c1 [2023-11-19 07:50:45,464 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:50:45,501 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:50:45,504 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:50:45,506 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:50:45,507 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:50:45,508 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c365565b-ac55-4d3b-b053-e83092452f2c/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i [2023-11-19 07:50:48,754 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:50:49,078 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:50:49,078 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c365565b-ac55-4d3b-b053-e83092452f2c/sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i [2023-11-19 07:50:49,104 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c365565b-ac55-4d3b-b053-e83092452f2c/bin/uautomizer-verify-uCwYo4JHxu/data/92a002dd2/07daf11e05e0407c9ce1d02f8ec22fbe/FLAG9729de5ad [2023-11-19 07:50:49,120 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c365565b-ac55-4d3b-b053-e83092452f2c/bin/uautomizer-verify-uCwYo4JHxu/data/92a002dd2/07daf11e05e0407c9ce1d02f8ec22fbe [2023-11-19 07:50:49,123 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:50:49,125 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:50:49,127 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:50:49,127 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:50:49,133 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:50:49,134 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:50:49" (1/1) ... [2023-11-19 07:50:49,135 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75833276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:49, skipping insertion in model container [2023-11-19 07:50:49,136 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:50:49" (1/1) ... [2023-11-19 07:50:49,189 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:50:49,750 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:50:49,767 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:50:49,878 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:50:49,933 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:50:49,934 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:50:49,942 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:50:49,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:49 WrapperNode [2023-11-19 07:50:49,943 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:50:49,944 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:50:49,944 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:50:49,944 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:50:49,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:49" (1/1) ... [2023-11-19 07:50:49,994 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:49" (1/1) ... [2023-11-19 07:50:50,053 INFO L138 Inliner]: procedures = 177, calls = 68, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 165 [2023-11-19 07:50:50,053 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:50:50,054 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:50:50,054 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:50:50,054 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:50:50,066 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:49" (1/1) ... [2023-11-19 07:50:50,066 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:49" (1/1) ... [2023-11-19 07:50:50,078 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:49" (1/1) ... [2023-11-19 07:50:50,084 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:49" (1/1) ... [2023-11-19 07:50:50,107 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:49" (1/1) ... [2023-11-19 07:50:50,109 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:49" (1/1) ... [2023-11-19 07:50:50,112 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:49" (1/1) ... [2023-11-19 07:50:50,114 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:49" (1/1) ... [2023-11-19 07:50:50,118 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:50:50,119 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:50:50,120 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:50:50,120 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:50:50,136 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:49" (1/1) ... [2023-11-19 07:50:50,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:50:50,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c365565b-ac55-4d3b-b053-e83092452f2c/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:50:50,173 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c365565b-ac55-4d3b-b053-e83092452f2c/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:50:50,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:50:50,215 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 07:50:50,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:50:50,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:50:50,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:50:50,216 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 07:50:50,217 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 07:50:50,217 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 07:50:50,217 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 07:50:50,217 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-19 07:50:50,217 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-19 07:50:50,218 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-19 07:50:50,218 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-19 07:50:50,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:50:50,218 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 07:50:50,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:50:50,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:50:50,222 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 07:50:50,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c365565b-ac55-4d3b-b053-e83092452f2c/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:50:50,435 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:50:50,438 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:50:51,048 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:50:51,289 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:50:51,289 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 07:50:51,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:50:51 BoogieIcfgContainer [2023-11-19 07:50:51,296 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:50:51,301 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:50:51,302 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:50:51,305 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:50:51,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:50:49" (1/3) ... [2023-11-19 07:50:51,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b2edb0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:50:51, skipping insertion in model container [2023-11-19 07:50:51,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:49" (2/3) ... [2023-11-19 07:50:51,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b2edb0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:50:51, skipping insertion in model container [2023-11-19 07:50:51,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:50:51" (3/3) ... [2023-11-19 07:50:51,311 INFO L112 eAbstractionObserver]: Analyzing ICFG mix053_tso.oepc.i [2023-11-19 07:50:51,331 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:50:51,332 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-19 07:50:51,332 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 07:50:51,431 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:50:51,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 149 transitions, 314 flow [2023-11-19 07:50:51,596 INFO L124 PetriNetUnfolderBase]: 4/145 cut-off events. [2023-11-19 07:50:51,596 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:50:51,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 145 events. 4/145 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 123 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 106. Up to 2 conditions per place. [2023-11-19 07:50:51,605 INFO L82 GeneralOperation]: Start removeDead. Operand has 158 places, 149 transitions, 314 flow [2023-11-19 07:50:51,613 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 154 places, 145 transitions, 302 flow [2023-11-19 07:50:51,619 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:50:51,642 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 145 transitions, 302 flow [2023-11-19 07:50:51,645 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 154 places, 145 transitions, 302 flow [2023-11-19 07:50:51,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 145 transitions, 302 flow [2023-11-19 07:50:51,681 INFO L124 PetriNetUnfolderBase]: 4/145 cut-off events. [2023-11-19 07:50:51,682 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:50:51,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 145 events. 4/145 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 122 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 106. Up to 2 conditions per place. [2023-11-19 07:50:51,690 INFO L119 LiptonReduction]: Number of co-enabled transitions 4044 [2023-11-19 07:50:57,836 INFO L134 LiptonReduction]: Checked pairs total: 8982 [2023-11-19 07:50:57,836 INFO L136 LiptonReduction]: Total number of compositions: 150 [2023-11-19 07:50:57,863 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:50:57,870 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;@59dcedf9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:50:57,871 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-19 07:50:57,873 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:50:57,874 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-11-19 07:50:57,874 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:50:57,874 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:50:57,875 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-19 07:50:57,876 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:50:57,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:50:57,887 INFO L85 PathProgramCache]: Analyzing trace with hash 646, now seen corresponding path program 1 times [2023-11-19 07:50:57,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:50:57,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587722152] [2023-11-19 07:50:57,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:50:57,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:50:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:50:58,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:50:58,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:50:58,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587722152] [2023-11-19 07:50:58,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587722152] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:50:58,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:50:58,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-19 07:50:58,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608648556] [2023-11-19 07:50:58,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:50:58,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:50:58,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:50:58,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:50:58,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:50:58,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 299 [2023-11-19 07:50:58,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 90 flow. Second operand has 2 states, 2 states have (on average 133.5) internal successors, (267), 2 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:50:58,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:50:58,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 299 [2023-11-19 07:50:58,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:50:59,933 INFO L124 PetriNetUnfolderBase]: 6935/9460 cut-off events. [2023-11-19 07:50:59,934 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2023-11-19 07:50:59,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19044 conditions, 9460 events. 6935/9460 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 47895 event pairs, 6935 based on Foata normal form. 0/8244 useless extension candidates. Maximal degree in co-relation 19032. Up to 9377 conditions per place. [2023-11-19 07:51:00,038 INFO L140 encePairwiseOnDemand]: 290/299 looper letters, 27 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2023-11-19 07:51:00,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 126 flow [2023-11-19 07:51:00,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:51:00,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-19 07:51:00,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 302 transitions. [2023-11-19 07:51:00,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5050167224080268 [2023-11-19 07:51:00,061 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 302 transitions. [2023-11-19 07:51:00,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 302 transitions. [2023-11-19 07:51:00,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:51:00,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 302 transitions. [2023-11-19 07:51:00,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 151.0) internal successors, (302), 2 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:00,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 299.0) internal successors, (897), 3 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:00,081 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 299.0) internal successors, (897), 3 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:00,084 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 90 flow. Second operand 2 states and 302 transitions. [2023-11-19 07:51:00,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 126 flow [2023-11-19 07:51:00,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 122 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-19 07:51:00,095 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 68 flow [2023-11-19 07:51:00,097 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-11-19 07:51:00,102 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -11 predicate places. [2023-11-19 07:51:00,103 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 68 flow [2023-11-19 07:51:00,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 133.5) internal successors, (267), 2 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:00,104 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:51:00,104 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:51:00,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:51:00,104 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:51:00,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:51:00,115 INFO L85 PathProgramCache]: Analyzing trace with hash -300769940, now seen corresponding path program 1 times [2023-11-19 07:51:00,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:51:00,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029488318] [2023-11-19 07:51:00,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:51:00,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:51:00,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:51:00,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:51:00,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:51:00,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029488318] [2023-11-19 07:51:00,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029488318] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:51:00,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:51:00,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:51:00,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163243539] [2023-11-19 07:51:00,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:51:00,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:51:00,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:51:00,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:51:00,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:51:00,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 299 [2023-11-19 07:51:00,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:00,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:51:00,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 299 [2023-11-19 07:51:00,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:51:02,024 INFO L124 PetriNetUnfolderBase]: 5463/7704 cut-off events. [2023-11-19 07:51:02,025 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:51:02,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15301 conditions, 7704 events. 5463/7704 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 40404 event pairs, 1495 based on Foata normal form. 0/7172 useless extension candidates. Maximal degree in co-relation 15298. Up to 5857 conditions per place. [2023-11-19 07:51:02,109 INFO L140 encePairwiseOnDemand]: 296/299 looper letters, 39 selfloop transitions, 2 changer transitions 2/46 dead transitions. [2023-11-19 07:51:02,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 46 transitions, 188 flow [2023-11-19 07:51:02,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:51:02,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:51:02,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 440 transitions. [2023-11-19 07:51:02,115 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49052396878483834 [2023-11-19 07:51:02,115 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 440 transitions. [2023-11-19 07:51:02,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 440 transitions. [2023-11-19 07:51:02,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:51:02,116 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 440 transitions. [2023-11-19 07:51:02,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:02,126 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 299.0) internal successors, (1196), 4 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:02,130 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 299.0) internal successors, (1196), 4 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:02,131 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 68 flow. Second operand 3 states and 440 transitions. [2023-11-19 07:51:02,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 46 transitions, 188 flow [2023-11-19 07:51:02,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 46 transitions, 188 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 07:51:02,135 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 68 flow [2023-11-19 07:51:02,136 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2023-11-19 07:51:02,138 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2023-11-19 07:51:02,138 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 68 flow [2023-11-19 07:51:02,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:02,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:51:02,148 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:51:02,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:51:02,149 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:51:02,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:51:02,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1365805778, now seen corresponding path program 1 times [2023-11-19 07:51:02,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:51:02,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975014730] [2023-11-19 07:51:02,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:51:02,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:51:02,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:51:03,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:51:03,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:51:03,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975014730] [2023-11-19 07:51:03,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975014730] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:51:03,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:51:03,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:51:03,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276623978] [2023-11-19 07:51:03,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:51:03,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:51:03,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:51:03,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:51:03,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:51:03,476 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 299 [2023-11-19 07:51:03,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 68 flow. Second operand has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:03,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:51:03,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 299 [2023-11-19 07:51:03,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:51:04,521 INFO L124 PetriNetUnfolderBase]: 3927/5460 cut-off events. [2023-11-19 07:51:04,521 INFO L125 PetriNetUnfolderBase]: For 336/336 co-relation queries the response was YES. [2023-11-19 07:51:04,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11363 conditions, 5460 events. 3927/5460 cut-off events. For 336/336 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 26831 event pairs, 768 based on Foata normal form. 0/5396 useless extension candidates. Maximal degree in co-relation 11359. Up to 5136 conditions per place. [2023-11-19 07:51:04,554 INFO L140 encePairwiseOnDemand]: 294/299 looper letters, 38 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2023-11-19 07:51:04,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 45 transitions, 188 flow [2023-11-19 07:51:04,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:51:04,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:51:04,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 721 transitions. [2023-11-19 07:51:04,558 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4018952062430323 [2023-11-19 07:51:04,559 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 721 transitions. [2023-11-19 07:51:04,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 721 transitions. [2023-11-19 07:51:04,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:51:04,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 721 transitions. [2023-11-19 07:51:04,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 120.16666666666667) internal successors, (721), 6 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:04,567 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 299.0) internal successors, (2093), 7 states have internal predecessors, (2093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:04,569 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 299.0) internal successors, (2093), 7 states have internal predecessors, (2093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:04,569 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 68 flow. Second operand 6 states and 721 transitions. [2023-11-19 07:51:04,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 45 transitions, 188 flow [2023-11-19 07:51:04,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 45 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:51:04,574 INFO L231 Difference]: Finished difference. Result has 42 places, 27 transitions, 70 flow [2023-11-19 07:51:04,574 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=70, PETRI_PLACES=42, PETRI_TRANSITIONS=27} [2023-11-19 07:51:04,575 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -9 predicate places. [2023-11-19 07:51:04,576 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 27 transitions, 70 flow [2023-11-19 07:51:04,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:04,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:51:04,577 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:51:04,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:51:04,577 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:51:04,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:51:04,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1365805737, now seen corresponding path program 1 times [2023-11-19 07:51:04,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:51:04,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699456670] [2023-11-19 07:51:04,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:51:04,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:51:04,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:51:05,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:51:05,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:51:05,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699456670] [2023-11-19 07:51:05,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699456670] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:51:05,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:51:05,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:51:05,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759617065] [2023-11-19 07:51:05,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:51:05,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:51:05,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:51:05,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:51:05,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:51:05,658 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 299 [2023-11-19 07:51:05,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 27 transitions, 70 flow. Second operand has 5 states, 5 states have (on average 122.4) internal successors, (612), 5 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:05,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:51:05,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 299 [2023-11-19 07:51:05,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:51:08,007 INFO L124 PetriNetUnfolderBase]: 9643/13768 cut-off events. [2023-11-19 07:51:08,008 INFO L125 PetriNetUnfolderBase]: For 139/139 co-relation queries the response was YES. [2023-11-19 07:51:08,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27527 conditions, 13768 events. 9643/13768 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 556. Compared 78966 event pairs, 716 based on Foata normal form. 596/14364 useless extension candidates. Maximal degree in co-relation 27523. Up to 8520 conditions per place. [2023-11-19 07:51:08,098 INFO L140 encePairwiseOnDemand]: 287/299 looper letters, 52 selfloop transitions, 12 changer transitions 39/104 dead transitions. [2023-11-19 07:51:08,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 104 transitions, 450 flow [2023-11-19 07:51:08,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:51:08,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 07:51:08,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 946 transitions. [2023-11-19 07:51:08,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4519827998088868 [2023-11-19 07:51:08,104 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 946 transitions. [2023-11-19 07:51:08,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 946 transitions. [2023-11-19 07:51:08,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:51:08,105 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 946 transitions. [2023-11-19 07:51:08,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 135.14285714285714) internal successors, (946), 7 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:08,115 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 299.0) internal successors, (2392), 8 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:08,117 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 299.0) internal successors, (2392), 8 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:08,118 INFO L175 Difference]: Start difference. First operand has 42 places, 27 transitions, 70 flow. Second operand 7 states and 946 transitions. [2023-11-19 07:51:08,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 104 transitions, 450 flow [2023-11-19 07:51:08,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 104 transitions, 435 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-19 07:51:08,123 INFO L231 Difference]: Finished difference. Result has 49 places, 37 transitions, 158 flow [2023-11-19 07:51:08,123 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=158, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2023-11-19 07:51:08,125 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -2 predicate places. [2023-11-19 07:51:08,126 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 158 flow [2023-11-19 07:51:08,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.4) internal successors, (612), 5 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:08,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:51:08,127 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:51:08,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:51:08,128 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:51:08,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:51:08,129 INFO L85 PathProgramCache]: Analyzing trace with hash -609719553, now seen corresponding path program 1 times [2023-11-19 07:51:08,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:51:08,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185779288] [2023-11-19 07:51:08,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:51:08,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:51:08,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:51:08,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:51:08,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:51:08,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185779288] [2023-11-19 07:51:08,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185779288] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:51:08,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:51:08,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:51:08,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023934200] [2023-11-19 07:51:08,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:51:08,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:51:08,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:51:08,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:51:08,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:51:08,729 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 299 [2023-11-19 07:51:08,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 158 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-19 07:51:08,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:51:08,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 299 [2023-11-19 07:51:08,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:51:10,378 INFO L124 PetriNetUnfolderBase]: 7627/11010 cut-off events. [2023-11-19 07:51:10,379 INFO L125 PetriNetUnfolderBase]: For 9286/9302 co-relation queries the response was YES. [2023-11-19 07:51:10,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33181 conditions, 11010 events. 7627/11010 cut-off events. For 9286/9302 co-relation queries the response was YES. Maximal size of possible extension queue 493. Compared 62631 event pairs, 1692 based on Foata normal form. 500/11370 useless extension candidates. Maximal degree in co-relation 33172. Up to 7606 conditions per place. [2023-11-19 07:51:10,492 INFO L140 encePairwiseOnDemand]: 295/299 looper letters, 48 selfloop transitions, 3 changer transitions 28/84 dead transitions. [2023-11-19 07:51:10,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 84 transitions, 503 flow [2023-11-19 07:51:10,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:51:10,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:51:10,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 711 transitions. [2023-11-19 07:51:10,497 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47558528428093644 [2023-11-19 07:51:10,497 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 711 transitions. [2023-11-19 07:51:10,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 711 transitions. [2023-11-19 07:51:10,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:51:10,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 711 transitions. [2023-11-19 07:51:10,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 142.2) internal successors, (711), 5 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:10,508 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 299.0) internal successors, (1794), 6 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:10,509 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 299.0) internal successors, (1794), 6 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:10,510 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 158 flow. Second operand 5 states and 711 transitions. [2023-11-19 07:51:10,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 84 transitions, 503 flow [2023-11-19 07:51:10,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 84 transitions, 499 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-19 07:51:10,639 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 169 flow [2023-11-19 07:51:10,639 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=169, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2023-11-19 07:51:10,642 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 0 predicate places. [2023-11-19 07:51:10,643 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 169 flow [2023-11-19 07:51:10,643 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-19 07:51:10,644 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:51:10,644 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:51:10,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:51:10,645 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:51:10,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:51:10,645 INFO L85 PathProgramCache]: Analyzing trace with hash 25087796, now seen corresponding path program 1 times [2023-11-19 07:51:10,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:51:10,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117792588] [2023-11-19 07:51:10,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:51:10,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:51:10,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:51:11,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:51:11,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:51:11,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117792588] [2023-11-19 07:51:11,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117792588] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:51:11,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:51:11,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:51:11,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879552204] [2023-11-19 07:51:11,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:51:11,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:51:11,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:51:11,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:51:11,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:51:11,747 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 299 [2023-11-19 07:51:11,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 169 flow. Second operand has 6 states, 6 states have (on average 130.33333333333334) internal successors, (782), 6 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:11,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:51:11,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 299 [2023-11-19 07:51:11,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:51:14,305 INFO L124 PetriNetUnfolderBase]: 10999/15762 cut-off events. [2023-11-19 07:51:14,306 INFO L125 PetriNetUnfolderBase]: For 14607/14727 co-relation queries the response was YES. [2023-11-19 07:51:14,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47433 conditions, 15762 events. 10999/15762 cut-off events. For 14607/14727 co-relation queries the response was YES. Maximal size of possible extension queue 657. Compared 89677 event pairs, 2439 based on Foata normal form. 700/16258 useless extension candidates. Maximal degree in co-relation 47422. Up to 8849 conditions per place. [2023-11-19 07:51:14,471 INFO L140 encePairwiseOnDemand]: 292/299 looper letters, 66 selfloop transitions, 9 changer transitions 30/109 dead transitions. [2023-11-19 07:51:14,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 109 transitions, 662 flow [2023-11-19 07:51:14,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:51:14,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:51:14,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 848 transitions. [2023-11-19 07:51:14,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47268673355629875 [2023-11-19 07:51:14,476 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 848 transitions. [2023-11-19 07:51:14,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 848 transitions. [2023-11-19 07:51:14,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:51:14,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 848 transitions. [2023-11-19 07:51:14,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 141.33333333333334) internal successors, (848), 6 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:14,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 299.0) internal successors, (2093), 7 states have internal predecessors, (2093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:14,487 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 299.0) internal successors, (2093), 7 states have internal predecessors, (2093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:14,487 INFO L175 Difference]: Start difference. First operand has 51 places, 37 transitions, 169 flow. Second operand 6 states and 848 transitions. [2023-11-19 07:51:14,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 109 transitions, 662 flow [2023-11-19 07:51:14,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 109 transitions, 652 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-11-19 07:51:14,673 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 248 flow [2023-11-19 07:51:14,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=248, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2023-11-19 07:51:14,677 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 2 predicate places. [2023-11-19 07:51:14,681 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 248 flow [2023-11-19 07:51:14,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 130.33333333333334) internal successors, (782), 6 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:14,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:51:14,682 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:51:14,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:51:14,683 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:51:14,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:51:14,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1629854023, now seen corresponding path program 1 times [2023-11-19 07:51:14,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:51:14,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741267399] [2023-11-19 07:51:14,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:51:14,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:51:14,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:51:15,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:51:15,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:51:15,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741267399] [2023-11-19 07:51:15,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741267399] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:51:15,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:51:15,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:51:15,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057842487] [2023-11-19 07:51:15,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:51:15,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:51:15,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:51:15,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:51:15,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:51:15,941 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 299 [2023-11-19 07:51:15,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 248 flow. Second operand has 8 states, 8 states have (on average 128.0) internal successors, (1024), 8 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:15,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:51:15,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 299 [2023-11-19 07:51:15,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:51:18,418 INFO L124 PetriNetUnfolderBase]: 12099/17318 cut-off events. [2023-11-19 07:51:18,419 INFO L125 PetriNetUnfolderBase]: For 25769/26169 co-relation queries the response was YES. [2023-11-19 07:51:18,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59460 conditions, 17318 events. 12099/17318 cut-off events. For 25769/26169 co-relation queries the response was YES. Maximal size of possible extension queue 735. Compared 101008 event pairs, 2142 based on Foata normal form. 308/17342 useless extension candidates. Maximal degree in co-relation 59448. Up to 9384 conditions per place. [2023-11-19 07:51:18,553 INFO L140 encePairwiseOnDemand]: 290/299 looper letters, 89 selfloop transitions, 26 changer transitions 22/141 dead transitions. [2023-11-19 07:51:18,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 141 transitions, 1006 flow [2023-11-19 07:51:18,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:51:18,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-19 07:51:18,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1110 transitions. [2023-11-19 07:51:18,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46404682274247494 [2023-11-19 07:51:18,563 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1110 transitions. [2023-11-19 07:51:18,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1110 transitions. [2023-11-19 07:51:18,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:51:18,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1110 transitions. [2023-11-19 07:51:18,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 138.75) internal successors, (1110), 8 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:18,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 299.0) internal successors, (2691), 9 states have internal predecessors, (2691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:18,576 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 299.0) internal successors, (2691), 9 states have internal predecessors, (2691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:18,576 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 248 flow. Second operand 8 states and 1110 transitions. [2023-11-19 07:51:18,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 141 transitions, 1006 flow [2023-11-19 07:51:18,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 141 transitions, 986 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-11-19 07:51:18,638 INFO L231 Difference]: Finished difference. Result has 61 places, 60 transitions, 487 flow [2023-11-19 07:51:18,638 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=487, PETRI_PLACES=61, PETRI_TRANSITIONS=60} [2023-11-19 07:51:18,639 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 10 predicate places. [2023-11-19 07:51:18,639 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 60 transitions, 487 flow [2023-11-19 07:51:18,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 128.0) internal successors, (1024), 8 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:18,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:51:18,640 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:51:18,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:51:18,641 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:51:18,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:51:18,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1401215563, now seen corresponding path program 2 times [2023-11-19 07:51:18,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:51:18,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606892736] [2023-11-19 07:51:18,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:51:18,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:51:18,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:51:19,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:51:19,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:51:19,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606892736] [2023-11-19 07:51:19,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606892736] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:51:19,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:51:19,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:51:19,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126594706] [2023-11-19 07:51:19,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:51:19,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:51:19,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:51:19,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:51:19,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:51:20,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 299 [2023-11-19 07:51:20,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 60 transitions, 487 flow. Second operand has 8 states, 8 states have (on average 127.0) internal successors, (1016), 8 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:20,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:51:20,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 299 [2023-11-19 07:51:20,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:51:23,274 INFO L124 PetriNetUnfolderBase]: 11911/17134 cut-off events. [2023-11-19 07:51:23,274 INFO L125 PetriNetUnfolderBase]: For 47453/47881 co-relation queries the response was YES. [2023-11-19 07:51:23,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67395 conditions, 17134 events. 11911/17134 cut-off events. For 47453/47881 co-relation queries the response was YES. Maximal size of possible extension queue 710. Compared 99869 event pairs, 2280 based on Foata normal form. 332/17191 useless extension candidates. Maximal degree in co-relation 67378. Up to 10304 conditions per place. [2023-11-19 07:51:23,470 INFO L140 encePairwiseOnDemand]: 290/299 looper letters, 118 selfloop transitions, 39 changer transitions 22/183 dead transitions. [2023-11-19 07:51:23,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 183 transitions, 1671 flow [2023-11-19 07:51:23,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 07:51:23,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-19 07:51:23,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1234 transitions. [2023-11-19 07:51:23,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4585655890003716 [2023-11-19 07:51:23,478 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1234 transitions. [2023-11-19 07:51:23,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1234 transitions. [2023-11-19 07:51:23,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:51:23,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1234 transitions. [2023-11-19 07:51:23,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 137.11111111111111) internal successors, (1234), 9 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:23,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 299.0) internal successors, (2990), 10 states have internal predecessors, (2990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:23,494 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 299.0) internal successors, (2990), 10 states have internal predecessors, (2990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:23,494 INFO L175 Difference]: Start difference. First operand has 61 places, 60 transitions, 487 flow. Second operand 9 states and 1234 transitions. [2023-11-19 07:51:23,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 183 transitions, 1671 flow [2023-11-19 07:51:23,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 183 transitions, 1592 flow, removed 26 selfloop flow, removed 3 redundant places. [2023-11-19 07:51:23,745 INFO L231 Difference]: Finished difference. Result has 69 places, 91 transitions, 951 flow [2023-11-19 07:51:23,745 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=951, PETRI_PLACES=69, PETRI_TRANSITIONS=91} [2023-11-19 07:51:23,746 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 18 predicate places. [2023-11-19 07:51:23,748 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 91 transitions, 951 flow [2023-11-19 07:51:23,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 127.0) internal successors, (1016), 8 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:23,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:51:23,750 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:51:23,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:51:23,751 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:51:23,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:51:23,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1663396331, now seen corresponding path program 1 times [2023-11-19 07:51:23,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:51:23,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643377182] [2023-11-19 07:51:23,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:51:23,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:51:23,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:51:23,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:51:23,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:51:23,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643377182] [2023-11-19 07:51:23,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643377182] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:51:23,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:51:23,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:51:23,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432719386] [2023-11-19 07:51:23,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:51:23,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:51:23,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:51:23,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:51:23,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:51:24,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 299 [2023-11-19 07:51:24,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 91 transitions, 951 flow. Second operand has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:24,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:51:24,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 299 [2023-11-19 07:51:24,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:51:26,156 INFO L124 PetriNetUnfolderBase]: 9803/14390 cut-off events. [2023-11-19 07:51:26,156 INFO L125 PetriNetUnfolderBase]: For 84336/86412 co-relation queries the response was YES. [2023-11-19 07:51:26,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64500 conditions, 14390 events. 9803/14390 cut-off events. For 84336/86412 co-relation queries the response was YES. Maximal size of possible extension queue 791. Compared 89104 event pairs, 1741 based on Foata normal form. 1316/15235 useless extension candidates. Maximal degree in co-relation 64480. Up to 9380 conditions per place. [2023-11-19 07:51:26,302 INFO L140 encePairwiseOnDemand]: 292/299 looper letters, 258 selfloop transitions, 10 changer transitions 12/287 dead transitions. [2023-11-19 07:51:26,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 287 transitions, 3779 flow [2023-11-19 07:51:26,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:51:26,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:51:26,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 699 transitions. [2023-11-19 07:51:26,310 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46755852842809364 [2023-11-19 07:51:26,310 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 699 transitions. [2023-11-19 07:51:26,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 699 transitions. [2023-11-19 07:51:26,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:51:26,312 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 699 transitions. [2023-11-19 07:51:26,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.8) internal successors, (699), 5 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:26,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 299.0) internal successors, (1794), 6 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:26,322 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 299.0) internal successors, (1794), 6 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:26,322 INFO L175 Difference]: Start difference. First operand has 69 places, 91 transitions, 951 flow. Second operand 5 states and 699 transitions. [2023-11-19 07:51:26,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 287 transitions, 3779 flow [2023-11-19 07:51:26,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 287 transitions, 3515 flow, removed 132 selfloop flow, removed 2 redundant places. [2023-11-19 07:51:26,499 INFO L231 Difference]: Finished difference. Result has 72 places, 100 transitions, 974 flow [2023-11-19 07:51:26,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=879, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=974, PETRI_PLACES=72, PETRI_TRANSITIONS=100} [2023-11-19 07:51:26,501 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 21 predicate places. [2023-11-19 07:51:26,501 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 100 transitions, 974 flow [2023-11-19 07:51:26,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:26,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:51:26,502 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:51:26,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:51:26,503 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:51:26,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:51:26,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1880456753, now seen corresponding path program 1 times [2023-11-19 07:51:26,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:51:26,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098671207] [2023-11-19 07:51:26,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:51:26,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:51:26,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:51:26,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:51:26,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:51:26,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098671207] [2023-11-19 07:51:26,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098671207] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:51:26,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:51:26,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:51:26,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650862327] [2023-11-19 07:51:26,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:51:26,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:51:26,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:51:26,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:51:26,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:51:26,726 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 299 [2023-11-19 07:51:26,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 100 transitions, 974 flow. Second operand has 5 states, 5 states have (on average 129.2) internal successors, (646), 5 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:26,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:51:26,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 299 [2023-11-19 07:51:26,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:51:28,683 INFO L124 PetriNetUnfolderBase]: 7615/11517 cut-off events. [2023-11-19 07:51:28,683 INFO L125 PetriNetUnfolderBase]: For 74999/77239 co-relation queries the response was YES. [2023-11-19 07:51:28,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58172 conditions, 11517 events. 7615/11517 cut-off events. For 74999/77239 co-relation queries the response was YES. Maximal size of possible extension queue 662. Compared 73159 event pairs, 681 based on Foata normal form. 997/12148 useless extension candidates. Maximal degree in co-relation 58150. Up to 4808 conditions per place. [2023-11-19 07:51:28,774 INFO L140 encePairwiseOnDemand]: 292/299 looper letters, 335 selfloop transitions, 19 changer transitions 24/385 dead transitions. [2023-11-19 07:51:28,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 385 transitions, 4822 flow [2023-11-19 07:51:28,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:51:28,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 07:51:28,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 980 transitions. [2023-11-19 07:51:28,779 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4682274247491639 [2023-11-19 07:51:28,780 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 980 transitions. [2023-11-19 07:51:28,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 980 transitions. [2023-11-19 07:51:28,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:51:28,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 980 transitions. [2023-11-19 07:51:28,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:28,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 299.0) internal successors, (2392), 8 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:28,792 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 299.0) internal successors, (2392), 8 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:28,792 INFO L175 Difference]: Start difference. First operand has 72 places, 100 transitions, 974 flow. Second operand 7 states and 980 transitions. [2023-11-19 07:51:28,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 385 transitions, 4822 flow [2023-11-19 07:51:28,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 385 transitions, 4763 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:51:28,960 INFO L231 Difference]: Finished difference. Result has 79 places, 107 transitions, 1089 flow [2023-11-19 07:51:28,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=935, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1089, PETRI_PLACES=79, PETRI_TRANSITIONS=107} [2023-11-19 07:51:28,962 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 28 predicate places. [2023-11-19 07:51:28,962 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 107 transitions, 1089 flow [2023-11-19 07:51:28,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 129.2) internal successors, (646), 5 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:28,963 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:51:28,963 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:51:28,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:51:28,963 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:51:28,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:51:28,964 INFO L85 PathProgramCache]: Analyzing trace with hash -2124605815, now seen corresponding path program 1 times [2023-11-19 07:51:28,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:51:28,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117508134] [2023-11-19 07:51:28,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:51:28,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:51:28,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:51:29,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:51:29,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:51:29,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117508134] [2023-11-19 07:51:29,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117508134] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:51:29,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:51:29,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:51:29,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248234153] [2023-11-19 07:51:29,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:51:29,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:51:29,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:51:29,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:51:29,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:51:29,188 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 299 [2023-11-19 07:51:29,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 107 transitions, 1089 flow. Second operand has 4 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:29,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:51:29,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 299 [2023-11-19 07:51:29,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:51:30,490 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([441] L767-->L774: Formula: (let ((.cse4 (not (= (mod v_~y$w_buff0_used~0_125 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_22 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd2~0_20 256) 0)))) (let ((.cse1 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_117 256) 0)))) (.cse0 (and .cse5 (not (= 0 (mod v_~y$w_buff0_used~0_126 256))))) (.cse2 (and .cse5 .cse4))) (and (= v_~y~0_79 (ite .cse0 v_~y$w_buff0~0_55 (ite .cse1 v_~y$w_buff1~0_50 v_~y~0_80))) (= v_~y$w_buff1_used~0_116 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_117)) (= v_~y$w_buff0_used~0_125 (ite .cse0 0 v_~y$w_buff0_used~0_126)) (= v_~y$r_buff0_thd2~0_21 (ite .cse2 0 v_~y$r_buff0_thd2~0_22)) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_116 256) 0))) (and .cse4 (not (= (mod v_~y$r_buff0_thd2~0_21 256) 0)))) 0 v_~y$r_buff1_thd2~0_20) v_~y$r_buff1_thd2~0_19)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_126, ~y$w_buff1~0=v_~y$w_buff1~0_50, ~y$w_buff0~0=v_~y$w_buff0~0_55, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_22, ~y~0=v_~y~0_80, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_117} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_125, ~y$w_buff1~0=v_~y$w_buff1~0_50, ~y$w_buff0~0=v_~y$w_buff0~0_55, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ~y~0=v_~y~0_79, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_116} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][79], [161#true, Black: 259#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 192#(and (= ~y$w_buff1~0 0) (not (= 2 ~y~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= ~y$w_buff0~0 0)), Black: 258#(= ~__unbuffered_cnt~0 0), Black: 261#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 84#L797true, Black: 205#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0))), Black: 274#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 210#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 270#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 236#true, 39#L754true, P0Thread1of1ForFork2InUse, 22#L848-3true, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, 281#(= ~x~0 1), Black: 220#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (= ~y~0 1)), Black: 224#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (<= 0 ~y$w_buff1_used~0) (or (= ~y~0 0) (= ~y~0 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y$w_buff0~0 0)), Black: 221#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), 269#(<= ~__unbuffered_cnt~0 1), 53#L774true, 36#P3EXITtrue, 173#(and (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1435~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1435~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1436~0#1.base| 0) |ULTIMATE.start_main_~#t1434~0#1.base| 0) |ULTIMATE.start_main_~#t1435~0#1.base| 0) |ULTIMATE.start_main_~#t1433~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1436~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1436~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1436~0#1.base| |ULTIMATE.start_main_~#t1435~0#1.base|))), 175#true, Black: 183#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 177#(<= ~x~0 0), Black: 247#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 240#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (not (= 2 ~y~0)) (not (= 2 ~y$w_buff1~0)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0)), Black: 178#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))), Black: 239#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (= ~y$w_buff0~0 0) (= ~y~0 1))]) [2023-11-19 07:51:30,490 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-11-19 07:51:30,491 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-19 07:51:30,491 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-19 07:51:30,491 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-19 07:51:30,780 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([441] L767-->L774: Formula: (let ((.cse4 (not (= (mod v_~y$w_buff0_used~0_125 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_22 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd2~0_20 256) 0)))) (let ((.cse1 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_117 256) 0)))) (.cse0 (and .cse5 (not (= 0 (mod v_~y$w_buff0_used~0_126 256))))) (.cse2 (and .cse5 .cse4))) (and (= v_~y~0_79 (ite .cse0 v_~y$w_buff0~0_55 (ite .cse1 v_~y$w_buff1~0_50 v_~y~0_80))) (= v_~y$w_buff1_used~0_116 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_117)) (= v_~y$w_buff0_used~0_125 (ite .cse0 0 v_~y$w_buff0_used~0_126)) (= v_~y$r_buff0_thd2~0_21 (ite .cse2 0 v_~y$r_buff0_thd2~0_22)) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_116 256) 0))) (and .cse4 (not (= (mod v_~y$r_buff0_thd2~0_21 256) 0)))) 0 v_~y$r_buff1_thd2~0_20) v_~y$r_buff1_thd2~0_19)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_126, ~y$w_buff1~0=v_~y$w_buff1~0_50, ~y$w_buff0~0=v_~y$w_buff0~0_55, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_22, ~y~0=v_~y~0_80, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_117} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_125, ~y$w_buff1~0=v_~y$w_buff1~0_50, ~y$w_buff0~0=v_~y$w_buff0~0_55, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ~y~0=v_~y~0_79, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_116} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][79], [161#true, Black: 259#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 192#(and (= ~y$w_buff1~0 0) (not (= 2 ~y~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= ~y$w_buff0~0 0)), Black: 258#(= ~__unbuffered_cnt~0 0), Black: 261#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 274#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 84#L797true, Black: 205#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0))), Black: 269#(<= ~__unbuffered_cnt~0 1), 15#L852true, Black: 210#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 270#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 236#true, 39#L754true, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, 281#(= ~x~0 1), Black: 220#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (= ~y~0 1)), Black: 224#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (<= 0 ~y$w_buff1_used~0) (or (= ~y~0 0) (= ~y~0 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y$w_buff0~0 0)), Black: 221#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), 53#L774true, 36#P3EXITtrue, 173#(and (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1435~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1435~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1436~0#1.base| 0) |ULTIMATE.start_main_~#t1434~0#1.base| 0) |ULTIMATE.start_main_~#t1435~0#1.base| 0) |ULTIMATE.start_main_~#t1433~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1436~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1436~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1436~0#1.base| |ULTIMATE.start_main_~#t1435~0#1.base|))), 175#true, Black: 183#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 177#(<= ~x~0 0), Black: 247#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 240#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (not (= 2 ~y~0)) (not (= 2 ~y$w_buff1~0)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0)), Black: 178#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))), Black: 239#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (= ~y$w_buff0~0 0) (= ~y~0 1))]) [2023-11-19 07:51:30,780 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-19 07:51:30,781 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-19 07:51:30,781 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-19 07:51:30,781 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-19 07:51:30,811 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([441] L767-->L774: Formula: (let ((.cse4 (not (= (mod v_~y$w_buff0_used~0_125 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_22 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd2~0_20 256) 0)))) (let ((.cse1 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_117 256) 0)))) (.cse0 (and .cse5 (not (= 0 (mod v_~y$w_buff0_used~0_126 256))))) (.cse2 (and .cse5 .cse4))) (and (= v_~y~0_79 (ite .cse0 v_~y$w_buff0~0_55 (ite .cse1 v_~y$w_buff1~0_50 v_~y~0_80))) (= v_~y$w_buff1_used~0_116 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_117)) (= v_~y$w_buff0_used~0_125 (ite .cse0 0 v_~y$w_buff0_used~0_126)) (= v_~y$r_buff0_thd2~0_21 (ite .cse2 0 v_~y$r_buff0_thd2~0_22)) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_116 256) 0))) (and .cse4 (not (= (mod v_~y$r_buff0_thd2~0_21 256) 0)))) 0 v_~y$r_buff1_thd2~0_20) v_~y$r_buff1_thd2~0_19)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_126, ~y$w_buff1~0=v_~y$w_buff1~0_50, ~y$w_buff0~0=v_~y$w_buff0~0_55, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_22, ~y~0=v_~y~0_80, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_117} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_125, ~y$w_buff1~0=v_~y$w_buff1~0_50, ~y$w_buff0~0=v_~y$w_buff0~0_55, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_21, ~y~0=v_~y~0_79, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_116} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][79], [161#true, Black: 192#(and (= ~y$w_buff1~0 0) (not (= 2 ~y~0)) (<= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (<= 0 ~y$r_buff1_thd0~0) (= ~y$w_buff0~0 0)), Black: 258#(= ~__unbuffered_cnt~0 0), 274#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 261#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 259#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 84#L797true, Black: 269#(<= ~__unbuffered_cnt~0 1), Black: 205#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0))), 15#L852true, Black: 210#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y~0)) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 270#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 236#true, 39#L754true, P0Thread1of1ForFork2InUse, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, 281#(= ~x~0 1), Black: 220#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (= ~y~0 1)), Black: 224#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (<= 0 ~y$w_buff1_used~0) (or (= ~y~0 0) (= ~y~0 1)) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y$w_buff0~0 0)), Black: 221#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), 53#L774true, 36#P3EXITtrue, 173#(and (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1435~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1435~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t1436~0#1.base| 0) |ULTIMATE.start_main_~#t1434~0#1.base| 0) |ULTIMATE.start_main_~#t1435~0#1.base| 0) |ULTIMATE.start_main_~#t1433~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1436~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1433~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1436~0#1.base| |ULTIMATE.start_main_~#t1434~0#1.base|)) (not (= |ULTIMATE.start_main_~#t1436~0#1.base| |ULTIMATE.start_main_~#t1435~0#1.base|))), 175#true, Black: 183#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 177#(<= ~x~0 0), Black: 247#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 240#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (not (= 2 ~y~0)) (not (= 2 ~y$w_buff1~0)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0)), Black: 178#(and (or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p3_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= ~__unbuffered_p3_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))), Black: 239#(and (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (= ~y$r_buff0_thd0~0 0) (<= 0 ~y$r_buff0_thd2~0) (= ~y$w_buff0~0 0) (= ~y~0 1))]) [2023-11-19 07:51:30,811 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-19 07:51:30,812 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-19 07:51:30,812 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-19 07:51:30,812 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-19 07:51:31,774 INFO L124 PetriNetUnfolderBase]: 9554/14766 cut-off events. [2023-11-19 07:51:31,775 INFO L125 PetriNetUnfolderBase]: For 99623/101671 co-relation queries the response was YES. [2023-11-19 07:51:31,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82629 conditions, 14766 events. 9554/14766 cut-off events. For 99623/101671 co-relation queries the response was YES. Maximal size of possible extension queue 859. Compared 101540 event pairs, 2808 based on Foata normal form. 344/14552 useless extension candidates. Maximal degree in co-relation 82605. Up to 7145 conditions per place. [2023-11-19 07:51:31,884 INFO L140 encePairwiseOnDemand]: 295/299 looper letters, 106 selfloop transitions, 4 changer transitions 70/187 dead transitions. [2023-11-19 07:51:31,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 187 transitions, 2265 flow [2023-11-19 07:51:31,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:51:31,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:51:31,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 703 transitions. [2023-11-19 07:51:31,889 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47023411371237456 [2023-11-19 07:51:31,889 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 703 transitions. [2023-11-19 07:51:31,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 703 transitions. [2023-11-19 07:51:31,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:51:31,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 703 transitions. [2023-11-19 07:51:31,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 140.6) internal successors, (703), 5 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:31,898 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 299.0) internal successors, (1794), 6 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:31,899 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 299.0) internal successors, (1794), 6 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:31,899 INFO L175 Difference]: Start difference. First operand has 79 places, 107 transitions, 1089 flow. Second operand 5 states and 703 transitions. [2023-11-19 07:51:31,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 187 transitions, 2265 flow [2023-11-19 07:51:33,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 187 transitions, 2167 flow, removed 34 selfloop flow, removed 3 redundant places. [2023-11-19 07:51:33,130 INFO L231 Difference]: Finished difference. Result has 83 places, 84 transitions, 794 flow [2023-11-19 07:51:33,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=1039, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=794, PETRI_PLACES=83, PETRI_TRANSITIONS=84} [2023-11-19 07:51:33,131 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 32 predicate places. [2023-11-19 07:51:33,131 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 84 transitions, 794 flow [2023-11-19 07:51:33,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:33,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:51:33,132 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-19 07:51:33,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:51:33,133 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:51:33,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:51:33,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1390863431, now seen corresponding path program 1 times [2023-11-19 07:51:33,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:51:33,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412043969] [2023-11-19 07:51:33,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:51:33,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:51:33,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:51:33,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:51:33,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:51:33,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412043969] [2023-11-19 07:51:33,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412043969] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:51:33,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:51:33,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:51:33,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186937713] [2023-11-19 07:51:33,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:51:33,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:51:33,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:51:33,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:51:33,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:51:33,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 299 [2023-11-19 07:51:33,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 84 transitions, 794 flow. Second operand has 6 states, 6 states have (on average 129.16666666666666) internal successors, (775), 6 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:33,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:51:33,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 299 [2023-11-19 07:51:33,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand