./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix005_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f52a9e0c-105e-4c02-bc1c-0c04661b0312/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f52a9e0c-105e-4c02-bc1c-0c04661b0312/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_f52a9e0c-105e-4c02-bc1c-0c04661b0312/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f52a9e0c-105e-4c02-bc1c-0c04661b0312/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix005_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f52a9e0c-105e-4c02-bc1c-0c04661b0312/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_f52a9e0c-105e-4c02-bc1c-0c04661b0312/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 2272010dc8e07b1cac46beb8b69d58bd905467d4d1bd6fb11b2eb1922da454c5 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 08:03:26,332 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 08:03:26,410 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f52a9e0c-105e-4c02-bc1c-0c04661b0312/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-19 08:03:26,417 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 08:03:26,418 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 08:03:26,447 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 08:03:26,448 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 08:03:26,448 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 08:03:26,449 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 08:03:26,450 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 08:03:26,451 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 08:03:26,452 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 08:03:26,452 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 08:03:26,453 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 08:03:26,454 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 08:03:26,455 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 08:03:26,455 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 08:03:26,456 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 08:03:26,457 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 08:03:26,458 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 08:03:26,458 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 08:03:26,459 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 08:03:26,460 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 08:03:26,461 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 08:03:26,461 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 08:03:26,462 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 08:03:26,463 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 08:03:26,463 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 08:03:26,464 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 08:03:26,465 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:03:26,465 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 08:03:26,466 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 08:03:26,466 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 08:03:26,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 08:03:26,467 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 08:03:26,467 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 08:03:26,467 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 08:03:26,491 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 08:03:26,492 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_f52a9e0c-105e-4c02-bc1c-0c04661b0312/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_f52a9e0c-105e-4c02-bc1c-0c04661b0312/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 -> 2272010dc8e07b1cac46beb8b69d58bd905467d4d1bd6fb11b2eb1922da454c5 [2023-11-19 08:03:26,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 08:03:26,861 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 08:03:26,864 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 08:03:26,866 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 08:03:26,867 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 08:03:26,868 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f52a9e0c-105e-4c02-bc1c-0c04661b0312/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/mix005_power.oepc_pso.oepc_rmo.oepc.i [2023-11-19 08:03:30,093 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 08:03:30,501 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 08:03:30,502 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f52a9e0c-105e-4c02-bc1c-0c04661b0312/sv-benchmarks/c/pthread-wmm/mix005_power.oepc_pso.oepc_rmo.oepc.i [2023-11-19 08:03:30,527 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f52a9e0c-105e-4c02-bc1c-0c04661b0312/bin/uautomizer-verify-uCwYo4JHxu/data/f509c5e1e/5bd6196949004cdb9cc0abd43ea2db21/FLAG5ff5307d0 [2023-11-19 08:03:30,556 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f52a9e0c-105e-4c02-bc1c-0c04661b0312/bin/uautomizer-verify-uCwYo4JHxu/data/f509c5e1e/5bd6196949004cdb9cc0abd43ea2db21 [2023-11-19 08:03:30,558 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 08:03:30,560 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 08:03:30,561 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 08:03:30,561 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 08:03:30,575 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 08:03:30,577 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:03:30" (1/1) ... [2023-11-19 08:03:30,578 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bdf01e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:30, skipping insertion in model container [2023-11-19 08:03:30,578 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:03:30" (1/1) ... [2023-11-19 08:03:30,637 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 08:03:31,161 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:03:31,184 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 08:03:31,276 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:03:31,320 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 08:03:31,320 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 08:03:31,329 INFO L206 MainTranslator]: Completed translation [2023-11-19 08:03:31,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:31 WrapperNode [2023-11-19 08:03:31,330 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 08:03:31,332 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 08:03:31,332 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 08:03:31,332 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 08:03:31,341 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:31" (1/1) ... [2023-11-19 08:03:31,383 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:31" (1/1) ... [2023-11-19 08:03:31,437 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 151 [2023-11-19 08:03:31,438 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 08:03:31,439 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 08:03:31,439 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 08:03:31,439 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 08:03:31,452 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:31" (1/1) ... [2023-11-19 08:03:31,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:31" (1/1) ... [2023-11-19 08:03:31,466 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:31" (1/1) ... [2023-11-19 08:03:31,466 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:31" (1/1) ... [2023-11-19 08:03:31,479 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:31" (1/1) ... [2023-11-19 08:03:31,481 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:31" (1/1) ... [2023-11-19 08:03:31,484 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:31" (1/1) ... [2023-11-19 08:03:31,487 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:31" (1/1) ... [2023-11-19 08:03:31,508 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 08:03:31,509 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 08:03:31,509 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 08:03:31,509 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 08:03:31,510 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:31" (1/1) ... [2023-11-19 08:03:31,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:03:31,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f52a9e0c-105e-4c02-bc1c-0c04661b0312/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:03:31,582 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f52a9e0c-105e-4c02-bc1c-0c04661b0312/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 08:03:31,669 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f52a9e0c-105e-4c02-bc1c-0c04661b0312/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 08:03:31,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 08:03:31,701 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 08:03:31,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 08:03:31,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 08:03:31,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 08:03:31,702 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 08:03:31,702 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 08:03:31,702 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 08:03:31,703 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 08:03:31,703 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-19 08:03:31,703 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-19 08:03:31,703 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-19 08:03:31,703 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-19 08:03:31,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 08:03:31,704 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 08:03:31,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 08:03:31,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 08:03:31,709 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 08:03:31,974 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 08:03:31,978 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 08:03:32,512 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 08:03:32,650 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 08:03:32,650 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 08:03:32,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:03:32 BoogieIcfgContainer [2023-11-19 08:03:32,655 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 08:03:32,659 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 08:03:32,659 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 08:03:32,663 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 08:03:32,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:03:30" (1/3) ... [2023-11-19 08:03:32,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d07c2d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:03:32, skipping insertion in model container [2023-11-19 08:03:32,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:03:31" (2/3) ... [2023-11-19 08:03:32,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d07c2d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:03:32, skipping insertion in model container [2023-11-19 08:03:32,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:03:32" (3/3) ... [2023-11-19 08:03:32,667 INFO L112 eAbstractionObserver]: Analyzing ICFG mix005_power.oepc_pso.oepc_rmo.oepc.i [2023-11-19 08:03:32,685 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 08:03:32,686 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-19 08:03:32,686 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 08:03:32,786 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 08:03:32,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 154 transitions, 324 flow [2023-11-19 08:03:32,911 INFO L124 PetriNetUnfolderBase]: 4/150 cut-off events. [2023-11-19 08:03:32,912 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:03:32,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 150 events. 4/150 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 124 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 108. Up to 2 conditions per place. [2023-11-19 08:03:32,923 INFO L82 GeneralOperation]: Start removeDead. Operand has 163 places, 154 transitions, 324 flow [2023-11-19 08:03:32,930 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 159 places, 150 transitions, 312 flow [2023-11-19 08:03:32,934 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 08:03:32,944 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 150 transitions, 312 flow [2023-11-19 08:03:32,947 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 150 transitions, 312 flow [2023-11-19 08:03:32,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 150 transitions, 312 flow [2023-11-19 08:03:33,039 INFO L124 PetriNetUnfolderBase]: 4/150 cut-off events. [2023-11-19 08:03:33,040 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:03:33,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 150 events. 4/150 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 124 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 108. Up to 2 conditions per place. [2023-11-19 08:03:33,046 INFO L119 LiptonReduction]: Number of co-enabled transitions 4400 [2023-11-19 08:03:39,460 INFO L134 LiptonReduction]: Checked pairs total: 11255 [2023-11-19 08:03:39,460 INFO L136 LiptonReduction]: Total number of compositions: 153 [2023-11-19 08:03:39,496 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 08:03:39,508 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;@7c51c269, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 08:03:39,509 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-19 08:03:39,511 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 08:03:39,511 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-19 08:03:39,512 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:03:39,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:03:39,513 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-19 08:03:39,514 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 08:03:39,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:39,523 INFO L85 PathProgramCache]: Analyzing trace with hash 669, now seen corresponding path program 1 times [2023-11-19 08:03:39,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:39,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661687971] [2023-11-19 08:03:39,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:39,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:39,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:39,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:03:39,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:03:39,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661687971] [2023-11-19 08:03:39,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661687971] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:03:39,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:03:39,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-19 08:03:39,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174132373] [2023-11-19 08:03:39,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:03:39,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 08:03:39,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:03:39,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 08:03:39,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 08:03:39,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 307 [2023-11-19 08:03:39,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 92 flow. Second operand has 2 states, 2 states have (on average 137.5) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:39,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:03:39,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 307 [2023-11-19 08:03:39,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:03:41,906 INFO L124 PetriNetUnfolderBase]: 7479/10215 cut-off events. [2023-11-19 08:03:41,906 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2023-11-19 08:03:41,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20523 conditions, 10215 events. 7479/10215 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 54149 event pairs, 7479 based on Foata normal form. 0/8767 useless extension candidates. Maximal degree in co-relation 20511. Up to 10091 conditions per place. [2023-11-19 08:03:42,015 INFO L140 encePairwiseOnDemand]: 299/307 looper letters, 27 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2023-11-19 08:03:42,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 130 flow [2023-11-19 08:03:42,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 08:03:42,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-19 08:03:42,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 309 transitions. [2023-11-19 08:03:42,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.503257328990228 [2023-11-19 08:03:42,033 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 309 transitions. [2023-11-19 08:03:42,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 309 transitions. [2023-11-19 08:03:42,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:03:42,039 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 309 transitions. [2023-11-19 08:03:42,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 154.5) internal successors, (309), 2 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:42,051 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 307.0) internal successors, (921), 3 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:42,052 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 307.0) internal successors, (921), 3 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:42,054 INFO L175 Difference]: Start difference. First operand has 53 places, 40 transitions, 92 flow. Second operand 2 states and 309 transitions. [2023-11-19 08:03:42,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 130 flow [2023-11-19 08:03:42,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 126 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-19 08:03:42,063 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 72 flow [2023-11-19 08:03:42,066 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2023-11-19 08:03:42,070 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2023-11-19 08:03:42,070 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 72 flow [2023-11-19 08:03:42,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 137.5) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:42,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:03:42,071 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-19 08:03:42,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 08:03:42,072 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 08:03:42,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:42,072 INFO L85 PathProgramCache]: Analyzing trace with hash 656444, now seen corresponding path program 1 times [2023-11-19 08:03:42,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:42,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229675282] [2023-11-19 08:03:42,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:42,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:42,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:42,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:03:42,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:03:42,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229675282] [2023-11-19 08:03:42,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229675282] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:03:42,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:03:42,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 08:03:42,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528583950] [2023-11-19 08:03:42,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:03:42,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:03:42,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:03:42,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:03:42,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:03:42,520 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 307 [2023-11-19 08:03:42,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:42,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:03:42,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 307 [2023-11-19 08:03:42,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:03:44,054 INFO L124 PetriNetUnfolderBase]: 5879/8515 cut-off events. [2023-11-19 08:03:44,054 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:03:44,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16656 conditions, 8515 events. 5879/8515 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 53001 event pairs, 1079 based on Foata normal form. 0/7845 useless extension candidates. Maximal degree in co-relation 16653. Up to 6367 conditions per place. [2023-11-19 08:03:44,125 INFO L140 encePairwiseOnDemand]: 304/307 looper letters, 43 selfloop transitions, 2 changer transitions 2/52 dead transitions. [2023-11-19 08:03:44,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 52 transitions, 212 flow [2023-11-19 08:03:44,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:03:44,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:03:44,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 456 transitions. [2023-11-19 08:03:44,131 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.495114006514658 [2023-11-19 08:03:44,131 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 456 transitions. [2023-11-19 08:03:44,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 456 transitions. [2023-11-19 08:03:44,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:03:44,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 456 transitions. [2023-11-19 08:03:44,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:44,139 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:44,141 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:44,141 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 72 flow. Second operand 3 states and 456 transitions. [2023-11-19 08:03:44,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 52 transitions, 212 flow [2023-11-19 08:03:44,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 52 transitions, 212 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 08:03:44,143 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 72 flow [2023-11-19 08:03:44,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2023-11-19 08:03:44,145 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2023-11-19 08:03:44,145 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 72 flow [2023-11-19 08:03:44,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:44,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:03:44,146 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:03:44,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 08:03:44,147 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 08:03:44,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:44,148 INFO L85 PathProgramCache]: Analyzing trace with hash 259095629, now seen corresponding path program 1 times [2023-11-19 08:03:44,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:44,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725592264] [2023-11-19 08:03:44,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:44,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:44,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:44,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:03:44,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:03:44,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725592264] [2023-11-19 08:03:44,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725592264] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:03:44,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:03:44,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 08:03:44,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138177630] [2023-11-19 08:03:44,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:03:44,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:03:44,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:03:44,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:03:44,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:03:44,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 307 [2023-11-19 08:03:44,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:44,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:03:44,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 307 [2023-11-19 08:03:44,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:03:49,435 INFO L124 PetriNetUnfolderBase]: 23007/31032 cut-off events. [2023-11-19 08:03:49,436 INFO L125 PetriNetUnfolderBase]: For 1143/1143 co-relation queries the response was YES. [2023-11-19 08:03:49,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63767 conditions, 31032 events. 23007/31032 cut-off events. For 1143/1143 co-relation queries the response was YES. Maximal size of possible extension queue 928. Compared 167351 event pairs, 8535 based on Foata normal form. 0/30152 useless extension candidates. Maximal degree in co-relation 63763. Up to 20521 conditions per place. [2023-11-19 08:03:49,623 INFO L140 encePairwiseOnDemand]: 297/307 looper letters, 46 selfloop transitions, 9 changer transitions 0/55 dead transitions. [2023-11-19 08:03:49,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 55 transitions, 238 flow [2023-11-19 08:03:49,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:03:49,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:03:49,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2023-11-19 08:03:49,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46796959826275786 [2023-11-19 08:03:49,627 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 431 transitions. [2023-11-19 08:03:49,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 431 transitions. [2023-11-19 08:03:49,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:03:49,628 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 431 transitions. [2023-11-19 08:03:49,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:49,633 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:49,634 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:49,635 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 72 flow. Second operand 3 states and 431 transitions. [2023-11-19 08:03:49,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 55 transitions, 238 flow [2023-11-19 08:03:49,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 55 transitions, 232 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 08:03:49,638 INFO L231 Difference]: Finished difference. Result has 44 places, 38 transitions, 138 flow [2023-11-19 08:03:49,638 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2023-11-19 08:03:49,640 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -9 predicate places. [2023-11-19 08:03:49,640 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 138 flow [2023-11-19 08:03:49,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:49,641 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:03:49,641 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:03:49,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 08:03:49,648 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 08:03:49,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:49,649 INFO L85 PathProgramCache]: Analyzing trace with hash 259095639, now seen corresponding path program 1 times [2023-11-19 08:03:49,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:49,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283274008] [2023-11-19 08:03:49,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:49,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:49,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:50,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:03:50,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:03:50,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283274008] [2023-11-19 08:03:50,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283274008] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:03:50,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:03:50,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 08:03:50,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616378840] [2023-11-19 08:03:50,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:03:50,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:03:50,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:03:50,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:03:50,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:03:50,689 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 307 [2023-11-19 08:03:50,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 138 flow. Second operand has 6 states, 6 states have (on average 120.83333333333333) internal successors, (725), 6 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:50,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:03:50,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 307 [2023-11-19 08:03:50,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:03:53,907 INFO L124 PetriNetUnfolderBase]: 14986/21427 cut-off events. [2023-11-19 08:03:53,907 INFO L125 PetriNetUnfolderBase]: For 8556/8788 co-relation queries the response was YES. [2023-11-19 08:03:53,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51482 conditions, 21427 events. 14986/21427 cut-off events. For 8556/8788 co-relation queries the response was YES. Maximal size of possible extension queue 862. Compared 129886 event pairs, 3179 based on Foata normal form. 702/21521 useless extension candidates. Maximal degree in co-relation 51477. Up to 14661 conditions per place. [2023-11-19 08:03:54,071 INFO L140 encePairwiseOnDemand]: 300/307 looper letters, 56 selfloop transitions, 8 changer transitions 0/72 dead transitions. [2023-11-19 08:03:54,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 72 transitions, 362 flow [2023-11-19 08:03:54,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 08:03:54,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 08:03:54,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 773 transitions. [2023-11-19 08:03:54,081 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4196525515743757 [2023-11-19 08:03:54,081 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 773 transitions. [2023-11-19 08:03:54,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 773 transitions. [2023-11-19 08:03:54,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:03:54,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 773 transitions. [2023-11-19 08:03:54,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.83333333333334) internal successors, (773), 6 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:54,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 307.0) internal successors, (2149), 7 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:54,094 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 307.0) internal successors, (2149), 7 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:54,094 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 138 flow. Second operand 6 states and 773 transitions. [2023-11-19 08:03:54,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 72 transitions, 362 flow [2023-11-19 08:03:54,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 72 transitions, 334 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 08:03:54,284 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 161 flow [2023-11-19 08:03:54,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=161, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2023-11-19 08:03:54,286 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -4 predicate places. [2023-11-19 08:03:54,287 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 161 flow [2023-11-19 08:03:54,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.83333333333333) internal successors, (725), 6 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:54,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:03:54,288 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:03:54,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 08:03:54,289 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 08:03:54,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:54,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1854656971, now seen corresponding path program 1 times [2023-11-19 08:03:54,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:54,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925700234] [2023-11-19 08:03:54,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:54,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:55,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:03:55,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:03:55,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925700234] [2023-11-19 08:03:55,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925700234] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:03:55,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:03:55,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 08:03:55,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839503428] [2023-11-19 08:03:55,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:03:55,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:03:55,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:03:55,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:03:55,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:03:55,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 307 [2023-11-19 08:03:55,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 161 flow. Second operand has 6 states, 6 states have (on average 121.0) internal successors, (726), 6 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:55,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:03:55,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 307 [2023-11-19 08:03:55,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:03:58,203 INFO L124 PetriNetUnfolderBase]: 13876/19590 cut-off events. [2023-11-19 08:03:58,203 INFO L125 PetriNetUnfolderBase]: For 5029/5218 co-relation queries the response was YES. [2023-11-19 08:03:58,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45536 conditions, 19590 events. 13876/19590 cut-off events. For 5029/5218 co-relation queries the response was YES. Maximal size of possible extension queue 702. Compared 113059 event pairs, 2576 based on Foata normal form. 353/18992 useless extension candidates. Maximal degree in co-relation 45529. Up to 13234 conditions per place. [2023-11-19 08:03:58,321 INFO L140 encePairwiseOnDemand]: 300/307 looper letters, 55 selfloop transitions, 7 changer transitions 0/72 dead transitions. [2023-11-19 08:03:58,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 72 transitions, 357 flow [2023-11-19 08:03:58,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 08:03:58,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 08:03:58,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 771 transitions. [2023-11-19 08:03:58,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4185667752442997 [2023-11-19 08:03:58,326 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 771 transitions. [2023-11-19 08:03:58,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 771 transitions. [2023-11-19 08:03:58,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:03:58,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 771 transitions. [2023-11-19 08:03:58,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.5) internal successors, (771), 6 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:58,334 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 307.0) internal successors, (2149), 7 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:58,336 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 307.0) internal successors, (2149), 7 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:58,337 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 161 flow. Second operand 6 states and 771 transitions. [2023-11-19 08:03:58,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 72 transitions, 357 flow [2023-11-19 08:03:58,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 72 transitions, 348 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-19 08:03:58,340 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 176 flow [2023-11-19 08:03:58,340 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=176, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2023-11-19 08:03:58,343 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -1 predicate places. [2023-11-19 08:03:58,343 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 176 flow [2023-11-19 08:03:58,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.0) internal successors, (726), 6 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:58,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:03:58,344 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:03:58,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 08:03:58,344 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 08:03:58,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:03:58,345 INFO L85 PathProgramCache]: Analyzing trace with hash -515459317, now seen corresponding path program 1 times [2023-11-19 08:03:58,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:03:58,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346822551] [2023-11-19 08:03:58,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:03:58,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:03:58,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:03:59,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:03:59,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:03:59,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346822551] [2023-11-19 08:03:59,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346822551] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:03:59,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:03:59,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 08:03:59,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574748651] [2023-11-19 08:03:59,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:03:59,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:03:59,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:03:59,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:03:59,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:03:59,321 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 307 [2023-11-19 08:03:59,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 176 flow. Second operand has 6 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:03:59,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:03:59,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 307 [2023-11-19 08:03:59,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:01,827 INFO L124 PetriNetUnfolderBase]: 11317/16018 cut-off events. [2023-11-19 08:04:01,828 INFO L125 PetriNetUnfolderBase]: For 7512/7925 co-relation queries the response was YES. [2023-11-19 08:04:01,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37246 conditions, 16018 events. 11317/16018 cut-off events. For 7512/7925 co-relation queries the response was YES. Maximal size of possible extension queue 741. Compared 93236 event pairs, 4523 based on Foata normal form. 287/15406 useless extension candidates. Maximal degree in co-relation 37238. Up to 14423 conditions per place. [2023-11-19 08:04:01,986 INFO L140 encePairwiseOnDemand]: 302/307 looper letters, 41 selfloop transitions, 5 changer transitions 0/58 dead transitions. [2023-11-19 08:04:01,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 58 transitions, 296 flow [2023-11-19 08:04:01,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 08:04:01,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 08:04:01,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 745 transitions. [2023-11-19 08:04:01,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40445168295331163 [2023-11-19 08:04:01,992 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 745 transitions. [2023-11-19 08:04:01,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 745 transitions. [2023-11-19 08:04:01,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:01,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 745 transitions. [2023-11-19 08:04:01,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.16666666666667) internal successors, (745), 6 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:02,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 307.0) internal successors, (2149), 7 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:02,003 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 307.0) internal successors, (2149), 7 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:02,003 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 176 flow. Second operand 6 states and 745 transitions. [2023-11-19 08:04:02,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 58 transitions, 296 flow [2023-11-19 08:04:02,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 58 transitions, 282 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-19 08:04:02,012 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 156 flow [2023-11-19 08:04:02,012 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=156, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2023-11-19 08:04:02,015 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -2 predicate places. [2023-11-19 08:04:02,016 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 156 flow [2023-11-19 08:04:02,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:02,017 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:02,017 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:02,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 08:04:02,017 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 08:04:02,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:02,018 INFO L85 PathProgramCache]: Analyzing trace with hash 226852631, now seen corresponding path program 1 times [2023-11-19 08:04:02,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:02,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537540167] [2023-11-19 08:04:02,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:02,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:02,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:04:02,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:02,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537540167] [2023-11-19 08:04:02,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537540167] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:02,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:02,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:04:02,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647935656] [2023-11-19 08:04:02,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:02,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 08:04:02,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:02,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 08:04:02,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 08:04:02,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 307 [2023-11-19 08:04:02,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 156 flow. Second operand has 4 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:02,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:02,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 307 [2023-11-19 08:04:02,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:04,616 INFO L124 PetriNetUnfolderBase]: 9627/14297 cut-off events. [2023-11-19 08:04:04,616 INFO L125 PetriNetUnfolderBase]: For 4169/4385 co-relation queries the response was YES. [2023-11-19 08:04:04,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32707 conditions, 14297 events. 9627/14297 cut-off events. For 4169/4385 co-relation queries the response was YES. Maximal size of possible extension queue 693. Compared 92185 event pairs, 2004 based on Foata normal form. 1099/14687 useless extension candidates. Maximal degree in co-relation 32699. Up to 5762 conditions per place. [2023-11-19 08:04:04,714 INFO L140 encePairwiseOnDemand]: 300/307 looper letters, 59 selfloop transitions, 6 changer transitions 0/77 dead transitions. [2023-11-19 08:04:04,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 77 transitions, 402 flow [2023-11-19 08:04:04,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 08:04:04,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 08:04:04,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 579 transitions. [2023-11-19 08:04:04,718 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4714983713355049 [2023-11-19 08:04:04,718 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 579 transitions. [2023-11-19 08:04:04,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 579 transitions. [2023-11-19 08:04:04,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:04,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 579 transitions. [2023-11-19 08:04:04,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:04,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 307.0) internal successors, (1535), 5 states have internal predecessors, (1535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:04,727 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 307.0) internal successors, (1535), 5 states have internal predecessors, (1535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:04,727 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 156 flow. Second operand 4 states and 579 transitions. [2023-11-19 08:04:04,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 77 transitions, 402 flow [2023-11-19 08:04:04,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 77 transitions, 388 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-19 08:04:04,733 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 194 flow [2023-11-19 08:04:04,733 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=194, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2023-11-19 08:04:04,734 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -1 predicate places. [2023-11-19 08:04:04,735 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 194 flow [2023-11-19 08:04:04,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:04,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:04,736 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:04,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 08:04:04,736 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 08:04:04,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:04,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1266034410, now seen corresponding path program 1 times [2023-11-19 08:04:04,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:04,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252956729] [2023-11-19 08:04:04,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:04,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:04,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:04,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:04:04,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:04,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252956729] [2023-11-19 08:04:04,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252956729] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:04,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:04,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 08:04:05,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303369611] [2023-11-19 08:04:05,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:05,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:04:05,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:05,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:04:05,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:04:05,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 307 [2023-11-19 08:04:05,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:05,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:05,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 307 [2023-11-19 08:04:05,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:06,440 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([475] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse7 (not .cse4)) (.cse10 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse4)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse4 .cse9))) (let ((.cse0 (or .cse10 .cse11 .cse6)) (.cse1 (and .cse7 (not .cse11))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$flush_delayed~0_25 0) (= v_~a$w_buff0_used~0_149 (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~a$r_buff0_thd4~0_62 (ite (and .cse7 (not .cse5)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse8 .cse9) (and .cse3 .cse8) .cse5)) v_~a$r_buff1_thd4~0_60 0))) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse10 .cse5 .cse6) v_~a$w_buff1_used~0_133 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][48], [120#L881true, P3Thread1of1ForFork3InUse, 201#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), P0Thread1of1ForFork0InUse, Black: 193#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), P2Thread1of1ForFork1InUse, 166#true, 134#P0EXITtrue, 155#L795true, Black: 175#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), 34#L808true, Black: 208#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 98#L847true, Black: 183#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|))), 206#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 184#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), P1Thread1of1ForFork2InUse, 212#true]) [2023-11-19 08:04:06,441 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-19 08:04:06,441 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 08:04:06,441 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 08:04:06,441 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-19 08:04:06,759 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([475] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse7 (not .cse4)) (.cse10 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse4)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse4 .cse9))) (let ((.cse0 (or .cse10 .cse11 .cse6)) (.cse1 (and .cse7 (not .cse11))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$flush_delayed~0_25 0) (= v_~a$w_buff0_used~0_149 (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~a$r_buff0_thd4~0_62 (ite (and .cse7 (not .cse5)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse8 .cse9) (and .cse3 .cse8) .cse5)) v_~a$r_buff1_thd4~0_60 0))) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse10 .cse5 .cse6) v_~a$w_buff1_used~0_133 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][48], [120#L881true, P3Thread1of1ForFork3InUse, 201#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), P0Thread1of1ForFork0InUse, Black: 193#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), P2Thread1of1ForFork1InUse, 166#true, 134#P0EXITtrue, 34#L808true, Black: 175#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 208#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 183#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|))), 206#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 103#P1EXITtrue, 98#L847true, Black: 184#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), P1Thread1of1ForFork2InUse, 212#true]) [2023-11-19 08:04:06,759 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-19 08:04:06,760 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 08:04:06,760 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 08:04:06,760 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 08:04:06,762 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([475] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse7 (not .cse4)) (.cse10 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse4)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse4 .cse9))) (let ((.cse0 (or .cse10 .cse11 .cse6)) (.cse1 (and .cse7 (not .cse11))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$flush_delayed~0_25 0) (= v_~a$w_buff0_used~0_149 (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~a$r_buff0_thd4~0_62 (ite (and .cse7 (not .cse5)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse8 .cse9) (and .cse3 .cse8) .cse5)) v_~a$r_buff1_thd4~0_60 0))) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse10 .cse5 .cse6) v_~a$w_buff1_used~0_133 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][48], [120#L881true, P3Thread1of1ForFork3InUse, 201#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), P0Thread1of1ForFork0InUse, Black: 193#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), P2Thread1of1ForFork1InUse, 166#true, 134#P0EXITtrue, 155#L795true, Black: 175#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 208#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 15#L811true, 98#L847true, Black: 183#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|))), 206#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 184#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), P1Thread1of1ForFork2InUse, 212#true]) [2023-11-19 08:04:06,762 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-19 08:04:06,762 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 08:04:06,762 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 08:04:06,762 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-19 08:04:07,151 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([475] L831-->L847: Formula: (let ((.cse9 (= (mod v_~a$r_buff1_thd4~0_60 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_62 256) 0))) (let ((.cse7 (not .cse4)) (.cse10 (and (= (mod v_~a$w_buff1_used~0_133 256) 0) .cse4)) (.cse11 (= (mod v_~a$w_buff0_used~0_150 256) 0)) (.cse6 (and .cse4 .cse9))) (let ((.cse0 (or .cse10 .cse11 .cse6)) (.cse1 (and .cse7 (not .cse11))) (.cse3 (= (mod v_~a$w_buff1_used~0_132 256) 0)) (.cse2 (not (= (mod v_~weak$$choice2~0_32 256) 0))) (.cse5 (= (mod v_~a$w_buff0_used~0_149 256) 0))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= (ite .cse0 v_~a~0_93 (ite .cse1 v_~a$w_buff0~0_61 v_~a$w_buff1~0_64)) v_~__unbuffered_p3_EBX~0_10) (= v_~a$flush_delayed~0_25 0) (= v_~a$w_buff0_used~0_149 (ite .cse2 v_~a$w_buff0_used~0_150 (ite .cse0 v_~a$w_buff0_used~0_150 (ite .cse1 0 v_~a$w_buff0_used~0_150)))) (= v_~a~0_93 v_~a$mem_tmp~0_18) (= v_~a$r_buff0_thd4~0_61 (ite .cse2 v_~a$r_buff0_thd4~0_62 (ite (or (and .cse3 .cse4) .cse5 .cse6) v_~a$r_buff0_thd4~0_62 (ite (and .cse7 (not .cse5)) 0 v_~a$r_buff0_thd4~0_62)))) (= v_~a$w_buff1~0_64 v_~a$w_buff1~0_63) (= v_~a$r_buff1_thd4~0_59 (ite .cse2 v_~a$r_buff1_thd4~0_60 (ite (let ((.cse8 (= (mod v_~a$r_buff0_thd4~0_61 256) 0))) (or (and .cse8 .cse9) (and .cse3 .cse8) .cse5)) v_~a$r_buff1_thd4~0_60 0))) (= v_~a~0_92 (ite .cse2 v_~a$mem_tmp~0_18 v_~__unbuffered_p3_EBX~0_10)) (= v_~a$w_buff1_used~0_132 (ite .cse2 v_~a$w_buff1_used~0_133 (ite (or .cse10 .cse5 .cse6) v_~a$w_buff1_used~0_133 0))))))) InVars {~a~0=v_~a~0_93, ~a$w_buff1~0=v_~a$w_buff1~0_64, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_60, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_150, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_133, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_62} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_59, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_149, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_61, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~a~0=v_~a~0_92, ~a$mem_tmp~0=v_~a$mem_tmp~0_18, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~a$w_buff1~0=v_~a$w_buff1~0_63, ~a$flush_delayed~0=v_~a$flush_delayed~0_25, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_132, ~weak$$choice2~0=v_~weak$$choice2~0_32} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~nondet3, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0][48], [120#L881true, P3Thread1of1ForFork3InUse, 201#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), P0Thread1of1ForFork0InUse, Black: 193#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), P2Thread1of1ForFork1InUse, 166#true, 134#P0EXITtrue, Black: 175#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 208#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 15#L811true, Black: 183#(and (not (= (select |#valid| |ULTIMATE.start_main_~#t122~0#1.base|) 0)) (not (= 0 (select |#valid| |ULTIMATE.start_main_~#t121~0#1.base|))) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= (select |#valid| |ULTIMATE.start_main_~#t123~0#1.base|) 0)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|))), 206#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 103#P1EXITtrue, 98#L847true, Black: 184#(and (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t123~0#1.base| 0) |ULTIMATE.start_main_~#t124~0#1.base| 0) |ULTIMATE.start_main_~#t121~0#1.base| 0) |ULTIMATE.start_main_~#t122~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t124~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t121~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t123~0#1.base|)) (not (= |ULTIMATE.start_main_~#t121~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|)) (not (= |ULTIMATE.start_main_~#t122~0#1.base| |ULTIMATE.start_main_~#t124~0#1.base|))), P1Thread1of1ForFork2InUse, 212#true]) [2023-11-19 08:04:07,151 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-19 08:04:07,151 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 08:04:07,151 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 08:04:07,151 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-19 08:04:07,639 INFO L124 PetriNetUnfolderBase]: 13638/20287 cut-off events. [2023-11-19 08:04:07,640 INFO L125 PetriNetUnfolderBase]: For 11872/12320 co-relation queries the response was YES. [2023-11-19 08:04:07,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57400 conditions, 20287 events. 13638/20287 cut-off events. For 11872/12320 co-relation queries the response was YES. Maximal size of possible extension queue 920. Compared 134209 event pairs, 5441 based on Foata normal form. 289/19587 useless extension candidates. Maximal degree in co-relation 57390. Up to 10698 conditions per place. [2023-11-19 08:04:07,749 INFO L140 encePairwiseOnDemand]: 304/307 looper letters, 56 selfloop transitions, 4 changer transitions 1/71 dead transitions. [2023-11-19 08:04:07,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 71 transitions, 427 flow [2023-11-19 08:04:07,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:04:07,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:04:07,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 448 transitions. [2023-11-19 08:04:07,752 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48642779587404994 [2023-11-19 08:04:07,752 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 448 transitions. [2023-11-19 08:04:07,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 448 transitions. [2023-11-19 08:04:07,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:07,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 448 transitions. [2023-11-19 08:04:07,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:07,757 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:07,758 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:07,758 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 194 flow. Second operand 3 states and 448 transitions. [2023-11-19 08:04:07,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 71 transitions, 427 flow [2023-11-19 08:04:07,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 71 transitions, 424 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 08:04:07,766 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 218 flow [2023-11-19 08:04:07,767 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=218, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2023-11-19 08:04:07,769 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 1 predicate places. [2023-11-19 08:04:07,769 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 218 flow [2023-11-19 08:04:07,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:07,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:07,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:07,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 08:04:07,770 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 08:04:07,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:07,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1245108166, now seen corresponding path program 1 times [2023-11-19 08:04:07,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:07,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797397873] [2023-11-19 08:04:07,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:07,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:07,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:08,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:04:08,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:08,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797397873] [2023-11-19 08:04:08,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797397873] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:08,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:08,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 08:04:08,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985308703] [2023-11-19 08:04:08,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:08,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 08:04:08,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:08,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 08:04:08,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:04:08,050 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 307 [2023-11-19 08:04:08,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 218 flow. Second operand has 5 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:08,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:08,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 307 [2023-11-19 08:04:08,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:11,810 INFO L124 PetriNetUnfolderBase]: 25954/36952 cut-off events. [2023-11-19 08:04:11,811 INFO L125 PetriNetUnfolderBase]: For 32438/32438 co-relation queries the response was YES. [2023-11-19 08:04:11,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110771 conditions, 36952 events. 25954/36952 cut-off events. For 32438/32438 co-relation queries the response was YES. Maximal size of possible extension queue 1238. Compared 235194 event pairs, 1968 based on Foata normal form. 168/37120 useless extension candidates. Maximal degree in co-relation 110760. Up to 15238 conditions per place. [2023-11-19 08:04:11,980 INFO L140 encePairwiseOnDemand]: 297/307 looper letters, 100 selfloop transitions, 18 changer transitions 26/144 dead transitions. [2023-11-19 08:04:11,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 144 transitions, 939 flow [2023-11-19 08:04:11,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 08:04:11,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 08:04:11,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 845 transitions. [2023-11-19 08:04:11,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4587404994571118 [2023-11-19 08:04:11,985 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 845 transitions. [2023-11-19 08:04:11,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 845 transitions. [2023-11-19 08:04:11,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:11,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 845 transitions. [2023-11-19 08:04:11,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 140.83333333333334) internal successors, (845), 6 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:11,994 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 307.0) internal successors, (2149), 7 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:11,995 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 307.0) internal successors, (2149), 7 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:11,995 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 218 flow. Second operand 6 states and 845 transitions. [2023-11-19 08:04:11,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 144 transitions, 939 flow [2023-11-19 08:04:12,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 144 transitions, 930 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 08:04:12,021 INFO L231 Difference]: Finished difference. Result has 61 places, 55 transitions, 325 flow [2023-11-19 08:04:12,021 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=325, PETRI_PLACES=61, PETRI_TRANSITIONS=55} [2023-11-19 08:04:12,022 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 8 predicate places. [2023-11-19 08:04:12,022 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 325 flow [2023-11-19 08:04:12,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:12,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:12,023 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:12,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 08:04:12,024 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 08:04:12,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:12,024 INFO L85 PathProgramCache]: Analyzing trace with hash 265337614, now seen corresponding path program 1 times [2023-11-19 08:04:12,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:12,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119549128] [2023-11-19 08:04:12,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:12,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:12,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:12,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:04:12,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:12,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119549128] [2023-11-19 08:04:12,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119549128] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:12,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:12,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 08:04:12,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096731750] [2023-11-19 08:04:12,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:12,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 08:04:12,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:12,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 08:04:12,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 08:04:12,230 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 307 [2023-11-19 08:04:12,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 55 transitions, 325 flow. Second operand has 4 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:12,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:12,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 307 [2023-11-19 08:04:12,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:04:15,483 INFO L124 PetriNetUnfolderBase]: 18178/26158 cut-off events. [2023-11-19 08:04:15,484 INFO L125 PetriNetUnfolderBase]: For 34518/34518 co-relation queries the response was YES. [2023-11-19 08:04:15,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84279 conditions, 26158 events. 18178/26158 cut-off events. For 34518/34518 co-relation queries the response was YES. Maximal size of possible extension queue 853. Compared 158473 event pairs, 6427 based on Foata normal form. 14/26172 useless extension candidates. Maximal degree in co-relation 84265. Up to 19396 conditions per place. [2023-11-19 08:04:15,604 INFO L140 encePairwiseOnDemand]: 298/307 looper letters, 81 selfloop transitions, 21 changer transitions 2/104 dead transitions. [2023-11-19 08:04:15,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 104 transitions, 772 flow [2023-11-19 08:04:15,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 08:04:15,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 08:04:15,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 573 transitions. [2023-11-19 08:04:15,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46661237785016285 [2023-11-19 08:04:15,610 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 573 transitions. [2023-11-19 08:04:15,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 573 transitions. [2023-11-19 08:04:15,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:04:15,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 573 transitions. [2023-11-19 08:04:15,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 143.25) internal successors, (573), 4 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:15,618 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 307.0) internal successors, (1535), 5 states have internal predecessors, (1535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:15,619 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 307.0) internal successors, (1535), 5 states have internal predecessors, (1535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:15,619 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 325 flow. Second operand 4 states and 573 transitions. [2023-11-19 08:04:15,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 104 transitions, 772 flow [2023-11-19 08:04:15,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 104 transitions, 753 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-11-19 08:04:15,896 INFO L231 Difference]: Finished difference. Result has 65 places, 60 transitions, 440 flow [2023-11-19 08:04:15,897 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=440, PETRI_PLACES=65, PETRI_TRANSITIONS=60} [2023-11-19 08:04:15,897 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 12 predicate places. [2023-11-19 08:04:15,898 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 60 transitions, 440 flow [2023-11-19 08:04:15,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:15,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:04:15,898 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:15,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 08:04:15,899 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 08:04:15,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:15,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1424511320, now seen corresponding path program 2 times [2023-11-19 08:04:15,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:15,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963603249] [2023-11-19 08:04:15,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:15,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:15,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:16,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:04:16,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:16,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963603249] [2023-11-19 08:04:16,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963603249] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:16,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:16,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 08:04:16,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604470248] [2023-11-19 08:04:16,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:16,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 08:04:16,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:16,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 08:04:16,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:04:16,112 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 307 [2023-11-19 08:04:16,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 60 transitions, 440 flow. Second operand has 5 states, 5 states have (on average 133.2) internal successors, (666), 5 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:04:16,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:04:16,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 307 [2023-11-19 08:04:16,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand