./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix039.opt.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_65d31430-0d5a-464d-a0e8-32e88dc2c011/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d31430-0d5a-464d-a0e8-32e88dc2c011/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_65d31430-0d5a-464d-a0e8-32e88dc2c011/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d31430-0d5a-464d-a0e8-32e88dc2c011/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix039.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d31430-0d5a-464d-a0e8-32e88dc2c011/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_65d31430-0d5a-464d-a0e8-32e88dc2c011/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 4df22382a468f75ea1bc6624bacd8789c0b9b9f8aa1bc2866cf2715dcbc507bc --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:31:20,312 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:31:20,390 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d31430-0d5a-464d-a0e8-32e88dc2c011/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-12 02:31:20,396 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:31:20,397 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:31:20,424 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:31:20,425 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:31:20,426 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:31:20,427 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:31:20,428 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:31:20,429 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:31:20,429 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:31:20,430 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:31:20,431 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:31:20,431 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:31:20,432 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:31:20,433 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:31:20,433 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:31:20,434 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-12 02:31:20,435 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-12 02:31:20,435 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-12 02:31:20,436 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:31:20,437 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 02:31:20,438 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 02:31:20,438 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:31:20,439 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:31:20,439 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:31:20,440 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:31:20,440 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:31:20,441 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:31:20,442 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:31:20,442 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:31:20,443 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:31:20,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:31:20,444 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:31:20,444 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:31:20,444 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:31:20,445 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:31:20,445 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_65d31430-0d5a-464d-a0e8-32e88dc2c011/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_65d31430-0d5a-464d-a0e8-32e88dc2c011/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 -> 4df22382a468f75ea1bc6624bacd8789c0b9b9f8aa1bc2866cf2715dcbc507bc [2023-11-12 02:31:20,684 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:31:20,709 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:31:20,712 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:31:20,713 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:31:20,714 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:31:20,715 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d31430-0d5a-464d-a0e8-32e88dc2c011/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/pthread-wmm/mix039.opt.i [2023-11-12 02:31:24,010 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:31:24,366 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:31:24,367 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d31430-0d5a-464d-a0e8-32e88dc2c011/sv-benchmarks/c/pthread-wmm/mix039.opt.i [2023-11-12 02:31:24,394 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d31430-0d5a-464d-a0e8-32e88dc2c011/bin/uautomizer-verify-uTZkv6EMXl/data/343f3f3f6/54bf432b7b564f4990e6711d6d41dcec/FLAG6030a0a0a [2023-11-12 02:31:24,417 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d31430-0d5a-464d-a0e8-32e88dc2c011/bin/uautomizer-verify-uTZkv6EMXl/data/343f3f3f6/54bf432b7b564f4990e6711d6d41dcec [2023-11-12 02:31:24,423 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:31:24,428 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:31:24,431 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:31:24,431 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:31:24,437 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:31:24,440 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:31:24" (1/1) ... [2023-11-12 02:31:24,441 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6989ef06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:31:24, skipping insertion in model container [2023-11-12 02:31:24,441 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:31:24" (1/1) ... [2023-11-12 02:31:24,513 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:31:24,997 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:31:25,010 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:31:25,068 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:31:25,104 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:31:25,104 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:31:25,113 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:31:25,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:31:25 WrapperNode [2023-11-12 02:31:25,114 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:31:25,115 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:31:25,115 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:31:25,131 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:31:25,143 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:31:25" (1/1) ... [2023-11-12 02:31:25,161 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:31:25" (1/1) ... [2023-11-12 02:31:25,193 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 157 [2023-11-12 02:31:25,194 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:31:25,194 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:31:25,195 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:31:25,195 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:31:25,206 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:31:25" (1/1) ... [2023-11-12 02:31:25,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:31:25" (1/1) ... [2023-11-12 02:31:25,212 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:31:25" (1/1) ... [2023-11-12 02:31:25,213 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:31:25" (1/1) ... [2023-11-12 02:31:25,226 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:31:25" (1/1) ... [2023-11-12 02:31:25,229 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:31:25" (1/1) ... [2023-11-12 02:31:25,233 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:31:25" (1/1) ... [2023-11-12 02:31:25,235 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:31:25" (1/1) ... [2023-11-12 02:31:25,241 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:31:25,242 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:31:25,242 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:31:25,242 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:31:25,243 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:31:25" (1/1) ... [2023-11-12 02:31:25,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:31:25,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d31430-0d5a-464d-a0e8-32e88dc2c011/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:31:25,289 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d31430-0d5a-464d-a0e8-32e88dc2c011/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:31:25,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d31430-0d5a-464d-a0e8-32e88dc2c011/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:31:25,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:31:25,328 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-12 02:31:25,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:31:25,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 02:31:25,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 02:31:25,329 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-12 02:31:25,329 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-12 02:31:25,330 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-12 02:31:25,330 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-12 02:31:25,330 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-12 02:31:25,330 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-12 02:31:25,330 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-12 02:31:25,331 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-12 02:31:25,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:31:25,331 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-12 02:31:25,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:31:25,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:31:25,333 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:31:25,495 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:31:25,497 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:31:25,888 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:31:26,109 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:31:26,109 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-12 02:31:26,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:31:26 BoogieIcfgContainer [2023-11-12 02:31:26,113 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:31:26,119 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:31:26,120 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:31:26,124 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:31:26,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:31:24" (1/3) ... [2023-11-12 02:31:26,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ac151f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:31:26, skipping insertion in model container [2023-11-12 02:31:26,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:31:25" (2/3) ... [2023-11-12 02:31:26,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ac151f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:31:26, skipping insertion in model container [2023-11-12 02:31:26,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:31:26" (3/3) ... [2023-11-12 02:31:26,130 INFO L112 eAbstractionObserver]: Analyzing ICFG mix039.opt.i [2023-11-12 02:31:26,155 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:31:26,157 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-12 02:31:26,158 INFO L521 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-12 02:31:26,252 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-12 02:31:26,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 150 transitions, 316 flow [2023-11-12 02:31:26,430 INFO L124 PetriNetUnfolderBase]: 3/146 cut-off events. [2023-11-12 02:31:26,431 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:31:26,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 3/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 108 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 104. Up to 2 conditions per place. [2023-11-12 02:31:26,437 INFO L82 GeneralOperation]: Start removeDead. Operand has 160 places, 150 transitions, 316 flow [2023-11-12 02:31:26,448 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 156 places, 146 transitions, 304 flow [2023-11-12 02:31:26,453 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-12 02:31:26,473 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 146 transitions, 304 flow [2023-11-12 02:31:26,475 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 146 transitions, 304 flow [2023-11-12 02:31:26,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 146 transitions, 304 flow [2023-11-12 02:31:26,515 INFO L124 PetriNetUnfolderBase]: 3/146 cut-off events. [2023-11-12 02:31:26,515 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:31:26,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 3/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 109 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 104. Up to 2 conditions per place. [2023-11-12 02:31:26,520 INFO L119 LiptonReduction]: Number of co-enabled transitions 3632 [2023-11-12 02:31:32,656 INFO L134 LiptonReduction]: Checked pairs total: 8653 [2023-11-12 02:31:32,657 INFO L136 LiptonReduction]: Total number of compositions: 157 [2023-11-12 02:31:32,672 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:31:32,680 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;@58e136a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:31:32,680 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-12 02:31:32,682 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-12 02:31:32,682 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-12 02:31:32,682 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:31:32,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:31:32,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-12 02:31:32,684 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 02:31:32,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:32,689 INFO L85 PathProgramCache]: Analyzing trace with hash 639, now seen corresponding path program 1 times [2023-11-12 02:31:32,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:32,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352765920] [2023-11-12 02:31:32,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:32,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:32,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:32,821 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:31:32,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:31:32,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352765920] [2023-11-12 02:31:32,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352765920] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:31:32,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:31:32,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-12 02:31:32,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161378355] [2023-11-12 02:31:32,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:31:32,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 02:31:32,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:31:32,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:31:32,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:31:32,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 307 [2023-11-12 02:31:32,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 88 flow. Second operand has 2 states, 2 states have (on average 137.5) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:31:32,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:31:32,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 307 [2023-11-12 02:31:32,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:31:33,946 INFO L124 PetriNetUnfolderBase]: 4373/6098 cut-off events. [2023-11-12 02:31:33,946 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-11-12 02:31:33,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12184 conditions, 6098 events. 4373/6098 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 31111 event pairs, 4373 based on Foata normal form. 0/5338 useless extension candidates. Maximal degree in co-relation 12172. Up to 5983 conditions per place. [2023-11-12 02:31:34,010 INFO L140 encePairwiseOnDemand]: 298/307 looper letters, 26 selfloop transitions, 0 changer transitions 0/29 dead transitions. [2023-11-12 02:31:34,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 29 transitions, 122 flow [2023-11-12 02:31:34,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:31:34,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-12 02:31:34,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 309 transitions. [2023-11-12 02:31:34,033 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.503257328990228 [2023-11-12 02:31:34,034 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 309 transitions. [2023-11-12 02:31:34,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 309 transitions. [2023-11-12 02:31:34,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:31:34,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 309 transitions. [2023-11-12 02:31:34,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 154.5) internal successors, (309), 2 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:31:34,054 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 307.0) internal successors, (921), 3 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:31:34,055 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 307.0) internal successors, (921), 3 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:31:34,057 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 88 flow. Second operand 2 states and 309 transitions. [2023-11-12 02:31:34,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 29 transitions, 122 flow [2023-11-12 02:31:34,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-12 02:31:34,066 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 66 flow [2023-11-12 02:31:34,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2023-11-12 02:31:34,074 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -11 predicate places. [2023-11-12 02:31:34,074 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 66 flow [2023-11-12 02:31:34,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 137.5) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:31:34,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:31:34,075 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:31:34,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:31:34,075 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 02:31:34,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:34,087 INFO L85 PathProgramCache]: Analyzing trace with hash 201394592, now seen corresponding path program 1 times [2023-11-12 02:31:34,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:34,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58494521] [2023-11-12 02:31:34,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:34,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:34,570 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:31:34,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:31:34,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58494521] [2023-11-12 02:31:34,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58494521] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:31:34,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:31:34,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 02:31:34,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9967817] [2023-11-12 02:31:34,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:31:34,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:31:34,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:31:34,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:31:34,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:31:34,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 307 [2023-11-12 02:31:34,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 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:31:34,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:31:34,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 307 [2023-11-12 02:31:34,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:31:35,491 INFO L124 PetriNetUnfolderBase]: 3632/5249 cut-off events. [2023-11-12 02:31:35,491 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:31:35,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10339 conditions, 5249 events. 3632/5249 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 28263 event pairs, 668 based on Foata normal form. 0/4885 useless extension candidates. Maximal degree in co-relation 10336. Up to 3973 conditions per place. [2023-11-12 02:31:35,540 INFO L140 encePairwiseOnDemand]: 304/307 looper letters, 34 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2023-11-12 02:31:35,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 41 transitions, 166 flow [2023-11-12 02:31:35,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:31:35,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:31:35,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 447 transitions. [2023-11-12 02:31:35,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48534201954397393 [2023-11-12 02:31:35,547 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 447 transitions. [2023-11-12 02:31:35,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 447 transitions. [2023-11-12 02:31:35,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:31:35,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 447 transitions. [2023-11-12 02:31:35,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states 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:31:35,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:31:35,559 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:31:35,560 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 66 flow. Second operand 3 states and 447 transitions. [2023-11-12 02:31:35,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 41 transitions, 166 flow [2023-11-12 02:31:35,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 41 transitions, 166 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-12 02:31:35,564 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 66 flow [2023-11-12 02:31:35,564 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2023-11-12 02:31:35,566 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -10 predicate places. [2023-11-12 02:31:35,566 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 66 flow [2023-11-12 02:31:35,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 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:31:35,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:31:35,573 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:31:35,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:31:35,574 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 02:31:35,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:35,577 INFO L85 PathProgramCache]: Analyzing trace with hash 266743191, now seen corresponding path program 1 times [2023-11-12 02:31:35,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:35,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609522033] [2023-11-12 02:31:35,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:35,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:35,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:35,795 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:31:35,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:31:35,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609522033] [2023-11-12 02:31:35,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609522033] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:31:35,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:31:35,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 02:31:35,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249729118] [2023-11-12 02:31:35,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:31:35,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:31:35,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:31:35,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:31:35,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:31:35,806 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 307 [2023-11-12 02:31:35,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:31:35,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:31:35,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 307 [2023-11-12 02:31:35,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:31:36,553 INFO L124 PetriNetUnfolderBase]: 4175/5732 cut-off events. [2023-11-12 02:31:36,553 INFO L125 PetriNetUnfolderBase]: For 276/276 co-relation queries the response was YES. [2023-11-12 02:31:36,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11859 conditions, 5732 events. 4175/5732 cut-off events. For 276/276 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 27503 event pairs, 1165 based on Foata normal form. 0/5506 useless extension candidates. Maximal degree in co-relation 11855. Up to 5234 conditions per place. [2023-11-12 02:31:36,609 INFO L140 encePairwiseOnDemand]: 303/307 looper letters, 39 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2023-11-12 02:31:36,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 44 transitions, 190 flow [2023-11-12 02:31:36,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:31:36,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:31:36,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2023-11-12 02:31:36,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4831704668838219 [2023-11-12 02:31:36,613 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 445 transitions. [2023-11-12 02:31:36,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 445 transitions. [2023-11-12 02:31:36,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:31:36,614 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 445 transitions. [2023-11-12 02:31:36,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states 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:31:36,618 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:31:36,619 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:31:36,619 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 66 flow. Second operand 3 states and 445 transitions. [2023-11-12 02:31:36,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 44 transitions, 190 flow [2023-11-12 02:31:36,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 44 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-12 02:31:36,622 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 81 flow [2023-11-12 02:31:36,623 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2023-11-12 02:31:36,624 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -10 predicate places. [2023-11-12 02:31:36,624 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 81 flow [2023-11-12 02:31:36,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:31:36,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:31:36,625 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:31:36,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:31:36,631 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 02:31:36,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:36,631 INFO L85 PathProgramCache]: Analyzing trace with hash -320897907, now seen corresponding path program 1 times [2023-11-12 02:31:36,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:36,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753481817] [2023-11-12 02:31:36,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:36,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:36,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:36,903 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:31:36,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:31:36,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753481817] [2023-11-12 02:31:36,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753481817] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:31:36,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:31:36,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 02:31:36,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956602408] [2023-11-12 02:31:36,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:31:36,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:31:36,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:31:36,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:31:36,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:31:36,911 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 307 [2023-11-12 02:31:36,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 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:31:36,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:31:36,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 307 [2023-11-12 02:31:36,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:31:37,640 INFO L124 PetriNetUnfolderBase]: 3488/5087 cut-off events. [2023-11-12 02:31:37,640 INFO L125 PetriNetUnfolderBase]: For 441/444 co-relation queries the response was YES. [2023-11-12 02:31:37,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10705 conditions, 5087 events. 3488/5087 cut-off events. For 441/444 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 26418 event pairs, 1328 based on Foata normal form. 84/5167 useless extension candidates. Maximal degree in co-relation 10700. Up to 3013 conditions per place. [2023-11-12 02:31:37,679 INFO L140 encePairwiseOnDemand]: 304/307 looper letters, 35 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2023-11-12 02:31:37,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 41 transitions, 184 flow [2023-11-12 02:31:37,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:31:37,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:31:37,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 441 transitions. [2023-11-12 02:31:37,682 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4788273615635179 [2023-11-12 02:31:37,682 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 441 transitions. [2023-11-12 02:31:37,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 441 transitions. [2023-11-12 02:31:37,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:31:37,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 441 transitions. [2023-11-12 02:31:37,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states 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:31:37,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:31:37,689 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:31:37,689 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 81 flow. Second operand 3 states and 441 transitions. [2023-11-12 02:31:37,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 41 transitions, 184 flow [2023-11-12 02:31:37,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 41 transitions, 180 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-12 02:31:37,692 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 86 flow [2023-11-12 02:31:37,692 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-11-12 02:31:37,694 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -8 predicate places. [2023-11-12 02:31:37,694 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 86 flow [2023-11-12 02:31:37,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 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:31:37,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:31:37,695 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:31:37,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:31:37,696 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 02:31:37,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:37,696 INFO L85 PathProgramCache]: Analyzing trace with hash -320894563, now seen corresponding path program 1 times [2023-11-12 02:31:37,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:37,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233191415] [2023-11-12 02:31:37,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:37,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:37,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:38,538 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:31:38,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:31:38,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233191415] [2023-11-12 02:31:38,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233191415] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:31:38,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:31:38,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:31:38,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055312189] [2023-11-12 02:31:38,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:31:38,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:31:38,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:31:38,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:31:38,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:31:38,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 307 [2023-11-12 02:31:38,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 86 flow. Second operand has 7 states, 7 states have (on average 120.71428571428571) internal successors, (845), 7 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:31:38,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:31:38,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 307 [2023-11-12 02:31:38,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:31:39,861 INFO L124 PetriNetUnfolderBase]: 3440/5035 cut-off events. [2023-11-12 02:31:39,861 INFO L125 PetriNetUnfolderBase]: For 708/708 co-relation queries the response was YES. [2023-11-12 02:31:39,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10979 conditions, 5035 events. 3440/5035 cut-off events. For 708/708 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 26719 event pairs, 354 based on Foata normal form. 225/5260 useless extension candidates. Maximal degree in co-relation 10973. Up to 2923 conditions per place. [2023-11-12 02:31:39,906 INFO L140 encePairwiseOnDemand]: 300/307 looper letters, 54 selfloop transitions, 6 changer transitions 2/66 dead transitions. [2023-11-12 02:31:39,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 66 transitions, 299 flow [2023-11-12 02:31:39,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:31:39,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-12 02:31:39,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 892 transitions. [2023-11-12 02:31:39,910 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4150767798976268 [2023-11-12 02:31:39,910 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 892 transitions. [2023-11-12 02:31:39,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 892 transitions. [2023-11-12 02:31:39,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:31:39,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 892 transitions. [2023-11-12 02:31:39,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.42857142857143) internal successors, (892), 7 states have internal predecessors, (892), 0 states have call successors, (0), 0 states 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:31:39,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 307.0) internal successors, (2456), 8 states have internal predecessors, (2456), 0 states have call successors, (0), 0 states 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:31:39,922 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 307.0) internal successors, (2456), 8 states have internal predecessors, (2456), 0 states have call successors, (0), 0 states 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:31:39,922 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 86 flow. Second operand 7 states and 892 transitions. [2023-11-12 02:31:39,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 66 transitions, 299 flow [2023-11-12 02:31:39,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 66 transitions, 293 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-12 02:31:39,936 INFO L231 Difference]: Finished difference. Result has 48 places, 31 transitions, 109 flow [2023-11-12 02:31:39,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=109, PETRI_PLACES=48, PETRI_TRANSITIONS=31} [2023-11-12 02:31:39,938 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2023-11-12 02:31:39,939 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 31 transitions, 109 flow [2023-11-12 02:31:39,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 120.71428571428571) internal successors, (845), 7 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:31:39,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:31:39,940 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:31:39,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:31:39,940 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 02:31:39,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:39,941 INFO L85 PathProgramCache]: Analyzing trace with hash -890008236, now seen corresponding path program 1 times [2023-11-12 02:31:39,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:39,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142952330] [2023-11-12 02:31:39,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:39,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:39,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:40,182 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:31:40,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:31:40,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142952330] [2023-11-12 02:31:40,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142952330] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:31:40,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:31:40,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:31:40,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369338246] [2023-11-12 02:31:40,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:31:40,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:31:40,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:31:40,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:31:40,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:31:40,206 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 307 [2023-11-12 02:31:40,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 31 transitions, 109 flow. Second operand has 4 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:31:40,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:31:40,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 307 [2023-11-12 02:31:40,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:31:40,881 INFO L124 PetriNetUnfolderBase]: 2808/4195 cut-off events. [2023-11-12 02:31:40,881 INFO L125 PetriNetUnfolderBase]: For 799/801 co-relation queries the response was YES. [2023-11-12 02:31:40,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9854 conditions, 4195 events. 2808/4195 cut-off events. For 799/801 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 22220 event pairs, 565 based on Foata normal form. 225/4415 useless extension candidates. Maximal degree in co-relation 9846. Up to 3168 conditions per place. [2023-11-12 02:31:40,907 INFO L140 encePairwiseOnDemand]: 300/307 looper letters, 57 selfloop transitions, 9 changer transitions 4/74 dead transitions. [2023-11-12 02:31:40,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 74 transitions, 372 flow [2023-11-12 02:31:40,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:31:40,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:31:40,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 716 transitions. [2023-11-12 02:31:40,911 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46644951140065144 [2023-11-12 02:31:40,911 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 716 transitions. [2023-11-12 02:31:40,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 716 transitions. [2023-11-12 02:31:40,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:31:40,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 716 transitions. [2023-11-12 02:31:40,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.2) internal successors, (716), 5 states have internal predecessors, (716), 0 states have call successors, (0), 0 states 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:31:40,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 307.0) internal successors, (1842), 6 states have internal predecessors, (1842), 0 states have call successors, (0), 0 states 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:31:40,918 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 307.0) internal successors, (1842), 6 states have internal predecessors, (1842), 0 states have call successors, (0), 0 states 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:31:40,918 INFO L175 Difference]: Start difference. First operand has 48 places, 31 transitions, 109 flow. Second operand 5 states and 716 transitions. [2023-11-12 02:31:40,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 74 transitions, 372 flow [2023-11-12 02:31:40,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 74 transitions, 356 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-12 02:31:40,922 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 170 flow [2023-11-12 02:31:40,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=170, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2023-11-12 02:31:40,922 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 1 predicate places. [2023-11-12 02:31:40,923 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 170 flow [2023-11-12 02:31:40,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:31:40,923 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:31:40,923 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:31:40,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:31:40,924 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 02:31:40,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:40,924 INFO L85 PathProgramCache]: Analyzing trace with hash -191418732, now seen corresponding path program 1 times [2023-11-12 02:31:40,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:40,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098969727] [2023-11-12 02:31:40,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:40,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:40,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:41,067 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:31:41,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:31:41,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098969727] [2023-11-12 02:31:41,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098969727] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:31:41,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:31:41,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:31:41,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316051416] [2023-11-12 02:31:41,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:31:41,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:31:41,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:31:41,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:31:41,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:31:41,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 307 [2023-11-12 02:31:41,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 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:31:41,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:31:41,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 307 [2023-11-12 02:31:41,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:31:42,055 INFO L124 PetriNetUnfolderBase]: 4088/6093 cut-off events. [2023-11-12 02:31:42,055 INFO L125 PetriNetUnfolderBase]: For 4871/4871 co-relation queries the response was YES. [2023-11-12 02:31:42,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18892 conditions, 6093 events. 4088/6093 cut-off events. For 4871/4871 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 34730 event pairs, 2024 based on Foata normal form. 60/6152 useless extension candidates. Maximal degree in co-relation 18881. Up to 3722 conditions per place. [2023-11-12 02:31:42,101 INFO L140 encePairwiseOnDemand]: 304/307 looper letters, 49 selfloop transitions, 3 changer transitions 12/66 dead transitions. [2023-11-12 02:31:42,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 66 transitions, 422 flow [2023-11-12 02:31:42,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:31:42,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:31:42,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2023-11-12 02:31:42,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48425624321389793 [2023-11-12 02:31:42,104 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2023-11-12 02:31:42,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2023-11-12 02:31:42,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:31:42,105 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2023-11-12 02:31:42,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:31:42,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:31:42,110 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:31:42,110 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 170 flow. Second operand 3 states and 446 transitions. [2023-11-12 02:31:42,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 66 transitions, 422 flow [2023-11-12 02:31:42,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 66 transitions, 413 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-12 02:31:42,119 INFO L231 Difference]: Finished difference. Result has 53 places, 33 transitions, 141 flow [2023-11-12 02:31:42,119 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=141, PETRI_PLACES=53, PETRI_TRANSITIONS=33} [2023-11-12 02:31:42,120 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 3 predicate places. [2023-11-12 02:31:42,120 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 33 transitions, 141 flow [2023-11-12 02:31:42,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 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:31:42,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:31:42,121 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:31:42,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 02:31:42,122 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 02:31:42,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:42,122 INFO L85 PathProgramCache]: Analyzing trace with hash 360776586, now seen corresponding path program 1 times [2023-11-12 02:31:42,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:42,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457600910] [2023-11-12 02:31:42,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:42,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:42,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:42,390 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:31:42,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:31:42,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457600910] [2023-11-12 02:31:42,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457600910] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:31:42,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:31:42,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:31:42,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950446211] [2023-11-12 02:31:42,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:31:42,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:31:42,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:31:42,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:31:42,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:31:42,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 307 [2023-11-12 02:31:42,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 33 transitions, 141 flow. Second operand has 5 states, 5 states have (on average 133.2) internal successors, (666), 5 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:31:42,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:31:42,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 307 [2023-11-12 02:31:42,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:31:43,005 INFO L124 PetriNetUnfolderBase]: 1789/2798 cut-off events. [2023-11-12 02:31:43,005 INFO L125 PetriNetUnfolderBase]: For 2023/2033 co-relation queries the response was YES. [2023-11-12 02:31:43,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8745 conditions, 2798 events. 1789/2798 cut-off events. For 2023/2033 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 14614 event pairs, 255 based on Foata normal form. 207/2994 useless extension candidates. Maximal degree in co-relation 8733. Up to 1407 conditions per place. [2023-11-12 02:31:43,027 INFO L140 encePairwiseOnDemand]: 300/307 looper letters, 50 selfloop transitions, 9 changer transitions 25/88 dead transitions. [2023-11-12 02:31:43,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 88 transitions, 523 flow [2023-11-12 02:31:43,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:31:43,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-12 02:31:43,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 861 transitions. [2023-11-12 02:31:43,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46742671009771986 [2023-11-12 02:31:43,031 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 861 transitions. [2023-11-12 02:31:43,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 861 transitions. [2023-11-12 02:31:43,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:31:43,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 861 transitions. [2023-11-12 02:31:43,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 143.5) internal successors, (861), 6 states have internal predecessors, (861), 0 states have call successors, (0), 0 states 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:31:43,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 307.0) internal successors, (2149), 7 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:31:43,039 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 307.0) internal successors, (2149), 7 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:31:43,039 INFO L175 Difference]: Start difference. First operand has 53 places, 33 transitions, 141 flow. Second operand 6 states and 861 transitions. [2023-11-12 02:31:43,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 88 transitions, 523 flow [2023-11-12 02:31:43,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 88 transitions, 494 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-11-12 02:31:43,053 INFO L231 Difference]: Finished difference. Result has 54 places, 37 transitions, 202 flow [2023-11-12 02:31:43,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=202, PETRI_PLACES=54, PETRI_TRANSITIONS=37} [2023-11-12 02:31:43,054 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 4 predicate places. [2023-11-12 02:31:43,054 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 37 transitions, 202 flow [2023-11-12 02:31:43,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.2) internal successors, (666), 5 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:31:43,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:31:43,055 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:31:43,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 02:31:43,055 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 02:31:43,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:43,056 INFO L85 PathProgramCache]: Analyzing trace with hash 59302480, now seen corresponding path program 1 times [2023-11-12 02:31:43,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:43,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327061090] [2023-11-12 02:31:43,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:43,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:43,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:43,266 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:31:43,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:31:43,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327061090] [2023-11-12 02:31:43,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327061090] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:31:43,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:31:43,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:31:43,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873287742] [2023-11-12 02:31:43,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:31:43,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:31:43,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:31:43,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:31:43,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:31:43,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 307 [2023-11-12 02:31:43,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 37 transitions, 202 flow. Second operand has 6 states, 6 states have (on average 133.0) internal successors, (798), 6 states have internal predecessors, (798), 0 states have call successors, (0), 0 states 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:31:43,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:31:43,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 307 [2023-11-12 02:31:43,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:31:43,734 INFO L124 PetriNetUnfolderBase]: 975/1590 cut-off events. [2023-11-12 02:31:43,734 INFO L125 PetriNetUnfolderBase]: For 2111/2114 co-relation queries the response was YES. [2023-11-12 02:31:43,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5729 conditions, 1590 events. 975/1590 cut-off events. For 2111/2114 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7639 event pairs, 160 based on Foata normal form. 94/1673 useless extension candidates. Maximal degree in co-relation 5716. Up to 646 conditions per place. [2023-11-12 02:31:43,748 INFO L140 encePairwiseOnDemand]: 300/307 looper letters, 59 selfloop transitions, 13 changer transitions 24/100 dead transitions. [2023-11-12 02:31:43,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 100 transitions, 661 flow [2023-11-12 02:31:43,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:31:43,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-12 02:31:43,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1004 transitions. [2023-11-12 02:31:43,752 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.467194043741275 [2023-11-12 02:31:43,753 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1004 transitions. [2023-11-12 02:31:43,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1004 transitions. [2023-11-12 02:31:43,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:31:43,754 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1004 transitions. [2023-11-12 02:31:43,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 143.42857142857142) internal successors, (1004), 7 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:31:43,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 307.0) internal successors, (2456), 8 states have internal predecessors, (2456), 0 states have call successors, (0), 0 states 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:31:43,762 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 307.0) internal successors, (2456), 8 states have internal predecessors, (2456), 0 states have call successors, (0), 0 states 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:31:43,763 INFO L175 Difference]: Start difference. First operand has 54 places, 37 transitions, 202 flow. Second operand 7 states and 1004 transitions. [2023-11-12 02:31:43,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 100 transitions, 661 flow [2023-11-12 02:31:43,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 100 transitions, 599 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-11-12 02:31:43,783 INFO L231 Difference]: Finished difference. Result has 57 places, 41 transitions, 252 flow [2023-11-12 02:31:43,783 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=252, PETRI_PLACES=57, PETRI_TRANSITIONS=41} [2023-11-12 02:31:43,784 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 7 predicate places. [2023-11-12 02:31:43,784 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 41 transitions, 252 flow [2023-11-12 02:31:43,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 133.0) internal successors, (798), 6 states have internal predecessors, (798), 0 states have call successors, (0), 0 states 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:31:43,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:31:43,785 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:31:43,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 02:31:43,785 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 02:31:43,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:43,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1056508988, now seen corresponding path program 1 times [2023-11-12 02:31:43,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:43,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190274146] [2023-11-12 02:31:43,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:43,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:43,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:43,996 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:31:43,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:31:43,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190274146] [2023-11-12 02:31:43,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190274146] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:31:43,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:31:43,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:31:43,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847286076] [2023-11-12 02:31:43,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:31:43,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:31:43,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:31:43,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:31:43,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:31:44,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 307 [2023-11-12 02:31:44,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 41 transitions, 252 flow. Second operand has 4 states, 4 states have (on average 138.25) internal successors, (553), 4 states have internal predecessors, (553), 0 states have call successors, (0), 0 states 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:31:44,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:31:44,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 307 [2023-11-12 02:31:44,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:31:44,446 INFO L124 PetriNetUnfolderBase]: 1525/2540 cut-off events. [2023-11-12 02:31:44,447 INFO L125 PetriNetUnfolderBase]: For 4776/4778 co-relation queries the response was YES. [2023-11-12 02:31:44,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8923 conditions, 2540 events. 1525/2540 cut-off events. For 4776/4778 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 13824 event pairs, 290 based on Foata normal form. 8/2548 useless extension candidates. Maximal degree in co-relation 8909. Up to 1363 conditions per place. [2023-11-12 02:31:44,473 INFO L140 encePairwiseOnDemand]: 304/307 looper letters, 91 selfloop transitions, 2 changer transitions 0/96 dead transitions. [2023-11-12 02:31:44,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 96 transitions, 782 flow [2023-11-12 02:31:44,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:31:44,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-12 02:31:44,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 594 transitions. [2023-11-12 02:31:44,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4837133550488599 [2023-11-12 02:31:44,476 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 594 transitions. [2023-11-12 02:31:44,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 594 transitions. [2023-11-12 02:31:44,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:31:44,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 594 transitions. [2023-11-12 02:31:44,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 148.5) internal successors, (594), 4 states have internal predecessors, (594), 0 states have call successors, (0), 0 states 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:31:44,482 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 307.0) internal successors, (1535), 5 states have internal predecessors, (1535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:31:44,482 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 307.0) internal successors, (1535), 5 states have internal predecessors, (1535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:31:44,483 INFO L175 Difference]: Start difference. First operand has 57 places, 41 transitions, 252 flow. Second operand 4 states and 594 transitions. [2023-11-12 02:31:44,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 96 transitions, 782 flow [2023-11-12 02:31:44,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 96 transitions, 642 flow, removed 47 selfloop flow, removed 5 redundant places. [2023-11-12 02:31:44,520 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 211 flow [2023-11-12 02:31:44,521 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=211, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2023-11-12 02:31:44,522 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 5 predicate places. [2023-11-12 02:31:44,523 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 211 flow [2023-11-12 02:31:44,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 138.25) internal successors, (553), 4 states have internal predecessors, (553), 0 states have call successors, (0), 0 states 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:31:44,525 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:31:44,525 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:31:44,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-12 02:31:44,526 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 02:31:44,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:44,526 INFO L85 PathProgramCache]: Analyzing trace with hash 244545490, now seen corresponding path program 2 times [2023-11-12 02:31:44,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:44,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390091432] [2023-11-12 02:31:44,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:44,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:44,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:44,808 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:31:44,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:31:44,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390091432] [2023-11-12 02:31:44,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390091432] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:31:44,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:31:44,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:31:44,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261494311] [2023-11-12 02:31:44,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:31:44,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:31:44,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:31:44,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:31:44,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:31:44,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 307 [2023-11-12 02:31:44,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 211 flow. Second operand has 7 states, 7 states have (on average 132.85714285714286) internal successors, (930), 7 states have internal predecessors, (930), 0 states have call successors, (0), 0 states 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:31:44,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:31:44,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 307 [2023-11-12 02:31:44,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:31:45,255 INFO L124 PetriNetUnfolderBase]: 1145/1843 cut-off events. [2023-11-12 02:31:45,256 INFO L125 PetriNetUnfolderBase]: For 1799/1820 co-relation queries the response was YES. [2023-11-12 02:31:45,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5874 conditions, 1843 events. 1145/1843 cut-off events. For 1799/1820 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 9439 event pairs, 190 based on Foata normal form. 53/1847 useless extension candidates. Maximal degree in co-relation 5860. Up to 680 conditions per place. [2023-11-12 02:31:45,271 INFO L140 encePairwiseOnDemand]: 300/307 looper letters, 55 selfloop transitions, 17 changer transitions 12/89 dead transitions. [2023-11-12 02:31:45,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 89 transitions, 558 flow [2023-11-12 02:31:45,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:31:45,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-12 02:31:45,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1123 transitions. [2023-11-12 02:31:45,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4572475570032573 [2023-11-12 02:31:45,277 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1123 transitions. [2023-11-12 02:31:45,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1123 transitions. [2023-11-12 02:31:45,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:31:45,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1123 transitions. [2023-11-12 02:31:45,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 140.375) internal successors, (1123), 8 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states 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:31:45,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 307.0) internal successors, (2763), 9 states have internal predecessors, (2763), 0 states have call successors, (0), 0 states 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:31:45,288 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 307.0) internal successors, (2763), 9 states have internal predecessors, (2763), 0 states have call successors, (0), 0 states 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:31:45,288 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 211 flow. Second operand 8 states and 1123 transitions. [2023-11-12 02:31:45,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 89 transitions, 558 flow [2023-11-12 02:31:45,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 89 transitions, 516 flow, removed 11 selfloop flow, removed 3 redundant places. [2023-11-12 02:31:45,321 INFO L231 Difference]: Finished difference. Result has 62 places, 42 transitions, 240 flow [2023-11-12 02:31:45,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=240, PETRI_PLACES=62, PETRI_TRANSITIONS=42} [2023-11-12 02:31:45,322 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 12 predicate places. [2023-11-12 02:31:45,323 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 42 transitions, 240 flow [2023-11-12 02:31:45,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 132.85714285714286) internal successors, (930), 7 states have internal predecessors, (930), 0 states have call successors, (0), 0 states 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:31:45,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:31:45,324 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:31:45,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-12 02:31:45,324 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 02:31:45,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:45,324 INFO L85 PathProgramCache]: Analyzing trace with hash -234587396, now seen corresponding path program 1 times [2023-11-12 02:31:45,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:45,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395781020] [2023-11-12 02:31:45,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:45,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:45,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:45,630 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:31:45,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:31:45,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395781020] [2023-11-12 02:31:45,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395781020] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:31:45,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:31:45,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:31:45,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421661382] [2023-11-12 02:31:45,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:31:45,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:31:45,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:31:45,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:31:45,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:31:45,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 307 [2023-11-12 02:31:45,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 42 transitions, 240 flow. Second operand has 4 states, 4 states have (on average 131.25) internal successors, (525), 4 states have internal predecessors, (525), 0 states have call successors, (0), 0 states 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:31:45,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:31:45,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 307 [2023-11-12 02:31:45,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:31:46,405 INFO L124 PetriNetUnfolderBase]: 2834/4394 cut-off events. [2023-11-12 02:31:46,405 INFO L125 PetriNetUnfolderBase]: For 8251/8251 co-relation queries the response was YES. [2023-11-12 02:31:46,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15594 conditions, 4394 events. 2834/4394 cut-off events. For 8251/8251 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 23526 event pairs, 357 based on Foata normal form. 1/4395 useless extension candidates. Maximal degree in co-relation 15579. Up to 2449 conditions per place. [2023-11-12 02:31:46,444 INFO L140 encePairwiseOnDemand]: 297/307 looper letters, 105 selfloop transitions, 20 changer transitions 0/125 dead transitions. [2023-11-12 02:31:46,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 125 transitions, 934 flow [2023-11-12 02:31:46,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:31:46,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:31:46,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 706 transitions. [2023-11-12 02:31:46,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45993485342019547 [2023-11-12 02:31:46,448 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 706 transitions. [2023-11-12 02:31:46,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 706 transitions. [2023-11-12 02:31:46,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:31:46,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 706 transitions. [2023-11-12 02:31:46,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 141.2) internal successors, (706), 5 states have internal predecessors, (706), 0 states have call successors, (0), 0 states 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:31:46,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 307.0) internal successors, (1842), 6 states have internal predecessors, (1842), 0 states have call successors, (0), 0 states 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:31:46,455 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 307.0) internal successors, (1842), 6 states have internal predecessors, (1842), 0 states have call successors, (0), 0 states 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:31:46,456 INFO L175 Difference]: Start difference. First operand has 62 places, 42 transitions, 240 flow. Second operand 5 states and 706 transitions. [2023-11-12 02:31:46,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 125 transitions, 934 flow [2023-11-12 02:31:46,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 125 transitions, 794 flow, removed 30 selfloop flow, removed 7 redundant places. [2023-11-12 02:31:46,538 INFO L231 Difference]: Finished difference. Result has 61 places, 60 transitions, 364 flow [2023-11-12 02:31:46,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=364, PETRI_PLACES=61, PETRI_TRANSITIONS=60} [2023-11-12 02:31:46,540 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places. [2023-11-12 02:31:46,541 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 60 transitions, 364 flow [2023-11-12 02:31:46,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.25) internal successors, (525), 4 states have internal predecessors, (525), 0 states have call successors, (0), 0 states 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:31:46,541 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:31:46,541 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:31:46,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-12 02:31:46,544 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 02:31:46,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:46,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1292868628, now seen corresponding path program 2 times [2023-11-12 02:31:46,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:46,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804139743] [2023-11-12 02:31:46,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:46,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:46,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:46,777 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:31:46,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:31:46,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804139743] [2023-11-12 02:31:46,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804139743] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:31:46,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:31:46,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:31:46,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128613196] [2023-11-12 02:31:46,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:31:46,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:31:46,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:31:46,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:31:46,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:31:46,786 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 307 [2023-11-12 02:31:46,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 60 transitions, 364 flow. Second operand has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 0 states 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:31:46,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:31:46,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 307 [2023-11-12 02:31:46,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:31:47,650 INFO L124 PetriNetUnfolderBase]: 2921/4781 cut-off events. [2023-11-12 02:31:47,650 INFO L125 PetriNetUnfolderBase]: For 9091/9167 co-relation queries the response was YES. [2023-11-12 02:31:47,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18223 conditions, 4781 events. 2921/4781 cut-off events. For 9091/9167 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 28930 event pairs, 596 based on Foata normal form. 15/4765 useless extension candidates. Maximal degree in co-relation 18208. Up to 2527 conditions per place. [2023-11-12 02:31:47,707 INFO L140 encePairwiseOnDemand]: 304/307 looper letters, 98 selfloop transitions, 4 changer transitions 0/112 dead transitions. [2023-11-12 02:31:47,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 112 transitions, 844 flow [2023-11-12 02:31:47,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:31:47,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-12 02:31:47,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 586 transitions. [2023-11-12 02:31:47,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4771986970684039 [2023-11-12 02:31:47,711 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 586 transitions. [2023-11-12 02:31:47,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 586 transitions. [2023-11-12 02:31:47,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:31:47,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 586 transitions. [2023-11-12 02:31:47,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 146.5) internal successors, (586), 4 states have internal predecessors, (586), 0 states have call successors, (0), 0 states 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:31:47,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 307.0) internal successors, (1535), 5 states have internal predecessors, (1535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:31:47,718 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 307.0) internal successors, (1535), 5 states have internal predecessors, (1535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:31:47,718 INFO L175 Difference]: Start difference. First operand has 61 places, 60 transitions, 364 flow. Second operand 4 states and 586 transitions. [2023-11-12 02:31:47,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 112 transitions, 844 flow [2023-11-12 02:31:47,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 112 transitions, 844 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-12 02:31:47,871 INFO L231 Difference]: Finished difference. Result has 66 places, 61 transitions, 388 flow [2023-11-12 02:31:47,871 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=388, PETRI_PLACES=66, PETRI_TRANSITIONS=61} [2023-11-12 02:31:47,872 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 16 predicate places. [2023-11-12 02:31:47,872 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 61 transitions, 388 flow [2023-11-12 02:31:47,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 0 states 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:31:47,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:31:47,873 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:31:47,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-12 02:31:47,873 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 02:31:47,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:47,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1238132544, now seen corresponding path program 3 times [2023-11-12 02:31:47,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:47,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551332501] [2023-11-12 02:31:47,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:47,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:47,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:31:48,625 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:31:48,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:31:48,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551332501] [2023-11-12 02:31:48,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551332501] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:31:48,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:31:48,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:31:48,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869646365] [2023-11-12 02:31:48,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:31:48,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:31:48,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:31:48,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:31:48,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:31:48,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 307 [2023-11-12 02:31:48,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 61 transitions, 388 flow. Second operand has 6 states, 6 states have (on average 135.66666666666666) internal successors, (814), 6 states have internal predecessors, (814), 0 states have call successors, (0), 0 states 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:31:48,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:31:48,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 307 [2023-11-12 02:31:48,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:31:49,584 INFO L124 PetriNetUnfolderBase]: 3031/5136 cut-off events. [2023-11-12 02:31:49,584 INFO L125 PetriNetUnfolderBase]: For 11735/11894 co-relation queries the response was YES. [2023-11-12 02:31:49,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19901 conditions, 5136 events. 3031/5136 cut-off events. For 11735/11894 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 33508 event pairs, 488 based on Foata normal form. 57/5119 useless extension candidates. Maximal degree in co-relation 19883. Up to 1539 conditions per place. [2023-11-12 02:31:49,635 INFO L140 encePairwiseOnDemand]: 301/307 looper letters, 104 selfloop transitions, 8 changer transitions 0/126 dead transitions. [2023-11-12 02:31:49,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 126 transitions, 1022 flow [2023-11-12 02:31:49,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:31:49,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-12 02:31:49,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 973 transitions. [2023-11-12 02:31:49,640 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4527687296416938 [2023-11-12 02:31:49,640 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 973 transitions. [2023-11-12 02:31:49,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 973 transitions. [2023-11-12 02:31:49,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:31:49,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 973 transitions. [2023-11-12 02:31:49,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 139.0) internal successors, (973), 7 states have internal predecessors, (973), 0 states have call successors, (0), 0 states 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:31:49,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 307.0) internal successors, (2456), 8 states have internal predecessors, (2456), 0 states have call successors, (0), 0 states 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:31:49,650 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 307.0) internal successors, (2456), 8 states have internal predecessors, (2456), 0 states have call successors, (0), 0 states 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:31:49,650 INFO L175 Difference]: Start difference. First operand has 66 places, 61 transitions, 388 flow. Second operand 7 states and 973 transitions. [2023-11-12 02:31:49,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 126 transitions, 1022 flow [2023-11-12 02:31:49,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 126 transitions, 1014 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-12 02:31:49,785 INFO L231 Difference]: Finished difference. Result has 73 places, 65 transitions, 436 flow [2023-11-12 02:31:49,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=436, PETRI_PLACES=73, PETRI_TRANSITIONS=65} [2023-11-12 02:31:49,787 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 23 predicate places. [2023-11-12 02:31:49,787 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 65 transitions, 436 flow [2023-11-12 02:31:49,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 135.66666666666666) internal successors, (814), 6 states have internal predecessors, (814), 0 states have call successors, (0), 0 states 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:31:49,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:31:49,788 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:31:49,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-12 02:31:49,788 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 02:31:49,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:31:49,789 INFO L85 PathProgramCache]: Analyzing trace with hash 942017068, now seen corresponding path program 4 times [2023-11-12 02:31:49,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:31:49,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462320319] [2023-11-12 02:31:49,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:31:49,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:31:49,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:31:49,837 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:31:49,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:31:49,910 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:31:49,910 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-12 02:31:49,911 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-12 02:31:49,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-12 02:31:49,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-12 02:31:49,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-12 02:31:49,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-12 02:31:49,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-12 02:31:49,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-12 02:31:49,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-12 02:31:49,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-12 02:31:49,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-12 02:31:49,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-12 02:31:49,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-12 02:31:49,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-12 02:31:49,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-12 02:31:49,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-12 02:31:49,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-12 02:31:49,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-12 02:31:49,917 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:31:49,923 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-12 02:31:49,924 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 02:31:49,982 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-12 02:31:49,985 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-12 02:31:49,986 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-12 02:31:49,987 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-12 02:31:50,012 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-12 02:31:50,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:31:50 BasicIcfg [2023-11-12 02:31:50,035 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 02:31:50,035 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 02:31:50,035 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 02:31:50,036 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 02:31:50,036 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:31:26" (3/4) ... [2023-11-12 02:31:50,038 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-12 02:31:50,039 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 02:31:50,040 INFO L158 Benchmark]: Toolchain (without parser) took 25612.09ms. Allocated memory was 155.2MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 108.9MB in the beginning and 963.8MB in the end (delta: -854.9MB). Peak memory consumption was 318.4MB. Max. memory is 16.1GB. [2023-11-12 02:31:50,040 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 107.0MB. Free memory is still 56.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:31:50,040 INFO L158 Benchmark]: CACSL2BoogieTranslator took 683.65ms. Allocated memory is still 155.2MB. Free memory was 108.9MB in the beginning and 85.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-12 02:31:50,040 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.77ms. Allocated memory is still 155.2MB. Free memory was 85.8MB in the beginning and 126.1MB in the end (delta: -40.3MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2023-11-12 02:31:50,041 INFO L158 Benchmark]: Boogie Preprocessor took 46.49ms. Allocated memory is still 155.2MB. Free memory was 126.1MB in the beginning and 124.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:31:50,041 INFO L158 Benchmark]: RCFGBuilder took 871.56ms. Allocated memory is still 155.2MB. Free memory was 124.0MB in the beginning and 88.3MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2023-11-12 02:31:50,041 INFO L158 Benchmark]: TraceAbstraction took 23916.10ms. Allocated memory was 155.2MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 88.3MB in the beginning and 963.8MB in the end (delta: -875.5MB). Peak memory consumption was 294.6MB. Max. memory is 16.1GB. [2023-11-12 02:31:50,042 INFO L158 Benchmark]: Witness Printer took 3.63ms. Allocated memory is still 1.3GB. Free memory is still 963.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:31:50,043 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.32ms. Allocated memory is still 107.0MB. Free memory is still 56.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 683.65ms. Allocated memory is still 155.2MB. Free memory was 108.9MB in the beginning and 85.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.77ms. Allocated memory is still 155.2MB. Free memory was 85.8MB in the beginning and 126.1MB in the end (delta: -40.3MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.49ms. Allocated memory is still 155.2MB. Free memory was 126.1MB in the beginning and 124.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 871.56ms. Allocated memory is still 155.2MB. Free memory was 124.0MB in the beginning and 88.3MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 23916.10ms. Allocated memory was 155.2MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 88.3MB in the beginning and 963.8MB in the end (delta: -875.5MB). Peak memory consumption was 294.6MB. Max. memory is 16.1GB. * Witness Printer took 3.63ms. Allocated memory is still 1.3GB. Free memory is still 963.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.2s, 156 PlacesBefore, 50 PlacesAfterwards, 146 TransitionsBefore, 38 TransitionsAfterwards, 3632 CoEnabledTransitionPairs, 7 FixpointIterations, 56 TrivialSequentialCompositions, 88 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 157 TotalNumberOfCompositions, 8653 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4215, independent: 4018, independent conditional: 0, independent unconditional: 4018, dependent: 197, dependent conditional: 0, dependent unconditional: 197, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2007, independent: 1966, independent conditional: 0, independent unconditional: 1966, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4215, independent: 2052, independent conditional: 0, independent unconditional: 2052, dependent: 156, dependent conditional: 0, dependent unconditional: 156, unknown: 2007, unknown conditional: 0, unknown unconditional: 2007] , Statistics on independence cache: Total cache size (in pairs): 157, Positive cache size: 140, Positive conditional cache size: 0, Positive unconditional cache size: 140, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L856] 0 pthread_t t1029; [L857] FCALL, FORK 0 pthread_create(&t1029, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1029={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L858] 0 pthread_t t1030; [L859] FCALL, FORK 0 pthread_create(&t1030, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1029={5:0}, t1030={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L860] 0 pthread_t t1031; [L861] FCALL, FORK 0 pthread_create(&t1031, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1029={5:0}, t1030={6:0}, t1031={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L862] 0 pthread_t t1032; [L863] FCALL, FORK 0 pthread_create(&t1032, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1029={5:0}, t1030={6:0}, t1031={7:0}, t1032={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L812] 4 z$w_buff1 = z$w_buff0 [L813] 4 z$w_buff0 = 1 [L814] 4 z$w_buff1_used = z$w_buff0_used [L815] 4 z$w_buff0_used = (_Bool)1 [L816] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L816] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L817] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L818] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L819] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L820] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L821] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L822] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L825] 4 a = 1 [L828] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L831] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L754] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L769] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L784] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L787] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L788] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L789] 3 z$flush_delayed = weak$$choice2 [L790] 3 z$mem_tmp = z [L791] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L792] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L793] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L794] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L795] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L797] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 __unbuffered_p2_EAX = z [L799] 3 z = z$flush_delayed ? z$mem_tmp : z [L800] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L834] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L835] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L836] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L837] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L838] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L843] 4 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L870] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L871] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L872] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L873] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1029={5:0}, t1030={6:0}, t1031={7:0}, t1032={3:0}, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L876] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] 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", "mix039.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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: -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: 854]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 184 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 23.6s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 12.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 643 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 542 mSDsluCounter, 121 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 101 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2007 IncrementalHoareTripleChecker+Invalid, 2071 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 20 mSDtfsCounter, 2007 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=436occurred in iteration=14, InterpolantAutomatonStates: 67, 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, 3.9s InterpolantComputationTime, 254 NumberOfCodeBlocks, 254 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 215 ConstructedInterpolants, 0 QuantifiedInterpolants, 1259 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-12 02:31:50,080 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d31430-0d5a-464d-a0e8-32e88dc2c011/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_65d31430-0d5a-464d-a0e8-32e88dc2c011/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d31430-0d5a-464d-a0e8-32e88dc2c011/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_65d31430-0d5a-464d-a0e8-32e88dc2c011/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d31430-0d5a-464d-a0e8-32e88dc2c011/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix039.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d31430-0d5a-464d-a0e8-32e88dc2c011/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_65d31430-0d5a-464d-a0e8-32e88dc2c011/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 4df22382a468f75ea1bc6624bacd8789c0b9b9f8aa1bc2866cf2715dcbc507bc --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:31:52,713 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:31:52,845 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d31430-0d5a-464d-a0e8-32e88dc2c011/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-12 02:31:52,857 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:31:52,858 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:31:52,902 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:31:52,903 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:31:52,903 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:31:52,904 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:31:52,909 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:31:52,910 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:31:52,910 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:31:52,911 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:31:52,912 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:31:52,913 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:31:52,913 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:31:52,914 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:31:52,914 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:31:52,914 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-12 02:31:52,915 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-12 02:31:52,916 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-12 02:31:52,916 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:31:52,917 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 02:31:52,917 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-12 02:31:52,918 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-12 02:31:52,918 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 02:31:52,918 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:31:52,919 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:31:52,920 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:31:52,920 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:31:52,921 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:31:52,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:31:52,922 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:31:52,922 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:31:52,922 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-12 02:31:52,923 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-12 02:31:52,923 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:31:52,923 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:31:52,923 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:31:52,924 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-12 02:31:52,924 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:31:52,925 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_65d31430-0d5a-464d-a0e8-32e88dc2c011/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_65d31430-0d5a-464d-a0e8-32e88dc2c011/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 -> 4df22382a468f75ea1bc6624bacd8789c0b9b9f8aa1bc2866cf2715dcbc507bc [2023-11-12 02:31:53,329 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:31:53,365 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:31:53,367 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:31:53,369 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:31:53,369 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:31:53,371 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d31430-0d5a-464d-a0e8-32e88dc2c011/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/pthread-wmm/mix039.opt.i [2023-11-12 02:31:56,603 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:31:56,955 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:31:56,956 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d31430-0d5a-464d-a0e8-32e88dc2c011/sv-benchmarks/c/pthread-wmm/mix039.opt.i [2023-11-12 02:31:56,976 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d31430-0d5a-464d-a0e8-32e88dc2c011/bin/uautomizer-verify-uTZkv6EMXl/data/3223ab536/e6af7a73806949e9918a576d28deefa2/FLAG7b19d3dcd [2023-11-12 02:31:56,991 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d31430-0d5a-464d-a0e8-32e88dc2c011/bin/uautomizer-verify-uTZkv6EMXl/data/3223ab536/e6af7a73806949e9918a576d28deefa2 [2023-11-12 02:31:56,994 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:31:56,996 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:31:56,997 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:31:56,997 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:31:57,003 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:31:57,004 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:31:56" (1/1) ... [2023-11-12 02:31:57,005 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@258f42f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:31:57, skipping insertion in model container [2023-11-12 02:31:57,005 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:31:56" (1/1) ... [2023-11-12 02:31:57,054 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:31:57,562 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:31:57,586 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:31:57,647 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:31:57,696 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:31:57,696 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:31:57,704 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:31:57,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:31:57 WrapperNode [2023-11-12 02:31:57,705 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:31:57,706 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:31:57,707 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:31:57,707 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:31:57,715 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:31:57" (1/1) ... [2023-11-12 02:31:57,752 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:31:57" (1/1) ... [2023-11-12 02:31:57,804 INFO L138 Inliner]: procedures = 180, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 158 [2023-11-12 02:31:57,806 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:31:57,807 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:31:57,808 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:31:57,808 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:31:57,818 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:31:57" (1/1) ... [2023-11-12 02:31:57,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:31:57" (1/1) ... [2023-11-12 02:31:57,836 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:31:57" (1/1) ... [2023-11-12 02:31:57,836 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:31:57" (1/1) ... [2023-11-12 02:31:57,858 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:31:57" (1/1) ... [2023-11-12 02:31:57,860 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:31:57" (1/1) ... [2023-11-12 02:31:57,874 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:31:57" (1/1) ... [2023-11-12 02:31:57,877 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:31:57" (1/1) ... [2023-11-12 02:31:57,881 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:31:57,882 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:31:57,882 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:31:57,882 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:31:57,897 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:31:57" (1/1) ... [2023-11-12 02:31:57,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:31:57,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d31430-0d5a-464d-a0e8-32e88dc2c011/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:31:57,934 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d31430-0d5a-464d-a0e8-32e88dc2c011/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:31:57,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d31430-0d5a-464d-a0e8-32e88dc2c011/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:31:57,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-12 02:31:57,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:31:57,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 02:31:57,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 02:31:57,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-12 02:31:57,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-12 02:31:57,991 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-12 02:31:57,992 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-12 02:31:57,992 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-12 02:31:57,992 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-12 02:31:57,992 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-12 02:31:57,992 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-12 02:31:57,994 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-12 02:31:57,995 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-12 02:31:57,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-12 02:31:57,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:31:57,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:31:57,997 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:31:58,178 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:31:58,182 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:31:58,676 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:31:58,816 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:31:58,817 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-12 02:31:58,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:31:58 BoogieIcfgContainer [2023-11-12 02:31:58,822 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:31:58,825 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:31:58,826 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:31:58,829 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:31:58,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:31:56" (1/3) ... [2023-11-12 02:31:58,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f8945d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:31:58, skipping insertion in model container [2023-11-12 02:31:58,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:31:57" (2/3) ... [2023-11-12 02:31:58,832 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f8945d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:31:58, skipping insertion in model container [2023-11-12 02:31:58,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:31:58" (3/3) ... [2023-11-12 02:31:58,834 INFO L112 eAbstractionObserver]: Analyzing ICFG mix039.opt.i [2023-11-12 02:31:58,854 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:31:58,854 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-12 02:31:58,854 INFO L521 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-12 02:31:58,973 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-12 02:31:59,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 151 transitions, 318 flow [2023-11-12 02:31:59,122 INFO L124 PetriNetUnfolderBase]: 3/147 cut-off events. [2023-11-12 02:31:59,122 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:31:59,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 147 events. 3/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 108 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 104. Up to 2 conditions per place. [2023-11-12 02:31:59,128 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 151 transitions, 318 flow [2023-11-12 02:31:59,139 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 157 places, 147 transitions, 306 flow [2023-11-12 02:31:59,153 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-12 02:31:59,171 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 157 places, 147 transitions, 306 flow [2023-11-12 02:31:59,174 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 147 transitions, 306 flow [2023-11-12 02:31:59,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 147 transitions, 306 flow [2023-11-12 02:31:59,227 INFO L124 PetriNetUnfolderBase]: 3/147 cut-off events. [2023-11-12 02:31:59,227 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:31:59,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 147 events. 3/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 108 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 104. Up to 2 conditions per place. [2023-11-12 02:31:59,233 INFO L119 LiptonReduction]: Number of co-enabled transitions 3632