./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix028_tso.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cf1a7837 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_f6eef98e-2844-4d03-b78f-bda20c90e05c/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6eef98e-2844-4d03-b78f-bda20c90e05c/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6eef98e-2844-4d03-b78f-bda20c90e05c/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6eef98e-2844-4d03-b78f-bda20c90e05c/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix028_tso.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6eef98e-2844-4d03-b78f-bda20c90e05c/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6eef98e-2844-4d03-b78f-bda20c90e05c/bin/uautomizer-verify-uTZkv6EMXl --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 381687e0b1f81c1857e97f802385548d8501e57e279b70a993237277b7cd3e3a --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:20:55,929 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:20:56,042 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6eef98e-2844-4d03-b78f-bda20c90e05c/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-12 02:20:56,053 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:20:56,054 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:20:56,093 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:20:56,094 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:20:56,094 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:20:56,095 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:20:56,096 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:20:56,097 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:20:56,098 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:20:56,098 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:20:56,099 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:20:56,100 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:20:56,100 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:20:56,101 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:20:56,102 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:20:56,102 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-12 02:20:56,103 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-12 02:20:56,103 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-12 02:20:56,104 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:20:56,105 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 02:20:56,106 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 02:20:56,106 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:20:56,107 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:20:56,108 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:20:56,108 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:20:56,109 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:20:56,109 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:20:56,110 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:20:56,110 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:20:56,111 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:20:56,111 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:20:56,112 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:20:56,112 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:20:56,113 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:20:56,113 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:20:56,114 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_f6eef98e-2844-4d03-b78f-bda20c90e05c/bin/uautomizer-verify-uTZkv6EMXl/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_f6eef98e-2844-4d03-b78f-bda20c90e05c/bin/uautomizer-verify-uTZkv6EMXl 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 -> 381687e0b1f81c1857e97f802385548d8501e57e279b70a993237277b7cd3e3a [2023-11-12 02:20:56,364 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:20:56,394 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:20:56,397 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:20:56,399 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:20:56,400 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:20:56,401 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6eef98e-2844-4d03-b78f-bda20c90e05c/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/pthread-wmm/mix028_tso.i [2023-11-12 02:20:59,577 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:20:59,880 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:20:59,881 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6eef98e-2844-4d03-b78f-bda20c90e05c/sv-benchmarks/c/pthread-wmm/mix028_tso.i [2023-11-12 02:20:59,905 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6eef98e-2844-4d03-b78f-bda20c90e05c/bin/uautomizer-verify-uTZkv6EMXl/data/6d2704b7e/1379769d925247feaee061691edf08f4/FLAGd3d2f88e4 [2023-11-12 02:20:59,927 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6eef98e-2844-4d03-b78f-bda20c90e05c/bin/uautomizer-verify-uTZkv6EMXl/data/6d2704b7e/1379769d925247feaee061691edf08f4 [2023-11-12 02:20:59,929 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:20:59,931 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:20:59,933 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:20:59,933 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:20:59,939 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:20:59,940 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:20:59" (1/1) ... [2023-11-12 02:20:59,941 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fb3dcdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:20:59, skipping insertion in model container [2023-11-12 02:20:59,941 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:20:59" (1/1) ... [2023-11-12 02:20:59,996 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:21:00,490 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:21:00,505 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:21:00,608 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:21:00,667 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:21:00,668 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:21:00,676 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:21:00,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:00 WrapperNode [2023-11-12 02:21:00,677 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:21:00,678 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:21:00,679 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:21:00,679 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:21:00,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:00" (1/1) ... [2023-11-12 02:21:00,724 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:00" (1/1) ... [2023-11-12 02:21:00,776 INFO L138 Inliner]: procedures = 176, calls = 57, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 170 [2023-11-12 02:21:00,776 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:21:00,777 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:21:00,778 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:21:00,778 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:21:00,788 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:00" (1/1) ... [2023-11-12 02:21:00,789 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:00" (1/1) ... [2023-11-12 02:21:00,795 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:00" (1/1) ... [2023-11-12 02:21:00,795 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:00" (1/1) ... [2023-11-12 02:21:00,806 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:00" (1/1) ... [2023-11-12 02:21:00,808 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:00" (1/1) ... [2023-11-12 02:21:00,812 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:00" (1/1) ... [2023-11-12 02:21:00,814 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:00" (1/1) ... [2023-11-12 02:21:00,819 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:21:00,820 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:21:00,820 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:21:00,820 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:21:00,821 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:00" (1/1) ... [2023-11-12 02:21:00,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:21:00,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6eef98e-2844-4d03-b78f-bda20c90e05c/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:21:00,857 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6eef98e-2844-4d03-b78f-bda20c90e05c/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:21:00,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6eef98e-2844-4d03-b78f-bda20c90e05c/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:21:00,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:21:00,918 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-12 02:21:00,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:21:00,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 02:21:00,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 02:21:00,920 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-12 02:21:00,920 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-12 02:21:00,920 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-12 02:21:00,921 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-12 02:21:00,921 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-12 02:21:00,921 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-12 02:21:00,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:21:00,921 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-12 02:21:00,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:21:00,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:21:00,925 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-12 02:21:01,119 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:21:01,121 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:21:01,627 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:21:01,898 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:21:01,898 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-12 02:21:01,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:21:01 BoogieIcfgContainer [2023-11-12 02:21:01,901 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:21:01,904 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:21:01,904 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:21:01,913 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:21:01,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:20:59" (1/3) ... [2023-11-12 02:21:01,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bce222a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:21:01, skipping insertion in model container [2023-11-12 02:21:01,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:00" (2/3) ... [2023-11-12 02:21:01,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bce222a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:21:01, skipping insertion in model container [2023-11-12 02:21:01,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:21:01" (3/3) ... [2023-11-12 02:21:01,918 INFO L112 eAbstractionObserver]: Analyzing ICFG mix028_tso.i [2023-11-12 02:21:01,939 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:21:01,939 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-12 02:21:01,940 INFO L521 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-12 02:21:02,016 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-12 02:21:02,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 126 transitions, 264 flow [2023-11-12 02:21:02,155 INFO L124 PetriNetUnfolderBase]: 3/123 cut-off events. [2023-11-12 02:21:02,155 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:21:02,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 123 events. 3/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2023-11-12 02:21:02,166 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 126 transitions, 264 flow [2023-11-12 02:21:02,171 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 123 transitions, 255 flow [2023-11-12 02:21:02,179 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-12 02:21:02,200 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 123 transitions, 255 flow [2023-11-12 02:21:02,203 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 123 transitions, 255 flow [2023-11-12 02:21:02,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 123 transitions, 255 flow [2023-11-12 02:21:02,258 INFO L124 PetriNetUnfolderBase]: 3/123 cut-off events. [2023-11-12 02:21:02,258 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:21:02,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 123 events. 3/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2023-11-12 02:21:02,264 INFO L119 LiptonReduction]: Number of co-enabled transitions 2464 [2023-11-12 02:21:09,599 INFO L134 LiptonReduction]: Checked pairs total: 6611 [2023-11-12 02:21:09,600 INFO L136 LiptonReduction]: Total number of compositions: 125 [2023-11-12 02:21:09,615 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:21:09,622 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;@146e300e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:21:09,623 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-12 02:21:09,624 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-12 02:21:09,625 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-12 02:21:09,625 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:21:09,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:21:09,626 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-12 02:21:09,626 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 02:21:09,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:21:09,632 INFO L85 PathProgramCache]: Analyzing trace with hash 591, now seen corresponding path program 1 times [2023-11-12 02:21:09,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:21:09,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702150237] [2023-11-12 02:21:09,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:21:09,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:21:09,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:09,766 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-12 02:21:09,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:21:09,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702150237] [2023-11-12 02:21:09,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702150237] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:21:09,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:21:09,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-12 02:21:09,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204328967] [2023-11-12 02:21:09,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:21:09,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 02:21:09,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:21:09,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:21:09,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:21:09,811 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 251 [2023-11-12 02:21:09,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 69 flow. Second operand has 2 states, 2 states have (on average 112.5) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:09,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:21:09,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 251 [2023-11-12 02:21:09,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:21:10,237 INFO L124 PetriNetUnfolderBase]: 939/1442 cut-off events. [2023-11-12 02:21:10,237 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-12 02:21:10,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2881 conditions, 1442 events. 939/1442 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 6837 event pairs, 939 based on Foata normal form. 0/1186 useless extension candidates. Maximal degree in co-relation 2870. Up to 1403 conditions per place. [2023-11-12 02:21:10,259 INFO L140 encePairwiseOnDemand]: 245/251 looper letters, 21 selfloop transitions, 0 changer transitions 0/24 dead transitions. [2023-11-12 02:21:10,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 24 transitions, 99 flow [2023-11-12 02:21:10,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:21:10,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-12 02:21:10,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 251 transitions. [2023-11-12 02:21:10,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-11-12 02:21:10,282 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 251 transitions. [2023-11-12 02:21:10,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 251 transitions. [2023-11-12 02:21:10,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:21:10,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 251 transitions. [2023-11-12 02:21:10,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:10,300 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 251.0) internal successors, (753), 3 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:10,300 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 251.0) internal successors, (753), 3 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:10,303 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 69 flow. Second operand 2 states and 251 transitions. [2023-11-12 02:21:10,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 24 transitions, 99 flow [2023-11-12 02:21:10,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 24 transitions, 96 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-12 02:21:10,309 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 54 flow [2023-11-12 02:21:10,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2023-11-12 02:21:10,318 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -8 predicate places. [2023-11-12 02:21:10,319 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 54 flow [2023-11-12 02:21:10,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 112.5) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:10,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:21:10,320 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:21:10,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:21:10,320 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 02:21:10,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:21:10,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1853062089, now seen corresponding path program 1 times [2023-11-12 02:21:10,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:21:10,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863476905] [2023-11-12 02:21:10,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:21:10,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:21:10,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:10,788 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-12 02:21:10,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:21:10,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863476905] [2023-11-12 02:21:10,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863476905] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:21:10,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:21:10,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 02:21:10,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446676047] [2023-11-12 02:21:10,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:21:10,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:21:10,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:21:10,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:21:10,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:21:10,795 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 251 [2023-11-12 02:21:10,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:10,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:21:10,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 251 [2023-11-12 02:21:10,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:21:11,143 INFO L124 PetriNetUnfolderBase]: 777/1244 cut-off events. [2023-11-12 02:21:11,143 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:21:11,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2447 conditions, 1244 events. 777/1244 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 6158 event pairs, 129 based on Foata normal form. 0/1120 useless extension candidates. Maximal degree in co-relation 2444. Up to 937 conditions per place. [2023-11-12 02:21:11,154 INFO L140 encePairwiseOnDemand]: 248/251 looper letters, 26 selfloop transitions, 2 changer transitions 2/33 dead transitions. [2023-11-12 02:21:11,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 33 transitions, 132 flow [2023-11-12 02:21:11,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:21:11,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:21:11,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2023-11-12 02:21:11,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48339973439575035 [2023-11-12 02:21:11,162 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 364 transitions. [2023-11-12 02:21:11,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 364 transitions. [2023-11-12 02:21:11,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:21:11,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 364 transitions. [2023-11-12 02:21:11,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:11,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:11,171 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:11,171 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 54 flow. Second operand 3 states and 364 transitions. [2023-11-12 02:21:11,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 33 transitions, 132 flow [2023-11-12 02:21:11,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 132 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-12 02:21:11,173 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 54 flow [2023-11-12 02:21:11,174 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2023-11-12 02:21:11,175 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -7 predicate places. [2023-11-12 02:21:11,175 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 54 flow [2023-11-12 02:21:11,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:11,176 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:21:11,176 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:21:11,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:21:11,176 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 02:21:11,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:21:11,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1618831104, now seen corresponding path program 1 times [2023-11-12 02:21:11,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:21:11,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055603643] [2023-11-12 02:21:11,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:21:11,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:21:11,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:12,434 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-12 02:21:12,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:21:12,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055603643] [2023-11-12 02:21:12,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055603643] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:21:12,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:21:12,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:21:12,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678726223] [2023-11-12 02:21:12,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:21:12,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:21:12,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:21:12,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:21:12,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:21:12,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 251 [2023-11-12 02:21:12,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:12,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:21:12,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 251 [2023-11-12 02:21:12,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:21:13,131 INFO L124 PetriNetUnfolderBase]: 1488/2371 cut-off events. [2023-11-12 02:21:13,131 INFO L125 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2023-11-12 02:21:13,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4813 conditions, 2371 events. 1488/2371 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 12679 event pairs, 125 based on Foata normal form. 0/2287 useless extension candidates. Maximal degree in co-relation 4809. Up to 1550 conditions per place. [2023-11-12 02:21:13,153 INFO L140 encePairwiseOnDemand]: 240/251 looper letters, 40 selfloop transitions, 12 changer transitions 0/53 dead transitions. [2023-11-12 02:21:13,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 53 transitions, 230 flow [2023-11-12 02:21:13,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:21:13,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-12 02:21:13,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 462 transitions. [2023-11-12 02:21:13,157 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4601593625498008 [2023-11-12 02:21:13,157 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 462 transitions. [2023-11-12 02:21:13,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 462 transitions. [2023-11-12 02:21:13,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:21:13,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 462 transitions. [2023-11-12 02:21:13,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:13,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:13,165 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:13,165 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 54 flow. Second operand 4 states and 462 transitions. [2023-11-12 02:21:13,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 53 transitions, 230 flow [2023-11-12 02:21:13,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 53 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-12 02:21:13,168 INFO L231 Difference]: Finished difference. Result has 36 places, 33 transitions, 142 flow [2023-11-12 02:21:13,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=36, PETRI_TRANSITIONS=33} [2023-11-12 02:21:13,170 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2023-11-12 02:21:13,170 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 33 transitions, 142 flow [2023-11-12 02:21:13,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:13,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:21:13,171 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:21:13,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:21:13,176 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 02:21:13,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:21:13,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1618831120, now seen corresponding path program 1 times [2023-11-12 02:21:13,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:21:13,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057069531] [2023-11-12 02:21:13,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:21:13,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:21:13,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:13,690 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-12 02:21:13,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:21:13,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057069531] [2023-11-12 02:21:13,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057069531] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:21:13,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:21:13,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:21:13,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65973886] [2023-11-12 02:21:13,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:21:13,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:21:13,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:21:13,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:21:13,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:21:13,819 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 251 [2023-11-12 02:21:13,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 33 transitions, 142 flow. Second operand has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:13,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:21:13,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 251 [2023-11-12 02:21:13,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:21:14,212 INFO L124 PetriNetUnfolderBase]: 970/1545 cut-off events. [2023-11-12 02:21:14,212 INFO L125 PetriNetUnfolderBase]: For 1101/1102 co-relation queries the response was YES. [2023-11-12 02:21:14,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4349 conditions, 1545 events. 970/1545 cut-off events. For 1101/1102 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 7574 event pairs, 246 based on Foata normal form. 137/1674 useless extension candidates. Maximal degree in co-relation 4343. Up to 1356 conditions per place. [2023-11-12 02:21:14,228 INFO L140 encePairwiseOnDemand]: 247/251 looper letters, 31 selfloop transitions, 3 changer transitions 0/39 dead transitions. [2023-11-12 02:21:14,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 39 transitions, 228 flow [2023-11-12 02:21:14,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:21:14,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:21:14,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 506 transitions. [2023-11-12 02:21:14,232 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40318725099601593 [2023-11-12 02:21:14,232 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 506 transitions. [2023-11-12 02:21:14,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 506 transitions. [2023-11-12 02:21:14,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:21:14,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 506 transitions. [2023-11-12 02:21:14,235 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.2) internal successors, (506), 5 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:14,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:14,239 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:14,240 INFO L175 Difference]: Start difference. First operand has 36 places, 33 transitions, 142 flow. Second operand 5 states and 506 transitions. [2023-11-12 02:21:14,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 39 transitions, 228 flow [2023-11-12 02:21:14,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 39 transitions, 215 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-12 02:21:14,244 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 124 flow [2023-11-12 02:21:14,244 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=124, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2023-11-12 02:21:14,245 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2023-11-12 02:21:14,246 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 124 flow [2023-11-12 02:21:14,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:14,246 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:21:14,247 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:21:14,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:21:14,247 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 02:21:14,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:21:14,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1341925651, now seen corresponding path program 1 times [2023-11-12 02:21:14,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:21:14,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627238620] [2023-11-12 02:21:14,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:21:14,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:21:14,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:14,680 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-12 02:21:14,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:21:14,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627238620] [2023-11-12 02:21:14,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627238620] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:21:14,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:21:14,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:21:14,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87449945] [2023-11-12 02:21:14,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:21:14,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:21:14,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:21:14,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:21:14,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:21:14,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 251 [2023-11-12 02:21:14,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:14,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:21:14,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 251 [2023-11-12 02:21:14,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:21:15,112 INFO L124 PetriNetUnfolderBase]: 1324/2043 cut-off events. [2023-11-12 02:21:15,112 INFO L125 PetriNetUnfolderBase]: For 699/706 co-relation queries the response was YES. [2023-11-12 02:21:15,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5659 conditions, 2043 events. 1324/2043 cut-off events. For 699/706 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 9390 event pairs, 247 based on Foata normal form. 15/2056 useless extension candidates. Maximal degree in co-relation 5652. Up to 1805 conditions per place. [2023-11-12 02:21:15,131 INFO L140 encePairwiseOnDemand]: 245/251 looper letters, 42 selfloop transitions, 10 changer transitions 0/54 dead transitions. [2023-11-12 02:21:15,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 54 transitions, 317 flow [2023-11-12 02:21:15,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:21:15,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-12 02:21:15,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 471 transitions. [2023-11-12 02:21:15,134 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46912350597609564 [2023-11-12 02:21:15,134 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 471 transitions. [2023-11-12 02:21:15,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 471 transitions. [2023-11-12 02:21:15,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:21:15,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 471 transitions. [2023-11-12 02:21:15,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:15,140 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:15,141 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:15,141 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 124 flow. Second operand 4 states and 471 transitions. [2023-11-12 02:21:15,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 54 transitions, 317 flow [2023-11-12 02:21:15,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 54 transitions, 310 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-12 02:21:15,148 INFO L231 Difference]: Finished difference. Result has 40 places, 39 transitions, 206 flow [2023-11-12 02:21:15,148 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=206, PETRI_PLACES=40, PETRI_TRANSITIONS=39} [2023-11-12 02:21:15,150 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2023-11-12 02:21:15,151 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 39 transitions, 206 flow [2023-11-12 02:21:15,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:15,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:21:15,152 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:21:15,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:21:15,153 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 02:21:15,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:21:15,153 INFO L85 PathProgramCache]: Analyzing trace with hash 2078931205, now seen corresponding path program 1 times [2023-11-12 02:21:15,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:21:15,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391230851] [2023-11-12 02:21:15,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:21:15,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:21:15,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:15,925 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-12 02:21:15,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:21:15,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391230851] [2023-11-12 02:21:15,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391230851] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:21:15,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:21:15,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:21:15,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754645348] [2023-11-12 02:21:15,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:21:15,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:21:15,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:21:15,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:21:15,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:21:15,998 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 251 [2023-11-12 02:21:15,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 39 transitions, 206 flow. Second operand has 4 states, 4 states have (on average 104.5) internal successors, (418), 4 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:15,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:21:15,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 251 [2023-11-12 02:21:15,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:21:16,465 INFO L124 PetriNetUnfolderBase]: 1217/1912 cut-off events. [2023-11-12 02:21:16,466 INFO L125 PetriNetUnfolderBase]: For 1638/1654 co-relation queries the response was YES. [2023-11-12 02:21:16,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6045 conditions, 1912 events. 1217/1912 cut-off events. For 1638/1654 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8849 event pairs, 289 based on Foata normal form. 44/1954 useless extension candidates. Maximal degree in co-relation 6036. Up to 1069 conditions per place. [2023-11-12 02:21:16,487 INFO L140 encePairwiseOnDemand]: 242/251 looper letters, 44 selfloop transitions, 10 changer transitions 0/56 dead transitions. [2023-11-12 02:21:16,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 56 transitions, 381 flow [2023-11-12 02:21:16,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:21:16,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-12 02:21:16,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 446 transitions. [2023-11-12 02:21:16,491 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4442231075697211 [2023-11-12 02:21:16,491 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 446 transitions. [2023-11-12 02:21:16,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 446 transitions. [2023-11-12 02:21:16,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:21:16,492 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 446 transitions. [2023-11-12 02:21:16,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:16,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:16,497 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:16,497 INFO L175 Difference]: Start difference. First operand has 40 places, 39 transitions, 206 flow. Second operand 4 states and 446 transitions. [2023-11-12 02:21:16,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 56 transitions, 381 flow [2023-11-12 02:21:16,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 56 transitions, 381 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-12 02:21:16,502 INFO L231 Difference]: Finished difference. Result has 46 places, 44 transitions, 288 flow [2023-11-12 02:21:16,503 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=288, PETRI_PLACES=46, PETRI_TRANSITIONS=44} [2023-11-12 02:21:16,503 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2023-11-12 02:21:16,504 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 44 transitions, 288 flow [2023-11-12 02:21:16,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.5) internal successors, (418), 4 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:16,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:21:16,505 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:21:16,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:21:16,505 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 02:21:16,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:21:16,505 INFO L85 PathProgramCache]: Analyzing trace with hash 24440143, now seen corresponding path program 1 times [2023-11-12 02:21:16,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:21:16,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171186137] [2023-11-12 02:21:16,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:21:16,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:21:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:16,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:21:16,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:21:16,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171186137] [2023-11-12 02:21:16,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171186137] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:21:16,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:21:16,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:21:16,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796876533] [2023-11-12 02:21:16,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:21:16,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:21:16,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:21:16,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:21:16,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:21:16,713 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 251 [2023-11-12 02:21:16,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 44 transitions, 288 flow. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:16,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:21:16,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 251 [2023-11-12 02:21:16,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:21:16,967 INFO L124 PetriNetUnfolderBase]: 567/995 cut-off events. [2023-11-12 02:21:16,967 INFO L125 PetriNetUnfolderBase]: For 1730/1773 co-relation queries the response was YES. [2023-11-12 02:21:16,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3550 conditions, 995 events. 567/995 cut-off events. For 1730/1773 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4815 event pairs, 113 based on Foata normal form. 66/1042 useless extension candidates. Maximal degree in co-relation 3538. Up to 764 conditions per place. [2023-11-12 02:21:16,979 INFO L140 encePairwiseOnDemand]: 246/251 looper letters, 59 selfloop transitions, 4 changer transitions 0/71 dead transitions. [2023-11-12 02:21:16,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 71 transitions, 574 flow [2023-11-12 02:21:16,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:21:16,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:21:16,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2023-11-12 02:21:16,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47277556440903057 [2023-11-12 02:21:16,982 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 356 transitions. [2023-11-12 02:21:16,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 356 transitions. [2023-11-12 02:21:16,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:21:16,983 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 356 transitions. [2023-11-12 02:21:16,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:16,986 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:16,987 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:16,987 INFO L175 Difference]: Start difference. First operand has 46 places, 44 transitions, 288 flow. Second operand 3 states and 356 transitions. [2023-11-12 02:21:16,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 71 transitions, 574 flow [2023-11-12 02:21:16,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 71 transitions, 563 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-11-12 02:21:16,996 INFO L231 Difference]: Finished difference. Result has 48 places, 47 transitions, 307 flow [2023-11-12 02:21:16,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=307, PETRI_PLACES=48, PETRI_TRANSITIONS=47} [2023-11-12 02:21:16,997 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places. [2023-11-12 02:21:16,998 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 47 transitions, 307 flow [2023-11-12 02:21:16,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:16,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:21:16,998 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:21:16,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 02:21:16,999 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 02:21:16,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:21:17,000 INFO L85 PathProgramCache]: Analyzing trace with hash 151044312, now seen corresponding path program 1 times [2023-11-12 02:21:17,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:21:17,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112098266] [2023-11-12 02:21:17,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:21:17,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:21:17,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:17,759 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-12 02:21:17,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:21:17,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112098266] [2023-11-12 02:21:17,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112098266] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:21:17,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:21:17,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:21:17,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704906589] [2023-11-12 02:21:17,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:21:17,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:21:17,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:21:17,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:21:17,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:21:17,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 251 [2023-11-12 02:21:17,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 47 transitions, 307 flow. Second operand has 4 states, 4 states have (on average 105.5) internal successors, (422), 4 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:17,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:21:17,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 251 [2023-11-12 02:21:17,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:21:18,180 INFO L124 PetriNetUnfolderBase]: 778/1370 cut-off events. [2023-11-12 02:21:18,181 INFO L125 PetriNetUnfolderBase]: For 2046/2053 co-relation queries the response was YES. [2023-11-12 02:21:18,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5326 conditions, 1370 events. 778/1370 cut-off events. For 2046/2053 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6775 event pairs, 198 based on Foata normal form. 35/1405 useless extension candidates. Maximal degree in co-relation 5312. Up to 680 conditions per place. [2023-11-12 02:21:18,196 INFO L140 encePairwiseOnDemand]: 246/251 looper letters, 50 selfloop transitions, 11 changer transitions 10/73 dead transitions. [2023-11-12 02:21:18,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 73 transitions, 576 flow [2023-11-12 02:21:18,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:21:18,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-12 02:21:18,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 450 transitions. [2023-11-12 02:21:18,199 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.448207171314741 [2023-11-12 02:21:18,200 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 450 transitions. [2023-11-12 02:21:18,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 450 transitions. [2023-11-12 02:21:18,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:21:18,200 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 450 transitions. [2023-11-12 02:21:18,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:18,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:18,205 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:18,206 INFO L175 Difference]: Start difference. First operand has 48 places, 47 transitions, 307 flow. Second operand 4 states and 450 transitions. [2023-11-12 02:21:18,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 73 transitions, 576 flow [2023-11-12 02:21:18,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 73 transitions, 569 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-12 02:21:18,217 INFO L231 Difference]: Finished difference. Result has 52 places, 45 transitions, 323 flow [2023-11-12 02:21:18,217 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=323, PETRI_PLACES=52, PETRI_TRANSITIONS=45} [2023-11-12 02:21:18,218 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 12 predicate places. [2023-11-12 02:21:18,218 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 323 flow [2023-11-12 02:21:18,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.5) internal successors, (422), 4 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:18,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:21:18,219 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:21:18,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 02:21:18,229 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 02:21:18,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:21:18,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1570268773, now seen corresponding path program 1 times [2023-11-12 02:21:18,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:21:18,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345935102] [2023-11-12 02:21:18,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:21:18,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:21:18,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:18,488 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-12 02:21:18,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:21:18,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345935102] [2023-11-12 02:21:18,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345935102] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:21:18,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:21:18,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:21:18,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306403220] [2023-11-12 02:21:18,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:21:18,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:21:18,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:21:18,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:21:18,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:21:18,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 251 [2023-11-12 02:21:18,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 323 flow. Second operand has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:18,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:21:18,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 251 [2023-11-12 02:21:18,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:21:18,710 INFO L124 PetriNetUnfolderBase]: 308/622 cut-off events. [2023-11-12 02:21:18,711 INFO L125 PetriNetUnfolderBase]: For 1018/1045 co-relation queries the response was YES. [2023-11-12 02:21:18,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2407 conditions, 622 events. 308/622 cut-off events. For 1018/1045 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3061 event pairs, 43 based on Foata normal form. 88/699 useless extension candidates. Maximal degree in co-relation 2391. Up to 269 conditions per place. [2023-11-12 02:21:18,718 INFO L140 encePairwiseOnDemand]: 246/251 looper letters, 57 selfloop transitions, 7 changer transitions 6/79 dead transitions. [2023-11-12 02:21:18,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 79 transitions, 676 flow [2023-11-12 02:21:18,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:21:18,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-12 02:21:18,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 475 transitions. [2023-11-12 02:21:18,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47310756972111556 [2023-11-12 02:21:18,722 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 475 transitions. [2023-11-12 02:21:18,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 475 transitions. [2023-11-12 02:21:18,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:21:18,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 475 transitions. [2023-11-12 02:21:18,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:18,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:18,728 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:18,728 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 323 flow. Second operand 4 states and 475 transitions. [2023-11-12 02:21:18,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 79 transitions, 676 flow [2023-11-12 02:21:18,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 79 transitions, 663 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-11-12 02:21:18,735 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 326 flow [2023-11-12 02:21:18,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=326, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2023-11-12 02:21:18,736 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 15 predicate places. [2023-11-12 02:21:18,737 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 326 flow [2023-11-12 02:21:18,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:18,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:21:18,738 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:21:18,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 02:21:18,738 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 02:21:18,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:21:18,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1846370911, now seen corresponding path program 1 times [2023-11-12 02:21:18,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:21:18,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759394400] [2023-11-12 02:21:18,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:21:18,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:21:18,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:19,071 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-12 02:21:19,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:21:19,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759394400] [2023-11-12 02:21:19,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759394400] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:21:19,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:21:19,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:21:19,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277964774] [2023-11-12 02:21:19,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:21:19,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:21:19,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:21:19,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:21:19,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:21:19,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 251 [2023-11-12 02:21:19,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 326 flow. Second operand has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:19,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:21:19,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 251 [2023-11-12 02:21:19,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:21:19,294 INFO L124 PetriNetUnfolderBase]: 237/488 cut-off events. [2023-11-12 02:21:19,294 INFO L125 PetriNetUnfolderBase]: For 1152/1182 co-relation queries the response was YES. [2023-11-12 02:21:19,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2059 conditions, 488 events. 237/488 cut-off events. For 1152/1182 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2385 event pairs, 34 based on Foata normal form. 48/527 useless extension candidates. Maximal degree in co-relation 2042. Up to 193 conditions per place. [2023-11-12 02:21:19,300 INFO L140 encePairwiseOnDemand]: 246/251 looper letters, 49 selfloop transitions, 10 changer transitions 9/75 dead transitions. [2023-11-12 02:21:19,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 75 transitions, 647 flow [2023-11-12 02:21:19,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:21:19,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:21:19,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 583 transitions. [2023-11-12 02:21:19,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4645418326693227 [2023-11-12 02:21:19,304 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 583 transitions. [2023-11-12 02:21:19,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 583 transitions. [2023-11-12 02:21:19,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:21:19,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 583 transitions. [2023-11-12 02:21:19,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.6) internal successors, (583), 5 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:19,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:19,312 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:19,313 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 326 flow. Second operand 5 states and 583 transitions. [2023-11-12 02:21:19,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 75 transitions, 647 flow [2023-11-12 02:21:19,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 75 transitions, 616 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-11-12 02:21:19,319 INFO L231 Difference]: Finished difference. Result has 57 places, 40 transitions, 283 flow [2023-11-12 02:21:19,319 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=283, PETRI_PLACES=57, PETRI_TRANSITIONS=40} [2023-11-12 02:21:19,320 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 17 predicate places. [2023-11-12 02:21:19,320 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 40 transitions, 283 flow [2023-11-12 02:21:19,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:19,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:21:19,321 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:21:19,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-12 02:21:19,322 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 02:21:19,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:21:19,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1687519678, now seen corresponding path program 1 times [2023-11-12 02:21:19,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:21:19,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432383912] [2023-11-12 02:21:19,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:21:19,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:21:19,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:19,633 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-12 02:21:19,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:21:19,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432383912] [2023-11-12 02:21:19,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432383912] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:21:19,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:21:19,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:21:19,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807473400] [2023-11-12 02:21:19,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:21:19,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:21:19,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:21:19,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:21:19,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:21:19,641 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 251 [2023-11-12 02:21:19,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 40 transitions, 283 flow. Second operand has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:19,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:21:19,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 251 [2023-11-12 02:21:19,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:21:19,788 INFO L124 PetriNetUnfolderBase]: 135/289 cut-off events. [2023-11-12 02:21:19,788 INFO L125 PetriNetUnfolderBase]: For 821/822 co-relation queries the response was YES. [2023-11-12 02:21:19,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1295 conditions, 289 events. 135/289 cut-off events. For 821/822 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1074 event pairs, 27 based on Foata normal form. 2/291 useless extension candidates. Maximal degree in co-relation 1278. Up to 172 conditions per place. [2023-11-12 02:21:19,791 INFO L140 encePairwiseOnDemand]: 248/251 looper letters, 28 selfloop transitions, 1 changer transitions 34/65 dead transitions. [2023-11-12 02:21:19,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 65 transitions, 568 flow [2023-11-12 02:21:19,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:21:19,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-12 02:21:19,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 469 transitions. [2023-11-12 02:21:19,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46713147410358563 [2023-11-12 02:21:19,795 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 469 transitions. [2023-11-12 02:21:19,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 469 transitions. [2023-11-12 02:21:19,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:21:19,795 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 469 transitions. [2023-11-12 02:21:19,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:19,800 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:19,801 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:19,802 INFO L175 Difference]: Start difference. First operand has 57 places, 40 transitions, 283 flow. Second operand 4 states and 469 transitions. [2023-11-12 02:21:19,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 65 transitions, 568 flow [2023-11-12 02:21:19,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 65 transitions, 494 flow, removed 17 selfloop flow, removed 5 redundant places. [2023-11-12 02:21:19,807 INFO L231 Difference]: Finished difference. Result has 57 places, 29 transitions, 167 flow [2023-11-12 02:21:19,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=167, PETRI_PLACES=57, PETRI_TRANSITIONS=29} [2023-11-12 02:21:19,808 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 17 predicate places. [2023-11-12 02:21:19,808 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 29 transitions, 167 flow [2023-11-12 02:21:19,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:19,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:21:19,809 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:21:19,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-12 02:21:19,809 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 02:21:19,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:21:19,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1471893034, now seen corresponding path program 2 times [2023-11-12 02:21:19,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:21:19,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627044329] [2023-11-12 02:21:19,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:21:19,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:21:19,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:21,038 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-12 02:21:21,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:21:21,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627044329] [2023-11-12 02:21:21,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627044329] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:21:21,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:21:21,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:21:21,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043864033] [2023-11-12 02:21:21,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:21:21,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 02:21:21,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:21:21,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 02:21:21,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:21:21,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 251 [2023-11-12 02:21:21,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 29 transitions, 167 flow. Second operand has 8 states, 8 states have (on average 104.375) internal successors, (835), 8 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:21,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:21:21,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 251 [2023-11-12 02:21:21,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:21:21,420 INFO L124 PetriNetUnfolderBase]: 55/136 cut-off events. [2023-11-12 02:21:21,420 INFO L125 PetriNetUnfolderBase]: For 247/247 co-relation queries the response was YES. [2023-11-12 02:21:21,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 555 conditions, 136 events. 55/136 cut-off events. For 247/247 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 380 event pairs, 16 based on Foata normal form. 1/137 useless extension candidates. Maximal degree in co-relation 537. Up to 70 conditions per place. [2023-11-12 02:21:21,422 INFO L140 encePairwiseOnDemand]: 244/251 looper letters, 25 selfloop transitions, 7 changer transitions 15/49 dead transitions. [2023-11-12 02:21:21,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 49 transitions, 367 flow [2023-11-12 02:21:21,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:21:21,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-12 02:21:21,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 746 transitions. [2023-11-12 02:21:21,426 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42458736482640863 [2023-11-12 02:21:21,426 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 746 transitions. [2023-11-12 02:21:21,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 746 transitions. [2023-11-12 02:21:21,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:21:21,427 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 746 transitions. [2023-11-12 02:21:21,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 106.57142857142857) internal successors, (746), 7 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:21,434 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:21,435 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:21,436 INFO L175 Difference]: Start difference. First operand has 57 places, 29 transitions, 167 flow. Second operand 7 states and 746 transitions. [2023-11-12 02:21:21,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 49 transitions, 367 flow [2023-11-12 02:21:21,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 49 transitions, 330 flow, removed 5 selfloop flow, removed 12 redundant places. [2023-11-12 02:21:21,439 INFO L231 Difference]: Finished difference. Result has 51 places, 29 transitions, 154 flow [2023-11-12 02:21:21,439 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=154, PETRI_PLACES=51, PETRI_TRANSITIONS=29} [2023-11-12 02:21:21,440 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2023-11-12 02:21:21,440 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 29 transitions, 154 flow [2023-11-12 02:21:21,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 104.375) internal successors, (835), 8 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:21,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:21:21,441 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:21:21,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-12 02:21:21,442 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 02:21:21,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:21:21,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1110721928, now seen corresponding path program 3 times [2023-11-12 02:21:21,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:21:21,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228763250] [2023-11-12 02:21:21,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:21:21,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:21:21,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:21:21,510 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:21:21,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:21:21,609 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:21:21,610 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-12 02:21:21,611 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-12 02:21:21,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-12 02:21:21,613 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-12 02:21:21,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-12 02:21:21,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-12 02:21:21,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-12 02:21:21,614 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-12 02:21:21,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-12 02:21:21,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-12 02:21:21,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-12 02:21:21,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-12 02:21:21,615 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-12 02:21:21,616 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-12 02:21:21,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-12 02:21:21,616 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:21:21,623 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-12 02:21:21,623 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 02:21:21,695 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-12 02:21:21,698 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-12 02:21:21,700 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-12 02:21:21,719 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-12 02:21:21,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:21:21 BasicIcfg [2023-11-12 02:21:21,740 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 02:21:21,741 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 02:21:21,741 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 02:21:21,741 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 02:21:21,742 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:21:01" (3/4) ... [2023-11-12 02:21:21,743 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-12 02:21:21,745 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 02:21:21,745 INFO L158 Benchmark]: Toolchain (without parser) took 21814.40ms. Allocated memory was 159.4MB in the beginning and 423.6MB in the end (delta: 264.2MB). Free memory was 111.9MB in the beginning and 371.6MB in the end (delta: -259.8MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2023-11-12 02:21:21,745 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 159.4MB. Free memory is still 105.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:21:21,746 INFO L158 Benchmark]: CACSL2BoogieTranslator took 744.67ms. Allocated memory is still 159.4MB. Free memory was 111.9MB in the beginning and 87.3MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-12 02:21:21,746 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.26ms. Allocated memory is still 159.4MB. Free memory was 87.3MB in the beginning and 84.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:21:21,747 INFO L158 Benchmark]: Boogie Preprocessor took 41.96ms. Allocated memory is still 159.4MB. Free memory was 84.3MB in the beginning and 82.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:21:21,747 INFO L158 Benchmark]: RCFGBuilder took 1081.32ms. Allocated memory was 159.4MB in the beginning and 201.3MB in the end (delta: 41.9MB). Free memory was 82.4MB in the beginning and 141.8MB in the end (delta: -59.4MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. [2023-11-12 02:21:21,748 INFO L158 Benchmark]: TraceAbstraction took 19836.13ms. Allocated memory was 201.3MB in the beginning and 423.6MB in the end (delta: 222.3MB). Free memory was 141.8MB in the beginning and 372.7MB in the end (delta: -230.9MB). Peak memory consumption was 230.5MB. Max. memory is 16.1GB. [2023-11-12 02:21:21,748 INFO L158 Benchmark]: Witness Printer took 3.75ms. Allocated memory is still 423.6MB. Free memory is still 371.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:21:21,750 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.28ms. Allocated memory is still 159.4MB. Free memory is still 105.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 744.67ms. Allocated memory is still 159.4MB. Free memory was 111.9MB in the beginning and 87.3MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.26ms. Allocated memory is still 159.4MB. Free memory was 87.3MB in the beginning and 84.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.96ms. Allocated memory is still 159.4MB. Free memory was 84.3MB in the beginning and 82.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1081.32ms. Allocated memory was 159.4MB in the beginning and 201.3MB in the end (delta: 41.9MB). Free memory was 82.4MB in the beginning and 141.8MB in the end (delta: -59.4MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. * TraceAbstraction took 19836.13ms. Allocated memory was 201.3MB in the beginning and 423.6MB in the end (delta: 222.3MB). Free memory was 141.8MB in the beginning and 372.7MB in the end (delta: -230.9MB). Peak memory consumption was 230.5MB. Max. memory is 16.1GB. * Witness Printer took 3.75ms. Allocated memory is still 423.6MB. Free memory is still 371.6MB. 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: 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: 7.4s, 130 PlacesBefore, 40 PlacesAfterwards, 123 TransitionsBefore, 30 TransitionsAfterwards, 2464 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 68 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 3 ChoiceCompositions, 125 TotalNumberOfCompositions, 6611 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3028, independent: 2833, independent conditional: 0, independent unconditional: 2833, dependent: 195, dependent conditional: 0, dependent unconditional: 195, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1354, independent: 1298, independent conditional: 0, independent unconditional: 1298, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3028, independent: 1535, independent conditional: 0, independent unconditional: 1535, dependent: 139, dependent conditional: 0, dependent unconditional: 139, unknown: 1354, unknown conditional: 0, unknown unconditional: 1354] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 77, Positive conditional cache size: 0, Positive unconditional cache size: 77, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L831] 0 pthread_t t763; [L832] FCALL, FORK 0 pthread_create(&t763, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t763={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L833] 0 pthread_t t764; [L834] FCALL, FORK 0 pthread_create(&t764, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t763={5:0}, t764={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L835] 0 pthread_t t765; [L836] FCALL, FORK 0 pthread_create(&t765, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t763={5:0}, t764={6:0}, t765={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 2 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L782] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L782] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L783] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L784] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L785] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L786] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L787] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 y$flush_delayed = weak$$choice2 [L793] 3 y$mem_tmp = y [L794] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L795] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L796] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L797] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L798] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L800] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EAX = y [L802] 3 y = y$flush_delayed ? y$mem_tmp : y [L803] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L806] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L758] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L761] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L764] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L765] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L767] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L809] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L810] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L811] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L812] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L813] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L843] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L844] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L845] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L846] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t763={5:0}, t764={6:0}, t765={3:0}, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L849] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L850] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L851] 0 y$flush_delayed = weak$$choice2 [L852] 0 y$mem_tmp = y [L853] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L854] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L855] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L856] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L857] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L858] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L859] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L860] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L861] 0 y = y$flush_delayed ? y$mem_tmp : y [L862] 0 y$flush_delayed = (_Bool)0 [L864] 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", "mix028_tso.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] - 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: 829]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 836]: 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: 834]: 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: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 152 locations, 13 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: 19.6s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 381 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 263 mSDsluCounter, 146 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 89 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 832 IncrementalHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 57 mSDtfsCounter, 832 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=326occurred in iteration=9, InterpolantAutomatonStates: 49, 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.5s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 169 NumberOfCodeBlocks, 169 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 136 ConstructedInterpolants, 0 QuantifiedInterpolants, 1401 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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-12 02:21:21,797 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6eef98e-2844-4d03-b78f-bda20c90e05c/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6eef98e-2844-4d03-b78f-bda20c90e05c/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6eef98e-2844-4d03-b78f-bda20c90e05c/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6eef98e-2844-4d03-b78f-bda20c90e05c/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6eef98e-2844-4d03-b78f-bda20c90e05c/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix028_tso.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6eef98e-2844-4d03-b78f-bda20c90e05c/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6eef98e-2844-4d03-b78f-bda20c90e05c/bin/uautomizer-verify-uTZkv6EMXl --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 381687e0b1f81c1857e97f802385548d8501e57e279b70a993237277b7cd3e3a --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:21:24,578 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:21:24,695 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6eef98e-2844-4d03-b78f-bda20c90e05c/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-12 02:21:24,720 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:21:24,720 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:21:24,770 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:21:24,771 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:21:24,771 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:21:24,772 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:21:24,777 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:21:24,778 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:21:24,779 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:21:24,779 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:21:24,781 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:21:24,781 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:21:24,782 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:21:24,782 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:21:24,783 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:21:24,783 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-12 02:21:24,784 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-12 02:21:24,784 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-12 02:21:24,785 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:21:24,785 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 02:21:24,786 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-12 02:21:24,786 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-12 02:21:24,787 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 02:21:24,787 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:21:24,787 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:21:24,788 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:21:24,789 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:21:24,790 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:21:24,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:21:24,790 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:21:24,791 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:21:24,791 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-12 02:21:24,791 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-12 02:21:24,792 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:21:24,792 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:21:24,792 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:21:24,793 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-12 02:21:24,793 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:21:24,794 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_f6eef98e-2844-4d03-b78f-bda20c90e05c/bin/uautomizer-verify-uTZkv6EMXl/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_f6eef98e-2844-4d03-b78f-bda20c90e05c/bin/uautomizer-verify-uTZkv6EMXl 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 -> 381687e0b1f81c1857e97f802385548d8501e57e279b70a993237277b7cd3e3a [2023-11-12 02:21:25,174 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:21:25,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:21:25,212 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:21:25,213 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:21:25,214 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:21:25,215 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6eef98e-2844-4d03-b78f-bda20c90e05c/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/pthread-wmm/mix028_tso.i [2023-11-12 02:21:28,458 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:21:28,927 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:21:28,928 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6eef98e-2844-4d03-b78f-bda20c90e05c/sv-benchmarks/c/pthread-wmm/mix028_tso.i [2023-11-12 02:21:28,953 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6eef98e-2844-4d03-b78f-bda20c90e05c/bin/uautomizer-verify-uTZkv6EMXl/data/3db31ae56/eb92619b375b45e1b14195ed06a1f546/FLAGe6e6c6a0f [2023-11-12 02:21:28,980 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6eef98e-2844-4d03-b78f-bda20c90e05c/bin/uautomizer-verify-uTZkv6EMXl/data/3db31ae56/eb92619b375b45e1b14195ed06a1f546 [2023-11-12 02:21:28,986 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:21:28,989 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:21:28,993 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:21:28,993 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:21:28,999 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:21:29,000 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:21:28" (1/1) ... [2023-11-12 02:21:29,001 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ce1834d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:29, skipping insertion in model container [2023-11-12 02:21:29,002 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:21:28" (1/1) ... [2023-11-12 02:21:29,081 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:21:29,672 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:21:29,692 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:21:29,835 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:21:29,886 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:21:29,886 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:21:29,894 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:21:29,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:29 WrapperNode [2023-11-12 02:21:29,895 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:21:29,896 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:21:29,896 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:21:29,896 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:21:29,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:29" (1/1) ... [2023-11-12 02:21:29,927 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:29" (1/1) ... [2023-11-12 02:21:29,968 INFO L138 Inliner]: procedures = 179, calls = 57, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 171 [2023-11-12 02:21:29,968 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:21:29,969 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:21:29,969 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:21:29,969 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:21:29,979 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:29" (1/1) ... [2023-11-12 02:21:29,979 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:29" (1/1) ... [2023-11-12 02:21:29,984 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:29" (1/1) ... [2023-11-12 02:21:29,985 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:29" (1/1) ... [2023-11-12 02:21:30,002 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:29" (1/1) ... [2023-11-12 02:21:30,021 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:29" (1/1) ... [2023-11-12 02:21:30,027 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:29" (1/1) ... [2023-11-12 02:21:30,038 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:29" (1/1) ... [2023-11-12 02:21:30,043 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:21:30,058 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:21:30,058 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:21:30,058 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:21:30,059 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:29" (1/1) ... [2023-11-12 02:21:30,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:21:30,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6eef98e-2844-4d03-b78f-bda20c90e05c/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:21:30,108 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6eef98e-2844-4d03-b78f-bda20c90e05c/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:21:30,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6eef98e-2844-4d03-b78f-bda20c90e05c/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:21:30,160 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-12 02:21:30,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:21:30,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 02:21:30,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 02:21:30,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-12 02:21:30,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-12 02:21:30,162 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-12 02:21:30,163 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-12 02:21:30,163 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-12 02:21:30,163 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-12 02:21:30,163 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-12 02:21:30,163 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-12 02:21:30,164 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-12 02:21:30,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:21:30,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:21:30,166 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-12 02:21:30,324 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:21:30,327 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:21:30,802 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:21:31,034 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:21:31,035 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-12 02:21:31,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:21:31 BoogieIcfgContainer [2023-11-12 02:21:31,039 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:21:31,042 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:21:31,043 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:21:31,046 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:21:31,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:21:28" (1/3) ... [2023-11-12 02:21:31,047 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55d72ecb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:21:31, skipping insertion in model container [2023-11-12 02:21:31,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:21:29" (2/3) ... [2023-11-12 02:21:31,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55d72ecb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:21:31, skipping insertion in model container [2023-11-12 02:21:31,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:21:31" (3/3) ... [2023-11-12 02:21:31,051 INFO L112 eAbstractionObserver]: Analyzing ICFG mix028_tso.i [2023-11-12 02:21:31,073 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:21:31,073 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-12 02:21:31,073 INFO L521 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-12 02:21:31,150 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-12 02:21:31,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 127 transitions, 266 flow [2023-11-12 02:21:31,296 INFO L124 PetriNetUnfolderBase]: 3/124 cut-off events. [2023-11-12 02:21:31,297 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:21:31,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 124 events. 3/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2023-11-12 02:21:31,303 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 127 transitions, 266 flow [2023-11-12 02:21:31,312 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 124 transitions, 257 flow [2023-11-12 02:21:31,316 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-12 02:21:31,339 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 124 transitions, 257 flow [2023-11-12 02:21:31,344 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 124 transitions, 257 flow [2023-11-12 02:21:31,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 124 transitions, 257 flow [2023-11-12 02:21:31,380 INFO L124 PetriNetUnfolderBase]: 3/124 cut-off events. [2023-11-12 02:21:31,381 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:21:31,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 124 events. 3/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2023-11-12 02:21:31,385 INFO L119 LiptonReduction]: Number of co-enabled transitions 2464 [2023-11-12 02:21:41,622 INFO L134 LiptonReduction]: Checked pairs total: 6814 [2023-11-12 02:21:41,624 INFO L136 LiptonReduction]: Total number of compositions: 127 [2023-11-12 02:21:41,651 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:21:41,663 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;@3dbef792, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:21:41,663 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-12 02:21:41,665 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-12 02:21:41,665 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-12 02:21:41,666 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:21:41,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:21:41,667 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-12 02:21:41,667 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-12 02:21:41,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:21:41,673 INFO L85 PathProgramCache]: Analyzing trace with hash 595, now seen corresponding path program 1 times [2023-11-12 02:21:41,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-12 02:21:41,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [547601024] [2023-11-12 02:21:41,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:21:41,687 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-12 02:21:41,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6eef98e-2844-4d03-b78f-bda20c90e05c/bin/uautomizer-verify-uTZkv6EMXl/mathsat [2023-11-12 02:21:41,699 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6eef98e-2844-4d03-b78f-bda20c90e05c/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-12 02:21:41,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f6eef98e-2844-4d03-b78f-bda20c90e05c/bin/uautomizer-verify-uTZkv6EMXl/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-12 02:21:41,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:21:41,816 INFO L262 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-12 02:21:41,819 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:21:41,824 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-12 02:21:41,824 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-12 02:21:41,825 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-12 02:21:41,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [547601024] [2023-11-12 02:21:41,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [547601024] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:21:41,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:21:41,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-12 02:21:41,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098051125] [2023-11-12 02:21:41,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:21:41,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 02:21:41,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-12 02:21:41,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:21:41,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:21:41,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 254 [2023-11-12 02:21:41,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 75 flow. Second operand has 2 states, 2 states have (on average 113.5) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:21:41,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:21:41,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 254 [2023-11-12 02:21:41,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:21:42,350 INFO L124 PetriNetUnfolderBase]: 1263/1922 cut-off events. [2023-11-12 02:21:42,350 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-12 02:21:42,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3829 conditions, 1922 events. 1263/1922 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 9508 event pairs, 1263 based on Foata normal form. 72/1666 useless extension candidates. Maximal degree in co-relation 3818. Up to 1871 conditions per place. [2023-11-12 02:21:42,376 INFO L140 encePairwiseOnDemand]: 247/254 looper letters, 23 selfloop transitions, 0 changer transitions 0/26 dead transitions. [2023-11-12 02:21:42,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 107 flow [2023-11-12 02:21:42,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:21:42,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states.