./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi006_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 30e01a73 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_748f899b-bf09-4aa3-8259-52ae05445b5a/bin/uautomizer-verify-zZY32mL2XJ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_748f899b-bf09-4aa3-8259-52ae05445b5a/bin/uautomizer-verify-zZY32mL2XJ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_748f899b-bf09-4aa3-8259-52ae05445b5a/bin/uautomizer-verify-zZY32mL2XJ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_748f899b-bf09-4aa3-8259-52ae05445b5a/bin/uautomizer-verify-zZY32mL2XJ/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi006_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_748f899b-bf09-4aa3-8259-52ae05445b5a/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_748f899b-bf09-4aa3-8259-52ae05445b5a/bin/uautomizer-verify-zZY32mL2XJ --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 de3096cf2a7a81c5a5563cf2e9ae3ddf8f4cc1ab1b483fb6503759d4e39a0a81 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 22:28:53,176 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 22:28:53,278 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_748f899b-bf09-4aa3-8259-52ae05445b5a/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-23 22:28:53,284 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 22:28:53,284 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 22:28:53,320 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 22:28:53,321 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 22:28:53,321 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 22:28:53,322 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 22:28:53,323 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 22:28:53,324 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 22:28:53,324 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 22:28:53,325 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 22:28:53,326 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 22:28:53,326 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 22:28:53,327 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 22:28:53,327 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 22:28:53,328 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 22:28:53,329 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-23 22:28:53,329 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-23 22:28:53,330 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-23 22:28:53,331 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 22:28:53,331 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-23 22:28:53,332 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-23 22:28:53,333 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 22:28:53,333 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 22:28:53,334 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 22:28:53,334 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 22:28:53,335 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 22:28:53,336 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 22:28:53,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 22:28:53,337 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 22:28:53,337 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 22:28:53,338 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 22:28:53,338 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 22:28:53,339 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 22:28:53,354 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 22:28:53,355 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 22:28:53,355 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 22:28:53,356 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_748f899b-bf09-4aa3-8259-52ae05445b5a/bin/uautomizer-verify-zZY32mL2XJ/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_748f899b-bf09-4aa3-8259-52ae05445b5a/bin/uautomizer-verify-zZY32mL2XJ 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 -> de3096cf2a7a81c5a5563cf2e9ae3ddf8f4cc1ab1b483fb6503759d4e39a0a81 [2023-11-23 22:28:53,675 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 22:28:53,708 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 22:28:53,711 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 22:28:53,713 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 22:28:53,714 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 22:28:53,716 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_748f899b-bf09-4aa3-8259-52ae05445b5a/bin/uautomizer-verify-zZY32mL2XJ/../../sv-benchmarks/c/pthread-wmm/rfi006_power.opt.i [2023-11-23 22:28:56,930 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 22:28:57,292 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 22:28:57,293 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_748f899b-bf09-4aa3-8259-52ae05445b5a/sv-benchmarks/c/pthread-wmm/rfi006_power.opt.i [2023-11-23 22:28:57,315 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_748f899b-bf09-4aa3-8259-52ae05445b5a/bin/uautomizer-verify-zZY32mL2XJ/data/5afd4b626/1ebf2bdd61a74d5ca09f44ecd187fbdd/FLAG441d468ec [2023-11-23 22:28:57,334 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_748f899b-bf09-4aa3-8259-52ae05445b5a/bin/uautomizer-verify-zZY32mL2XJ/data/5afd4b626/1ebf2bdd61a74d5ca09f44ecd187fbdd [2023-11-23 22:28:57,337 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 22:28:57,339 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 22:28:57,340 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 22:28:57,340 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 22:28:57,344 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 22:28:57,345 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:28:57" (1/1) ... [2023-11-23 22:28:57,346 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b3bf4c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:57, skipping insertion in model container [2023-11-23 22:28:57,347 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:28:57" (1/1) ... [2023-11-23 22:28:57,408 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 22:28:57,931 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 22:28:57,950 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 22:28:58,028 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 22:28:58,066 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 22:28:58,066 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 22:28:58,075 INFO L206 MainTranslator]: Completed translation [2023-11-23 22:28:58,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:58 WrapperNode [2023-11-23 22:28:58,075 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 22:28:58,077 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 22:28:58,077 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 22:28:58,077 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 22:28:58,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:58" (1/1) ... [2023-11-23 22:28:58,125 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:58" (1/1) ... [2023-11-23 22:28:58,188 INFO L138 Inliner]: procedures = 176, calls = 76, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 183 [2023-11-23 22:28:58,189 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 22:28:58,190 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 22:28:58,191 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 22:28:58,192 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 22:28:58,203 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:58" (1/1) ... [2023-11-23 22:28:58,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:58" (1/1) ... [2023-11-23 22:28:58,222 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:58" (1/1) ... [2023-11-23 22:28:58,224 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:58" (1/1) ... [2023-11-23 22:28:58,253 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:58" (1/1) ... [2023-11-23 22:28:58,256 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:58" (1/1) ... [2023-11-23 22:28:58,274 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:58" (1/1) ... [2023-11-23 22:28:58,277 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:58" (1/1) ... [2023-11-23 22:28:58,282 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 22:28:58,284 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 22:28:58,284 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 22:28:58,284 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 22:28:58,285 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:58" (1/1) ... [2023-11-23 22:28:58,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 22:28:58,315 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_748f899b-bf09-4aa3-8259-52ae05445b5a/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:28:58,328 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_748f899b-bf09-4aa3-8259-52ae05445b5a/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 22:28:58,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_748f899b-bf09-4aa3-8259-52ae05445b5a/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 22:28:58,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-23 22:28:58,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 22:28:58,376 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-23 22:28:58,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 22:28:58,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 22:28:58,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 22:28:58,377 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-23 22:28:58,377 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-23 22:28:58,377 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-23 22:28:58,378 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-23 22:28:58,378 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-23 22:28:58,378 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-23 22:28:58,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 22:28:58,378 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-23 22:28:58,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 22:28:58,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 22:28:58,381 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-23 22:28:58,560 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 22:28:58,563 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 22:28:59,312 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 22:29:00,022 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 22:29:00,023 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 22:29:00,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:29:00 BoogieIcfgContainer [2023-11-23 22:29:00,024 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 22:29:00,028 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 22:29:00,028 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 22:29:00,032 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 22:29:00,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:28:57" (1/3) ... [2023-11-23 22:29:00,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e28475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:29:00, skipping insertion in model container [2023-11-23 22:29:00,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:28:58" (2/3) ... [2023-11-23 22:29:00,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e28475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:29:00, skipping insertion in model container [2023-11-23 22:29:00,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:29:00" (3/3) ... [2023-11-23 22:29:00,037 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi006_power.opt.i [2023-11-23 22:29:00,062 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 22:29:00,063 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 47 error locations. [2023-11-23 22:29:00,063 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-23 22:29:00,281 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-23 22:29:00,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 91 transitions, 194 flow [2023-11-23 22:29:00,388 INFO L124 PetriNetUnfolderBase]: 2/88 cut-off events. [2023-11-23 22:29:00,388 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-23 22:29:00,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 335 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-11-23 22:29:00,396 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 91 transitions, 194 flow [2023-11-23 22:29:00,402 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 88 transitions, 185 flow [2023-11-23 22:29:00,412 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 22:29:00,420 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;@7953a3a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 22:29:00,420 INFO L358 AbstractCegarLoop]: Starting to check reachability of 83 error locations. [2023-11-23 22:29:00,426 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-23 22:29:00,427 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-23 22:29:00,427 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-23 22:29:00,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:29:00,428 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-23 22:29:00,429 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-23 22:29:00,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:29:00,436 INFO L85 PathProgramCache]: Analyzing trace with hash 28766, now seen corresponding path program 1 times [2023-11-23 22:29:00,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:29:00,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954548373] [2023-11-23 22:29:00,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:00,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:29:00,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:00,825 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-23 22:29:00,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:29:00,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954548373] [2023-11-23 22:29:00,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954548373] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:29:00,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:29:00,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 22:29:00,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134542897] [2023-11-23 22:29:00,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:29:00,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:29:00,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:29:00,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:29:00,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:29:00,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 91 [2023-11-23 22:29:00,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 88 transitions, 185 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:00,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:29:00,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 91 [2023-11-23 22:29:00,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:29:04,681 INFO L124 PetriNetUnfolderBase]: 8264/12896 cut-off events. [2023-11-23 22:29:04,682 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-23 22:29:04,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24664 conditions, 12896 events. 8264/12896 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 1313. Compared 105361 event pairs, 7144 based on Foata normal form. 450/7304 useless extension candidates. Maximal degree in co-relation 24650. Up to 10131 conditions per place. [2023-11-23 22:29:04,840 INFO L140 encePairwiseOnDemand]: 62/91 looper letters, 51 selfloop transitions, 2 changer transitions 0/76 dead transitions. [2023-11-23 22:29:04,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 76 transitions, 267 flow [2023-11-23 22:29:04,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:29:04,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:29:04,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2023-11-23 22:29:04,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2023-11-23 22:29:04,855 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 182 transitions. [2023-11-23 22:29:04,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 182 transitions. [2023-11-23 22:29:04,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:29:04,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 182 transitions. [2023-11-23 22:29:04,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:04,867 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:04,867 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:04,869 INFO L175 Difference]: Start difference. First operand has 96 places, 88 transitions, 185 flow. Second operand 3 states and 182 transitions. [2023-11-23 22:29:04,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 76 transitions, 267 flow [2023-11-23 22:29:04,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 76 transitions, 264 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-23 22:29:04,879 INFO L231 Difference]: Finished difference. Result has 69 places, 60 transitions, 130 flow [2023-11-23 22:29:04,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=69, PETRI_TRANSITIONS=60} [2023-11-23 22:29:04,885 INFO L281 CegarLoopForPetriNet]: 96 programPoint places, -27 predicate places. [2023-11-23 22:29:04,886 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 60 transitions, 130 flow [2023-11-23 22:29:04,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:04,886 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:29:04,887 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-23 22:29:04,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 22:29:04,887 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-23 22:29:04,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:29:04,888 INFO L85 PathProgramCache]: Analyzing trace with hash 28767, now seen corresponding path program 1 times [2023-11-23 22:29:04,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:29:04,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802792744] [2023-11-23 22:29:04,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:04,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:29:04,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:05,010 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-23 22:29:05,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:29:05,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802792744] [2023-11-23 22:29:05,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802792744] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:29:05,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:29:05,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 22:29:05,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788141565] [2023-11-23 22:29:05,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:29:05,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:29:05,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:29:05,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:29:05,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:29:05,031 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 91 [2023-11-23 22:29:05,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 60 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:05,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:29:05,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 91 [2023-11-23 22:29:05,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:29:07,994 INFO L124 PetriNetUnfolderBase]: 8264/12895 cut-off events. [2023-11-23 22:29:07,994 INFO L125 PetriNetUnfolderBase]: For 225/225 co-relation queries the response was YES. [2023-11-23 22:29:08,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24886 conditions, 12895 events. 8264/12895 cut-off events. For 225/225 co-relation queries the response was YES. Maximal size of possible extension queue 1313. Compared 105283 event pairs, 7144 based on Foata normal form. 1/6854 useless extension candidates. Maximal degree in co-relation 24875. Up to 10130 conditions per place. [2023-11-23 22:29:08,104 INFO L140 encePairwiseOnDemand]: 88/91 looper letters, 50 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2023-11-23 22:29:08,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 75 transitions, 264 flow [2023-11-23 22:29:08,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:29:08,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:29:08,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2023-11-23 22:29:08,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4908424908424908 [2023-11-23 22:29:08,107 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 134 transitions. [2023-11-23 22:29:08,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 134 transitions. [2023-11-23 22:29:08,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:29:08,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 134 transitions. [2023-11-23 22:29:08,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:08,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:08,111 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:08,112 INFO L175 Difference]: Start difference. First operand has 69 places, 60 transitions, 130 flow. Second operand 3 states and 134 transitions. [2023-11-23 22:29:08,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 75 transitions, 264 flow [2023-11-23 22:29:08,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 75 transitions, 260 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 22:29:08,152 INFO L231 Difference]: Finished difference. Result has 68 places, 59 transitions, 128 flow [2023-11-23 22:29:08,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=68, PETRI_TRANSITIONS=59} [2023-11-23 22:29:08,154 INFO L281 CegarLoopForPetriNet]: 96 programPoint places, -28 predicate places. [2023-11-23 22:29:08,154 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 59 transitions, 128 flow [2023-11-23 22:29:08,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:08,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:29:08,159 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-23 22:29:08,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 22:29:08,160 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-23 22:29:08,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:29:08,171 INFO L85 PathProgramCache]: Analyzing trace with hash 857908429, now seen corresponding path program 1 times [2023-11-23 22:29:08,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:29:08,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470111015] [2023-11-23 22:29:08,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:08,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:29:08,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:08,254 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-23 22:29:08,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:29:08,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470111015] [2023-11-23 22:29:08,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470111015] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:29:08,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:29:08,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 22:29:08,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600939496] [2023-11-23 22:29:08,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:29:08,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:29:08,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:29:08,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:29:08,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:29:08,272 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 91 [2023-11-23 22:29:08,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 59 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:08,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:29:08,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 91 [2023-11-23 22:29:08,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:29:11,600 INFO L124 PetriNetUnfolderBase]: 8268/12851 cut-off events. [2023-11-23 22:29:11,601 INFO L125 PetriNetUnfolderBase]: For 225/225 co-relation queries the response was YES. [2023-11-23 22:29:11,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24851 conditions, 12851 events. 8268/12851 cut-off events. For 225/225 co-relation queries the response was YES. Maximal size of possible extension queue 1313. Compared 104576 event pairs, 7189 based on Foata normal form. 0/6818 useless extension candidates. Maximal degree in co-relation 24840. Up to 10133 conditions per place. [2023-11-23 22:29:11,770 INFO L140 encePairwiseOnDemand]: 88/91 looper letters, 51 selfloop transitions, 2 changer transitions 0/74 dead transitions. [2023-11-23 22:29:11,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 74 transitions, 264 flow [2023-11-23 22:29:11,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:29:11,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:29:11,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 132 transitions. [2023-11-23 22:29:11,777 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4835164835164835 [2023-11-23 22:29:11,777 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 132 transitions. [2023-11-23 22:29:11,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 132 transitions. [2023-11-23 22:29:11,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:29:11,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 132 transitions. [2023-11-23 22:29:11,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:11,784 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:11,785 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:11,785 INFO L175 Difference]: Start difference. First operand has 68 places, 59 transitions, 128 flow. Second operand 3 states and 132 transitions. [2023-11-23 22:29:11,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 74 transitions, 264 flow [2023-11-23 22:29:11,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 74 transitions, 260 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 22:29:11,809 INFO L231 Difference]: Finished difference. Result has 67 places, 58 transitions, 126 flow [2023-11-23 22:29:11,810 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=67, PETRI_TRANSITIONS=58} [2023-11-23 22:29:11,812 INFO L281 CegarLoopForPetriNet]: 96 programPoint places, -29 predicate places. [2023-11-23 22:29:11,812 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 58 transitions, 126 flow [2023-11-23 22:29:11,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:11,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:29:11,813 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-23 22:29:11,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 22:29:11,814 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-23 22:29:11,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:29:11,816 INFO L85 PathProgramCache]: Analyzing trace with hash 857908430, now seen corresponding path program 1 times [2023-11-23 22:29:11,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:29:11,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893964996] [2023-11-23 22:29:11,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:11,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:29:11,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:12,027 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-23 22:29:12,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:29:12,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893964996] [2023-11-23 22:29:12,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893964996] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:29:12,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:29:12,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 22:29:12,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858980606] [2023-11-23 22:29:12,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:29:12,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:29:12,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:29:12,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:29:12,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:29:12,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 91 [2023-11-23 22:29:12,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 58 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:12,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:29:12,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 91 [2023-11-23 22:29:12,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:29:14,545 INFO L124 PetriNetUnfolderBase]: 8264/12834 cut-off events. [2023-11-23 22:29:14,546 INFO L125 PetriNetUnfolderBase]: For 229/229 co-relation queries the response was YES. [2023-11-23 22:29:14,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24829 conditions, 12834 events. 8264/12834 cut-off events. For 229/229 co-relation queries the response was YES. Maximal size of possible extension queue 1313. Compared 108251 event pairs, 7185 based on Foata normal form. 5/6804 useless extension candidates. Maximal degree in co-relation 24819. Up to 10124 conditions per place. [2023-11-23 22:29:14,663 INFO L140 encePairwiseOnDemand]: 88/91 looper letters, 50 selfloop transitions, 2 changer transitions 0/73 dead transitions. [2023-11-23 22:29:14,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 73 transitions, 260 flow [2023-11-23 22:29:14,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:29:14,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:29:14,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2023-11-23 22:29:14,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4908424908424908 [2023-11-23 22:29:14,667 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 134 transitions. [2023-11-23 22:29:14,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 134 transitions. [2023-11-23 22:29:14,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:29:14,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 134 transitions. [2023-11-23 22:29:14,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:14,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:14,671 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:14,672 INFO L175 Difference]: Start difference. First operand has 67 places, 58 transitions, 126 flow. Second operand 3 states and 134 transitions. [2023-11-23 22:29:14,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 73 transitions, 260 flow [2023-11-23 22:29:14,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 73 transitions, 256 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 22:29:14,690 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 124 flow [2023-11-23 22:29:14,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2023-11-23 22:29:14,693 INFO L281 CegarLoopForPetriNet]: 96 programPoint places, -30 predicate places. [2023-11-23 22:29:14,693 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 124 flow [2023-11-23 22:29:14,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:14,694 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:29:14,694 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-23 22:29:14,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 22:29:14,695 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-23 22:29:14,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:29:14,696 INFO L85 PathProgramCache]: Analyzing trace with hash 857910521, now seen corresponding path program 1 times [2023-11-23 22:29:14,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:29:14,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640371720] [2023-11-23 22:29:14,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:14,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:29:14,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:14,856 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-23 22:29:14,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:29:14,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640371720] [2023-11-23 22:29:14,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640371720] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:29:14,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:29:14,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 22:29:14,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244966909] [2023-11-23 22:29:14,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:29:14,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 22:29:14,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:29:14,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 22:29:14,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 22:29:14,886 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 91 [2023-11-23 22:29:14,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:14,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:29:14,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 91 [2023-11-23 22:29:14,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:29:16,226 INFO L124 PetriNetUnfolderBase]: 4274/7274 cut-off events. [2023-11-23 22:29:16,226 INFO L125 PetriNetUnfolderBase]: For 115/115 co-relation queries the response was YES. [2023-11-23 22:29:16,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13757 conditions, 7274 events. 4274/7274 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 59748 event pairs, 3014 based on Foata normal form. 0/4819 useless extension candidates. Maximal degree in co-relation 13746. Up to 4121 conditions per place. [2023-11-23 22:29:16,283 INFO L140 encePairwiseOnDemand]: 80/91 looper letters, 55 selfloop transitions, 5 changer transitions 0/80 dead transitions. [2023-11-23 22:29:16,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 80 transitions, 290 flow [2023-11-23 22:29:16,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 22:29:16,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-23 22:29:16,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 178 transitions. [2023-11-23 22:29:16,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.489010989010989 [2023-11-23 22:29:16,294 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 178 transitions. [2023-11-23 22:29:16,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 178 transitions. [2023-11-23 22:29:16,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:29:16,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 178 transitions. [2023-11-23 22:29:16,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:16,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 91.0) internal successors, (455), 5 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:16,299 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 91.0) internal successors, (455), 5 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:16,299 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 124 flow. Second operand 4 states and 178 transitions. [2023-11-23 22:29:16,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 80 transitions, 290 flow [2023-11-23 22:29:16,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 80 transitions, 286 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 22:29:16,306 INFO L231 Difference]: Finished difference. Result has 68 places, 58 transitions, 164 flow [2023-11-23 22:29:16,307 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=164, PETRI_PLACES=68, PETRI_TRANSITIONS=58} [2023-11-23 22:29:16,310 INFO L281 CegarLoopForPetriNet]: 96 programPoint places, -28 predicate places. [2023-11-23 22:29:16,310 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 58 transitions, 164 flow [2023-11-23 22:29:16,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:16,311 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:29:16,311 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-23 22:29:16,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 22:29:16,312 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-23 22:29:16,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:29:16,314 INFO L85 PathProgramCache]: Analyzing trace with hash 857910522, now seen corresponding path program 1 times [2023-11-23 22:29:16,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:29:16,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426679261] [2023-11-23 22:29:16,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:16,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:29:16,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:16,462 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-23 22:29:16,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:29:16,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426679261] [2023-11-23 22:29:16,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426679261] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:29:16,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:29:16,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 22:29:16,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215482211] [2023-11-23 22:29:16,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:29:16,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 22:29:16,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:29:16,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 22:29:16,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-23 22:29:16,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 91 [2023-11-23 22:29:16,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 58 transitions, 164 flow. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:16,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:29:16,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 91 [2023-11-23 22:29:16,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:29:17,181 INFO L124 PetriNetUnfolderBase]: 1505/2808 cut-off events. [2023-11-23 22:29:17,181 INFO L125 PetriNetUnfolderBase]: For 898/898 co-relation queries the response was YES. [2023-11-23 22:29:17,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6375 conditions, 2808 events. 1505/2808 cut-off events. For 898/898 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 21564 event pairs, 1049 based on Foata normal form. 601/3123 useless extension candidates. Maximal degree in co-relation 6361. Up to 1278 conditions per place. [2023-11-23 22:29:17,200 INFO L140 encePairwiseOnDemand]: 83/91 looper letters, 37 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-23 22:29:17,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 60 transitions, 252 flow [2023-11-23 22:29:17,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 22:29:17,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-23 22:29:17,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2023-11-23 22:29:17,202 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4340659340659341 [2023-11-23 22:29:17,202 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 158 transitions. [2023-11-23 22:29:17,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 158 transitions. [2023-11-23 22:29:17,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:29:17,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 158 transitions. [2023-11-23 22:29:17,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:17,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 91.0) internal successors, (455), 5 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:17,205 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 91.0) internal successors, (455), 5 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:17,205 INFO L175 Difference]: Start difference. First operand has 68 places, 58 transitions, 164 flow. Second operand 4 states and 158 transitions. [2023-11-23 22:29:17,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 60 transitions, 252 flow [2023-11-23 22:29:17,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 60 transitions, 250 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-23 22:29:17,208 INFO L231 Difference]: Finished difference. Result has 64 places, 52 transitions, 154 flow [2023-11-23 22:29:17,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=154, PETRI_PLACES=64, PETRI_TRANSITIONS=52} [2023-11-23 22:29:17,210 INFO L281 CegarLoopForPetriNet]: 96 programPoint places, -32 predicate places. [2023-11-23 22:29:17,210 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 52 transitions, 154 flow [2023-11-23 22:29:17,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:17,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:29:17,210 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:29:17,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 22:29:17,211 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-23 22:29:17,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:29:17,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1399430227, now seen corresponding path program 1 times [2023-11-23 22:29:17,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:29:17,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600382195] [2023-11-23 22:29:17,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:17,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:29:17,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:17,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 22:29:17,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:29:17,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600382195] [2023-11-23 22:29:17,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600382195] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:29:17,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:29:17,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 22:29:17,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450896470] [2023-11-23 22:29:17,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:29:17,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:29:17,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:29:17,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:29:17,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:29:17,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 91 [2023-11-23 22:29:17,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 52 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:17,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:29:17,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 91 [2023-11-23 22:29:17,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:29:18,025 INFO L124 PetriNetUnfolderBase]: 1505/2760 cut-off events. [2023-11-23 22:29:18,026 INFO L125 PetriNetUnfolderBase]: For 974/974 co-relation queries the response was YES. [2023-11-23 22:29:18,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6373 conditions, 2760 events. 1505/2760 cut-off events. For 974/974 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 21053 event pairs, 952 based on Foata normal form. 9/2495 useless extension candidates. Maximal degree in co-relation 6358. Up to 1254 conditions per place. [2023-11-23 22:29:18,049 INFO L140 encePairwiseOnDemand]: 88/91 looper letters, 37 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-11-23 22:29:18,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 59 transitions, 252 flow [2023-11-23 22:29:18,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:29:18,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:29:18,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2023-11-23 22:29:18,051 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43223443223443225 [2023-11-23 22:29:18,051 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 118 transitions. [2023-11-23 22:29:18,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 118 transitions. [2023-11-23 22:29:18,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:29:18,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 118 transitions. [2023-11-23 22:29:18,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:18,053 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:18,054 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:18,054 INFO L175 Difference]: Start difference. First operand has 64 places, 52 transitions, 154 flow. Second operand 3 states and 118 transitions. [2023-11-23 22:29:18,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 59 transitions, 252 flow [2023-11-23 22:29:18,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 59 transitions, 249 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 22:29:18,057 INFO L231 Difference]: Finished difference. Result has 63 places, 51 transitions, 153 flow [2023-11-23 22:29:18,058 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=153, PETRI_PLACES=63, PETRI_TRANSITIONS=51} [2023-11-23 22:29:18,058 INFO L281 CegarLoopForPetriNet]: 96 programPoint places, -33 predicate places. [2023-11-23 22:29:18,059 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 51 transitions, 153 flow [2023-11-23 22:29:18,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:18,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:29:18,059 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:29:18,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 22:29:18,059 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-23 22:29:18,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:29:18,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1399430228, now seen corresponding path program 1 times [2023-11-23 22:29:18,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:29:18,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187306820] [2023-11-23 22:29:18,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:18,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:29:18,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:18,133 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-23 22:29:18,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:29:18,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187306820] [2023-11-23 22:29:18,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187306820] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:29:18,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:29:18,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 22:29:18,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739545053] [2023-11-23 22:29:18,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:29:18,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:29:18,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:29:18,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:29:18,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:29:18,149 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 91 [2023-11-23 22:29:18,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 51 transitions, 153 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:18,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:29:18,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 91 [2023-11-23 22:29:18,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:29:18,870 INFO L124 PetriNetUnfolderBase]: 1517/2775 cut-off events. [2023-11-23 22:29:18,870 INFO L125 PetriNetUnfolderBase]: For 986/986 co-relation queries the response was YES. [2023-11-23 22:29:18,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6468 conditions, 2775 events. 1517/2775 cut-off events. For 986/986 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 21184 event pairs, 958 based on Foata normal form. 0/2498 useless extension candidates. Maximal degree in co-relation 6454. Up to 1275 conditions per place. [2023-11-23 22:29:18,889 INFO L140 encePairwiseOnDemand]: 88/91 looper letters, 38 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-11-23 22:29:18,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 58 transitions, 253 flow [2023-11-23 22:29:18,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:29:18,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:29:18,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2023-11-23 22:29:18,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4249084249084249 [2023-11-23 22:29:18,891 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 116 transitions. [2023-11-23 22:29:18,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 116 transitions. [2023-11-23 22:29:18,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:29:18,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 116 transitions. [2023-11-23 22:29:18,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:18,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:18,894 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:18,894 INFO L175 Difference]: Start difference. First operand has 63 places, 51 transitions, 153 flow. Second operand 3 states and 116 transitions. [2023-11-23 22:29:18,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 58 transitions, 253 flow [2023-11-23 22:29:18,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 58 transitions, 249 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 22:29:18,898 INFO L231 Difference]: Finished difference. Result has 62 places, 50 transitions, 151 flow [2023-11-23 22:29:18,898 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=151, PETRI_PLACES=62, PETRI_TRANSITIONS=50} [2023-11-23 22:29:18,899 INFO L281 CegarLoopForPetriNet]: 96 programPoint places, -34 predicate places. [2023-11-23 22:29:18,899 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 50 transitions, 151 flow [2023-11-23 22:29:18,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:18,900 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:29:18,900 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:29:18,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 22:29:18,900 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-23 22:29:18,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:29:18,901 INFO L85 PathProgramCache]: Analyzing trace with hash 822565773, now seen corresponding path program 1 times [2023-11-23 22:29:18,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:29:18,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687969287] [2023-11-23 22:29:18,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:18,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:29:18,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:19,051 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-23 22:29:19,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:29:19,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687969287] [2023-11-23 22:29:19,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687969287] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:29:19,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:29:19,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 22:29:19,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052244965] [2023-11-23 22:29:19,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:29:19,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:29:19,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:29:19,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:29:19,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:29:19,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 91 [2023-11-23 22:29:19,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 50 transitions, 151 flow. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:19,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:29:19,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 91 [2023-11-23 22:29:19,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:29:19,906 INFO L124 PetriNetUnfolderBase]: 1216/2212 cut-off events. [2023-11-23 22:29:19,906 INFO L125 PetriNetUnfolderBase]: For 671/671 co-relation queries the response was YES. [2023-11-23 22:29:19,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5290 conditions, 2212 events. 1216/2212 cut-off events. For 671/671 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 15957 event pairs, 223 based on Foata normal form. 0/2097 useless extension candidates. Maximal degree in co-relation 5276. Up to 1575 conditions per place. [2023-11-23 22:29:19,923 INFO L140 encePairwiseOnDemand]: 88/91 looper letters, 46 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-11-23 22:29:19,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 67 transitions, 307 flow [2023-11-23 22:29:19,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:29:19,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:29:19,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2023-11-23 22:29:19,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46886446886446886 [2023-11-23 22:29:19,925 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 128 transitions. [2023-11-23 22:29:19,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 128 transitions. [2023-11-23 22:29:19,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:29:19,925 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 128 transitions. [2023-11-23 22:29:19,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:19,927 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:19,928 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:19,928 INFO L175 Difference]: Start difference. First operand has 62 places, 50 transitions, 151 flow. Second operand 3 states and 128 transitions. [2023-11-23 22:29:19,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 67 transitions, 307 flow [2023-11-23 22:29:19,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 67 transitions, 301 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 22:29:19,932 INFO L231 Difference]: Finished difference. Result has 61 places, 49 transitions, 149 flow [2023-11-23 22:29:19,932 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=149, PETRI_PLACES=61, PETRI_TRANSITIONS=49} [2023-11-23 22:29:19,933 INFO L281 CegarLoopForPetriNet]: 96 programPoint places, -35 predicate places. [2023-11-23 22:29:19,933 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 149 flow [2023-11-23 22:29:19,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:19,934 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:29:19,934 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:29:19,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 22:29:19,935 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-23 22:29:19,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:29:19,935 INFO L85 PathProgramCache]: Analyzing trace with hash -2145124567, now seen corresponding path program 1 times [2023-11-23 22:29:19,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:29:19,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678783681] [2023-11-23 22:29:19,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:19,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:29:19,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:20,080 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-23 22:29:20,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:29:20,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678783681] [2023-11-23 22:29:20,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678783681] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:29:20,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:29:20,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 22:29:20,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460108981] [2023-11-23 22:29:20,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:29:20,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:29:20,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:29:20,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:29:20,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:29:20,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 91 [2023-11-23 22:29:20,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 149 flow. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:20,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:29:20,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 91 [2023-11-23 22:29:20,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:29:20,898 INFO L124 PetriNetUnfolderBase]: 1158/2404 cut-off events. [2023-11-23 22:29:20,899 INFO L125 PetriNetUnfolderBase]: For 768/776 co-relation queries the response was YES. [2023-11-23 22:29:20,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5449 conditions, 2404 events. 1158/2404 cut-off events. For 768/776 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 18978 event pairs, 396 based on Foata normal form. 0/2284 useless extension candidates. Maximal degree in co-relation 5434. Up to 1275 conditions per place. [2023-11-23 22:29:20,913 INFO L140 encePairwiseOnDemand]: 87/91 looper letters, 49 selfloop transitions, 3 changer transitions 0/71 dead transitions. [2023-11-23 22:29:20,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 71 transitions, 331 flow [2023-11-23 22:29:20,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:29:20,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 22:29:20,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 133 transitions. [2023-11-23 22:29:20,916 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48717948717948717 [2023-11-23 22:29:20,916 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 133 transitions. [2023-11-23 22:29:20,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 133 transitions. [2023-11-23 22:29:20,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:29:20,917 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 133 transitions. [2023-11-23 22:29:20,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:20,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:20,920 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:20,920 INFO L175 Difference]: Start difference. First operand has 61 places, 49 transitions, 149 flow. Second operand 3 states and 133 transitions. [2023-11-23 22:29:20,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 71 transitions, 331 flow [2023-11-23 22:29:20,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 71 transitions, 325 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 22:29:20,924 INFO L231 Difference]: Finished difference. Result has 62 places, 49 transitions, 158 flow [2023-11-23 22:29:20,925 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=62, PETRI_TRANSITIONS=49} [2023-11-23 22:29:20,926 INFO L281 CegarLoopForPetriNet]: 96 programPoint places, -34 predicate places. [2023-11-23 22:29:20,926 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 49 transitions, 158 flow [2023-11-23 22:29:20,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:20,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:29:20,927 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:29:20,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-23 22:29:20,927 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-23 22:29:20,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:29:20,928 INFO L85 PathProgramCache]: Analyzing trace with hash 119662745, now seen corresponding path program 1 times [2023-11-23 22:29:20,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:29:20,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136940234] [2023-11-23 22:29:20,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:20,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:29:20,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:21,305 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-23 22:29:21,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:29:21,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136940234] [2023-11-23 22:29:21,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136940234] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:29:21,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:29:21,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 22:29:21,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376994767] [2023-11-23 22:29:21,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:29:21,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 22:29:21,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:29:21,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 22:29:21,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 22:29:21,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 91 [2023-11-23 22:29:21,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 49 transitions, 158 flow. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:21,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:29:21,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 91 [2023-11-23 22:29:21,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:29:22,165 INFO L124 PetriNetUnfolderBase]: 1112/2266 cut-off events. [2023-11-23 22:29:22,165 INFO L125 PetriNetUnfolderBase]: For 977/985 co-relation queries the response was YES. [2023-11-23 22:29:22,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5465 conditions, 2266 events. 1112/2266 cut-off events. For 977/985 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 17099 event pairs, 492 based on Foata normal form. 0/2214 useless extension candidates. Maximal degree in co-relation 5449. Up to 1204 conditions per place. [2023-11-23 22:29:22,177 INFO L140 encePairwiseOnDemand]: 88/91 looper letters, 48 selfloop transitions, 3 changer transitions 0/70 dead transitions. [2023-11-23 22:29:22,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 70 transitions, 332 flow [2023-11-23 22:29:22,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 22:29:22,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-23 22:29:22,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2023-11-23 22:29:22,179 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4368131868131868 [2023-11-23 22:29:22,179 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 159 transitions. [2023-11-23 22:29:22,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 159 transitions. [2023-11-23 22:29:22,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:29:22,180 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 159 transitions. [2023-11-23 22:29:22,180 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:22,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 91.0) internal successors, (455), 5 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:22,182 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 91.0) internal successors, (455), 5 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:22,182 INFO L175 Difference]: Start difference. First operand has 62 places, 49 transitions, 158 flow. Second operand 4 states and 159 transitions. [2023-11-23 22:29:22,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 70 transitions, 332 flow [2023-11-23 22:29:22,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 70 transitions, 326 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 22:29:22,185 INFO L231 Difference]: Finished difference. Result has 62 places, 48 transitions, 154 flow [2023-11-23 22:29:22,186 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=154, PETRI_PLACES=62, PETRI_TRANSITIONS=48} [2023-11-23 22:29:22,186 INFO L281 CegarLoopForPetriNet]: 96 programPoint places, -34 predicate places. [2023-11-23 22:29:22,187 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 48 transitions, 154 flow [2023-11-23 22:29:22,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:22,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:29:22,187 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:29:22,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-23 22:29:22,188 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-23 22:29:22,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:29:22,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1225288290, now seen corresponding path program 1 times [2023-11-23 22:29:22,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:29:22,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937865901] [2023-11-23 22:29:22,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:22,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:29:22,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:22,366 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-23 22:29:22,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:29:22,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937865901] [2023-11-23 22:29:22,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937865901] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:29:22,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:29:22,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 22:29:22,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28519341] [2023-11-23 22:29:22,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:29:22,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 22:29:22,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:29:22,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 22:29:22,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 22:29:22,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 91 [2023-11-23 22:29:22,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 48 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:22,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:29:22,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 91 [2023-11-23 22:29:22,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:29:23,101 INFO L124 PetriNetUnfolderBase]: 1130/2440 cut-off events. [2023-11-23 22:29:23,101 INFO L125 PetriNetUnfolderBase]: For 963/971 co-relation queries the response was YES. [2023-11-23 22:29:23,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5675 conditions, 2440 events. 1130/2440 cut-off events. For 963/971 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 19860 event pairs, 260 based on Foata normal form. 24/2428 useless extension candidates. Maximal degree in co-relation 5659. Up to 862 conditions per place. [2023-11-23 22:29:23,112 INFO L140 encePairwiseOnDemand]: 85/91 looper letters, 44 selfloop transitions, 7 changer transitions 0/70 dead transitions. [2023-11-23 22:29:23,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 70 transitions, 310 flow [2023-11-23 22:29:23,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 22:29:23,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-23 22:29:23,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 164 transitions. [2023-11-23 22:29:23,114 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45054945054945056 [2023-11-23 22:29:23,114 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 164 transitions. [2023-11-23 22:29:23,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 164 transitions. [2023-11-23 22:29:23,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:29:23,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 164 transitions. [2023-11-23 22:29:23,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:23,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 91.0) internal successors, (455), 5 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:23,117 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 91.0) internal successors, (455), 5 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:23,117 INFO L175 Difference]: Start difference. First operand has 62 places, 48 transitions, 154 flow. Second operand 4 states and 164 transitions. [2023-11-23 22:29:23,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 70 transitions, 310 flow [2023-11-23 22:29:23,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 70 transitions, 303 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-23 22:29:23,120 INFO L231 Difference]: Finished difference. Result has 61 places, 48 transitions, 163 flow [2023-11-23 22:29:23,120 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=163, PETRI_PLACES=61, PETRI_TRANSITIONS=48} [2023-11-23 22:29:23,120 INFO L281 CegarLoopForPetriNet]: 96 programPoint places, -35 predicate places. [2023-11-23 22:29:23,121 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 48 transitions, 163 flow [2023-11-23 22:29:23,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.75) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:23,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:29:23,121 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:29:23,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-23 22:29:23,122 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-23 22:29:23,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:29:23,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1005630617, now seen corresponding path program 1 times [2023-11-23 22:29:23,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:29:23,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438430388] [2023-11-23 22:29:23,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:23,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:29:23,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:23,585 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-23 22:29:23,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:29:23,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438430388] [2023-11-23 22:29:23,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438430388] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:29:23,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:29:23,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 22:29:23,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613396124] [2023-11-23 22:29:23,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:29:23,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 22:29:23,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:29:23,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 22:29:23,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-23 22:29:23,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 91 [2023-11-23 22:29:23,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 48 transitions, 163 flow. Second operand has 8 states, 8 states have (on average 24.875) internal successors, (199), 8 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:23,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:29:23,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 91 [2023-11-23 22:29:23,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:29:24,295 INFO L124 PetriNetUnfolderBase]: 1132/2217 cut-off events. [2023-11-23 22:29:24,295 INFO L125 PetriNetUnfolderBase]: For 1185/1185 co-relation queries the response was YES. [2023-11-23 22:29:24,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5576 conditions, 2217 events. 1132/2217 cut-off events. For 1185/1185 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 16958 event pairs, 382 based on Foata normal form. 0/2168 useless extension candidates. Maximal degree in co-relation 5560. Up to 1028 conditions per place. [2023-11-23 22:29:24,306 INFO L140 encePairwiseOnDemand]: 86/91 looper letters, 39 selfloop transitions, 5 changer transitions 0/60 dead transitions. [2023-11-23 22:29:24,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 60 transitions, 296 flow [2023-11-23 22:29:24,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 22:29:24,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-23 22:29:24,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 179 transitions. [2023-11-23 22:29:24,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32783882783882784 [2023-11-23 22:29:24,308 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 179 transitions. [2023-11-23 22:29:24,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 179 transitions. [2023-11-23 22:29:24,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:29:24,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 179 transitions. [2023-11-23 22:29:24,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:24,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 91.0) internal successors, (637), 7 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:24,311 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 91.0) internal successors, (637), 7 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:24,311 INFO L175 Difference]: Start difference. First operand has 61 places, 48 transitions, 163 flow. Second operand 6 states and 179 transitions. [2023-11-23 22:29:24,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 60 transitions, 296 flow [2023-11-23 22:29:24,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 60 transitions, 290 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-23 22:29:24,314 INFO L231 Difference]: Finished difference. Result has 64 places, 47 transitions, 165 flow [2023-11-23 22:29:24,315 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=165, PETRI_PLACES=64, PETRI_TRANSITIONS=47} [2023-11-23 22:29:24,315 INFO L281 CegarLoopForPetriNet]: 96 programPoint places, -32 predicate places. [2023-11-23 22:29:24,316 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 47 transitions, 165 flow [2023-11-23 22:29:24,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 24.875) internal successors, (199), 8 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:24,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:29:24,316 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:29:24,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-23 22:29:24,317 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-23 22:29:24,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:29:24,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1005631711, now seen corresponding path program 1 times [2023-11-23 22:29:24,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:29:24,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834654416] [2023-11-23 22:29:24,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:24,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:29:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:24,501 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-23 22:29:24,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:29:24,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834654416] [2023-11-23 22:29:24,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834654416] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:29:24,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:29:24,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 22:29:24,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325240750] [2023-11-23 22:29:24,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:29:24,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 22:29:24,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:29:24,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 22:29:24,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 22:29:24,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 91 [2023-11-23 22:29:24,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 47 transitions, 165 flow. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:24,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:29:24,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 91 [2023-11-23 22:29:24,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:29:25,255 INFO L124 PetriNetUnfolderBase]: 2227/3786 cut-off events. [2023-11-23 22:29:25,255 INFO L125 PetriNetUnfolderBase]: For 1563/1563 co-relation queries the response was YES. [2023-11-23 22:29:25,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9075 conditions, 3786 events. 2227/3786 cut-off events. For 1563/1563 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 25536 event pairs, 361 based on Foata normal form. 80/3828 useless extension candidates. Maximal degree in co-relation 9059. Up to 2713 conditions per place. [2023-11-23 22:29:25,272 INFO L140 encePairwiseOnDemand]: 85/91 looper letters, 50 selfloop transitions, 5 changer transitions 1/70 dead transitions. [2023-11-23 22:29:25,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 70 transitions, 349 flow [2023-11-23 22:29:25,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 22:29:25,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-23 22:29:25,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2023-11-23 22:29:25,273 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41208791208791207 [2023-11-23 22:29:25,274 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 150 transitions. [2023-11-23 22:29:25,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 150 transitions. [2023-11-23 22:29:25,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:29:25,274 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 150 transitions. [2023-11-23 22:29:25,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:25,276 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 91.0) internal successors, (455), 5 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:25,276 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 91.0) internal successors, (455), 5 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:25,276 INFO L175 Difference]: Start difference. First operand has 64 places, 47 transitions, 165 flow. Second operand 4 states and 150 transitions. [2023-11-23 22:29:25,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 70 transitions, 349 flow [2023-11-23 22:29:25,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 70 transitions, 337 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-23 22:29:25,279 INFO L231 Difference]: Finished difference. Result has 65 places, 50 transitions, 191 flow [2023-11-23 22:29:25,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=191, PETRI_PLACES=65, PETRI_TRANSITIONS=50} [2023-11-23 22:29:25,280 INFO L281 CegarLoopForPetriNet]: 96 programPoint places, -31 predicate places. [2023-11-23 22:29:25,280 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 50 transitions, 191 flow [2023-11-23 22:29:25,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:25,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:29:25,281 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-23 22:29:25,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-23 22:29:25,281 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-23 22:29:25,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:29:25,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1169898816, now seen corresponding path program 1 times [2023-11-23 22:29:25,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:29:25,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563697478] [2023-11-23 22:29:25,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:25,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:29:25,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:25,576 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-23 22:29:25,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:29:25,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563697478] [2023-11-23 22:29:25,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563697478] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:29:25,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:29:25,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 22:29:25,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745246572] [2023-11-23 22:29:25,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:29:25,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 22:29:25,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:29:25,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 22:29:25,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 22:29:25,582 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 91 [2023-11-23 22:29:25,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 50 transitions, 191 flow. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:25,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:29:25,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 91 [2023-11-23 22:29:25,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:29:26,046 INFO L124 PetriNetUnfolderBase]: 1115/1914 cut-off events. [2023-11-23 22:29:26,047 INFO L125 PetriNetUnfolderBase]: For 1016/1016 co-relation queries the response was YES. [2023-11-23 22:29:26,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4973 conditions, 1914 events. 1115/1914 cut-off events. For 1016/1016 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 10653 event pairs, 111 based on Foata normal form. 68/1968 useless extension candidates. Maximal degree in co-relation 4955. Up to 1037 conditions per place. [2023-11-23 22:29:26,056 INFO L140 encePairwiseOnDemand]: 85/91 looper letters, 57 selfloop transitions, 8 changer transitions 4/83 dead transitions. [2023-11-23 22:29:26,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 83 transitions, 443 flow [2023-11-23 22:29:26,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 22:29:26,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-23 22:29:26,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 187 transitions. [2023-11-23 22:29:26,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41098901098901097 [2023-11-23 22:29:26,058 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 187 transitions. [2023-11-23 22:29:26,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 187 transitions. [2023-11-23 22:29:26,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:29:26,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 187 transitions. [2023-11-23 22:29:26,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:26,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 91.0) internal successors, (546), 6 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:26,061 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 91.0) internal successors, (546), 6 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:26,062 INFO L175 Difference]: Start difference. First operand has 65 places, 50 transitions, 191 flow. Second operand 5 states and 187 transitions. [2023-11-23 22:29:26,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 83 transitions, 443 flow [2023-11-23 22:29:26,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 83 transitions, 422 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-11-23 22:29:26,066 INFO L231 Difference]: Finished difference. Result has 68 places, 50 transitions, 201 flow [2023-11-23 22:29:26,067 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=201, PETRI_PLACES=68, PETRI_TRANSITIONS=50} [2023-11-23 22:29:26,067 INFO L281 CegarLoopForPetriNet]: 96 programPoint places, -28 predicate places. [2023-11-23 22:29:26,068 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 50 transitions, 201 flow [2023-11-23 22:29:26,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:26,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:29:26,068 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:29:26,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-23 22:29:26,069 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-23 22:29:26,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:29:26,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1392379707, now seen corresponding path program 1 times [2023-11-23 22:29:26,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:29:26,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128583910] [2023-11-23 22:29:26,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:26,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:29:26,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:26,395 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-23 22:29:26,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:29:26,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128583910] [2023-11-23 22:29:26,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128583910] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:29:26,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:29:26,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 22:29:26,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586392739] [2023-11-23 22:29:26,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:29:26,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 22:29:26,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:29:26,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 22:29:26,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-23 22:29:26,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 91 [2023-11-23 22:29:26,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 50 transitions, 201 flow. Second operand has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:26,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:29:26,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 91 [2023-11-23 22:29:26,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 22:29:26,791 INFO L124 PetriNetUnfolderBase]: 499/846 cut-off events. [2023-11-23 22:29:26,791 INFO L125 PetriNetUnfolderBase]: For 924/924 co-relation queries the response was YES. [2023-11-23 22:29:26,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2468 conditions, 846 events. 499/846 cut-off events. For 924/924 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3681 event pairs, 53 based on Foata normal form. 36/876 useless extension candidates. Maximal degree in co-relation 2449. Up to 268 conditions per place. [2023-11-23 22:29:26,798 INFO L140 encePairwiseOnDemand]: 85/91 looper letters, 44 selfloop transitions, 11 changer transitions 3/72 dead transitions. [2023-11-23 22:29:26,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 72 transitions, 375 flow [2023-11-23 22:29:26,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 22:29:26,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-23 22:29:26,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 204 transitions. [2023-11-23 22:29:26,800 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37362637362637363 [2023-11-23 22:29:26,800 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 204 transitions. [2023-11-23 22:29:26,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 204 transitions. [2023-11-23 22:29:26,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 22:29:26,801 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 204 transitions. [2023-11-23 22:29:26,802 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 34.0) internal successors, (204), 6 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:26,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 91.0) internal successors, (637), 7 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:26,804 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 91.0) internal successors, (637), 7 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:26,805 INFO L175 Difference]: Start difference. First operand has 68 places, 50 transitions, 201 flow. Second operand 6 states and 204 transitions. [2023-11-23 22:29:26,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 72 transitions, 375 flow [2023-11-23 22:29:26,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 72 transitions, 338 flow, removed 4 selfloop flow, removed 8 redundant places. [2023-11-23 22:29:26,810 INFO L231 Difference]: Finished difference. Result has 62 places, 43 transitions, 176 flow [2023-11-23 22:29:26,810 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=176, PETRI_PLACES=62, PETRI_TRANSITIONS=43} [2023-11-23 22:29:26,811 INFO L281 CegarLoopForPetriNet]: 96 programPoint places, -34 predicate places. [2023-11-23 22:29:26,811 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 43 transitions, 176 flow [2023-11-23 22:29:26,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:26,812 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:29:26,812 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:29:26,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-23 22:29:26,812 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-23 22:29:26,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:29:26,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1161195702, now seen corresponding path program 1 times [2023-11-23 22:29:26,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:29:26,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520448876] [2023-11-23 22:29:26,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:26,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:29:26,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:29:26,943 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 22:29:27,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:29:27,091 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 22:29:27,092 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-23 22:29:27,093 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (82 of 83 remaining) [2023-11-23 22:29:27,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 83 remaining) [2023-11-23 22:29:27,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 83 remaining) [2023-11-23 22:29:27,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 83 remaining) [2023-11-23 22:29:27,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 83 remaining) [2023-11-23 22:29:27,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 83 remaining) [2023-11-23 22:29:27,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 83 remaining) [2023-11-23 22:29:27,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 83 remaining) [2023-11-23 22:29:27,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 83 remaining) [2023-11-23 22:29:27,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 83 remaining) [2023-11-23 22:29:27,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 83 remaining) [2023-11-23 22:29:27,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 83 remaining) [2023-11-23 22:29:27,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 83 remaining) [2023-11-23 22:29:27,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 83 remaining) [2023-11-23 22:29:27,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 83 remaining) [2023-11-23 22:29:27,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 83 remaining) [2023-11-23 22:29:27,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 83 remaining) [2023-11-23 22:29:27,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 83 remaining) [2023-11-23 22:29:27,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 83 remaining) [2023-11-23 22:29:27,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 83 remaining) [2023-11-23 22:29:27,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 83 remaining) [2023-11-23 22:29:27,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 83 remaining) [2023-11-23 22:29:27,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 83 remaining) [2023-11-23 22:29:27,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 83 remaining) [2023-11-23 22:29:27,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 83 remaining) [2023-11-23 22:29:27,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 83 remaining) [2023-11-23 22:29:27,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 83 remaining) [2023-11-23 22:29:27,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 83 remaining) [2023-11-23 22:29:27,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 83 remaining) [2023-11-23 22:29:27,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (53 of 83 remaining) [2023-11-23 22:29:27,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 83 remaining) [2023-11-23 22:29:27,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 83 remaining) [2023-11-23 22:29:27,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 83 remaining) [2023-11-23 22:29:27,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 83 remaining) [2023-11-23 22:29:27,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 83 remaining) [2023-11-23 22:29:27,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 83 remaining) [2023-11-23 22:29:27,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 83 remaining) [2023-11-23 22:29:27,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 83 remaining) [2023-11-23 22:29:27,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 83 remaining) [2023-11-23 22:29:27,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 83 remaining) [2023-11-23 22:29:27,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 83 remaining) [2023-11-23 22:29:27,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 83 remaining) [2023-11-23 22:29:27,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 83 remaining) [2023-11-23 22:29:27,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 83 remaining) [2023-11-23 22:29:27,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 83 remaining) [2023-11-23 22:29:27,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 83 remaining) [2023-11-23 22:29:27,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (36 of 83 remaining) [2023-11-23 22:29:27,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 83 remaining) [2023-11-23 22:29:27,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 83 remaining) [2023-11-23 22:29:27,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 83 remaining) [2023-11-23 22:29:27,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 83 remaining) [2023-11-23 22:29:27,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 83 remaining) [2023-11-23 22:29:27,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 83 remaining) [2023-11-23 22:29:27,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 83 remaining) [2023-11-23 22:29:27,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 83 remaining) [2023-11-23 22:29:27,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 83 remaining) [2023-11-23 22:29:27,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 83 remaining) [2023-11-23 22:29:27,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 83 remaining) [2023-11-23 22:29:27,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 83 remaining) [2023-11-23 22:29:27,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 83 remaining) [2023-11-23 22:29:27,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 83 remaining) [2023-11-23 22:29:27,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 83 remaining) [2023-11-23 22:29:27,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 83 remaining) [2023-11-23 22:29:27,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 83 remaining) [2023-11-23 22:29:27,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 83 remaining) [2023-11-23 22:29:27,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 83 remaining) [2023-11-23 22:29:27,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 83 remaining) [2023-11-23 22:29:27,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 83 remaining) [2023-11-23 22:29:27,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 83 remaining) [2023-11-23 22:29:27,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 83 remaining) [2023-11-23 22:29:27,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 83 remaining) [2023-11-23 22:29:27,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 83 remaining) [2023-11-23 22:29:27,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 83 remaining) [2023-11-23 22:29:27,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 83 remaining) [2023-11-23 22:29:27,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 83 remaining) [2023-11-23 22:29:27,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 83 remaining) [2023-11-23 22:29:27,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 83 remaining) [2023-11-23 22:29:27,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 83 remaining) [2023-11-23 22:29:27,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 83 remaining) [2023-11-23 22:29:27,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 83 remaining) [2023-11-23 22:29:27,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 83 remaining) [2023-11-23 22:29:27,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 83 remaining) [2023-11-23 22:29:27,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 83 remaining) [2023-11-23 22:29:27,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-23 22:29:27,116 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:29:27,124 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-23 22:29:27,124 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 22:29:27,230 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre30 could not be translated [2023-11-23 22:29:27,235 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre32 could not be translated [2023-11-23 22:29:27,241 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre34 could not be translated [2023-11-23 22:29:27,252 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-23 22:29:27,253 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-23 22:29:27,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:29:27 BasicIcfg [2023-11-23 22:29:27,281 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 22:29:27,282 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 22:29:27,282 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 22:29:27,282 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 22:29:27,283 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:29:00" (3/4) ... [2023-11-23 22:29:27,287 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-23 22:29:27,288 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 22:29:27,289 INFO L158 Benchmark]: Toolchain (without parser) took 29950.30ms. Allocated memory was 172.0MB in the beginning and 3.9GB in the end (delta: 3.8GB). Free memory was 139.3MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2023-11-23 22:29:27,289 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 130.0MB. Free memory is still 102.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 22:29:27,290 INFO L158 Benchmark]: CACSL2BoogieTranslator took 735.92ms. Allocated memory is still 172.0MB. Free memory was 139.3MB in the beginning and 114.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-23 22:29:27,291 INFO L158 Benchmark]: Boogie Procedure Inliner took 112.49ms. Allocated memory is still 172.0MB. Free memory was 114.1MB in the beginning and 110.9MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 22:29:27,292 INFO L158 Benchmark]: Boogie Preprocessor took 92.88ms. Allocated memory is still 172.0MB. Free memory was 110.9MB in the beginning and 108.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 22:29:27,292 INFO L158 Benchmark]: RCFGBuilder took 1740.99ms. Allocated memory is still 172.0MB. Free memory was 108.4MB in the beginning and 77.3MB in the end (delta: 31.1MB). Peak memory consumption was 53.2MB. Max. memory is 16.1GB. [2023-11-23 22:29:27,293 INFO L158 Benchmark]: TraceAbstraction took 27253.46ms. Allocated memory was 172.0MB in the beginning and 3.9GB in the end (delta: 3.8GB). Free memory was 77.3MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2023-11-23 22:29:27,293 INFO L158 Benchmark]: Witness Printer took 6.44ms. Allocated memory is still 3.9GB. Free memory is still 2.3GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 22:29:27,297 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.29ms. Allocated memory is still 130.0MB. Free memory is still 102.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 735.92ms. Allocated memory is still 172.0MB. Free memory was 139.3MB in the beginning and 114.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 112.49ms. Allocated memory is still 172.0MB. Free memory was 114.1MB in the beginning and 110.9MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 92.88ms. Allocated memory is still 172.0MB. Free memory was 110.9MB in the beginning and 108.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1740.99ms. Allocated memory is still 172.0MB. Free memory was 108.4MB in the beginning and 77.3MB in the end (delta: 31.1MB). Peak memory consumption was 53.2MB. Max. memory is 16.1GB. * TraceAbstraction took 27253.46ms. Allocated memory was 172.0MB in the beginning and 3.9GB in the end (delta: 3.8GB). Free memory was 77.3MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 6.44ms. Allocated memory is still 3.9GB. Free memory is still 2.3GB. 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~pre30 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre32 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre34 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - 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: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p1_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L857] 0 pthread_t t1684; [L858] FCALL, FORK 0 pthread_create(&t1684, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1684={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 x$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(x) [L764] 1 x$mem_tmp = x [L765] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L766] EXPR 1 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L766] EXPR 1 \read(x) [L766] EXPR 1 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L766] 1 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L767] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)))) [L768] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)))) [L769] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L770] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$r_buff1_thd1 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L774] 1 __unbuffered_p0_EAX$read_delayed_var = &x [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L780] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L859] 0 pthread_t t1685; [L860] FCALL, FORK 0 pthread_create(&t1685, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1684={6:0}, t1685={7:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L792] 2 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L795] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L798] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 2 x$flush_delayed = weak$$choice2 [L801] EXPR 2 \read(x) [L801] 2 x$mem_tmp = x [L802] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L802] EXPR 2 \read(x) [L802] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L802] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L803] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L804] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L805] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L806] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L807] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L808] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L809] EXPR 2 \read(x) [L809] 2 __unbuffered_p1_EBX = x [L810] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L810] EXPR 2 \read(x) [L810] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L810] 2 x = x$flush_delayed ? x$mem_tmp : x [L811] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L861] 0 pthread_t t1686; [L862] FCALL, FORK 0 pthread_create(&t1686, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1684={6:0}, t1685={7:0}, t1686={5:0}, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L823] 3 x$w_buff1 = x$w_buff0 [L824] 3 x$w_buff0 = 1 [L825] 3 x$w_buff1_used = x$w_buff0_used [L826] 3 x$w_buff0_used = (_Bool)1 [L827] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L827] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L828] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L829] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L830] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L831] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L832] 3 x$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L835] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L835] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L836] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L837] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L838] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L839] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L816] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L842] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L864] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1684={6:0}, t1685={7:0}, t1686={5:0}, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L866] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L866] RET 0 assume_abort_if_not(main$tmp_guard0) [L868] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L868] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L868] EXPR 0 \read(x) [L868] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L868] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L868] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L869] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L870] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L871] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L872] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1684={6:0}, t1685={7:0}, t1686={5:0}, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L875] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L876] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L876] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L876] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L876] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L876] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L876] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L877] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1684={6:0}, t1685={7:0}, t1686={5:0}, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L879] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L18] 0 __assert_fail ("0", "rfi006_power.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] - 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: -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: -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: -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: 18]: 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: -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: 855]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 862]: 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: 860]: 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: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 147 locations, 83 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: 26.8s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 22.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 836 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 698 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1463 IncrementalHoareTripleChecker+Invalid, 1554 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 7 mSDtfsCounter, 1463 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=201occurred in iteration=15, InterpolantAutomatonStates: 61, 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, 2.6s InterpolantComputationTime, 215 NumberOfCodeBlocks, 215 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 166 ConstructedInterpolants, 0 QuantifiedInterpolants, 816 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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-23 22:29:27,364 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_748f899b-bf09-4aa3-8259-52ae05445b5a/bin/uautomizer-verify-zZY32mL2XJ/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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_748f899b-bf09-4aa3-8259-52ae05445b5a/bin/uautomizer-verify-zZY32mL2XJ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_748f899b-bf09-4aa3-8259-52ae05445b5a/bin/uautomizer-verify-zZY32mL2XJ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_748f899b-bf09-4aa3-8259-52ae05445b5a/bin/uautomizer-verify-zZY32mL2XJ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_748f899b-bf09-4aa3-8259-52ae05445b5a/bin/uautomizer-verify-zZY32mL2XJ/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi006_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_748f899b-bf09-4aa3-8259-52ae05445b5a/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_748f899b-bf09-4aa3-8259-52ae05445b5a/bin/uautomizer-verify-zZY32mL2XJ --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 de3096cf2a7a81c5a5563cf2e9ae3ddf8f4cc1ab1b483fb6503759d4e39a0a81 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 22:29:30,069 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 22:29:30,172 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_748f899b-bf09-4aa3-8259-52ae05445b5a/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-23 22:29:30,181 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 22:29:30,184 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 22:29:30,230 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 22:29:30,231 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 22:29:30,231 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 22:29:30,232 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 22:29:30,237 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 22:29:30,238 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 22:29:30,239 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 22:29:30,239 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 22:29:30,241 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 22:29:30,241 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 22:29:30,242 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 22:29:30,242 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 22:29:30,243 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 22:29:30,243 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-23 22:29:30,244 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-23 22:29:30,245 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-23 22:29:30,245 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 22:29:30,246 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-23 22:29:30,246 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-23 22:29:30,247 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-23 22:29:30,247 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-23 22:29:30,247 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 22:29:30,248 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 22:29:30,249 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 22:29:30,249 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 22:29:30,251 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 22:29:30,251 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 22:29:30,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 22:29:30,252 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 22:29:30,252 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 22:29:30,252 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-23 22:29:30,252 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-23 22:29:30,253 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 22:29:30,253 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 22:29:30,254 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 22:29:30,254 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 22:29:30,255 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-23 22:29:30,255 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_748f899b-bf09-4aa3-8259-52ae05445b5a/bin/uautomizer-verify-zZY32mL2XJ/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_748f899b-bf09-4aa3-8259-52ae05445b5a/bin/uautomizer-verify-zZY32mL2XJ 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 -> de3096cf2a7a81c5a5563cf2e9ae3ddf8f4cc1ab1b483fb6503759d4e39a0a81 [2023-11-23 22:29:30,656 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 22:29:30,681 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 22:29:30,683 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 22:29:30,684 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 22:29:30,685 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 22:29:30,686 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_748f899b-bf09-4aa3-8259-52ae05445b5a/bin/uautomizer-verify-zZY32mL2XJ/../../sv-benchmarks/c/pthread-wmm/rfi006_power.opt.i [2023-11-23 22:29:33,899 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 22:29:34,306 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 22:29:34,307 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_748f899b-bf09-4aa3-8259-52ae05445b5a/sv-benchmarks/c/pthread-wmm/rfi006_power.opt.i [2023-11-23 22:29:34,327 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_748f899b-bf09-4aa3-8259-52ae05445b5a/bin/uautomizer-verify-zZY32mL2XJ/data/99a54bb09/e9045e7e0e0b4e0b9ec687ed5fd8ecfa/FLAGc33a64f07 [2023-11-23 22:29:34,351 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_748f899b-bf09-4aa3-8259-52ae05445b5a/bin/uautomizer-verify-zZY32mL2XJ/data/99a54bb09/e9045e7e0e0b4e0b9ec687ed5fd8ecfa [2023-11-23 22:29:34,357 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 22:29:34,359 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 22:29:34,362 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 22:29:34,363 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 22:29:34,368 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 22:29:34,369 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:29:34" (1/1) ... [2023-11-23 22:29:34,370 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d0b4b94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:34, skipping insertion in model container [2023-11-23 22:29:34,370 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:29:34" (1/1) ... [2023-11-23 22:29:34,447 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 22:29:34,977 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 22:29:35,004 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 22:29:35,083 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 22:29:35,126 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 22:29:35,127 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 22:29:35,135 INFO L206 MainTranslator]: Completed translation [2023-11-23 22:29:35,136 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:35 WrapperNode [2023-11-23 22:29:35,136 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 22:29:35,137 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 22:29:35,137 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 22:29:35,138 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 22:29:35,146 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:35" (1/1) ... [2023-11-23 22:29:35,168 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:35" (1/1) ... [2023-11-23 22:29:35,200 INFO L138 Inliner]: procedures = 180, calls = 76, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 184 [2023-11-23 22:29:35,200 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 22:29:35,201 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 22:29:35,201 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 22:29:35,202 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 22:29:35,210 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:35" (1/1) ... [2023-11-23 22:29:35,211 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:35" (1/1) ... [2023-11-23 22:29:35,217 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:35" (1/1) ... [2023-11-23 22:29:35,218 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:35" (1/1) ... [2023-11-23 22:29:35,237 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:35" (1/1) ... [2023-11-23 22:29:35,240 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:35" (1/1) ... [2023-11-23 22:29:35,245 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:35" (1/1) ... [2023-11-23 22:29:35,248 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:35" (1/1) ... [2023-11-23 22:29:35,254 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 22:29:35,255 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 22:29:35,255 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 22:29:35,256 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 22:29:35,256 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:35" (1/1) ... [2023-11-23 22:29:35,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 22:29:35,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_748f899b-bf09-4aa3-8259-52ae05445b5a/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:29:35,321 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_748f899b-bf09-4aa3-8259-52ae05445b5a/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 22:29:35,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_748f899b-bf09-4aa3-8259-52ae05445b5a/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 22:29:35,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-23 22:29:35,363 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-23 22:29:35,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 22:29:35,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 22:29:35,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 22:29:35,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-23 22:29:35,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-23 22:29:35,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-11-23 22:29:35,366 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-23 22:29:35,366 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-23 22:29:35,366 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-23 22:29:35,367 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-23 22:29:35,367 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-23 22:29:35,367 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-23 22:29:35,367 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-23 22:29:35,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 22:29:35,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 22:29:35,370 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-23 22:29:35,554 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 22:29:35,556 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 22:29:36,258 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 22:29:37,164 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 22:29:37,165 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 22:29:37,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:29:37 BoogieIcfgContainer [2023-11-23 22:29:37,166 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 22:29:37,168 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 22:29:37,168 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 22:29:37,173 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 22:29:37,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:29:34" (1/3) ... [2023-11-23 22:29:37,174 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6548db51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:29:37, skipping insertion in model container [2023-11-23 22:29:37,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:29:35" (2/3) ... [2023-11-23 22:29:37,176 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6548db51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:29:37, skipping insertion in model container [2023-11-23 22:29:37,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:29:37" (3/3) ... [2023-11-23 22:29:37,178 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi006_power.opt.i [2023-11-23 22:29:37,198 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 22:29:37,198 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 47 error locations. [2023-11-23 22:29:37,198 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-23 22:29:37,431 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-23 22:29:37,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 91 transitions, 194 flow [2023-11-23 22:29:37,553 INFO L124 PetriNetUnfolderBase]: 2/88 cut-off events. [2023-11-23 22:29:37,553 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-23 22:29:37,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 335 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-11-23 22:29:37,560 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 91 transitions, 194 flow [2023-11-23 22:29:37,567 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 88 transitions, 185 flow [2023-11-23 22:29:37,578 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 22:29:37,585 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;@6d76f145, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 22:29:37,586 INFO L358 AbstractCegarLoop]: Starting to check reachability of 83 error locations. [2023-11-23 22:29:37,590 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-23 22:29:37,590 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-23 22:29:37,590 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-23 22:29:37,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 22:29:37,591 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-23 22:29:37,592 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-23 22:29:37,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:29:37,598 INFO L85 PathProgramCache]: Analyzing trace with hash 28830, now seen corresponding path program 1 times [2023-11-23 22:29:37,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 22:29:37,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [222870986] [2023-11-23 22:29:37,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:29:37,613 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 22:29:37,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_748f899b-bf09-4aa3-8259-52ae05445b5a/bin/uautomizer-verify-zZY32mL2XJ/mathsat [2023-11-23 22:29:37,620 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_748f899b-bf09-4aa3-8259-52ae05445b5a/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 22:29:37,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_748f899b-bf09-4aa3-8259-52ae05445b5a/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-23 22:29:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:29:37,794 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 22:29:37,799 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:29:37,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-23 22:29:37,902 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-23 22:29:37,902 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 22:29:37,903 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 22:29:37,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [222870986] [2023-11-23 22:29:37,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [222870986] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:29:37,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:29:37,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 22:29:37,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036716346] [2023-11-23 22:29:37,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:29:37,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:29:37,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 22:29:37,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:29:37,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:29:37,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 91 [2023-11-23 22:29:37,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 88 transitions, 185 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 22:29:37,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 22:29:37,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 91 [2023-11-23 22:29:37,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand