./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c75c9f2-23e5-4d74-bdec-0d0333fd1143/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c75c9f2-23e5-4d74-bdec-0d0333fd1143/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c75c9f2-23e5-4d74-bdec-0d0333fd1143/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c75c9f2-23e5-4d74-bdec-0d0333fd1143/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c75c9f2-23e5-4d74-bdec-0d0333fd1143/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c75c9f2-23e5-4d74-bdec-0d0333fd1143/bin/uautomizer-verify-uCwYo4JHxu --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e1a7472923aa95b61749a468b52dfc65e03dead5bf647c94f71a6e156dc586ae --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:32:54,328 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:32:54,454 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c75c9f2-23e5-4d74-bdec-0d0333fd1143/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-19 07:32:54,462 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:32:54,463 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:32:54,502 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:32:54,504 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:32:54,504 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:32:54,505 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:32:54,511 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:32:54,512 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:32:54,512 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:32:54,513 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:32:54,515 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:32:54,515 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:32:54,516 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:32:54,516 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:32:54,517 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:32:54,517 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 07:32:54,518 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 07:32:54,518 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 07:32:54,519 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:32:54,520 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 07:32:54,520 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 07:32:54,520 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:32:54,521 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:32:54,522 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:32:54,522 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:32:54,523 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:32:54,523 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:32:54,525 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:32:54,525 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:32:54,526 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:32:54,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:32:54,526 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:32:54,526 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:32:54,527 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:32:54,527 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:32:54,527 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_3c75c9f2-23e5-4d74-bdec-0d0333fd1143/bin/uautomizer-verify-uCwYo4JHxu/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c75c9f2-23e5-4d74-bdec-0d0333fd1143/bin/uautomizer-verify-uCwYo4JHxu Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e1a7472923aa95b61749a468b52dfc65e03dead5bf647c94f71a6e156dc586ae [2023-11-19 07:32:54,813 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:32:54,848 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:32:54,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:32:54,853 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:32:54,853 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:32:54,855 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c75c9f2-23e5-4d74-bdec-0d0333fd1143/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i [2023-11-19 07:32:58,120 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:32:58,386 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:32:58,386 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c75c9f2-23e5-4d74-bdec-0d0333fd1143/sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i [2023-11-19 07:32:58,414 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c75c9f2-23e5-4d74-bdec-0d0333fd1143/bin/uautomizer-verify-uCwYo4JHxu/data/90c4e80ce/939cb53a3e95472e87a795597f6c66ab/FLAG38ae7af84 [2023-11-19 07:32:58,434 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c75c9f2-23e5-4d74-bdec-0d0333fd1143/bin/uautomizer-verify-uCwYo4JHxu/data/90c4e80ce/939cb53a3e95472e87a795597f6c66ab [2023-11-19 07:32:58,440 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:32:58,442 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:32:58,445 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:32:58,446 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:32:58,451 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:32:58,452 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:32:58" (1/1) ... [2023-11-19 07:32:58,454 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a75dc42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:58, skipping insertion in model container [2023-11-19 07:32:58,454 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:32:58" (1/1) ... [2023-11-19 07:32:58,545 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:32:59,086 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:32:59,104 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:32:59,186 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:32:59,227 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:32:59,227 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:32:59,236 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:32:59,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:59 WrapperNode [2023-11-19 07:32:59,236 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:32:59,237 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:32:59,238 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:32:59,238 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:32:59,246 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:59" (1/1) ... [2023-11-19 07:32:59,268 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:59" (1/1) ... [2023-11-19 07:32:59,322 INFO L138 Inliner]: procedures = 175, calls = 57, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 123 [2023-11-19 07:32:59,322 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:32:59,323 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:32:59,323 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:32:59,323 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:32:59,334 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:59" (1/1) ... [2023-11-19 07:32:59,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:59" (1/1) ... [2023-11-19 07:32:59,349 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:59" (1/1) ... [2023-11-19 07:32:59,350 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:59" (1/1) ... [2023-11-19 07:32:59,375 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:59" (1/1) ... [2023-11-19 07:32:59,378 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:59" (1/1) ... [2023-11-19 07:32:59,381 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:59" (1/1) ... [2023-11-19 07:32:59,412 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:59" (1/1) ... [2023-11-19 07:32:59,416 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:32:59,417 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:32:59,418 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:32:59,418 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:32:59,419 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:59" (1/1) ... [2023-11-19 07:32:59,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:32:59,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c75c9f2-23e5-4d74-bdec-0d0333fd1143/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:32:59,484 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c75c9f2-23e5-4d74-bdec-0d0333fd1143/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:32:59,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c75c9f2-23e5-4d74-bdec-0d0333fd1143/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:32:59,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 07:32:59,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:32:59,539 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 07:32:59,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:32:59,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:32:59,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:32:59,540 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 07:32:59,540 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 07:32:59,540 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 07:32:59,541 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 07:32:59,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:32:59,541 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 07:32:59,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:32:59,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:32:59,543 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 07:32:59,754 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:32:59,757 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:33:00,233 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:33:01,048 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:33:01,048 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 07:33:01,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:33:01 BoogieIcfgContainer [2023-11-19 07:33:01,056 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:33:01,059 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:33:01,060 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:33:01,064 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:33:01,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:32:58" (1/3) ... [2023-11-19 07:33:01,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1181f27e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:33:01, skipping insertion in model container [2023-11-19 07:33:01,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:59" (2/3) ... [2023-11-19 07:33:01,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1181f27e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:33:01, skipping insertion in model container [2023-11-19 07:33:01,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:33:01" (3/3) ... [2023-11-19 07:33:01,069 INFO L112 eAbstractionObserver]: Analyzing ICFG safe006_power.oepc-thin000_power.oepc.i [2023-11-19 07:33:01,101 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:33:01,102 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2023-11-19 07:33:01,102 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 07:33:01,317 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:33:01,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 169 transitions, 346 flow [2023-11-19 07:33:01,516 INFO L124 PetriNetUnfolderBase]: 24/167 cut-off events. [2023-11-19 07:33:01,516 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:33:01,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 167 events. 24/167 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 241 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 113. Up to 4 conditions per place. [2023-11-19 07:33:01,530 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 169 transitions, 346 flow [2023-11-19 07:33:01,542 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 167 transitions, 340 flow [2023-11-19 07:33:01,552 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:33:01,570 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 167 transitions, 340 flow [2023-11-19 07:33:01,573 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 167 transitions, 340 flow [2023-11-19 07:33:01,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 167 transitions, 340 flow [2023-11-19 07:33:01,661 INFO L124 PetriNetUnfolderBase]: 24/167 cut-off events. [2023-11-19 07:33:01,661 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:33:01,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 167 events. 24/167 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 241 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 113. Up to 4 conditions per place. [2023-11-19 07:33:01,671 INFO L119 LiptonReduction]: Number of co-enabled transitions 6900 [2023-11-19 07:33:16,869 INFO L134 LiptonReduction]: Checked pairs total: 18897 [2023-11-19 07:33:16,870 INFO L136 LiptonReduction]: Total number of compositions: 183 [2023-11-19 07:33:16,887 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:33:16,895 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;@12f6100e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:33:16,895 INFO L358 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2023-11-19 07:33:16,897 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:33:16,898 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-19 07:33:16,898 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:33:16,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:16,899 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-19 07:33:16,899 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-19 07:33:16,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:16,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1010, now seen corresponding path program 1 times [2023-11-19 07:33:16,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:16,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883775337] [2023-11-19 07:33:16,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:16,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:17,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:17,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:33:17,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:17,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883775337] [2023-11-19 07:33:17,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883775337] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:17,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:17,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-19 07:33:17,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618821169] [2023-11-19 07:33:17,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:17,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:33:17,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:17,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:33:17,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:33:17,146 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 352 [2023-11-19 07:33:17,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 55 transitions, 116 flow. Second operand has 2 states, 2 states have (on average 109.5) internal successors, (219), 2 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:17,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:17,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 352 [2023-11-19 07:33:17,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:17,992 INFO L124 PetriNetUnfolderBase]: 1270/2057 cut-off events. [2023-11-19 07:33:17,993 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-19 07:33:17,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4124 conditions, 2057 events. 1270/2057 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 11449 event pairs, 1270 based on Foata normal form. 0/884 useless extension candidates. Maximal degree in co-relation 4114. Up to 2052 conditions per place. [2023-11-19 07:33:18,018 INFO L140 encePairwiseOnDemand]: 332/352 looper letters, 31 selfloop transitions, 0 changer transitions 0/33 dead transitions. [2023-11-19 07:33:18,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 33 transitions, 134 flow [2023-11-19 07:33:18,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:33:18,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-19 07:33:18,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 269 transitions. [2023-11-19 07:33:18,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3821022727272727 [2023-11-19 07:33:18,043 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 269 transitions. [2023-11-19 07:33:18,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 269 transitions. [2023-11-19 07:33:18,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:18,051 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 269 transitions. [2023-11-19 07:33:18,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 134.5) internal successors, (269), 2 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:18,062 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:18,063 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 352.0) internal successors, (1056), 3 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:18,065 INFO L175 Difference]: Start difference. First operand has 60 places, 55 transitions, 116 flow. Second operand 2 states and 269 transitions. [2023-11-19 07:33:18,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 33 transitions, 134 flow [2023-11-19 07:33:18,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 33 transitions, 132 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:33:18,073 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 70 flow [2023-11-19 07:33:18,076 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2023-11-19 07:33:18,081 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -21 predicate places. [2023-11-19 07:33:18,081 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 70 flow [2023-11-19 07:33:18,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 109.5) internal successors, (219), 2 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:18,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:18,082 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-19 07:33:18,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:33:18,083 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-19 07:33:18,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:18,085 INFO L85 PathProgramCache]: Analyzing trace with hash 994207, now seen corresponding path program 1 times [2023-11-19 07:33:18,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:18,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603817575] [2023-11-19 07:33:18,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:18,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:18,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:18,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:33:18,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:18,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603817575] [2023-11-19 07:33:18,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603817575] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:18,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:18,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:33:18,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500783103] [2023-11-19 07:33:18,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:18,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:33:18,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:18,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:33:18,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:33:18,526 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 352 [2023-11-19 07:33:18,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:18,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:18,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 352 [2023-11-19 07:33:18,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:18,983 INFO L124 PetriNetUnfolderBase]: 599/997 cut-off events. [2023-11-19 07:33:18,983 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:33:18,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2002 conditions, 997 events. 599/997 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 4913 event pairs, 599 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 1999. Up to 992 conditions per place. [2023-11-19 07:33:18,994 INFO L140 encePairwiseOnDemand]: 345/352 looper letters, 24 selfloop transitions, 1 changer transitions 0/27 dead transitions. [2023-11-19 07:33:18,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 27 transitions, 108 flow [2023-11-19 07:33:18,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:33:18,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:33:18,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions. [2023-11-19 07:33:18,999 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33617424242424243 [2023-11-19 07:33:19,000 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 355 transitions. [2023-11-19 07:33:19,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 355 transitions. [2023-11-19 07:33:19,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:19,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 355 transitions. [2023-11-19 07:33:19,003 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:19,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:19,010 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:19,011 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 70 flow. Second operand 3 states and 355 transitions. [2023-11-19 07:33:19,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 27 transitions, 108 flow [2023-11-19 07:33:19,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 27 transitions, 108 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 07:33:19,014 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 60 flow [2023-11-19 07:33:19,014 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2023-11-19 07:33:19,015 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -25 predicate places. [2023-11-19 07:33:19,016 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 60 flow [2023-11-19 07:33:19,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:19,017 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:19,017 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-19 07:33:19,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:33:19,018 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-19 07:33:19,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:19,019 INFO L85 PathProgramCache]: Analyzing trace with hash 994206, now seen corresponding path program 1 times [2023-11-19 07:33:19,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:19,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649352344] [2023-11-19 07:33:19,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:19,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:19,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:19,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:33:19,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:19,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649352344] [2023-11-19 07:33:19,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649352344] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:19,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:19,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:33:19,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184080922] [2023-11-19 07:33:19,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:19,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:33:19,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:19,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:33:19,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:33:19,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 352 [2023-11-19 07:33:19,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:19,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:19,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 352 [2023-11-19 07:33:19,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:19,481 INFO L124 PetriNetUnfolderBase]: 330/623 cut-off events. [2023-11-19 07:33:19,481 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:33:19,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1240 conditions, 623 events. 330/623 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3179 event pairs, 211 based on Foata normal form. 0/463 useless extension candidates. Maximal degree in co-relation 1236. Up to 373 conditions per place. [2023-11-19 07:33:19,486 INFO L140 encePairwiseOnDemand]: 339/352 looper letters, 24 selfloop transitions, 7 changer transitions 0/33 dead transitions. [2023-11-19 07:33:19,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 33 transitions, 134 flow [2023-11-19 07:33:19,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:33:19,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:33:19,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions. [2023-11-19 07:33:19,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33617424242424243 [2023-11-19 07:33:19,490 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 355 transitions. [2023-11-19 07:33:19,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 355 transitions. [2023-11-19 07:33:19,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:19,491 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 355 transitions. [2023-11-19 07:33:19,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:19,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:19,497 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:19,497 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 60 flow. Second operand 3 states and 355 transitions. [2023-11-19 07:33:19,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 33 transitions, 134 flow [2023-11-19 07:33:19,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 33 transitions, 133 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:33:19,500 INFO L231 Difference]: Finished difference. Result has 36 places, 30 transitions, 111 flow [2023-11-19 07:33:19,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=55, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=36, PETRI_TRANSITIONS=30} [2023-11-19 07:33:19,501 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -24 predicate places. [2023-11-19 07:33:19,501 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 30 transitions, 111 flow [2023-11-19 07:33:19,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:19,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:19,502 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:19,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:33:19,503 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-19 07:33:19,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:19,504 INFO L85 PathProgramCache]: Analyzing trace with hash -339921200, now seen corresponding path program 1 times [2023-11-19 07:33:19,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:19,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292843517] [2023-11-19 07:33:19,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:19,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:19,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:19,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:33:19,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:19,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292843517] [2023-11-19 07:33:19,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292843517] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:19,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:19,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:33:19,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006097449] [2023-11-19 07:33:19,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:19,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:33:19,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:19,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:33:19,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:33:19,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 352 [2023-11-19 07:33:19,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 111 flow. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:19,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:19,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 352 [2023-11-19 07:33:19,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:20,167 INFO L124 PetriNetUnfolderBase]: 325/612 cut-off events. [2023-11-19 07:33:20,168 INFO L125 PetriNetUnfolderBase]: For 143/143 co-relation queries the response was YES. [2023-11-19 07:33:20,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1667 conditions, 612 events. 325/612 cut-off events. For 143/143 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3177 event pairs, 68 based on Foata normal form. 0/503 useless extension candidates. Maximal degree in co-relation 1662. Up to 531 conditions per place. [2023-11-19 07:33:20,174 INFO L140 encePairwiseOnDemand]: 349/352 looper letters, 40 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2023-11-19 07:33:20,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 44 transitions, 247 flow [2023-11-19 07:33:20,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:33:20,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:33:20,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2023-11-19 07:33:20,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3371212121212121 [2023-11-19 07:33:20,177 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 356 transitions. [2023-11-19 07:33:20,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 356 transitions. [2023-11-19 07:33:20,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:20,178 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 356 transitions. [2023-11-19 07:33:20,180 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:20,183 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:20,185 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:20,185 INFO L175 Difference]: Start difference. First operand has 36 places, 30 transitions, 111 flow. Second operand 3 states and 356 transitions. [2023-11-19 07:33:20,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 44 transitions, 247 flow [2023-11-19 07:33:20,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 44 transitions, 225 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:33:20,195 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 105 flow [2023-11-19 07:33:20,195 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2023-11-19 07:33:20,197 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -23 predicate places. [2023-11-19 07:33:20,198 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 105 flow [2023-11-19 07:33:20,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:20,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:20,199 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:20,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:33:20,200 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-19 07:33:20,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:20,200 INFO L85 PathProgramCache]: Analyzing trace with hash -339921428, now seen corresponding path program 1 times [2023-11-19 07:33:20,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:20,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488559661] [2023-11-19 07:33:20,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:20,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:20,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:20,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:33:20,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:20,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488559661] [2023-11-19 07:33:20,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488559661] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:20,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:20,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:33:20,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971422260] [2023-11-19 07:33:20,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:20,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:33:20,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:20,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:33:20,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:33:20,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 352 [2023-11-19 07:33:20,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 105 flow. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:20,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:20,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 352 [2023-11-19 07:33:20,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:20,669 INFO L124 PetriNetUnfolderBase]: 307/619 cut-off events. [2023-11-19 07:33:20,669 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2023-11-19 07:33:20,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1606 conditions, 619 events. 307/619 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3386 event pairs, 104 based on Foata normal form. 0/485 useless extension candidates. Maximal degree in co-relation 1600. Up to 400 conditions per place. [2023-11-19 07:33:20,674 INFO L140 encePairwiseOnDemand]: 348/352 looper letters, 45 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2023-11-19 07:33:20,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 50 transitions, 272 flow [2023-11-19 07:33:20,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:33:20,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:33:20,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 365 transitions. [2023-11-19 07:33:20,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3456439393939394 [2023-11-19 07:33:20,678 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 365 transitions. [2023-11-19 07:33:20,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 365 transitions. [2023-11-19 07:33:20,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:20,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 365 transitions. [2023-11-19 07:33:20,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:20,684 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:20,686 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:20,686 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 105 flow. Second operand 3 states and 365 transitions. [2023-11-19 07:33:20,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 50 transitions, 272 flow [2023-11-19 07:33:20,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 50 transitions, 266 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:33:20,690 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 114 flow [2023-11-19 07:33:20,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2023-11-19 07:33:20,694 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -22 predicate places. [2023-11-19 07:33:20,694 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 114 flow [2023-11-19 07:33:20,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:20,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:20,695 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:20,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:33:20,695 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-19 07:33:20,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:20,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1947622922, now seen corresponding path program 1 times [2023-11-19 07:33:20,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:20,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462651419] [2023-11-19 07:33:20,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:20,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:20,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:21,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:33:21,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:21,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462651419] [2023-11-19 07:33:21,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462651419] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:21,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:21,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:33:21,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700677795] [2023-11-19 07:33:21,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:21,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:33:21,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:21,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:33:21,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:33:21,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 352 [2023-11-19 07:33:21,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:21,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:21,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 352 [2023-11-19 07:33:21,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:21,418 INFO L124 PetriNetUnfolderBase]: 309/605 cut-off events. [2023-11-19 07:33:21,418 INFO L125 PetriNetUnfolderBase]: For 156/156 co-relation queries the response was YES. [2023-11-19 07:33:21,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1709 conditions, 605 events. 309/605 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3224 event pairs, 125 based on Foata normal form. 0/509 useless extension candidates. Maximal degree in co-relation 1702. Up to 244 conditions per place. [2023-11-19 07:33:21,424 INFO L140 encePairwiseOnDemand]: 344/352 looper letters, 33 selfloop transitions, 11 changer transitions 0/46 dead transitions. [2023-11-19 07:33:21,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 46 transitions, 248 flow [2023-11-19 07:33:21,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:33:21,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:33:21,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 465 transitions. [2023-11-19 07:33:21,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3302556818181818 [2023-11-19 07:33:21,427 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 465 transitions. [2023-11-19 07:33:21,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 465 transitions. [2023-11-19 07:33:21,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:21,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 465 transitions. [2023-11-19 07:33:21,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:21,433 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 352.0) internal successors, (1760), 5 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:21,435 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 352.0) internal successors, (1760), 5 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:21,435 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 114 flow. Second operand 4 states and 465 transitions. [2023-11-19 07:33:21,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 46 transitions, 248 flow [2023-11-19 07:33:21,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 46 transitions, 242 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:33:21,438 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 138 flow [2023-11-19 07:33:21,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2023-11-19 07:33:21,439 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -22 predicate places. [2023-11-19 07:33:21,440 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 138 flow [2023-11-19 07:33:21,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:21,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:21,441 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:21,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:33:21,441 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-19 07:33:21,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:21,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1778213383, now seen corresponding path program 1 times [2023-11-19 07:33:21,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:21,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373664919] [2023-11-19 07:33:21,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:21,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:21,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:33:21,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:21,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373664919] [2023-11-19 07:33:21,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373664919] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:21,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:21,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:33:21,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626546029] [2023-11-19 07:33:21,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:21,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:33:21,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:21,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:33:21,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:33:21,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 352 [2023-11-19 07:33:21,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 138 flow. Second operand has 5 states, 5 states have (on average 106.6) internal successors, (533), 5 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:21,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:21,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 352 [2023-11-19 07:33:21,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:22,397 INFO L124 PetriNetUnfolderBase]: 424/828 cut-off events. [2023-11-19 07:33:22,397 INFO L125 PetriNetUnfolderBase]: For 260/260 co-relation queries the response was YES. [2023-11-19 07:33:22,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2402 conditions, 828 events. 424/828 cut-off events. For 260/260 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 4862 event pairs, 223 based on Foata normal form. 20/748 useless extension candidates. Maximal degree in co-relation 2395. Up to 384 conditions per place. [2023-11-19 07:33:22,405 INFO L140 encePairwiseOnDemand]: 348/352 looper letters, 64 selfloop transitions, 4 changer transitions 0/70 dead transitions. [2023-11-19 07:33:22,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 70 transitions, 422 flow [2023-11-19 07:33:22,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:33:22,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:33:22,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 580 transitions. [2023-11-19 07:33:22,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32954545454545453 [2023-11-19 07:33:22,409 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 580 transitions. [2023-11-19 07:33:22,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 580 transitions. [2023-11-19 07:33:22,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:22,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 580 transitions. [2023-11-19 07:33:22,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:22,417 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:22,418 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:22,418 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 138 flow. Second operand 5 states and 580 transitions. [2023-11-19 07:33:22,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 70 transitions, 422 flow [2023-11-19 07:33:22,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 70 transitions, 400 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:33:22,423 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 136 flow [2023-11-19 07:33:22,423 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=136, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2023-11-19 07:33:22,424 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -20 predicate places. [2023-11-19 07:33:22,424 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 136 flow [2023-11-19 07:33:22,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.6) internal successors, (533), 5 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:22,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:22,425 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:22,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:33:22,426 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-19 07:33:22,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:22,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1947699884, now seen corresponding path program 1 times [2023-11-19 07:33:22,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:22,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000812310] [2023-11-19 07:33:22,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:22,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:22,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:22,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:33:22,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:22,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000812310] [2023-11-19 07:33:22,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000812310] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:22,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:22,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:33:22,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367592496] [2023-11-19 07:33:22,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:22,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:33:22,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:22,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:33:22,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:33:22,668 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 352 [2023-11-19 07:33:22,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 106.6) internal successors, (533), 5 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:22,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:22,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 352 [2023-11-19 07:33:22,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:23,114 INFO L124 PetriNetUnfolderBase]: 836/1550 cut-off events. [2023-11-19 07:33:23,114 INFO L125 PetriNetUnfolderBase]: For 721/721 co-relation queries the response was YES. [2023-11-19 07:33:23,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4183 conditions, 1550 events. 836/1550 cut-off events. For 721/721 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 9521 event pairs, 172 based on Foata normal form. 28/1309 useless extension candidates. Maximal degree in co-relation 4176. Up to 634 conditions per place. [2023-11-19 07:33:23,128 INFO L140 encePairwiseOnDemand]: 348/352 looper letters, 68 selfloop transitions, 3 changer transitions 0/72 dead transitions. [2023-11-19 07:33:23,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 72 transitions, 434 flow [2023-11-19 07:33:23,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:33:23,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:33:23,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 472 transitions. [2023-11-19 07:33:23,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3352272727272727 [2023-11-19 07:33:23,132 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 472 transitions. [2023-11-19 07:33:23,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 472 transitions. [2023-11-19 07:33:23,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:23,134 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 472 transitions. [2023-11-19 07:33:23,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:23,139 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 352.0) internal successors, (1760), 5 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:23,140 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 352.0) internal successors, (1760), 5 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:23,140 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 136 flow. Second operand 4 states and 472 transitions. [2023-11-19 07:33:23,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 72 transitions, 434 flow [2023-11-19 07:33:23,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 72 transitions, 430 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:33:23,144 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 151 flow [2023-11-19 07:33:23,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=151, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2023-11-19 07:33:23,145 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -17 predicate places. [2023-11-19 07:33:23,145 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 151 flow [2023-11-19 07:33:23,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.6) internal successors, (533), 5 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:23,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:23,147 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:23,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:33:23,147 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-19 07:33:23,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:23,148 INFO L85 PathProgramCache]: Analyzing trace with hash -246748735, now seen corresponding path program 1 times [2023-11-19 07:33:23,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:23,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386230925] [2023-11-19 07:33:23,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:23,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:23,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:23,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:33:23,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:23,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386230925] [2023-11-19 07:33:23,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386230925] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:23,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:23,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:33:23,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622813071] [2023-11-19 07:33:23,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:23,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:33:23,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:23,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:33:23,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:33:23,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 352 [2023-11-19 07:33:23,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 151 flow. Second operand has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:23,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:23,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 352 [2023-11-19 07:33:23,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:24,020 INFO L124 PetriNetUnfolderBase]: 476/951 cut-off events. [2023-11-19 07:33:24,020 INFO L125 PetriNetUnfolderBase]: For 472/480 co-relation queries the response was YES. [2023-11-19 07:33:24,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2703 conditions, 951 events. 476/951 cut-off events. For 472/480 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 5683 event pairs, 199 based on Foata normal form. 8/898 useless extension candidates. Maximal degree in co-relation 2694. Up to 398 conditions per place. [2023-11-19 07:33:24,029 INFO L140 encePairwiseOnDemand]: 347/352 looper letters, 41 selfloop transitions, 8 changer transitions 2/53 dead transitions. [2023-11-19 07:33:24,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 344 flow [2023-11-19 07:33:24,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:33:24,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:33:24,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 524 transitions. [2023-11-19 07:33:24,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29772727272727273 [2023-11-19 07:33:24,035 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 524 transitions. [2023-11-19 07:33:24,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 524 transitions. [2023-11-19 07:33:24,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:24,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 524 transitions. [2023-11-19 07:33:24,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 104.8) internal successors, (524), 5 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:24,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:24,045 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:24,045 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 151 flow. Second operand 5 states and 524 transitions. [2023-11-19 07:33:24,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 344 flow [2023-11-19 07:33:24,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 53 transitions, 338 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:33:24,051 INFO L231 Difference]: Finished difference. Result has 44 places, 30 transitions, 149 flow [2023-11-19 07:33:24,052 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=149, PETRI_PLACES=44, PETRI_TRANSITIONS=30} [2023-11-19 07:33:24,053 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -16 predicate places. [2023-11-19 07:33:24,053 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 30 transitions, 149 flow [2023-11-19 07:33:24,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:24,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:24,055 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:24,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:33:24,055 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-19 07:33:24,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:24,056 INFO L85 PathProgramCache]: Analyzing trace with hash -246748810, now seen corresponding path program 1 times [2023-11-19 07:33:24,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:24,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595502803] [2023-11-19 07:33:24,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:24,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:24,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:24,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:33:24,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:24,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595502803] [2023-11-19 07:33:24,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595502803] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:24,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:24,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:33:24,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820300472] [2023-11-19 07:33:24,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:24,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:33:24,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:24,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:33:24,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:33:24,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 352 [2023-11-19 07:33:24,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 30 transitions, 149 flow. Second operand has 6 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:24,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:24,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 352 [2023-11-19 07:33:24,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:24,785 INFO L124 PetriNetUnfolderBase]: 414/842 cut-off events. [2023-11-19 07:33:24,786 INFO L125 PetriNetUnfolderBase]: For 604/612 co-relation queries the response was YES. [2023-11-19 07:33:24,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2486 conditions, 842 events. 414/842 cut-off events. For 604/612 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4862 event pairs, 224 based on Foata normal form. 13/824 useless extension candidates. Maximal degree in co-relation 2477. Up to 402 conditions per place. [2023-11-19 07:33:24,793 INFO L140 encePairwiseOnDemand]: 342/352 looper letters, 33 selfloop transitions, 9 changer transitions 0/44 dead transitions. [2023-11-19 07:33:24,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 44 transitions, 294 flow [2023-11-19 07:33:24,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:33:24,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:33:24,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 432 transitions. [2023-11-19 07:33:24,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3068181818181818 [2023-11-19 07:33:24,797 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 432 transitions. [2023-11-19 07:33:24,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 432 transitions. [2023-11-19 07:33:24,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:24,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 432 transitions. [2023-11-19 07:33:24,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:24,803 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 352.0) internal successors, (1760), 5 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:24,803 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 352.0) internal successors, (1760), 5 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:24,804 INFO L175 Difference]: Start difference. First operand has 44 places, 30 transitions, 149 flow. Second operand 4 states and 432 transitions. [2023-11-19 07:33:24,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 44 transitions, 294 flow [2023-11-19 07:33:24,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 44 transitions, 278 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-19 07:33:24,807 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 197 flow [2023-11-19 07:33:24,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=197, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2023-11-19 07:33:24,809 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -15 predicate places. [2023-11-19 07:33:24,809 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 197 flow [2023-11-19 07:33:24,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:24,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:24,810 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:24,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:33:24,810 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-19 07:33:24,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:24,811 INFO L85 PathProgramCache]: Analyzing trace with hash 368743558, now seen corresponding path program 1 times [2023-11-19 07:33:24,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:24,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050039732] [2023-11-19 07:33:24,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:24,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:26,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:33:26,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:26,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050039732] [2023-11-19 07:33:26,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050039732] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:26,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:26,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:33:26,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046715854] [2023-11-19 07:33:26,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:26,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:33:26,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:26,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:33:26,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:33:26,452 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 352 [2023-11-19 07:33:26,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 197 flow. Second operand has 7 states, 7 states have (on average 97.42857142857143) internal successors, (682), 7 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:26,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:26,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 352 [2023-11-19 07:33:26,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:27,057 INFO L124 PetriNetUnfolderBase]: 411/843 cut-off events. [2023-11-19 07:33:27,058 INFO L125 PetriNetUnfolderBase]: For 859/866 co-relation queries the response was YES. [2023-11-19 07:33:27,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2686 conditions, 843 events. 411/843 cut-off events. For 859/866 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4955 event pairs, 63 based on Foata normal form. 11/844 useless extension candidates. Maximal degree in co-relation 2676. Up to 597 conditions per place. [2023-11-19 07:33:27,065 INFO L140 encePairwiseOnDemand]: 345/352 looper letters, 47 selfloop transitions, 18 changer transitions 2/68 dead transitions. [2023-11-19 07:33:27,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 68 transitions, 509 flow [2023-11-19 07:33:27,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 07:33:27,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-19 07:33:27,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1015 transitions. [2023-11-19 07:33:27,072 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2883522727272727 [2023-11-19 07:33:27,072 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1015 transitions. [2023-11-19 07:33:27,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1015 transitions. [2023-11-19 07:33:27,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:27,074 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1015 transitions. [2023-11-19 07:33:27,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 101.5) internal successors, (1015), 10 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:27,085 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 352.0) internal successors, (3872), 11 states have internal predecessors, (3872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:27,088 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 352.0) internal successors, (3872), 11 states have internal predecessors, (3872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:27,088 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 197 flow. Second operand 10 states and 1015 transitions. [2023-11-19 07:33:27,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 68 transitions, 509 flow [2023-11-19 07:33:27,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 68 transitions, 489 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:33:27,097 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 343 flow [2023-11-19 07:33:27,097 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=343, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2023-11-19 07:33:27,098 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -3 predicate places. [2023-11-19 07:33:27,098 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 343 flow [2023-11-19 07:33:27,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.42857142857143) internal successors, (682), 7 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:27,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:27,100 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:27,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:33:27,100 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-19 07:33:27,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:27,101 INFO L85 PathProgramCache]: Analyzing trace with hash 940726261, now seen corresponding path program 1 times [2023-11-19 07:33:27,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:27,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725500474] [2023-11-19 07:33:27,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:27,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:27,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:27,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:33:27,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:27,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725500474] [2023-11-19 07:33:27,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725500474] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:27,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:27,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:33:27,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093849892] [2023-11-19 07:33:27,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:27,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:33:27,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:27,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:33:27,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:33:27,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 352 [2023-11-19 07:33:27,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 343 flow. Second operand has 4 states, 4 states have (on average 105.5) internal successors, (422), 4 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:27,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:27,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 352 [2023-11-19 07:33:27,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:27,611 INFO L124 PetriNetUnfolderBase]: 373/736 cut-off events. [2023-11-19 07:33:27,611 INFO L125 PetriNetUnfolderBase]: For 1100/1106 co-relation queries the response was YES. [2023-11-19 07:33:27,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2559 conditions, 736 events. 373/736 cut-off events. For 1100/1106 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3997 event pairs, 264 based on Foata normal form. 29/764 useless extension candidates. Maximal degree in co-relation 2543. Up to 641 conditions per place. [2023-11-19 07:33:27,617 INFO L140 encePairwiseOnDemand]: 342/352 looper letters, 14 selfloop transitions, 1 changer transitions 28/45 dead transitions. [2023-11-19 07:33:27,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 45 transitions, 419 flow [2023-11-19 07:33:27,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:33:27,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:33:27,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 439 transitions. [2023-11-19 07:33:27,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3117897727272727 [2023-11-19 07:33:27,623 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 439 transitions. [2023-11-19 07:33:27,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 439 transitions. [2023-11-19 07:33:27,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:27,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 439 transitions. [2023-11-19 07:33:27,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:27,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 352.0) internal successors, (1760), 5 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:27,630 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 352.0) internal successors, (1760), 5 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:27,630 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 343 flow. Second operand 4 states and 439 transitions. [2023-11-19 07:33:27,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 45 transitions, 419 flow [2023-11-19 07:33:27,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 45 transitions, 379 flow, removed 9 selfloop flow, removed 2 redundant places. [2023-11-19 07:33:27,642 INFO L231 Difference]: Finished difference. Result has 54 places, 17 transitions, 89 flow [2023-11-19 07:33:27,642 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=89, PETRI_PLACES=54, PETRI_TRANSITIONS=17} [2023-11-19 07:33:27,644 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -6 predicate places. [2023-11-19 07:33:27,645 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 17 transitions, 89 flow [2023-11-19 07:33:27,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.5) internal successors, (422), 4 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:27,645 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:27,646 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:27,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 07:33:27,646 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-19 07:33:27,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:27,649 INFO L85 PathProgramCache]: Analyzing trace with hash -611546273, now seen corresponding path program 1 times [2023-11-19 07:33:27,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:27,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387592367] [2023-11-19 07:33:27,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:27,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:27,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:27,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:33:27,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:27,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387592367] [2023-11-19 07:33:27,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387592367] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:27,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:27,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:33:27,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83868078] [2023-11-19 07:33:27,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:27,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:33:27,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:27,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:33:27,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:33:27,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 352 [2023-11-19 07:33:27,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 17 transitions, 89 flow. Second operand has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:27,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:27,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 352 [2023-11-19 07:33:27,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:28,131 INFO L124 PetriNetUnfolderBase]: 53/141 cut-off events. [2023-11-19 07:33:28,131 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2023-11-19 07:33:28,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 429 conditions, 141 events. 53/141 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 562 event pairs, 7 based on Foata normal form. 21/161 useless extension candidates. Maximal degree in co-relation 413. Up to 85 conditions per place. [2023-11-19 07:33:28,133 INFO L140 encePairwiseOnDemand]: 347/352 looper letters, 19 selfloop transitions, 3 changer transitions 12/36 dead transitions. [2023-11-19 07:33:28,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 36 transitions, 233 flow [2023-11-19 07:33:28,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:33:28,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:33:28,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 539 transitions. [2023-11-19 07:33:28,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30625 [2023-11-19 07:33:28,137 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 539 transitions. [2023-11-19 07:33:28,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 539 transitions. [2023-11-19 07:33:28,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:28,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 539 transitions. [2023-11-19 07:33:28,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:28,145 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:28,146 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:28,146 INFO L175 Difference]: Start difference. First operand has 54 places, 17 transitions, 89 flow. Second operand 5 states and 539 transitions. [2023-11-19 07:33:28,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 36 transitions, 233 flow [2023-11-19 07:33:28,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 36 transitions, 185 flow, removed 6 selfloop flow, removed 11 redundant places. [2023-11-19 07:33:28,148 INFO L231 Difference]: Finished difference. Result has 42 places, 19 transitions, 89 flow [2023-11-19 07:33:28,149 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=89, PETRI_PLACES=42, PETRI_TRANSITIONS=19} [2023-11-19 07:33:28,149 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -18 predicate places. [2023-11-19 07:33:28,150 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 19 transitions, 89 flow [2023-11-19 07:33:28,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:28,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:28,151 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:28,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-19 07:33:28,151 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-19 07:33:28,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:28,152 INFO L85 PathProgramCache]: Analyzing trace with hash -526366999, now seen corresponding path program 1 times [2023-11-19 07:33:28,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:28,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719079014] [2023-11-19 07:33:28,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:28,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:28,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:28,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:33:28,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:28,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719079014] [2023-11-19 07:33:28,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719079014] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:33:28,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:33:28,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:33:28,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749654028] [2023-11-19 07:33:28,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:33:28,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:33:28,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:28,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:33:28,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:33:28,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 352 [2023-11-19 07:33:28,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 19 transitions, 89 flow. Second operand has 5 states, 5 states have (on average 103.2) internal successors, (516), 5 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:28,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:33:28,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 352 [2023-11-19 07:33:28,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:33:28,711 INFO L124 PetriNetUnfolderBase]: 20/73 cut-off events. [2023-11-19 07:33:28,711 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-11-19 07:33:28,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254 conditions, 73 events. 20/73 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 221 event pairs, 1 based on Foata normal form. 12/84 useless extension candidates. Maximal degree in co-relation 242. Up to 34 conditions per place. [2023-11-19 07:33:28,712 INFO L140 encePairwiseOnDemand]: 347/352 looper letters, 17 selfloop transitions, 5 changer transitions 6/30 dead transitions. [2023-11-19 07:33:28,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 30 transitions, 188 flow [2023-11-19 07:33:28,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:33:28,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:33:28,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 634 transitions. [2023-11-19 07:33:28,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3001893939393939 [2023-11-19 07:33:28,717 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 634 transitions. [2023-11-19 07:33:28,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 634 transitions. [2023-11-19 07:33:28,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:33:28,718 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 634 transitions. [2023-11-19 07:33:28,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 105.66666666666667) internal successors, (634), 6 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:28,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 352.0) internal successors, (2464), 7 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:28,726 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 352.0) internal successors, (2464), 7 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:28,727 INFO L175 Difference]: Start difference. First operand has 42 places, 19 transitions, 89 flow. Second operand 6 states and 634 transitions. [2023-11-19 07:33:28,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 30 transitions, 188 flow [2023-11-19 07:33:28,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 30 transitions, 161 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-11-19 07:33:28,729 INFO L231 Difference]: Finished difference. Result has 44 places, 19 transitions, 91 flow [2023-11-19 07:33:28,729 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=91, PETRI_PLACES=44, PETRI_TRANSITIONS=19} [2023-11-19 07:33:28,730 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -16 predicate places. [2023-11-19 07:33:28,730 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 19 transitions, 91 flow [2023-11-19 07:33:28,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.2) internal successors, (516), 5 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:33:28,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:33:28,731 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:28,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-19 07:33:28,732 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2023-11-19 07:33:28,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:28,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1205378459, now seen corresponding path program 1 times [2023-11-19 07:33:28,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:28,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619044472] [2023-11-19 07:33:28,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:28,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:28,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:33:28,826 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:33:28,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:33:28,968 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:33:28,969 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:33:28,970 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (57 of 58 remaining) [2023-11-19 07:33:28,972 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 58 remaining) [2023-11-19 07:33:28,972 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 58 remaining) [2023-11-19 07:33:28,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 58 remaining) [2023-11-19 07:33:28,975 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 58 remaining) [2023-11-19 07:33:28,975 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 58 remaining) [2023-11-19 07:33:28,975 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 58 remaining) [2023-11-19 07:33:28,975 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 58 remaining) [2023-11-19 07:33:28,975 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 58 remaining) [2023-11-19 07:33:28,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 58 remaining) [2023-11-19 07:33:28,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 58 remaining) [2023-11-19 07:33:28,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 58 remaining) [2023-11-19 07:33:28,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 58 remaining) [2023-11-19 07:33:28,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 58 remaining) [2023-11-19 07:33:28,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 58 remaining) [2023-11-19 07:33:28,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 58 remaining) [2023-11-19 07:33:28,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 58 remaining) [2023-11-19 07:33:28,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 58 remaining) [2023-11-19 07:33:28,977 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 58 remaining) [2023-11-19 07:33:28,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 58 remaining) [2023-11-19 07:33:28,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 58 remaining) [2023-11-19 07:33:28,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 58 remaining) [2023-11-19 07:33:28,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 58 remaining) [2023-11-19 07:33:28,978 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 58 remaining) [2023-11-19 07:33:28,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 58 remaining) [2023-11-19 07:33:28,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 58 remaining) [2023-11-19 07:33:28,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 58 remaining) [2023-11-19 07:33:28,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 58 remaining) [2023-11-19 07:33:28,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 58 remaining) [2023-11-19 07:33:28,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 58 remaining) [2023-11-19 07:33:28,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 58 remaining) [2023-11-19 07:33:28,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 58 remaining) [2023-11-19 07:33:28,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 58 remaining) [2023-11-19 07:33:28,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK (24 of 58 remaining) [2023-11-19 07:33:28,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 58 remaining) [2023-11-19 07:33:28,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 58 remaining) [2023-11-19 07:33:28,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 58 remaining) [2023-11-19 07:33:28,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 58 remaining) [2023-11-19 07:33:28,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 58 remaining) [2023-11-19 07:33:28,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 58 remaining) [2023-11-19 07:33:28,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 58 remaining) [2023-11-19 07:33:28,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 58 remaining) [2023-11-19 07:33:28,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 58 remaining) [2023-11-19 07:33:28,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 58 remaining) [2023-11-19 07:33:28,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 58 remaining) [2023-11-19 07:33:28,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 58 remaining) [2023-11-19 07:33:28,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 58 remaining) [2023-11-19 07:33:28,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 58 remaining) [2023-11-19 07:33:28,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 58 remaining) [2023-11-19 07:33:28,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 58 remaining) [2023-11-19 07:33:28,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 58 remaining) [2023-11-19 07:33:28,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 58 remaining) [2023-11-19 07:33:28,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 58 remaining) [2023-11-19 07:33:28,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 58 remaining) [2023-11-19 07:33:28,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 58 remaining) [2023-11-19 07:33:28,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 58 remaining) [2023-11-19 07:33:28,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 58 remaining) [2023-11-19 07:33:28,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 58 remaining) [2023-11-19 07:33:28,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-19 07:33:28,986 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:28,994 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 07:33:28,994 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:33:29,081 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre22 could not be translated [2023-11-19 07:33:29,083 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre24 could not be translated [2023-11-19 07:33:29,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:33:29 BasicIcfg [2023-11-19 07:33:29,103 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:33:29,104 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:33:29,104 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:33:29,104 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:33:29,105 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:33:01" (3/4) ... [2023-11-19 07:33:29,106 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-19 07:33:29,107 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:33:29,108 INFO L158 Benchmark]: Toolchain (without parser) took 30666.20ms. Allocated memory was 157.3MB in the beginning and 497.0MB in the end (delta: 339.7MB). Free memory was 109.7MB in the beginning and 317.9MB in the end (delta: -208.2MB). Peak memory consumption was 133.5MB. Max. memory is 16.1GB. [2023-11-19 07:33:29,109 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 123.7MB. Free memory was 87.1MB in the beginning and 87.0MB in the end (delta: 28.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:33:29,109 INFO L158 Benchmark]: CACSL2BoogieTranslator took 791.20ms. Allocated memory is still 157.3MB. Free memory was 109.7MB in the beginning and 86.5MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-19 07:33:29,109 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.80ms. Allocated memory is still 157.3MB. Free memory was 86.5MB in the beginning and 84.0MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-19 07:33:29,110 INFO L158 Benchmark]: Boogie Preprocessor took 93.96ms. Allocated memory is still 157.3MB. Free memory was 84.0MB in the beginning and 125.7MB in the end (delta: -41.7MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2023-11-19 07:33:29,110 INFO L158 Benchmark]: RCFGBuilder took 1638.34ms. Allocated memory is still 157.3MB. Free memory was 125.7MB in the beginning and 58.3MB in the end (delta: 67.4MB). Peak memory consumption was 80.4MB. Max. memory is 16.1GB. [2023-11-19 07:33:29,111 INFO L158 Benchmark]: TraceAbstraction took 28043.69ms. Allocated memory was 157.3MB in the beginning and 497.0MB in the end (delta: 339.7MB). Free memory was 57.3MB in the beginning and 317.9MB in the end (delta: -260.6MB). Peak memory consumption was 79.1MB. Max. memory is 16.1GB. [2023-11-19 07:33:29,111 INFO L158 Benchmark]: Witness Printer took 4.05ms. Allocated memory is still 497.0MB. Free memory is still 317.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:33:29,113 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.31ms. Allocated memory is still 123.7MB. Free memory was 87.1MB in the beginning and 87.0MB in the end (delta: 28.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 791.20ms. Allocated memory is still 157.3MB. Free memory was 109.7MB in the beginning and 86.5MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.80ms. Allocated memory is still 157.3MB. Free memory was 86.5MB in the beginning and 84.0MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 93.96ms. Allocated memory is still 157.3MB. Free memory was 84.0MB in the beginning and 125.7MB in the end (delta: -41.7MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. * RCFGBuilder took 1638.34ms. Allocated memory is still 157.3MB. Free memory was 125.7MB in the beginning and 58.3MB in the end (delta: 67.4MB). Peak memory consumption was 80.4MB. Max. memory is 16.1GB. * TraceAbstraction took 28043.69ms. Allocated memory was 157.3MB in the beginning and 497.0MB in the end (delta: 339.7MB). Free memory was 57.3MB in the beginning and 317.9MB in the end (delta: -260.6MB). Peak memory consumption was 79.1MB. Max. memory is 16.1GB. * Witness Printer took 4.05ms. Allocated memory is still 497.0MB. Free memory is still 317.9MB. 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~pre22 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre24 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15.3s, 150 PlacesBefore, 60 PlacesAfterwards, 167 TransitionsBefore, 55 TransitionsAfterwards, 6900 CoEnabledTransitionPairs, 8 FixpointIterations, 60 TrivialSequentialCompositions, 88 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 22 ChoiceCompositions, 183 TotalNumberOfCompositions, 18897 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8076, independent: 7701, independent conditional: 0, independent unconditional: 7701, dependent: 375, dependent conditional: 0, dependent unconditional: 375, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2421, independent: 2363, independent conditional: 0, independent unconditional: 2363, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8076, independent: 5338, independent conditional: 0, independent unconditional: 5338, dependent: 317, dependent conditional: 0, dependent unconditional: 317, unknown: 2421, unknown conditional: 0, unknown unconditional: 2421] , Statistics on independence cache: Total cache size (in pairs): 255, Positive cache size: 228, Positive conditional cache size: 0, Positive unconditional cache size: 228, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L713] 0 int __unbuffered_p0_EAX$mem_tmp; [L714] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L720] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L721] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L722] 0 int __unbuffered_p0_EAX$w_buff0; [L723] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L724] 0 int __unbuffered_p0_EAX$w_buff1; [L725] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L727] 0 int __unbuffered_p1_EAX = 0; [L728] 0 _Bool main$tmp_guard0; [L729] 0 _Bool main$tmp_guard1; [L731] 0 int x = 0; [L733] 0 int y = 0; [L734] 0 _Bool y$flush_delayed; [L735] 0 int y$mem_tmp; [L736] 0 _Bool y$r_buff0_thd0; [L737] 0 _Bool y$r_buff0_thd1; [L738] 0 _Bool y$r_buff0_thd2; [L739] 0 _Bool y$r_buff1_thd0; [L740] 0 _Bool y$r_buff1_thd1; [L741] 0 _Bool y$r_buff1_thd2; [L742] 0 _Bool y$read_delayed; [L743] 0 int *y$read_delayed_var; [L744] 0 int y$w_buff0; [L745] 0 _Bool y$w_buff0_used; [L746] 0 int y$w_buff1; [L747] 0 _Bool y$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice1; [L750] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1921; [L814] FCALL, FORK 0 pthread_create(&t1921, ((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_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1921={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L815] 0 pthread_t t1922; [L816] FCALL, FORK 0 pthread_create(&t1922, ((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_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1921={6:0}, t1922={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] EXPR 1 \read(y) [L757] 1 y$mem_tmp = y [L758] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L759] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L759] EXPR 1 \read(y) [L759] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L759] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L760] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L761] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L762] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L763] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L764] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L765] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L766] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L767] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L768] EXPR 1 \read(y) [L768] 1 __unbuffered_p0_EAX = y [L769] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L769] EXPR 1 \read(y) [L769] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L769] 1 y = y$flush_delayed ? y$mem_tmp : y [L770] 1 y$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_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=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, 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=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L773] 1 x = 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_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=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, 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=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L785] 2 __unbuffered_p1_EAX = x 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_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=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=1, 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=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L788] 2 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_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=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=1, 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=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L791] EXPR 2 \read(y) [L791] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L792] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L793] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L794] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L795] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L778] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 1 return 0; [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] EXPR 0 \read(y) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=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_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=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=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1921={6:0}, t1922={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L829] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L830] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L830] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L830] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L830] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L830] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L830] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L831] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1) [L833] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe006_power.oepc-thin000_power.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __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_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=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=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - 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: -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: 811]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 816]: 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: 814]: 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 5 procedures, 186 locations, 58 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: 27.6s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 15.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 909 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 634 mSDsluCounter, 255 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 215 mSDsCounter, 113 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1435 IncrementalHoareTripleChecker+Invalid, 1548 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 113 mSolverCounterUnsat, 40 mSDtfsCounter, 1435 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=343occurred in iteration=11, 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, 4.2s InterpolantComputationTime, 132 NumberOfCodeBlocks, 132 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 103 ConstructedInterpolants, 0 QuantifiedInterpolants, 787 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-19 07:33:29,177 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c75c9f2-23e5-4d74-bdec-0d0333fd1143/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c75c9f2-23e5-4d74-bdec-0d0333fd1143/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c75c9f2-23e5-4d74-bdec-0d0333fd1143/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c75c9f2-23e5-4d74-bdec-0d0333fd1143/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c75c9f2-23e5-4d74-bdec-0d0333fd1143/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c75c9f2-23e5-4d74-bdec-0d0333fd1143/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c75c9f2-23e5-4d74-bdec-0d0333fd1143/bin/uautomizer-verify-uCwYo4JHxu --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e1a7472923aa95b61749a468b52dfc65e03dead5bf647c94f71a6e156dc586ae --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:33:31,924 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:33:32,094 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c75c9f2-23e5-4d74-bdec-0d0333fd1143/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-19 07:33:32,104 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:33:32,105 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:33:32,151 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:33:32,152 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:33:32,153 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:33:32,154 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:33:32,160 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:33:32,161 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:33:32,161 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:33:32,162 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:33:32,164 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:33:32,164 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:33:32,165 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:33:32,165 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:33:32,166 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:33:32,166 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 07:33:32,167 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 07:33:32,168 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 07:33:32,168 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:33:32,169 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 07:33:32,169 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-19 07:33:32,170 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-19 07:33:32,170 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 07:33:32,171 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:33:32,171 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:33:32,172 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:33:32,173 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:33:32,174 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:33:32,175 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:33:32,175 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:33:32,176 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:33:32,176 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-19 07:33:32,176 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-19 07:33:32,176 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:33:32,177 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:33:32,177 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:33:32,178 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-19 07:33:32,178 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:33:32,179 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_3c75c9f2-23e5-4d74-bdec-0d0333fd1143/bin/uautomizer-verify-uCwYo4JHxu/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c75c9f2-23e5-4d74-bdec-0d0333fd1143/bin/uautomizer-verify-uCwYo4JHxu Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e1a7472923aa95b61749a468b52dfc65e03dead5bf647c94f71a6e156dc586ae [2023-11-19 07:33:32,673 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:33:32,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:33:32,706 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:33:32,708 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:33:32,708 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:33:32,710 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c75c9f2-23e5-4d74-bdec-0d0333fd1143/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i [2023-11-19 07:33:36,024 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:33:36,450 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:33:36,451 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c75c9f2-23e5-4d74-bdec-0d0333fd1143/sv-benchmarks/c/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i [2023-11-19 07:33:36,471 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c75c9f2-23e5-4d74-bdec-0d0333fd1143/bin/uautomizer-verify-uCwYo4JHxu/data/7ca10a9dc/9749c055633d4e4b9dd4cec63965c516/FLAGc63118115 [2023-11-19 07:33:36,498 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c75c9f2-23e5-4d74-bdec-0d0333fd1143/bin/uautomizer-verify-uCwYo4JHxu/data/7ca10a9dc/9749c055633d4e4b9dd4cec63965c516 [2023-11-19 07:33:36,505 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:33:36,507 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:33:36,511 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:33:36,512 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:33:36,518 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:33:36,519 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:33:36" (1/1) ... [2023-11-19 07:33:36,521 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33ff76a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:36, skipping insertion in model container [2023-11-19 07:33:36,521 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:33:36" (1/1) ... [2023-11-19 07:33:36,617 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:33:37,248 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:33:37,282 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:33:37,397 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:33:37,500 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:33:37,501 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:33:37,510 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:33:37,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:37 WrapperNode [2023-11-19 07:33:37,511 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:33:37,512 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:33:37,513 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:33:37,513 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:33:37,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:37" (1/1) ... [2023-11-19 07:33:37,558 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:37" (1/1) ... [2023-11-19 07:33:37,611 INFO L138 Inliner]: procedures = 179, calls = 57, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 124 [2023-11-19 07:33:37,612 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:33:37,614 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:33:37,614 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:33:37,615 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:33:37,626 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:37" (1/1) ... [2023-11-19 07:33:37,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:37" (1/1) ... [2023-11-19 07:33:37,645 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:37" (1/1) ... [2023-11-19 07:33:37,655 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:37" (1/1) ... [2023-11-19 07:33:37,668 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:37" (1/1) ... [2023-11-19 07:33:37,682 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:37" (1/1) ... [2023-11-19 07:33:37,686 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:37" (1/1) ... [2023-11-19 07:33:37,703 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:37" (1/1) ... [2023-11-19 07:33:37,708 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:33:37,709 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:33:37,710 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:33:37,710 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:33:37,711 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:37" (1/1) ... [2023-11-19 07:33:37,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:33:37,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c75c9f2-23e5-4d74-bdec-0d0333fd1143/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:33:37,758 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c75c9f2-23e5-4d74-bdec-0d0333fd1143/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:33:37,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3c75c9f2-23e5-4d74-bdec-0d0333fd1143/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:33:37,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-19 07:33:37,811 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 07:33:37,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:33:37,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:33:37,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:33:37,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-19 07:33:37,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-19 07:33:37,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-11-19 07:33:37,812 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 07:33:37,813 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 07:33:37,813 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 07:33:37,813 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 07:33:37,813 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 07:33:37,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:33:37,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:33:37,816 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 07:33:38,007 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:33:38,009 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:33:38,676 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:33:39,410 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:33:39,411 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 07:33:39,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:33:39 BoogieIcfgContainer [2023-11-19 07:33:39,418 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:33:39,421 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:33:39,421 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:33:39,425 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:33:39,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:33:36" (1/3) ... [2023-11-19 07:33:39,426 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40b60ba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:33:39, skipping insertion in model container [2023-11-19 07:33:39,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:33:37" (2/3) ... [2023-11-19 07:33:39,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40b60ba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:33:39, skipping insertion in model container [2023-11-19 07:33:39,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:33:39" (3/3) ... [2023-11-19 07:33:39,430 INFO L112 eAbstractionObserver]: Analyzing ICFG safe006_power.oepc-thin000_power.oepc.i [2023-11-19 07:33:39,452 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:33:39,452 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2023-11-19 07:33:39,453 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 07:33:39,714 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:33:39,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 170 transitions, 348 flow [2023-11-19 07:33:39,892 INFO L124 PetriNetUnfolderBase]: 24/168 cut-off events. [2023-11-19 07:33:39,894 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:33:39,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 168 events. 24/168 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 241 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 113. Up to 4 conditions per place. [2023-11-19 07:33:39,903 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 170 transitions, 348 flow [2023-11-19 07:33:39,915 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 168 transitions, 342 flow [2023-11-19 07:33:39,919 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:33:39,937 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 168 transitions, 342 flow [2023-11-19 07:33:39,941 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 168 transitions, 342 flow [2023-11-19 07:33:39,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 168 transitions, 342 flow [2023-11-19 07:33:40,042 INFO L124 PetriNetUnfolderBase]: 24/168 cut-off events. [2023-11-19 07:33:40,043 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:33:40,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 168 events. 24/168 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 238 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 113. Up to 4 conditions per place. [2023-11-19 07:33:40,051 INFO L119 LiptonReduction]: Number of co-enabled transitions 6900