./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix030_tso.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ff5df0b-d899-4b70-ac92-e04561c18e9b/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ff5df0b-d899-4b70-ac92-e04561c18e9b/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_7ff5df0b-d899-4b70-ac92-e04561c18e9b/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ff5df0b-d899-4b70-ac92-e04561c18e9b/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix030_tso.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ff5df0b-d899-4b70-ac92-e04561c18e9b/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_7ff5df0b-d899-4b70-ac92-e04561c18e9b/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 20a2c57970e5e291ffc10826c9a5fbe3296a1e55ae86cfd2b786718aae571bfa --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:50:40,436 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:50:40,562 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ff5df0b-d899-4b70-ac92-e04561c18e9b/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-19 07:50:40,574 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:50:40,575 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:50:40,636 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:50:40,637 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:50:40,638 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:50:40,639 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:50:40,646 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:50:40,647 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:50:40,648 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:50:40,648 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:50:40,651 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:50:40,651 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:50:40,652 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:50:40,653 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:50:40,653 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:50:40,654 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 07:50:40,654 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 07:50:40,655 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 07:50:40,656 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:50:40,656 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 07:50:40,657 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 07:50:40,657 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:50:40,658 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:50:40,659 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:50:40,660 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:50:40,660 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:50:40,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:50:40,663 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:50:40,663 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:50:40,664 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:50:40,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:50:40,664 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:50:40,665 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:50:40,665 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:50:40,665 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:50:40,666 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_7ff5df0b-d899-4b70-ac92-e04561c18e9b/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_7ff5df0b-d899-4b70-ac92-e04561c18e9b/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 -> 20a2c57970e5e291ffc10826c9a5fbe3296a1e55ae86cfd2b786718aae571bfa [2023-11-19 07:50:41,089 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:50:41,130 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:50:41,134 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:50:41,136 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:50:41,137 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:50:41,139 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ff5df0b-d899-4b70-ac92-e04561c18e9b/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/mix030_tso.i [2023-11-19 07:50:44,543 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:50:44,992 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:50:44,993 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ff5df0b-d899-4b70-ac92-e04561c18e9b/sv-benchmarks/c/pthread-wmm/mix030_tso.i [2023-11-19 07:50:45,015 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ff5df0b-d899-4b70-ac92-e04561c18e9b/bin/uautomizer-verify-uCwYo4JHxu/data/1d82f4844/b3a0b125a41e4492a0051f5faf4dc39a/FLAGb73c0d942 [2023-11-19 07:50:45,031 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ff5df0b-d899-4b70-ac92-e04561c18e9b/bin/uautomizer-verify-uCwYo4JHxu/data/1d82f4844/b3a0b125a41e4492a0051f5faf4dc39a [2023-11-19 07:50:45,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:50:45,036 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:50:45,038 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:50:45,038 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:50:45,045 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:50:45,046 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:50:45" (1/1) ... [2023-11-19 07:50:45,047 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20150362 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:45, skipping insertion in model container [2023-11-19 07:50:45,047 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:50:45" (1/1) ... [2023-11-19 07:50:45,103 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:50:45,709 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:50:45,723 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:50:45,797 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:50:45,836 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:50:45,836 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:50:45,846 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:50:45,846 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:45 WrapperNode [2023-11-19 07:50:45,847 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:50:45,848 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:50:45,849 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:50:45,849 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:50:45,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:45" (1/1) ... [2023-11-19 07:50:45,884 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:45" (1/1) ... [2023-11-19 07:50:45,934 INFO L138 Inliner]: procedures = 177, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 185 [2023-11-19 07:50:45,935 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:50:45,936 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:50:45,936 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:50:45,936 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:50:45,949 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:45" (1/1) ... [2023-11-19 07:50:45,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:45" (1/1) ... [2023-11-19 07:50:45,958 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:45" (1/1) ... [2023-11-19 07:50:45,958 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:45" (1/1) ... [2023-11-19 07:50:45,973 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:45" (1/1) ... [2023-11-19 07:50:45,976 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:45" (1/1) ... [2023-11-19 07:50:45,980 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:45" (1/1) ... [2023-11-19 07:50:45,983 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:45" (1/1) ... [2023-11-19 07:50:45,990 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:50:45,991 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:50:45,992 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:50:45,992 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:50:45,993 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:45" (1/1) ... [2023-11-19 07:50:46,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:50:46,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ff5df0b-d899-4b70-ac92-e04561c18e9b/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:50:46,037 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ff5df0b-d899-4b70-ac92-e04561c18e9b/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:50:46,098 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ff5df0b-d899-4b70-ac92-e04561c18e9b/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:50:46,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:50:46,120 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 07:50:46,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:50:46,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:50:46,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:50:46,121 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 07:50:46,121 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 07:50:46,122 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 07:50:46,122 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 07:50:46,122 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-19 07:50:46,122 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-19 07:50:46,123 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-19 07:50:46,123 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-19 07:50:46,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:50:46,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 07:50:46,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:50:46,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:50:46,128 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 07:50:46,319 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:50:46,321 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:50:46,747 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:50:47,027 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:50:47,028 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 07:50:47,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:50:47 BoogieIcfgContainer [2023-11-19 07:50:47,036 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:50:47,040 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:50:47,040 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:50:47,044 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:50:47,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:50:45" (1/3) ... [2023-11-19 07:50:47,045 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c26ab16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:50:47, skipping insertion in model container [2023-11-19 07:50:47,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:50:45" (2/3) ... [2023-11-19 07:50:47,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c26ab16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:50:47, skipping insertion in model container [2023-11-19 07:50:47,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:50:47" (3/3) ... [2023-11-19 07:50:47,050 INFO L112 eAbstractionObserver]: Analyzing ICFG mix030_tso.i [2023-11-19 07:50:47,070 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:50:47,071 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-19 07:50:47,072 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 07:50:47,174 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:50:47,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 149 transitions, 314 flow [2023-11-19 07:50:47,342 INFO L124 PetriNetUnfolderBase]: 3/145 cut-off events. [2023-11-19 07:50:47,342 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:50:47,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 145 events. 3/145 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 119 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 106. Up to 2 conditions per place. [2023-11-19 07:50:47,353 INFO L82 GeneralOperation]: Start removeDead. Operand has 159 places, 149 transitions, 314 flow [2023-11-19 07:50:47,360 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 155 places, 145 transitions, 302 flow [2023-11-19 07:50:47,363 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:50:47,375 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 145 transitions, 302 flow [2023-11-19 07:50:47,378 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 145 transitions, 302 flow [2023-11-19 07:50:47,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 145 transitions, 302 flow [2023-11-19 07:50:47,415 INFO L124 PetriNetUnfolderBase]: 3/145 cut-off events. [2023-11-19 07:50:47,415 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:50:47,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 145 events. 3/145 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 119 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 106. Up to 2 conditions per place. [2023-11-19 07:50:47,421 INFO L119 LiptonReduction]: Number of co-enabled transitions 4008 [2023-11-19 07:50:55,738 INFO L134 LiptonReduction]: Checked pairs total: 9971 [2023-11-19 07:50:55,739 INFO L136 LiptonReduction]: Total number of compositions: 155 [2023-11-19 07:50:55,755 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:50:55,762 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;@3f06cb31, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:50:55,763 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-19 07:50:55,764 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:50:55,765 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-19 07:50:55,765 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:50:55,765 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:50:55,766 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-19 07:50:55,766 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:50:55,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:50:55,771 INFO L85 PathProgramCache]: Analyzing trace with hash 678, now seen corresponding path program 1 times [2023-11-19 07:50:55,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:50:55,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823364755] [2023-11-19 07:50:55,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:50:55,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:50:55,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:50:55,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:50:55,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:50:55,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823364755] [2023-11-19 07:50:55,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823364755] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:50:55,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:50:55,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-19 07:50:55,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797220305] [2023-11-19 07:50:55,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:50:55,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:50:55,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:50:55,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:50:55,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:50:55,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 304 [2023-11-19 07:50:55,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 86 flow. Second operand has 2 states, 2 states have (on average 134.5) internal successors, (269), 2 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:50:55,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:50:55,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 304 [2023-11-19 07:50:55,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:50:57,934 INFO L124 PetriNetUnfolderBase]: 7063/9680 cut-off events. [2023-11-19 07:50:57,935 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-11-19 07:50:57,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19392 conditions, 9680 events. 7063/9680 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 48120 event pairs, 7063 based on Foata normal form. 0/8448 useless extension candidates. Maximal degree in co-relation 19380. Up to 9537 conditions per place. [2023-11-19 07:50:58,034 INFO L140 encePairwiseOnDemand]: 296/304 looper letters, 27 selfloop transitions, 0 changer transitions 0/29 dead transitions. [2023-11-19 07:50:58,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 29 transitions, 124 flow [2023-11-19 07:50:58,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:50:58,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-19 07:50:58,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 303 transitions. [2023-11-19 07:50:58,061 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49835526315789475 [2023-11-19 07:50:58,062 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 303 transitions. [2023-11-19 07:50:58,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 303 transitions. [2023-11-19 07:50:58,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:50:58,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 303 transitions. [2023-11-19 07:50:58,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 151.5) internal successors, (303), 2 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:50:58,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 304.0) internal successors, (912), 3 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:50:58,084 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 304.0) internal successors, (912), 3 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:50:58,086 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 86 flow. Second operand 2 states and 303 transitions. [2023-11-19 07:50:58,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 29 transitions, 124 flow [2023-11-19 07:50:58,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 29 transitions, 120 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-19 07:50:58,098 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 66 flow [2023-11-19 07:50:58,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=304, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2023-11-19 07:50:58,106 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -11 predicate places. [2023-11-19 07:50:58,106 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 66 flow [2023-11-19 07:50:58,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 134.5) internal successors, (269), 2 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:50:58,107 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:50:58,108 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:50:58,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:50:58,108 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:50:58,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:50:58,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1023877749, now seen corresponding path program 1 times [2023-11-19 07:50:58,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:50:58,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687598788] [2023-11-19 07:50:58,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:50:58,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:50:58,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:50:58,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:50:58,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:50:58,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687598788] [2023-11-19 07:50:58,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687598788] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:50:58,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:50:58,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:50:58,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261061761] [2023-11-19 07:50:58,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:50:58,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:50:58,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:50:58,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:50:58,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:50:58,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 304 [2023-11-19 07:50:58,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:50:58,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:50:58,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 304 [2023-11-19 07:50:58,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:51:00,481 INFO L124 PetriNetUnfolderBase]: 5879/8368 cut-off events. [2023-11-19 07:51:00,481 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:51:00,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16509 conditions, 8368 events. 5879/8368 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 44383 event pairs, 1143 based on Foata normal form. 0/7712 useless extension candidates. Maximal degree in co-relation 16506. Up to 6273 conditions per place. [2023-11-19 07:51:00,559 INFO L140 encePairwiseOnDemand]: 301/304 looper letters, 36 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2023-11-19 07:51:00,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 42 transitions, 172 flow [2023-11-19 07:51:00,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:51:00,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:51:00,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 440 transitions. [2023-11-19 07:51:00,564 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4824561403508772 [2023-11-19 07:51:00,564 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 440 transitions. [2023-11-19 07:51:00,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 440 transitions. [2023-11-19 07:51:00,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:51:00,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 440 transitions. [2023-11-19 07:51:00,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:00,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 304.0) internal successors, (1216), 4 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:00,577 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 304.0) internal successors, (1216), 4 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:00,578 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 66 flow. Second operand 3 states and 440 transitions. [2023-11-19 07:51:00,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 42 transitions, 172 flow [2023-11-19 07:51:00,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 42 transitions, 172 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 07:51:00,582 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 66 flow [2023-11-19 07:51:00,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=304, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2023-11-19 07:51:00,584 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -10 predicate places. [2023-11-19 07:51:00,585 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 66 flow [2023-11-19 07:51:00,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:00,592 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:51:00,592 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:51:00,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:51:00,592 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:51:00,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:51:00,596 INFO L85 PathProgramCache]: Analyzing trace with hash 399090417, now seen corresponding path program 1 times [2023-11-19 07:51:00,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:51:00,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030352637] [2023-11-19 07:51:00,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:51:00,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:51:00,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:51:01,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:51:01,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:51:01,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030352637] [2023-11-19 07:51:01,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030352637] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:51:01,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:51:01,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:51:01,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272551284] [2023-11-19 07:51:01,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:51:01,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:51:01,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:51:01,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:51:01,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:51:01,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 304 [2023-11-19 07:51:01,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 66 flow. Second operand has 6 states, 6 states have (on average 115.83333333333333) internal successors, (695), 6 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:01,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:51:01,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 304 [2023-11-19 07:51:01,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:51:03,002 INFO L124 PetriNetUnfolderBase]: 3927/5520 cut-off events. [2023-11-19 07:51:03,002 INFO L125 PetriNetUnfolderBase]: For 192/192 co-relation queries the response was YES. [2023-11-19 07:51:03,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11327 conditions, 5520 events. 3927/5520 cut-off events. For 192/192 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 26305 event pairs, 768 based on Foata normal form. 0/5456 useless extension candidates. Maximal degree in co-relation 11323. Up to 5136 conditions per place. [2023-11-19 07:51:03,032 INFO L140 encePairwiseOnDemand]: 299/304 looper letters, 38 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2023-11-19 07:51:03,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 44 transitions, 184 flow [2023-11-19 07:51:03,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:51:03,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:51:03,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 727 transitions. [2023-11-19 07:51:03,037 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3985745614035088 [2023-11-19 07:51:03,037 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 727 transitions. [2023-11-19 07:51:03,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 727 transitions. [2023-11-19 07:51:03,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:51:03,038 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 727 transitions. [2023-11-19 07:51:03,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 121.16666666666667) internal successors, (727), 6 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:03,045 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 304.0) internal successors, (2128), 7 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:03,047 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 304.0) internal successors, (2128), 7 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:03,047 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 66 flow. Second operand 6 states and 727 transitions. [2023-11-19 07:51:03,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 44 transitions, 184 flow [2023-11-19 07:51:03,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 44 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:51:03,059 INFO L231 Difference]: Finished difference. Result has 41 places, 26 transitions, 68 flow [2023-11-19 07:51:03,059 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=304, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=68, PETRI_PLACES=41, PETRI_TRANSITIONS=26} [2023-11-19 07:51:03,061 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -9 predicate places. [2023-11-19 07:51:03,061 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 26 transitions, 68 flow [2023-11-19 07:51:03,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.83333333333333) internal successors, (695), 6 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:03,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:51:03,063 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:51:03,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:51:03,068 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:51:03,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:51:03,068 INFO L85 PathProgramCache]: Analyzing trace with hash 399090395, now seen corresponding path program 1 times [2023-11-19 07:51:03,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:51:03,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480372864] [2023-11-19 07:51:03,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:51:03,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:51:03,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:51:04,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:51:04,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:51:04,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480372864] [2023-11-19 07:51:04,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480372864] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:51:04,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:51:04,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:51:04,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4666533] [2023-11-19 07:51:04,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:51:04,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:51:04,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:51:04,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:51:04,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:51:04,235 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 304 [2023-11-19 07:51:04,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 26 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:04,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:51:04,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 304 [2023-11-19 07:51:04,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:51:05,780 INFO L124 PetriNetUnfolderBase]: 7071/10136 cut-off events. [2023-11-19 07:51:05,780 INFO L125 PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES. [2023-11-19 07:51:05,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20319 conditions, 10136 events. 7071/10136 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 56697 event pairs, 511 based on Foata normal form. 312/10448 useless extension candidates. Maximal degree in co-relation 20315. Up to 6389 conditions per place. [2023-11-19 07:51:05,859 INFO L140 encePairwiseOnDemand]: 292/304 looper letters, 47 selfloop transitions, 13 changer transitions 0/61 dead transitions. [2023-11-19 07:51:05,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 61 transitions, 270 flow [2023-11-19 07:51:05,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:51:05,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:51:05,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 546 transitions. [2023-11-19 07:51:05,863 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44901315789473684 [2023-11-19 07:51:05,864 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 546 transitions. [2023-11-19 07:51:05,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 546 transitions. [2023-11-19 07:51:05,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:51:05,865 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 546 transitions. [2023-11-19 07:51:05,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 136.5) internal successors, (546), 4 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:05,871 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 304.0) internal successors, (1520), 5 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:05,872 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 304.0) internal successors, (1520), 5 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:05,873 INFO L175 Difference]: Start difference. First operand has 41 places, 26 transitions, 68 flow. Second operand 4 states and 546 transitions. [2023-11-19 07:51:05,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 61 transitions, 270 flow [2023-11-19 07:51:05,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 61 transitions, 259 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-19 07:51:05,876 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 161 flow [2023-11-19 07:51:05,877 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=304, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2023-11-19 07:51:05,879 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -7 predicate places. [2023-11-19 07:51:05,879 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 161 flow [2023-11-19 07:51:05,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:05,880 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:51:05,880 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:51:05,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:51:05,881 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:51:05,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:51:05,881 INFO L85 PathProgramCache]: Analyzing trace with hash -513101216, now seen corresponding path program 1 times [2023-11-19 07:51:05,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:51:05,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085594403] [2023-11-19 07:51:05,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:51:05,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:51:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:51:06,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:51:06,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:51:06,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085594403] [2023-11-19 07:51:06,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085594403] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:51:06,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:51:06,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:51:06,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781713823] [2023-11-19 07:51:06,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:51:06,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:51:06,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:51:06,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:51:06,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:51:07,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 304 [2023-11-19 07:51:07,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 161 flow. Second operand has 4 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:07,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:51:07,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 304 [2023-11-19 07:51:07,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:51:08,311 INFO L124 PetriNetUnfolderBase]: 6695/9336 cut-off events. [2023-11-19 07:51:08,312 INFO L125 PetriNetUnfolderBase]: For 5648/5648 co-relation queries the response was YES. [2023-11-19 07:51:08,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26864 conditions, 9336 events. 6695/9336 cut-off events. For 5648/5648 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 46468 event pairs, 1639 based on Foata normal form. 112/9440 useless extension candidates. Maximal degree in co-relation 26858. Up to 4565 conditions per place. [2023-11-19 07:51:08,395 INFO L140 encePairwiseOnDemand]: 293/304 looper letters, 51 selfloop transitions, 18 changer transitions 0/70 dead transitions. [2023-11-19 07:51:08,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 70 transitions, 425 flow [2023-11-19 07:51:08,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:51:08,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:51:08,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 535 transitions. [2023-11-19 07:51:08,399 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4399671052631579 [2023-11-19 07:51:08,399 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 535 transitions. [2023-11-19 07:51:08,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 535 transitions. [2023-11-19 07:51:08,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:51:08,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 535 transitions. [2023-11-19 07:51:08,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:08,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 304.0) internal successors, (1520), 5 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:08,407 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 304.0) internal successors, (1520), 5 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:08,407 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 161 flow. Second operand 4 states and 535 transitions. [2023-11-19 07:51:08,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 70 transitions, 425 flow [2023-11-19 07:51:08,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 70 transitions, 425 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 07:51:08,413 INFO L231 Difference]: Finished difference. Result has 49 places, 51 transitions, 329 flow [2023-11-19 07:51:08,413 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=304, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=329, PETRI_PLACES=49, PETRI_TRANSITIONS=51} [2023-11-19 07:51:08,414 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -1 predicate places. [2023-11-19 07:51:08,414 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 51 transitions, 329 flow [2023-11-19 07:51:08,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:08,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:51:08,415 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:51:08,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:51:08,416 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:51:08,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:51:08,416 INFO L85 PathProgramCache]: Analyzing trace with hash 2117373793, now seen corresponding path program 1 times [2023-11-19 07:51:08,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:51:08,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734054339] [2023-11-19 07:51:08,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:51:08,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:51:08,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:51:09,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:51:09,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:51:09,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734054339] [2023-11-19 07:51:09,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734054339] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:51:09,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:51:09,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:51:09,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775735843] [2023-11-19 07:51:09,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:51:09,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:51:09,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:51:09,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:51:09,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:51:09,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 304 [2023-11-19 07:51:09,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 51 transitions, 329 flow. Second operand has 4 states, 4 states have (on average 124.5) internal successors, (498), 4 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:09,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:51:09,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 304 [2023-11-19 07:51:09,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:51:10,546 INFO L124 PetriNetUnfolderBase]: 6645/9330 cut-off events. [2023-11-19 07:51:10,546 INFO L125 PetriNetUnfolderBase]: For 13758/13764 co-relation queries the response was YES. [2023-11-19 07:51:10,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32721 conditions, 9330 events. 6645/9330 cut-off events. For 13758/13764 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 48284 event pairs, 1019 based on Foata normal form. 24/9352 useless extension candidates. Maximal degree in co-relation 32712. Up to 5851 conditions per place. [2023-11-19 07:51:10,631 INFO L140 encePairwiseOnDemand]: 292/304 looper letters, 53 selfloop transitions, 36 changer transitions 0/90 dead transitions. [2023-11-19 07:51:10,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 90 transitions, 685 flow [2023-11-19 07:51:10,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:51:10,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:51:10,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 549 transitions. [2023-11-19 07:51:10,635 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45148026315789475 [2023-11-19 07:51:10,635 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 549 transitions. [2023-11-19 07:51:10,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 549 transitions. [2023-11-19 07:51:10,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:51:10,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 549 transitions. [2023-11-19 07:51:10,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.25) internal successors, (549), 4 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:10,640 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 304.0) internal successors, (1520), 5 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:10,641 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 304.0) internal successors, (1520), 5 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:10,641 INFO L175 Difference]: Start difference. First operand has 49 places, 51 transitions, 329 flow. Second operand 4 states and 549 transitions. [2023-11-19 07:51:10,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 90 transitions, 685 flow [2023-11-19 07:51:10,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 90 transitions, 680 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:51:10,652 INFO L231 Difference]: Finished difference. Result has 54 places, 63 transitions, 569 flow [2023-11-19 07:51:10,653 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=304, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=569, PETRI_PLACES=54, PETRI_TRANSITIONS=63} [2023-11-19 07:51:10,654 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 4 predicate places. [2023-11-19 07:51:10,654 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 63 transitions, 569 flow [2023-11-19 07:51:10,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.5) internal successors, (498), 4 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:10,654 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:51:10,655 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:51:10,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:51:10,655 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:51:10,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:51:10,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1768293959, now seen corresponding path program 1 times [2023-11-19 07:51:10,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:51:10,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849582181] [2023-11-19 07:51:10,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:51:10,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:51:10,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:51:10,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:51:10,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:51:10,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849582181] [2023-11-19 07:51:10,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849582181] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:51:10,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:51:10,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:51:10,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385518131] [2023-11-19 07:51:10,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:51:10,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:51:10,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:51:10,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:51:10,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:51:10,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 304 [2023-11-19 07:51:10,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 63 transitions, 569 flow. Second operand has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:10,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:51:10,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 304 [2023-11-19 07:51:10,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:51:12,377 INFO L124 PetriNetUnfolderBase]: 7823/11194 cut-off events. [2023-11-19 07:51:12,377 INFO L125 PetriNetUnfolderBase]: For 37854/37854 co-relation queries the response was YES. [2023-11-19 07:51:12,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45914 conditions, 11194 events. 7823/11194 cut-off events. For 37854/37854 co-relation queries the response was YES. Maximal size of possible extension queue 477. Compared 61989 event pairs, 3028 based on Foata normal form. 128/11164 useless extension candidates. Maximal degree in co-relation 45902. Up to 6194 conditions per place. [2023-11-19 07:51:12,455 INFO L140 encePairwiseOnDemand]: 301/304 looper letters, 73 selfloop transitions, 8 changer transitions 2/87 dead transitions. [2023-11-19 07:51:12,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 87 transitions, 908 flow [2023-11-19 07:51:12,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:51:12,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:51:12,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2023-11-19 07:51:12,458 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4769736842105263 [2023-11-19 07:51:12,458 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 435 transitions. [2023-11-19 07:51:12,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 435 transitions. [2023-11-19 07:51:12,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:51:12,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 435 transitions. [2023-11-19 07:51:12,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:12,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 304.0) internal successors, (1216), 4 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:12,463 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 304.0) internal successors, (1216), 4 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:12,463 INFO L175 Difference]: Start difference. First operand has 54 places, 63 transitions, 569 flow. Second operand 3 states and 435 transitions. [2023-11-19 07:51:12,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 87 transitions, 908 flow [2023-11-19 07:51:12,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 87 transitions, 906 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-11-19 07:51:12,494 INFO L231 Difference]: Finished difference. Result has 57 places, 62 transitions, 581 flow [2023-11-19 07:51:12,494 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=304, PETRI_DIFFERENCE_MINUEND_FLOW=567, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=581, PETRI_PLACES=57, PETRI_TRANSITIONS=62} [2023-11-19 07:51:12,495 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 7 predicate places. [2023-11-19 07:51:12,495 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 62 transitions, 581 flow [2023-11-19 07:51:12,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:12,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:51:12,496 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:51:12,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:51:12,496 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:51:12,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:51:12,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1488634737, now seen corresponding path program 1 times [2023-11-19 07:51:12,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:51:12,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856568654] [2023-11-19 07:51:12,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:51:12,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:51:12,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:51:12,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:51:12,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:51:12,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856568654] [2023-11-19 07:51:12,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856568654] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:51:12,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:51:12,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:51:12,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309088893] [2023-11-19 07:51:12,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:51:12,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:51:12,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:51:12,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:51:12,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:51:12,735 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 304 [2023-11-19 07:51:12,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 62 transitions, 581 flow. Second operand has 4 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:12,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:51:12,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 304 [2023-11-19 07:51:12,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:51:14,070 INFO L124 PetriNetUnfolderBase]: 6870/10167 cut-off events. [2023-11-19 07:51:14,070 INFO L125 PetriNetUnfolderBase]: For 58144/58937 co-relation queries the response was YES. [2023-11-19 07:51:14,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41835 conditions, 10167 events. 6870/10167 cut-off events. For 58144/58937 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 60231 event pairs, 1128 based on Foata normal form. 1143/11174 useless extension candidates. Maximal degree in co-relation 41821. Up to 6706 conditions per place. [2023-11-19 07:51:14,130 INFO L140 encePairwiseOnDemand]: 297/304 looper letters, 147 selfloop transitions, 9 changer transitions 34/194 dead transitions. [2023-11-19 07:51:14,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 194 transitions, 2265 flow [2023-11-19 07:51:14,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:51:14,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:51:14,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 692 transitions. [2023-11-19 07:51:14,142 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45526315789473687 [2023-11-19 07:51:14,142 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 692 transitions. [2023-11-19 07:51:14,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 692 transitions. [2023-11-19 07:51:14,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:51:14,143 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 692 transitions. [2023-11-19 07:51:14,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.4) internal successors, (692), 5 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:14,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 304.0) internal successors, (1824), 6 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:14,154 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 304.0) internal successors, (1824), 6 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:14,154 INFO L175 Difference]: Start difference. First operand has 57 places, 62 transitions, 581 flow. Second operand 5 states and 692 transitions. [2023-11-19 07:51:14,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 194 transitions, 2265 flow [2023-11-19 07:51:14,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 194 transitions, 2233 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:51:14,188 INFO L231 Difference]: Finished difference. Result has 63 places, 70 transitions, 658 flow [2023-11-19 07:51:14,188 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=304, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=658, PETRI_PLACES=63, PETRI_TRANSITIONS=70} [2023-11-19 07:51:14,192 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 13 predicate places. [2023-11-19 07:51:14,192 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 70 transitions, 658 flow [2023-11-19 07:51:14,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:14,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:51:14,193 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:51:14,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:51:14,194 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:51:14,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:51:14,194 INFO L85 PathProgramCache]: Analyzing trace with hash 911328483, now seen corresponding path program 1 times [2023-11-19 07:51:14,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:51:14,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364292027] [2023-11-19 07:51:14,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:51:14,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:51:14,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:51:15,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:51:15,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:51:15,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364292027] [2023-11-19 07:51:15,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364292027] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:51:15,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:51:15,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:51:15,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677865020] [2023-11-19 07:51:15,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:51:15,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:51:15,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:51:15,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:51:15,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:51:15,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 304 [2023-11-19 07:51:15,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 70 transitions, 658 flow. Second operand has 4 states, 4 states have (on average 125.25) internal successors, (501), 4 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:15,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:51:15,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 304 [2023-11-19 07:51:15,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:51:17,158 INFO L124 PetriNetUnfolderBase]: 8815/13205 cut-off events. [2023-11-19 07:51:17,158 INFO L125 PetriNetUnfolderBase]: For 59395/59395 co-relation queries the response was YES. [2023-11-19 07:51:17,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64881 conditions, 13205 events. 8815/13205 cut-off events. For 59395/59395 co-relation queries the response was YES. Maximal size of possible extension queue 625. Compared 81524 event pairs, 2476 based on Foata normal form. 78/13283 useless extension candidates. Maximal degree in co-relation 64864. Up to 6398 conditions per place. [2023-11-19 07:51:17,222 INFO L140 encePairwiseOnDemand]: 292/304 looper letters, 79 selfloop transitions, 28 changer transitions 23/131 dead transitions. [2023-11-19 07:51:17,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 131 transitions, 1366 flow [2023-11-19 07:51:17,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:51:17,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:51:17,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 549 transitions. [2023-11-19 07:51:17,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45148026315789475 [2023-11-19 07:51:17,226 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 549 transitions. [2023-11-19 07:51:17,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 549 transitions. [2023-11-19 07:51:17,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:51:17,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 549 transitions. [2023-11-19 07:51:17,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.25) internal successors, (549), 4 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:17,232 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 304.0) internal successors, (1520), 5 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:17,232 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 304.0) internal successors, (1520), 5 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:17,233 INFO L175 Difference]: Start difference. First operand has 63 places, 70 transitions, 658 flow. Second operand 4 states and 549 transitions. [2023-11-19 07:51:17,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 131 transitions, 1366 flow [2023-11-19 07:51:17,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 131 transitions, 1353 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:51:17,307 INFO L231 Difference]: Finished difference. Result has 68 places, 74 transitions, 870 flow [2023-11-19 07:51:17,307 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=304, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=870, PETRI_PLACES=68, PETRI_TRANSITIONS=74} [2023-11-19 07:51:17,308 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 18 predicate places. [2023-11-19 07:51:17,308 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 74 transitions, 870 flow [2023-11-19 07:51:17,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.25) internal successors, (501), 4 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:17,309 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:51:17,309 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:51:17,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:51:17,309 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:51:17,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:51:17,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1733386482, now seen corresponding path program 1 times [2023-11-19 07:51:17,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:51:17,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855188948] [2023-11-19 07:51:17,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:51:17,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:51:17,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:51:17,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:51:17,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:51:17,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855188948] [2023-11-19 07:51:17,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855188948] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:51:17,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:51:17,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:51:17,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470939952] [2023-11-19 07:51:17,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:51:17,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:51:17,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:51:17,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:51:17,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:51:17,591 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 304 [2023-11-19 07:51:17,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 74 transitions, 870 flow. Second operand has 5 states, 5 states have (on average 127.4) internal successors, (637), 5 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:17,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:51:17,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 304 [2023-11-19 07:51:17,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:51:18,715 INFO L124 PetriNetUnfolderBase]: 4276/6759 cut-off events. [2023-11-19 07:51:18,716 INFO L125 PetriNetUnfolderBase]: For 65094/66011 co-relation queries the response was YES. [2023-11-19 07:51:18,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34277 conditions, 6759 events. 4276/6759 cut-off events. For 65094/66011 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 42323 event pairs, 423 based on Foata normal form. 1092/7748 useless extension candidates. Maximal degree in co-relation 34258. Up to 3020 conditions per place. [2023-11-19 07:51:18,753 INFO L140 encePairwiseOnDemand]: 297/304 looper letters, 139 selfloop transitions, 13 changer transitions 77/234 dead transitions. [2023-11-19 07:51:18,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 234 transitions, 3296 flow [2023-11-19 07:51:18,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:51:18,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:51:18,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 833 transitions. [2023-11-19 07:51:18,759 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45668859649122806 [2023-11-19 07:51:18,759 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 833 transitions. [2023-11-19 07:51:18,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 833 transitions. [2023-11-19 07:51:18,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:51:18,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 833 transitions. [2023-11-19 07:51:18,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 138.83333333333334) internal successors, (833), 6 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:18,770 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 304.0) internal successors, (2128), 7 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:18,771 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 304.0) internal successors, (2128), 7 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:18,771 INFO L175 Difference]: Start difference. First operand has 68 places, 74 transitions, 870 flow. Second operand 6 states and 833 transitions. [2023-11-19 07:51:18,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 234 transitions, 3296 flow [2023-11-19 07:51:18,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 234 transitions, 3144 flow, removed 13 selfloop flow, removed 2 redundant places. [2023-11-19 07:51:18,871 INFO L231 Difference]: Finished difference. Result has 72 places, 80 transitions, 909 flow [2023-11-19 07:51:18,872 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=304, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=909, PETRI_PLACES=72, PETRI_TRANSITIONS=80} [2023-11-19 07:51:18,873 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 22 predicate places. [2023-11-19 07:51:18,873 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 80 transitions, 909 flow [2023-11-19 07:51:18,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.4) internal successors, (637), 5 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:18,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:51:18,874 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:51:18,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:51:18,874 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:51:18,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:51:18,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1739427184, now seen corresponding path program 1 times [2023-11-19 07:51:18,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:51:18,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406864793] [2023-11-19 07:51:18,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:51:18,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:51:18,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:51:19,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:51:19,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:51:19,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406864793] [2023-11-19 07:51:19,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406864793] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:51:19,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:51:19,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:51:19,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776883662] [2023-11-19 07:51:19,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:51:19,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:51:19,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:51:19,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:51:19,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:51:19,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 304 [2023-11-19 07:51:19,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 80 transitions, 909 flow. Second operand has 6 states, 6 states have (on average 127.33333333333333) internal successors, (764), 6 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:19,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:51:19,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 304 [2023-11-19 07:51:19,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:51:20,152 INFO L124 PetriNetUnfolderBase]: 3437/5668 cut-off events. [2023-11-19 07:51:20,152 INFO L125 PetriNetUnfolderBase]: For 47224/47858 co-relation queries the response was YES. [2023-11-19 07:51:20,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31510 conditions, 5668 events. 3437/5668 cut-off events. For 47224/47858 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 37088 event pairs, 231 based on Foata normal form. 556/6136 useless extension candidates. Maximal degree in co-relation 31488. Up to 2536 conditions per place. [2023-11-19 07:51:20,174 INFO L140 encePairwiseOnDemand]: 297/304 looper letters, 143 selfloop transitions, 18 changer transitions 104/270 dead transitions. [2023-11-19 07:51:20,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 270 transitions, 3631 flow [2023-11-19 07:51:20,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:51:20,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-19 07:51:20,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1109 transitions. [2023-11-19 07:51:20,179 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45600328947368424 [2023-11-19 07:51:20,179 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1109 transitions. [2023-11-19 07:51:20,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1109 transitions. [2023-11-19 07:51:20,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:51:20,181 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1109 transitions. [2023-11-19 07:51:20,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 138.625) internal successors, (1109), 8 states have internal predecessors, (1109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:20,189 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 304.0) internal successors, (2736), 9 states have internal predecessors, (2736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:20,190 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 304.0) internal successors, (2736), 9 states have internal predecessors, (2736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:20,190 INFO L175 Difference]: Start difference. First operand has 72 places, 80 transitions, 909 flow. Second operand 8 states and 1109 transitions. [2023-11-19 07:51:20,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 270 transitions, 3631 flow [2023-11-19 07:51:20,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 270 transitions, 3446 flow, removed 17 selfloop flow, removed 4 redundant places. [2023-11-19 07:51:20,554 INFO L231 Difference]: Finished difference. Result has 78 places, 79 transitions, 862 flow [2023-11-19 07:51:20,555 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=304, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=862, PETRI_PLACES=78, PETRI_TRANSITIONS=79} [2023-11-19 07:51:20,555 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 28 predicate places. [2023-11-19 07:51:20,555 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 79 transitions, 862 flow [2023-11-19 07:51:20,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.33333333333333) internal successors, (764), 6 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:20,556 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:51:20,556 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:51:20,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:51:20,556 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:51:20,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:51:20,557 INFO L85 PathProgramCache]: Analyzing trace with hash 249177126, now seen corresponding path program 1 times [2023-11-19 07:51:20,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:51:20,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883641459] [2023-11-19 07:51:20,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:51:20,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:51:20,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:51:20,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:51:20,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:51:20,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883641459] [2023-11-19 07:51:20,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883641459] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:51:20,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:51:20,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:51:20,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126170822] [2023-11-19 07:51:20,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:51:20,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:51:20,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:51:20,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:51:20,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:51:20,857 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 304 [2023-11-19 07:51:20,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 79 transitions, 862 flow. Second operand has 7 states, 7 states have (on average 127.14285714285714) internal successors, (890), 7 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:20,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:51:20,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 304 [2023-11-19 07:51:20,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:51:21,762 INFO L124 PetriNetUnfolderBase]: 2776/4682 cut-off events. [2023-11-19 07:51:21,762 INFO L125 PetriNetUnfolderBase]: For 34233/34668 co-relation queries the response was YES. [2023-11-19 07:51:21,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25793 conditions, 4682 events. 2776/4682 cut-off events. For 34233/34668 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 31006 event pairs, 207 based on Foata normal form. 246/4859 useless extension candidates. Maximal degree in co-relation 25769. Up to 1615 conditions per place. [2023-11-19 07:51:21,791 INFO L140 encePairwiseOnDemand]: 297/304 looper letters, 92 selfloop transitions, 21 changer transitions 129/246 dead transitions. [2023-11-19 07:51:21,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 246 transitions, 3257 flow [2023-11-19 07:51:21,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 07:51:21,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-19 07:51:21,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1354 transitions. [2023-11-19 07:51:21,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4453947368421053 [2023-11-19 07:51:21,797 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1354 transitions. [2023-11-19 07:51:21,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1354 transitions. [2023-11-19 07:51:21,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:51:21,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1354 transitions. [2023-11-19 07:51:21,802 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 135.4) internal successors, (1354), 10 states have internal predecessors, (1354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:21,808 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 304.0) internal successors, (3344), 11 states have internal predecessors, (3344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:21,809 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 304.0) internal successors, (3344), 11 states have internal predecessors, (3344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:21,809 INFO L175 Difference]: Start difference. First operand has 78 places, 79 transitions, 862 flow. Second operand 10 states and 1354 transitions. [2023-11-19 07:51:21,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 246 transitions, 3257 flow [2023-11-19 07:51:22,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 246 transitions, 3164 flow, removed 23 selfloop flow, removed 7 redundant places. [2023-11-19 07:51:22,137 INFO L231 Difference]: Finished difference. Result has 82 places, 58 transitions, 551 flow [2023-11-19 07:51:22,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=304, PETRI_DIFFERENCE_MINUEND_FLOW=785, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=551, PETRI_PLACES=82, PETRI_TRANSITIONS=58} [2023-11-19 07:51:22,138 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 32 predicate places. [2023-11-19 07:51:22,138 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 58 transitions, 551 flow [2023-11-19 07:51:22,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 127.14285714285714) internal successors, (890), 7 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:22,139 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:51:22,139 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:51:22,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 07:51:22,139 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:51:22,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:51:22,140 INFO L85 PathProgramCache]: Analyzing trace with hash 597100163, now seen corresponding path program 1 times [2023-11-19 07:51:22,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:51:22,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906747112] [2023-11-19 07:51:22,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:51:22,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:51:22,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:51:23,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:51:23,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:51:23,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906747112] [2023-11-19 07:51:23,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906747112] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:51:23,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:51:23,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:51:23,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616643481] [2023-11-19 07:51:23,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:51:23,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:51:23,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:51:23,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:51:23,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:51:23,114 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 304 [2023-11-19 07:51:23,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 58 transitions, 551 flow. Second operand has 5 states, 5 states have (on average 124.0) internal successors, (620), 5 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:23,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:51:23,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 304 [2023-11-19 07:51:23,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:51:23,557 INFO L124 PetriNetUnfolderBase]: 728/1304 cut-off events. [2023-11-19 07:51:23,558 INFO L125 PetriNetUnfolderBase]: For 6503/6519 co-relation queries the response was YES. [2023-11-19 07:51:23,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7096 conditions, 1304 events. 728/1304 cut-off events. For 6503/6519 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6631 event pairs, 68 based on Foata normal form. 1/1297 useless extension candidates. Maximal degree in co-relation 7072. Up to 661 conditions per place. [2023-11-19 07:51:23,562 INFO L140 encePairwiseOnDemand]: 293/304 looper letters, 43 selfloop transitions, 9 changer transitions 67/120 dead transitions. [2023-11-19 07:51:23,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 120 transitions, 1311 flow [2023-11-19 07:51:23,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:51:23,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:51:23,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 780 transitions. [2023-11-19 07:51:23,566 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4276315789473684 [2023-11-19 07:51:23,566 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 780 transitions. [2023-11-19 07:51:23,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 780 transitions. [2023-11-19 07:51:23,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:51:23,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 780 transitions. [2023-11-19 07:51:23,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 130.0) internal successors, (780), 6 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:23,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 304.0) internal successors, (2128), 7 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:23,574 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 304.0) internal successors, (2128), 7 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:23,574 INFO L175 Difference]: Start difference. First operand has 82 places, 58 transitions, 551 flow. Second operand 6 states and 780 transitions. [2023-11-19 07:51:23,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 120 transitions, 1311 flow [2023-11-19 07:51:23,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 120 transitions, 1074 flow, removed 53 selfloop flow, removed 14 redundant places. [2023-11-19 07:51:23,601 INFO L231 Difference]: Finished difference. Result has 73 places, 42 transitions, 307 flow [2023-11-19 07:51:23,601 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=304, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=307, PETRI_PLACES=73, PETRI_TRANSITIONS=42} [2023-11-19 07:51:23,602 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 23 predicate places. [2023-11-19 07:51:23,602 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 42 transitions, 307 flow [2023-11-19 07:51:23,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.0) internal successors, (620), 5 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:23,602 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:51:23,603 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:51:23,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 07:51:23,603 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:51:23,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:51:23,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1096611059, now seen corresponding path program 2 times [2023-11-19 07:51:23,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:51:23,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072214743] [2023-11-19 07:51:23,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:51:23,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:51:23,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:51:24,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:51:24,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:51:24,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072214743] [2023-11-19 07:51:24,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072214743] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:51:24,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:51:24,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:51:24,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198745216] [2023-11-19 07:51:24,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:51:24,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:51:24,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:51:24,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:51:24,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:51:24,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 304 [2023-11-19 07:51:24,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 42 transitions, 307 flow. Second operand has 7 states, 7 states have (on average 121.71428571428571) internal successors, (852), 7 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:24,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:51:24,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 304 [2023-11-19 07:51:24,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:51:25,146 INFO L124 PetriNetUnfolderBase]: 171/326 cut-off events. [2023-11-19 07:51:25,146 INFO L125 PetriNetUnfolderBase]: For 1126/1126 co-relation queries the response was YES. [2023-11-19 07:51:25,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1519 conditions, 326 events. 171/326 cut-off events. For 1126/1126 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1121 event pairs, 14 based on Foata normal form. 1/327 useless extension candidates. Maximal degree in co-relation 1499. Up to 168 conditions per place. [2023-11-19 07:51:25,149 INFO L140 encePairwiseOnDemand]: 294/304 looper letters, 43 selfloop transitions, 9 changer transitions 20/72 dead transitions. [2023-11-19 07:51:25,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 72 transitions, 630 flow [2023-11-19 07:51:25,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:51:25,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:51:25,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 750 transitions. [2023-11-19 07:51:25,153 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41118421052631576 [2023-11-19 07:51:25,153 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 750 transitions. [2023-11-19 07:51:25,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 750 transitions. [2023-11-19 07:51:25,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:51:25,154 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 750 transitions. [2023-11-19 07:51:25,156 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.0) internal successors, (750), 6 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:25,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 304.0) internal successors, (2128), 7 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:25,160 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 304.0) internal successors, (2128), 7 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:25,160 INFO L175 Difference]: Start difference. First operand has 73 places, 42 transitions, 307 flow. Second operand 6 states and 750 transitions. [2023-11-19 07:51:25,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 72 transitions, 630 flow [2023-11-19 07:51:25,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 72 transitions, 546 flow, removed 15 selfloop flow, removed 13 redundant places. [2023-11-19 07:51:25,166 INFO L231 Difference]: Finished difference. Result has 61 places, 38 transitions, 225 flow [2023-11-19 07:51:25,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=304, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=225, PETRI_PLACES=61, PETRI_TRANSITIONS=38} [2023-11-19 07:51:25,168 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places. [2023-11-19 07:51:25,168 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 38 transitions, 225 flow [2023-11-19 07:51:25,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 121.71428571428571) internal successors, (852), 7 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:51:25,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:51:25,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:51:25,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 07:51:25,170 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-19 07:51:25,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:51:25,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1372198925, now seen corresponding path program 3 times [2023-11-19 07:51:25,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:51:25,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11532985] [2023-11-19 07:51:25,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:51:25,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:51:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:51:25,243 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:51:25,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:51:25,381 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:51:25,381 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:51:25,382 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-19 07:51:25,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-19 07:51:25,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-19 07:51:25,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-19 07:51:25,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-19 07:51:25,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-19 07:51:25,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-19 07:51:25,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-19 07:51:25,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-19 07:51:25,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-19 07:51:25,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-19 07:51:25,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-19 07:51:25,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-19 07:51:25,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-19 07:51:25,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-19 07:51:25,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-19 07:51:25,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-19 07:51:25,387 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:51:25,395 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 07:51:25,395 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:51:25,475 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 07:51:25,477 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 07:51:25,481 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-19 07:51:25,489 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-19 07:51:25,504 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-19 07:51:25,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:51:25 BasicIcfg [2023-11-19 07:51:25,529 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:51:25,530 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:51:25,530 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:51:25,530 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:51:25,531 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:50:47" (3/4) ... [2023-11-19 07:51:25,532 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-19 07:51:25,533 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:51:25,534 INFO L158 Benchmark]: Toolchain (without parser) took 40497.99ms. Allocated memory was 136.3MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 106.8MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 666.8MB. Max. memory is 16.1GB. [2023-11-19 07:51:25,534 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 136.3MB. Free memory was 110.9MB in the beginning and 110.8MB in the end (delta: 92.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:51:25,535 INFO L158 Benchmark]: CACSL2BoogieTranslator took 809.31ms. Allocated memory is still 136.3MB. Free memory was 106.8MB in the beginning and 82.2MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-19 07:51:25,535 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.91ms. Allocated memory is still 136.3MB. Free memory was 82.2MB in the beginning and 79.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-19 07:51:25,536 INFO L158 Benchmark]: Boogie Preprocessor took 54.55ms. Allocated memory is still 136.3MB. Free memory was 79.1MB in the beginning and 77.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:51:25,536 INFO L158 Benchmark]: RCFGBuilder took 1045.14ms. Allocated memory is still 136.3MB. Free memory was 77.0MB in the beginning and 88.4MB in the end (delta: -11.4MB). Peak memory consumption was 36.0MB. Max. memory is 16.1GB. [2023-11-19 07:51:25,536 INFO L158 Benchmark]: TraceAbstraction took 38489.65ms. Allocated memory was 136.3MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 87.8MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 645.5MB. Max. memory is 16.1GB. [2023-11-19 07:51:25,537 INFO L158 Benchmark]: Witness Printer took 3.77ms. Allocated memory is still 1.9GB. Free memory is still 1.2GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:51:25,538 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.43ms. Allocated memory is still 136.3MB. Free memory was 110.9MB in the beginning and 110.8MB in the end (delta: 92.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 809.31ms. Allocated memory is still 136.3MB. Free memory was 106.8MB in the beginning and 82.2MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.91ms. Allocated memory is still 136.3MB. Free memory was 82.2MB in the beginning and 79.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.55ms. Allocated memory is still 136.3MB. Free memory was 79.1MB in the beginning and 77.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1045.14ms. Allocated memory is still 136.3MB. Free memory was 77.0MB in the beginning and 88.4MB in the end (delta: -11.4MB). Peak memory consumption was 36.0MB. Max. memory is 16.1GB. * TraceAbstraction took 38489.65ms. Allocated memory was 136.3MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 87.8MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 645.5MB. Max. memory is 16.1GB. * Witness Printer took 3.77ms. Allocated memory is still 1.9GB. Free memory is still 1.2GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.4s, 155 PlacesBefore, 50 PlacesAfterwards, 145 TransitionsBefore, 37 TransitionsAfterwards, 4008 CoEnabledTransitionPairs, 7 FixpointIterations, 53 TrivialSequentialCompositions, 87 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 3 ChoiceCompositions, 155 TotalNumberOfCompositions, 9971 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4509, independent: 4281, independent conditional: 0, independent unconditional: 4281, dependent: 228, dependent conditional: 0, dependent unconditional: 228, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2190, independent: 2127, independent conditional: 0, independent unconditional: 2127, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4509, independent: 2154, independent conditional: 0, independent unconditional: 2154, dependent: 165, dependent conditional: 0, dependent unconditional: 165, unknown: 2190, unknown conditional: 0, unknown unconditional: 2190] , Statistics on independence cache: Total cache size (in pairs): 137, Positive cache size: 116, Positive conditional cache size: 0, Positive unconditional cache size: 116, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff0_thd3; [L731] 0 _Bool z$r_buff0_thd4; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd4; [L737] 0 _Bool z$read_delayed; [L738] 0 int *z$read_delayed_var; [L739] 0 int z$w_buff0; [L740] 0 _Bool z$w_buff0_used; [L741] 0 int z$w_buff1; [L742] 0 _Bool z$w_buff1_used; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L852] 0 pthread_t t825; [L853] FCALL, FORK 0 pthread_create(&t825, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t825={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L854] 0 pthread_t t826; [L855] FCALL, FORK 0 pthread_create(&t826, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t825={5:0}, t826={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L856] 0 pthread_t t827; [L857] FCALL, FORK 0 pthread_create(&t827, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t825={5:0}, t826={6:0}, t827={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L858] 0 pthread_t t828; [L859] FCALL, FORK 0 pthread_create(&t828, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t825={5:0}, t826={6:0}, t827={7:0}, t828={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 2 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L802] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L802] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L803] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L804] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L805] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L806] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L807] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L808] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L811] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L812] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L813] 4 z$flush_delayed = weak$$choice2 [L814] 4 z$mem_tmp = z [L815] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L816] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L817] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L818] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L819] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L820] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L821] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L822] 4 __unbuffered_p3_EAX = z [L823] 4 z = z$flush_delayed ? z$mem_tmp : z [L824] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L827] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L763] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L766] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L778] 3 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L781] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L784] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L788] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L830] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L831] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L832] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L833] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L834] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L837] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L839] 4 return 0; [L791] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 3 return 0; [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L863] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L863] RET 0 assume_abort_if_not(main$tmp_guard0) [L865] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L866] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L867] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L868] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L869] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t825={5:0}, t826={6:0}, t827={7:0}, t828={3:0}, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 z$flush_delayed = weak$$choice2 [L875] 0 z$mem_tmp = z [L876] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L877] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L878] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L879] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L880] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L882] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L884] 0 z = z$flush_delayed ? z$mem_tmp : z [L885] 0 z$flush_delayed = (_Bool)0 [L887] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix030_tso.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 185 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 38.2s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 19.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 904 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 682 mSDsluCounter, 360 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 255 mSDsCounter, 163 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1779 IncrementalHoareTripleChecker+Invalid, 1942 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 163 mSolverCounterUnsat, 105 mSDtfsCounter, 1779 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=909occurred in iteration=10, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 243 NumberOfCodeBlocks, 243 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 203 ConstructedInterpolants, 0 QuantifiedInterpolants, 1887 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-19 07:51:25,594 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7ff5df0b-d899-4b70-ac92-e04561c18e9b/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...