./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.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_2e40b510-3772-4305-ad97-fdb984c17e16/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e40b510-3772-4305-ad97-fdb984c17e16/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_2e40b510-3772-4305-ad97-fdb984c17e16/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e40b510-3772-4305-ad97-fdb984c17e16/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e40b510-3772-4305-ad97-fdb984c17e16/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_2e40b510-3772-4305-ad97-fdb984c17e16/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 5e0f2637c3745e36a3708f37a9783771b3e1c15cb350f0e936eafd42058bd9cf
--- Real Ultimate output ---
This is Ultimate 0.2.3-dev-9bd2c7f
[2023-11-19 07:40:55,731 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2023-11-19 07:40:55,846 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e40b510-3772-4305-ad97-fdb984c17e16/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf
[2023-11-19 07:40:55,859 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2023-11-19 07:40:55,859 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2023-11-19 07:40:55,883 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-19 07:40:55,884 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-19 07:40:55,884 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-19 07:40:55,885 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-19 07:40:55,886 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-19 07:40:55,887 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-19 07:40:55,888 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2023-11-19 07:40:55,888 INFO L153 SettingsManager]: * Use SBE=true
[2023-11-19 07:40:55,889 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-19 07:40:55,890 INFO L153 SettingsManager]: * sizeof long=4
[2023-11-19 07:40:55,890 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2023-11-19 07:40:55,891 INFO L153 SettingsManager]: * sizeof POINTER=4
[2023-11-19 07:40:55,891 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2023-11-19 07:40:55,892 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2023-11-19 07:40:55,892 INFO L153 SettingsManager]: * Bitprecise bitfields=true
[2023-11-19 07:40:55,893 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2023-11-19 07:40:55,894 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-19 07:40:55,895 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2023-11-19 07:40:55,895 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2023-11-19 07:40:55,896 INFO L153 SettingsManager]: * sizeof long double=12
[2023-11-19 07:40:55,896 INFO L153 SettingsManager]: * Use constant arrays=true
[2023-11-19 07:40:55,897 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-19 07:40:55,897 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2023-11-19 07:40:55,898 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2023-11-19 07:40:55,898 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-19 07:40:55,899 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-19 07:40:55,899 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2023-11-19 07:40:55,900 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2023-11-19 07:40:55,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-11-19 07:40:55,901 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-19 07:40:55,901 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2023-11-19 07:40:55,902 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2023-11-19 07:40:55,902 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-11-19 07:40:55,903 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_2e40b510-3772-4305-ad97-fdb984c17e16/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_2e40b510-3772-4305-ad97-fdb984c17e16/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 -> 5e0f2637c3745e36a3708f37a9783771b3e1c15cb350f0e936eafd42058bd9cf
[2023-11-19 07:40:56,203 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-19 07:40:56,235 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-19 07:40:56,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-19 07:40:56,240 INFO L270 PluginConnector]: Initializing CDTParser...
[2023-11-19 07:40:56,241 INFO L274 PluginConnector]: CDTParser initialized
[2023-11-19 07:40:56,242 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e40b510-3772-4305-ad97-fdb984c17e16/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2023-11-19 07:40:59,217 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2023-11-19 07:40:59,642 INFO L384 CDTParser]: Found 1 translation units.
[2023-11-19 07:40:59,642 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e40b510-3772-4305-ad97-fdb984c17e16/sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2023-11-19 07:40:59,660 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e40b510-3772-4305-ad97-fdb984c17e16/bin/uautomizer-verify-uCwYo4JHxu/data/47471829f/e67b9c0829ea43c09b07ba7de5d41c33/FLAGa1e462d65
[2023-11-19 07:40:59,675 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e40b510-3772-4305-ad97-fdb984c17e16/bin/uautomizer-verify-uCwYo4JHxu/data/47471829f/e67b9c0829ea43c09b07ba7de5d41c33
[2023-11-19 07:40:59,678 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-19 07:40:59,680 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-19 07:40:59,682 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-19 07:40:59,682 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-19 07:40:59,687 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-19 07:40:59,688 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:40:59" (1/1) ...
[2023-11-19 07:40:59,689 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5320c46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:40:59, skipping insertion in model container
[2023-11-19 07:40:59,690 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:40:59" (1/1) ...
[2023-11-19 07:40:59,765 INFO L177 MainTranslator]: Built tables and reachable declarations
[2023-11-19 07:41:00,282 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-19 07:41:00,308 INFO L202 MainTranslator]: Completed pre-run
[2023-11-19 07:41:00,387 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-19 07:41:00,437 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler.
[2023-11-19 07:41:00,438 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler.
[2023-11-19 07:41:00,446 INFO L206 MainTranslator]: Completed translation
[2023-11-19 07:41:00,447 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:00 WrapperNode
[2023-11-19 07:41:00,447 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-19 07:41:00,449 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-19 07:41:00,449 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-19 07:41:00,449 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-19 07:41:00,458 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:41:00" (1/1) ...
[2023-11-19 07:41:00,484 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:41:00" (1/1) ...
[2023-11-19 07:41:00,531 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 150
[2023-11-19 07:41:00,532 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-19 07:41:00,533 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-19 07:41:00,533 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-19 07:41:00,533 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2023-11-19 07:41:00,543 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:00" (1/1) ...
[2023-11-19 07:41:00,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:00" (1/1) ...
[2023-11-19 07:41:00,563 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:00" (1/1) ...
[2023-11-19 07:41:00,563 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:00" (1/1) ...
[2023-11-19 07:41:00,576 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:00" (1/1) ...
[2023-11-19 07:41:00,579 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:00" (1/1) ...
[2023-11-19 07:41:00,582 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:00" (1/1) ...
[2023-11-19 07:41:00,584 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:00" (1/1) ...
[2023-11-19 07:41:00,590 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-19 07:41:00,591 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-19 07:41:00,591 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2023-11-19 07:41:00,591 INFO L274 PluginConnector]: RCFGBuilder initialized
[2023-11-19 07:41:00,592 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:00" (1/1) ...
[2023-11-19 07:41:00,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-19 07:41:00,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e40b510-3772-4305-ad97-fdb984c17e16/bin/uautomizer-verify-uCwYo4JHxu/z3
[2023-11-19 07:41:00,627 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e40b510-3772-4305-ad97-fdb984c17e16/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:41:00,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e40b510-3772-4305-ad97-fdb984c17e16/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:41:00,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2023-11-19 07:41:00,705 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2023-11-19 07:41:00,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-11-19 07:41:00,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-11-19 07:41:00,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-11-19 07:41:00,706 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2023-11-19 07:41:00,706 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2023-11-19 07:41:00,706 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2023-11-19 07:41:00,707 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2023-11-19 07:41:00,707 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2023-11-19 07:41:00,707 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2023-11-19 07:41:00,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2023-11-19 07:41:00,707 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2023-11-19 07:41:00,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-19 07:41:00,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-19 07:41:00,711 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:41:00,949 INFO L236 CfgBuilder]: Building ICFG
[2023-11-19 07:41:00,951 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-19 07:41:01,465 INFO L277 CfgBuilder]: Performing block encoding
[2023-11-19 07:41:01,712 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-19 07:41:01,712 INFO L302 CfgBuilder]: Removed 0 assume(true) statements.
[2023-11-19 07:41:01,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:41:01 BoogieIcfgContainer
[2023-11-19 07:41:01,720 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-19 07:41:01,723 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-19 07:41:01,723 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2023-11-19 07:41:01,727 INFO L274 PluginConnector]: TraceAbstraction initialized
[2023-11-19 07:41:01,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:40:59" (1/3) ...
[2023-11-19 07:41:01,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c52b323 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:41:01, skipping insertion in model container
[2023-11-19 07:41:01,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:41:00" (2/3) ...
[2023-11-19 07:41:01,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c52b323 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:41:01, skipping insertion in model container
[2023-11-19 07:41:01,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:41:01" (3/3) ...
[2023-11-19 07:41:01,731 INFO L112 eAbstractionObserver]: Analyzing ICFG safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i
[2023-11-19 07:41:01,752 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-19 07:41:01,753 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations.
[2023-11-19 07:41:01,753 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-11-19 07:41:01,833 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-11-19 07:41:01,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 127 transitions, 266 flow
[2023-11-19 07:41:02,035 INFO L124 PetriNetUnfolderBase]: 4/124 cut-off events.
[2023-11-19 07:41:02,036 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-19 07:41:02,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 124 events. 4/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 97 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place.
[2023-11-19 07:41:02,042 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 127 transitions, 266 flow
[2023-11-19 07:41:02,047 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 124 transitions, 257 flow
[2023-11-19 07:41:02,051 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-19 07:41:02,061 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 124 transitions, 257 flow
[2023-11-19 07:41:02,068 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 124 transitions, 257 flow
[2023-11-19 07:41:02,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 124 transitions, 257 flow
[2023-11-19 07:41:02,101 INFO L124 PetriNetUnfolderBase]: 4/124 cut-off events.
[2023-11-19 07:41:02,101 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-19 07:41:02,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 124 events. 4/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 97 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place.
[2023-11-19 07:41:02,106 INFO L119 LiptonReduction]: Number of co-enabled transitions 2686
[2023-11-19 07:41:09,178 INFO L134 LiptonReduction]: Checked pairs total: 6592
[2023-11-19 07:41:09,178 INFO L136 LiptonReduction]: Total number of compositions: 133
[2023-11-19 07:41:09,194 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-19 07:41:09,201 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;@14825831, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-19 07:41:09,201 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations.
[2023-11-19 07:41:09,203 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2023-11-19 07:41:09,203 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events.
[2023-11-19 07:41:09,204 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-19 07:41:09,204 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:41:09,204 INFO L208 CegarLoopForPetriNet]: trace histogram [1]
[2023-11-19 07:41:09,205 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-11-19 07:41:09,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:41:09,210 INFO L85 PathProgramCache]: Analyzing trace with hash 644, now seen corresponding path program 1 times
[2023-11-19 07:41:09,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:41:09,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279391257]
[2023-11-19 07:41:09,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:41:09,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:41:09,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:09,358 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:41:09,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:41:09,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279391257]
[2023-11-19 07:41:09,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279391257] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:41:09,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:41:09,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-11-19 07:41:09,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290605981]
[2023-11-19 07:41:09,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:41:09,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-19 07:41:09,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:41:09,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-19 07:41:09,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-19 07:41:09,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 260
[2023-11-19 07:41:09,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 71 flow. Second operand has 2 states, 2 states have (on average 110.5) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 states 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:41:09,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:41:09,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 260
[2023-11-19 07:41:09,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:41:10,104 INFO L124 PetriNetUnfolderBase]: 1381/2037 cut-off events.
[2023-11-19 07:41:10,104 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES.
[2023-11-19 07:41:10,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4126 conditions, 2037 events. 1381/2037 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 9308 event pairs, 1381 based on Foata normal form. 0/1701 useless extension candidates. Maximal degree in co-relation 4115. Up to 2033 conditions per place.
[2023-11-19 07:41:10,129 INFO L140 encePairwiseOnDemand]: 253/260 looper letters, 22 selfloop transitions, 0 changer transitions 0/24 dead transitions.
[2023-11-19 07:41:10,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 24 transitions, 101 flow
[2023-11-19 07:41:10,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2023-11-19 07:41:10,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-11-19 07:41:10,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 249 transitions.
[2023-11-19 07:41:10,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47884615384615387
[2023-11-19 07:41:10,151 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 249 transitions.
[2023-11-19 07:41:10,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 249 transitions.
[2023-11-19 07:41:10,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:41:10,156 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 249 transitions.
[2023-11-19 07:41:10,164 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 124.5) internal successors, (249), 2 states have internal predecessors, (249), 0 states have call successors, (0), 0 states 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:41:10,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 260.0) internal successors, (780), 3 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:41:10,171 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 260.0) internal successors, (780), 3 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:41:10,173 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 71 flow. Second operand 2 states and 249 transitions.
[2023-11-19 07:41:10,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 24 transitions, 101 flow
[2023-11-19 07:41:10,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 24 transitions, 98 flow, removed 0 selfloop flow, removed 3 redundant places.
[2023-11-19 07:41:10,181 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 54 flow
[2023-11-19 07:41:10,184 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=24}
[2023-11-19 07:41:10,188 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -8 predicate places.
[2023-11-19 07:41:10,188 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 54 flow
[2023-11-19 07:41:10,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 110.5) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 states 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:41:10,189 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:41:10,189 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1]
[2023-11-19 07:41:10,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-11-19 07:41:10,190 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-11-19 07:41:10,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:41:10,191 INFO L85 PathProgramCache]: Analyzing trace with hash 632421, now seen corresponding path program 1 times
[2023-11-19 07:41:10,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:41:10,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465474023]
[2023-11-19 07:41:10,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:41:10,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:41:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:10,519 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:41:10,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:41:10,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465474023]
[2023-11-19 07:41:10,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465474023] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:41:10,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:41:10,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-19 07:41:10,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359983449]
[2023-11-19 07:41:10,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:41:10,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:41:10,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:41:10,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:41:10,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:41:10,526 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 260
[2023-11-19 07:41:10,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states 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:41:10,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:41:10,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 260
[2023-11-19 07:41:10,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:41:11,038 INFO L124 PetriNetUnfolderBase]: 1079/1667 cut-off events.
[2023-11-19 07:41:11,038 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-19 07:41:11,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3312 conditions, 1667 events. 1079/1667 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 8060 event pairs, 301 based on Foata normal form. 0/1506 useless extension candidates. Maximal degree in co-relation 3309. Up to 1297 conditions per place.
[2023-11-19 07:41:11,051 INFO L140 encePairwiseOnDemand]: 257/260 looper letters, 33 selfloop transitions, 2 changer transitions 2/39 dead transitions.
[2023-11-19 07:41:11,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 39 transitions, 162 flow
[2023-11-19 07:41:11,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-19 07:41:11,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-19 07:41:11,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 365 transitions.
[2023-11-19 07:41:11,056 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46794871794871795
[2023-11-19 07:41:11,056 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 365 transitions.
[2023-11-19 07:41:11,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 365 transitions.
[2023-11-19 07:41:11,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:41:11,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 365 transitions.
[2023-11-19 07:41:11,059 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:41:11,062 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 260.0) internal successors, (1040), 4 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states 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:41:11,064 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 260.0) internal successors, (1040), 4 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states 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:41:11,064 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 54 flow. Second operand 3 states and 365 transitions.
[2023-11-19 07:41:11,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 39 transitions, 162 flow
[2023-11-19 07:41:11,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 39 transitions, 162 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-19 07:41:11,066 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 54 flow
[2023-11-19 07:41:11,066 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=33, PETRI_TRANSITIONS=22}
[2023-11-19 07:41:11,067 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -7 predicate places.
[2023-11-19 07:41:11,068 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 54 flow
[2023-11-19 07:41:11,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states 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:41:11,069 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:41:11,069 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:41:11,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-11-19 07:41:11,069 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-11-19 07:41:11,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:41:11,070 INFO L85 PathProgramCache]: Analyzing trace with hash 12224435, now seen corresponding path program 1 times
[2023-11-19 07:41:11,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:41:11,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945588550]
[2023-11-19 07:41:11,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:41:11,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:41:11,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:12,505 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:41:12,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:41:12,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945588550]
[2023-11-19 07:41:12,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945588550] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:41:12,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:41:12,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-19 07:41:12,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125066250]
[2023-11-19 07:41:12,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:41:12,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-19 07:41:12,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:41:12,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-19 07:41:12,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2023-11-19 07:41:12,562 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 260
[2023-11-19 07:41:12,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:41:12,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:41:12,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 260
[2023-11-19 07:41:12,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:41:12,999 INFO L124 PetriNetUnfolderBase]: 935/1428 cut-off events.
[2023-11-19 07:41:13,000 INFO L125 PetriNetUnfolderBase]: For 121/121 co-relation queries the response was YES.
[2023-11-19 07:41:13,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3021 conditions, 1428 events. 935/1428 cut-off events. For 121/121 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 6512 event pairs, 183 based on Foata normal form. 0/1359 useless extension candidates. Maximal degree in co-relation 3017. Up to 1073 conditions per place.
[2023-11-19 07:41:13,011 INFO L140 encePairwiseOnDemand]: 250/260 looper letters, 29 selfloop transitions, 9 changer transitions 0/40 dead transitions.
[2023-11-19 07:41:13,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 40 transitions, 170 flow
[2023-11-19 07:41:13,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2023-11-19 07:41:13,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-19 07:41:13,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 447 transitions.
[2023-11-19 07:41:13,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42980769230769234
[2023-11-19 07:41:13,014 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 447 transitions.
[2023-11-19 07:41:13,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 447 transitions.
[2023-11-19 07:41:13,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:41:13,015 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 447 transitions.
[2023-11-19 07:41:13,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:41:13,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 260.0) internal successors, (1300), 5 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states 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:41:13,021 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 260.0) internal successors, (1300), 5 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states 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:41:13,022 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 54 flow. Second operand 4 states and 447 transitions.
[2023-11-19 07:41:13,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 40 transitions, 170 flow
[2023-11-19 07:41:13,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 40 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-19 07:41:13,024 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 116 flow
[2023-11-19 07:41:13,024 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=36, PETRI_TRANSITIONS=29}
[2023-11-19 07:41:13,025 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places.
[2023-11-19 07:41:13,025 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 116 flow
[2023-11-19 07:41:13,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:41:13,026 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:41:13,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:41:13,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-11-19 07:41:13,027 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-11-19 07:41:13,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:41:13,028 INFO L85 PathProgramCache]: Analyzing trace with hash 12224460, now seen corresponding path program 1 times
[2023-11-19 07:41:13,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:41:13,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181937227]
[2023-11-19 07:41:13,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:41:13,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:41:13,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:13,507 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:41:13,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:41:13,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181937227]
[2023-11-19 07:41:13,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181937227] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:41:13,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:41:13,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-19 07:41:13,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541882555]
[2023-11-19 07:41:13,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:41:13,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-11-19 07:41:13,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:41:13,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-11-19 07:41:13,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2023-11-19 07:41:13,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 260
[2023-11-19 07:41:13,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 116 flow. Second operand has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:41:13,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:41:13,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 260
[2023-11-19 07:41:13,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:41:14,026 INFO L124 PetriNetUnfolderBase]: 671/1019 cut-off events.
[2023-11-19 07:41:14,027 INFO L125 PetriNetUnfolderBase]: For 539/539 co-relation queries the response was YES.
[2023-11-19 07:41:14,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2713 conditions, 1019 events. 671/1019 cut-off events. For 539/539 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4281 event pairs, 184 based on Foata normal form. 80/1099 useless extension candidates. Maximal degree in co-relation 2707. Up to 976 conditions per place.
[2023-11-19 07:41:14,039 INFO L140 encePairwiseOnDemand]: 256/260 looper letters, 25 selfloop transitions, 3 changer transitions 0/30 dead transitions.
[2023-11-19 07:41:14,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 30 transitions, 156 flow
[2023-11-19 07:41:14,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-11-19 07:41:14,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-11-19 07:41:14,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 509 transitions.
[2023-11-19 07:41:14,043 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39153846153846156
[2023-11-19 07:41:14,043 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 509 transitions.
[2023-11-19 07:41:14,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 509 transitions.
[2023-11-19 07:41:14,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:41:14,044 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 509 transitions.
[2023-11-19 07:41:14,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 0 states have call successors, (0), 0 states 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:41:14,049 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 260.0) internal successors, (1560), 6 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states 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:41:14,051 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 260.0) internal successors, (1560), 6 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states 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:41:14,051 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 116 flow. Second operand 5 states and 509 transitions.
[2023-11-19 07:41:14,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 30 transitions, 156 flow
[2023-11-19 07:41:14,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 30 transitions, 150 flow, removed 0 selfloop flow, removed 3 redundant places.
[2023-11-19 07:41:14,055 INFO L231 Difference]: Finished difference. Result has 35 places, 21 transitions, 70 flow
[2023-11-19 07:41:14,055 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=70, PETRI_PLACES=35, PETRI_TRANSITIONS=21}
[2023-11-19 07:41:14,057 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -5 predicate places.
[2023-11-19 07:41:14,057 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 21 transitions, 70 flow
[2023-11-19 07:41:14,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.8) internal successors, (489), 5 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:41:14,058 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:41:14,058 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:41:14,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-11-19 07:41:14,059 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-11-19 07:41:14,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:41:14,060 INFO L85 PathProgramCache]: Analyzing trace with hash 378914116, now seen corresponding path program 1 times
[2023-11-19 07:41:14,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:41:14,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916172713]
[2023-11-19 07:41:14,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:41:14,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:41:14,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:15,079 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:41:15,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:41:15,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916172713]
[2023-11-19 07:41:15,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916172713] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:41:15,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:41:15,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-19 07:41:15,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670951691]
[2023-11-19 07:41:15,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:41:15,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-19 07:41:15,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:41:15,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-19 07:41:15,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2023-11-19 07:41:15,139 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 260
[2023-11-19 07:41:15,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 21 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 104.5) internal successors, (418), 4 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:41:15,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:41:15,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 260
[2023-11-19 07:41:15,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:41:15,404 INFO L124 PetriNetUnfolderBase]: 631/965 cut-off events.
[2023-11-19 07:41:15,404 INFO L125 PetriNetUnfolderBase]: For 324/324 co-relation queries the response was YES.
[2023-11-19 07:41:15,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2526 conditions, 965 events. 631/965 cut-off events. For 324/324 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3990 event pairs, 247 based on Foata normal form. 16/977 useless extension candidates. Maximal degree in co-relation 2520. Up to 609 conditions per place.
[2023-11-19 07:41:15,414 INFO L140 encePairwiseOnDemand]: 257/260 looper letters, 25 selfloop transitions, 2 changer transitions 0/29 dead transitions.
[2023-11-19 07:41:15,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 29 transitions, 148 flow
[2023-11-19 07:41:15,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-19 07:41:15,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-19 07:41:15,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions.
[2023-11-19 07:41:15,417 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4282051282051282
[2023-11-19 07:41:15,417 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 334 transitions.
[2023-11-19 07:41:15,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 334 transitions.
[2023-11-19 07:41:15,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:41:15,418 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 334 transitions.
[2023-11-19 07:41:15,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states 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:41:15,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 260.0) internal successors, (1040), 4 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states 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:41:15,423 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 260.0) internal successors, (1040), 4 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states 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:41:15,423 INFO L175 Difference]: Start difference. First operand has 35 places, 21 transitions, 70 flow. Second operand 3 states and 334 transitions.
[2023-11-19 07:41:15,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 29 transitions, 148 flow
[2023-11-19 07:41:15,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 29 transitions, 143 flow, removed 0 selfloop flow, removed 3 redundant places.
[2023-11-19 07:41:15,425 INFO L231 Difference]: Finished difference. Result has 35 places, 21 transitions, 73 flow
[2023-11-19 07:41:15,425 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=35, PETRI_TRANSITIONS=21}
[2023-11-19 07:41:15,428 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -5 predicate places.
[2023-11-19 07:41:15,428 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 21 transitions, 73 flow
[2023-11-19 07:41:15,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.5) internal successors, (418), 4 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:41:15,429 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:41:15,430 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:41:15,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-11-19 07:41:15,430 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-11-19 07:41:15,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:41:15,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1138567330, now seen corresponding path program 1 times
[2023-11-19 07:41:15,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:41:15,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262862972]
[2023-11-19 07:41:15,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:41:15,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:41:15,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:15,738 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:41:15,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:41:15,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262862972]
[2023-11-19 07:41:15,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262862972] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:41:15,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:41:15,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-19 07:41:15,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695409771]
[2023-11-19 07:41:15,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:41:15,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 07:41:15,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:41:15,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 07:41:15,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 07:41:15,747 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 260
[2023-11-19 07:41:15,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 21 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states 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:41:15,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:41:15,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 260
[2023-11-19 07:41:15,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:41:16,009 INFO L124 PetriNetUnfolderBase]: 602/989 cut-off events.
[2023-11-19 07:41:16,010 INFO L125 PetriNetUnfolderBase]: For 438/438 co-relation queries the response was YES.
[2023-11-19 07:41:16,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2604 conditions, 989 events. 602/989 cut-off events. For 438/438 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4714 event pairs, 110 based on Foata normal form. 12/1000 useless extension candidates. Maximal degree in co-relation 2597. Up to 757 conditions per place.
[2023-11-19 07:41:16,021 INFO L140 encePairwiseOnDemand]: 257/260 looper letters, 28 selfloop transitions, 2 changer transitions 0/32 dead transitions.
[2023-11-19 07:41:16,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 32 transitions, 170 flow
[2023-11-19 07:41:16,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-19 07:41:16,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-19 07:41:16,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions.
[2023-11-19 07:41:16,024 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4551282051282051
[2023-11-19 07:41:16,024 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 355 transitions.
[2023-11-19 07:41:16,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 355 transitions.
[2023-11-19 07:41:16,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:41:16,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 355 transitions.
[2023-11-19 07:41:16,027 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:41:16,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 260.0) internal successors, (1040), 4 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states 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:41:16,030 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 260.0) internal successors, (1040), 4 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states 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:41:16,030 INFO L175 Difference]: Start difference. First operand has 35 places, 21 transitions, 73 flow. Second operand 3 states and 355 transitions.
[2023-11-19 07:41:16,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 32 transitions, 170 flow
[2023-11-19 07:41:16,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 32 transitions, 159 flow, removed 1 selfloop flow, removed 3 redundant places.
[2023-11-19 07:41:16,035 INFO L231 Difference]: Finished difference. Result has 35 places, 21 transitions, 73 flow
[2023-11-19 07:41:16,036 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=35, PETRI_TRANSITIONS=21}
[2023-11-19 07:41:16,038 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -5 predicate places.
[2023-11-19 07:41:16,042 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 21 transitions, 73 flow
[2023-11-19 07:41:16,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states 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:41:16,043 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:41:16,044 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:41:16,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-11-19 07:41:16,044 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-11-19 07:41:16,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:41:16,045 INFO L85 PathProgramCache]: Analyzing trace with hash -935851156, now seen corresponding path program 1 times
[2023-11-19 07:41:16,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:41:16,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834106630]
[2023-11-19 07:41:16,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:41:16,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:41:16,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:16,428 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:41:16,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:41:16,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834106630]
[2023-11-19 07:41:16,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834106630] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:41:16,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:41:16,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-19 07:41:16,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107831219]
[2023-11-19 07:41:16,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:41:16,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-19 07:41:16,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:41:16,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-19 07:41:16,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-11-19 07:41:16,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 260
[2023-11-19 07:41:16,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 21 transitions, 73 flow. Second operand has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states 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:41:16,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:41:16,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 260
[2023-11-19 07:41:16,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:41:16,839 INFO L124 PetriNetUnfolderBase]: 997/1583 cut-off events.
[2023-11-19 07:41:16,840 INFO L125 PetriNetUnfolderBase]: For 662/662 co-relation queries the response was YES.
[2023-11-19 07:41:16,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4142 conditions, 1583 events. 997/1583 cut-off events. For 662/662 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7928 event pairs, 247 based on Foata normal form. 45/1626 useless extension candidates. Maximal degree in co-relation 4135. Up to 614 conditions per place.
[2023-11-19 07:41:16,851 INFO L140 encePairwiseOnDemand]: 256/260 looper letters, 37 selfloop transitions, 3 changer transitions 5/46 dead transitions.
[2023-11-19 07:41:16,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 46 transitions, 242 flow
[2023-11-19 07:41:16,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2023-11-19 07:41:16,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-19 07:41:16,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 471 transitions.
[2023-11-19 07:41:16,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4528846153846154
[2023-11-19 07:41:16,855 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 471 transitions.
[2023-11-19 07:41:16,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 471 transitions.
[2023-11-19 07:41:16,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:41:16,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 471 transitions.
[2023-11-19 07:41:16,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:41:16,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 260.0) internal successors, (1300), 5 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states 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:41:16,861 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 260.0) internal successors, (1300), 5 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states 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:41:16,861 INFO L175 Difference]: Start difference. First operand has 35 places, 21 transitions, 73 flow. Second operand 4 states and 471 transitions.
[2023-11-19 07:41:16,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 46 transitions, 242 flow
[2023-11-19 07:41:16,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 46 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-19 07:41:16,864 INFO L231 Difference]: Finished difference. Result has 38 places, 21 transitions, 83 flow
[2023-11-19 07:41:16,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=83, PETRI_PLACES=38, PETRI_TRANSITIONS=21}
[2023-11-19 07:41:16,865 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places.
[2023-11-19 07:41:16,866 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 21 transitions, 83 flow
[2023-11-19 07:41:16,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states 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:41:16,867 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:41:16,867 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:41:16,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-11-19 07:41:16,867 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-11-19 07:41:16,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:41:16,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1577624702, now seen corresponding path program 1 times
[2023-11-19 07:41:16,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:41:16,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188246709]
[2023-11-19 07:41:16,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:41:16,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:41:16,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:17,921 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:41:17,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:41:17,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188246709]
[2023-11-19 07:41:17,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188246709] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:41:17,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:41:17,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-19 07:41:17,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292640024]
[2023-11-19 07:41:17,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:41:17,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-11-19 07:41:17,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:41:17,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-11-19 07:41:17,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2023-11-19 07:41:17,961 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 260
[2023-11-19 07:41:17,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 21 transitions, 83 flow. Second operand has 7 states, 7 states have (on average 105.85714285714286) internal successors, (741), 7 states have internal predecessors, (741), 0 states have call successors, (0), 0 states 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:41:17,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:41:17,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 260
[2023-11-19 07:41:17,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:41:18,325 INFO L124 PetriNetUnfolderBase]: 625/962 cut-off events.
[2023-11-19 07:41:18,326 INFO L125 PetriNetUnfolderBase]: For 607/608 co-relation queries the response was YES.
[2023-11-19 07:41:18,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2733 conditions, 962 events. 625/962 cut-off events. For 607/608 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3631 event pairs, 223 based on Foata normal form. 3/964 useless extension candidates. Maximal degree in co-relation 2724. Up to 865 conditions per place.
[2023-11-19 07:41:18,335 INFO L140 encePairwiseOnDemand]: 251/260 looper letters, 39 selfloop transitions, 16 changer transitions 0/56 dead transitions.
[2023-11-19 07:41:18,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 56 transitions, 316 flow
[2023-11-19 07:41:18,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2023-11-19 07:41:18,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-19 07:41:18,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 681 transitions.
[2023-11-19 07:41:18,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43653846153846154
[2023-11-19 07:41:18,339 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 681 transitions.
[2023-11-19 07:41:18,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 681 transitions.
[2023-11-19 07:41:18,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:41:18,341 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 681 transitions.
[2023-11-19 07:41:18,343 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 0 states 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:41:18,346 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 260.0) internal successors, (1820), 7 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states 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:41:18,347 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 260.0) internal successors, (1820), 7 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states 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:41:18,348 INFO L175 Difference]: Start difference. First operand has 38 places, 21 transitions, 83 flow. Second operand 6 states and 681 transitions.
[2023-11-19 07:41:18,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 56 transitions, 316 flow
[2023-11-19 07:41:18,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 56 transitions, 298 flow, removed 2 selfloop flow, removed 4 redundant places.
[2023-11-19 07:41:18,353 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 196 flow
[2023-11-19 07:41:18,353 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=196, PETRI_PLACES=43, PETRI_TRANSITIONS=36}
[2023-11-19 07:41:18,356 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places.
[2023-11-19 07:41:18,356 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 196 flow
[2023-11-19 07:41:18,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 105.85714285714286) internal successors, (741), 7 states have internal predecessors, (741), 0 states have call successors, (0), 0 states 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:41:18,357 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:41:18,357 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:41:18,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-11-19 07:41:18,358 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-11-19 07:41:18,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:41:18,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1709244898, now seen corresponding path program 2 times
[2023-11-19 07:41:18,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:41:18,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555842296]
[2023-11-19 07:41:18,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:41:18,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:41:18,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:19,275 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:41:19,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:41:19,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555842296]
[2023-11-19 07:41:19,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555842296] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:41:19,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:41:19,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-11-19 07:41:19,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241491050]
[2023-11-19 07:41:19,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:41:19,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-19 07:41:19,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:41:19,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-19 07:41:19,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2023-11-19 07:41:19,318 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 260
[2023-11-19 07:41:19,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 196 flow. Second operand has 6 states, 6 states have (on average 105.16666666666667) internal successors, (631), 6 states have internal predecessors, (631), 0 states have call successors, (0), 0 states 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:41:19,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:41:19,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 260
[2023-11-19 07:41:19,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:41:19,656 INFO L124 PetriNetUnfolderBase]: 630/974 cut-off events.
[2023-11-19 07:41:19,656 INFO L125 PetriNetUnfolderBase]: For 1148/1148 co-relation queries the response was YES.
[2023-11-19 07:41:19,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3257 conditions, 974 events. 630/974 cut-off events. For 1148/1148 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3695 event pairs, 288 based on Foata normal form. 1/975 useless extension candidates. Maximal degree in co-relation 3246. Up to 911 conditions per place.
[2023-11-19 07:41:19,666 INFO L140 encePairwiseOnDemand]: 251/260 looper letters, 49 selfloop transitions, 17 changer transitions 0/67 dead transitions.
[2023-11-19 07:41:19,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 67 transitions, 463 flow
[2023-11-19 07:41:19,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2023-11-19 07:41:19,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-19 07:41:19,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 668 transitions.
[2023-11-19 07:41:19,671 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4282051282051282
[2023-11-19 07:41:19,671 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 668 transitions.
[2023-11-19 07:41:19,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 668 transitions.
[2023-11-19 07:41:19,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:41:19,672 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 668 transitions.
[2023-11-19 07:41:19,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 111.33333333333333) internal successors, (668), 6 states have internal predecessors, (668), 0 states have call successors, (0), 0 states 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:41:19,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 260.0) internal successors, (1820), 7 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states 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:41:19,681 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 260.0) internal successors, (1820), 7 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states 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:41:19,681 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 196 flow. Second operand 6 states and 668 transitions.
[2023-11-19 07:41:19,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 67 transitions, 463 flow
[2023-11-19 07:41:19,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 67 transitions, 457 flow, removed 3 selfloop flow, removed 0 redundant places.
[2023-11-19 07:41:19,689 INFO L231 Difference]: Finished difference. Result has 52 places, 51 transitions, 352 flow
[2023-11-19 07:41:19,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=352, PETRI_PLACES=52, PETRI_TRANSITIONS=51}
[2023-11-19 07:41:19,690 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 12 predicate places.
[2023-11-19 07:41:19,691 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 51 transitions, 352 flow
[2023-11-19 07:41:19,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.16666666666667) internal successors, (631), 6 states have internal predecessors, (631), 0 states have call successors, (0), 0 states 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:41:19,691 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:41:19,691 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:41:19,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-11-19 07:41:19,692 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-11-19 07:41:19,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:41:19,692 INFO L85 PathProgramCache]: Analyzing trace with hash -48608028, now seen corresponding path program 3 times
[2023-11-19 07:41:19,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:41:19,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126435685]
[2023-11-19 07:41:19,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:41:19,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:41:19,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:20,087 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:41:20,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:41:20,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126435685]
[2023-11-19 07:41:20,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126435685] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:41:20,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:41:20,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-19 07:41:20,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422521416]
[2023-11-19 07:41:20,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:41:20,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-19 07:41:20,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:41:20,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-19 07:41:20,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-11-19 07:41:20,102 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 260
[2023-11-19 07:41:20,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 51 transitions, 352 flow. Second operand has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:41:20,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:41:20,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 260
[2023-11-19 07:41:20,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:41:20,477 INFO L124 PetriNetUnfolderBase]: 927/1437 cut-off events.
[2023-11-19 07:41:20,477 INFO L125 PetriNetUnfolderBase]: For 2684/2685 co-relation queries the response was YES.
[2023-11-19 07:41:20,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5320 conditions, 1437 events. 927/1437 cut-off events. For 2684/2685 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6232 event pairs, 180 based on Foata normal form. 36/1472 useless extension candidates. Maximal degree in co-relation 5304. Up to 716 conditions per place.
[2023-11-19 07:41:20,524 INFO L140 encePairwiseOnDemand]: 254/260 looper letters, 54 selfloop transitions, 8 changer transitions 38/101 dead transitions.
[2023-11-19 07:41:20,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 101 transitions, 901 flow
[2023-11-19 07:41:20,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2023-11-19 07:41:20,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-19 07:41:20,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 479 transitions.
[2023-11-19 07:41:20,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46057692307692305
[2023-11-19 07:41:20,528 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 479 transitions.
[2023-11-19 07:41:20,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 479 transitions.
[2023-11-19 07:41:20,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:41:20,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 479 transitions.
[2023-11-19 07:41:20,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 states 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:41:20,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 260.0) internal successors, (1300), 5 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states 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:41:20,535 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 260.0) internal successors, (1300), 5 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states 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:41:20,536 INFO L175 Difference]: Start difference. First operand has 52 places, 51 transitions, 352 flow. Second operand 4 states and 479 transitions.
[2023-11-19 07:41:20,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 101 transitions, 901 flow
[2023-11-19 07:41:20,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 101 transitions, 879 flow, removed 11 selfloop flow, removed 0 redundant places.
[2023-11-19 07:41:20,547 INFO L231 Difference]: Finished difference. Result has 57 places, 46 transitions, 349 flow
[2023-11-19 07:41:20,548 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=349, PETRI_PLACES=57, PETRI_TRANSITIONS=46}
[2023-11-19 07:41:20,549 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 17 predicate places.
[2023-11-19 07:41:20,549 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 349 flow
[2023-11-19 07:41:20,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:41:20,550 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:41:20,550 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:41:20,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-11-19 07:41:20,550 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-11-19 07:41:20,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:41:20,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1170774957, now seen corresponding path program 1 times
[2023-11-19 07:41:20,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:41:20,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651250691]
[2023-11-19 07:41:20,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:41:20,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:41:20,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:21,713 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:41:21,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:41:21,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651250691]
[2023-11-19 07:41:21,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651250691] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:41:21,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:41:21,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-11-19 07:41:21,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409258729]
[2023-11-19 07:41:21,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:41:21,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-11-19 07:41:21,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:41:21,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-11-19 07:41:21,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2023-11-19 07:41:21,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 260
[2023-11-19 07:41:21,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 349 flow. Second operand has 8 states, 8 states have (on average 100.75) internal successors, (806), 8 states have internal predecessors, (806), 0 states have call successors, (0), 0 states 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:41:21,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:41:21,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 260
[2023-11-19 07:41:21,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:41:22,568 INFO L124 PetriNetUnfolderBase]: 723/1158 cut-off events.
[2023-11-19 07:41:22,568 INFO L125 PetriNetUnfolderBase]: For 3458/3458 co-relation queries the response was YES.
[2023-11-19 07:41:22,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4589 conditions, 1158 events. 723/1158 cut-off events. For 3458/3458 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5018 event pairs, 63 based on Foata normal form. 40/1198 useless extension candidates. Maximal degree in co-relation 4570. Up to 540 conditions per place.
[2023-11-19 07:41:22,581 INFO L140 encePairwiseOnDemand]: 252/260 looper letters, 64 selfloop transitions, 16 changer transitions 16/97 dead transitions.
[2023-11-19 07:41:22,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 97 transitions, 854 flow
[2023-11-19 07:41:22,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2023-11-19 07:41:22,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-19 07:41:22,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 657 transitions.
[2023-11-19 07:41:22,585 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42115384615384616
[2023-11-19 07:41:22,585 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 657 transitions.
[2023-11-19 07:41:22,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 657 transitions.
[2023-11-19 07:41:22,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:41:22,586 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 657 transitions.
[2023-11-19 07:41:22,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states 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:41:22,592 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 260.0) internal successors, (1820), 7 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states 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:41:22,594 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 260.0) internal successors, (1820), 7 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states 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:41:22,594 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 349 flow. Second operand 6 states and 657 transitions.
[2023-11-19 07:41:22,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 97 transitions, 854 flow
[2023-11-19 07:41:22,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 97 transitions, 812 flow, removed 12 selfloop flow, removed 3 redundant places.
[2023-11-19 07:41:22,605 INFO L231 Difference]: Finished difference. Result has 62 places, 55 transitions, 477 flow
[2023-11-19 07:41:22,606 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=477, PETRI_PLACES=62, PETRI_TRANSITIONS=55}
[2023-11-19 07:41:22,618 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 22 predicate places.
[2023-11-19 07:41:22,619 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 55 transitions, 477 flow
[2023-11-19 07:41:22,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 100.75) internal successors, (806), 8 states have internal predecessors, (806), 0 states have call successors, (0), 0 states 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:41:22,622 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:41:22,622 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:41:22,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-11-19 07:41:22,623 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-11-19 07:41:22,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:41:22,625 INFO L85 PathProgramCache]: Analyzing trace with hash 788505213, now seen corresponding path program 1 times
[2023-11-19 07:41:22,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:41:22,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802985247]
[2023-11-19 07:41:22,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:41:22,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:41:22,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:23,467 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:41:23,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:41:23,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802985247]
[2023-11-19 07:41:23,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802985247] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:41:23,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:41:23,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-19 07:41:23,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160165850]
[2023-11-19 07:41:23,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:41:23,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-11-19 07:41:23,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:41:23,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-11-19 07:41:23,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2023-11-19 07:41:23,500 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 260
[2023-11-19 07:41:23,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 55 transitions, 477 flow. Second operand has 7 states, 7 states have (on average 104.0) internal successors, (728), 7 states have internal predecessors, (728), 0 states have call successors, (0), 0 states 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:41:23,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:41:23,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 260
[2023-11-19 07:41:23,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:41:24,220 INFO L124 PetriNetUnfolderBase]: 952/1523 cut-off events.
[2023-11-19 07:41:24,221 INFO L125 PetriNetUnfolderBase]: For 6291/6291 co-relation queries the response was YES.
[2023-11-19 07:41:24,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6721 conditions, 1523 events. 952/1523 cut-off events. For 6291/6291 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 7078 event pairs, 152 based on Foata normal form. 7/1530 useless extension candidates. Maximal degree in co-relation 6701. Up to 981 conditions per place.
[2023-11-19 07:41:24,245 INFO L140 encePairwiseOnDemand]: 250/260 looper letters, 64 selfloop transitions, 67 changer transitions 5/137 dead transitions.
[2023-11-19 07:41:24,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 137 transitions, 1359 flow
[2023-11-19 07:41:24,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2023-11-19 07:41:24,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2023-11-19 07:41:24,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1220 transitions.
[2023-11-19 07:41:24,252 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42657342657342656
[2023-11-19 07:41:24,252 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1220 transitions.
[2023-11-19 07:41:24,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1220 transitions.
[2023-11-19 07:41:24,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:41:24,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1220 transitions.
[2023-11-19 07:41:24,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 110.9090909090909) internal successors, (1220), 11 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states 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:41:24,263 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 260.0) internal successors, (3120), 12 states have internal predecessors, (3120), 0 states have call successors, (0), 0 states 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:41:24,264 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 260.0) internal successors, (3120), 12 states have internal predecessors, (3120), 0 states have call successors, (0), 0 states 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:41:24,265 INFO L175 Difference]: Start difference. First operand has 62 places, 55 transitions, 477 flow. Second operand 11 states and 1220 transitions.
[2023-11-19 07:41:24,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 137 transitions, 1359 flow
[2023-11-19 07:41:24,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 137 transitions, 1307 flow, removed 20 selfloop flow, removed 2 redundant places.
[2023-11-19 07:41:24,296 INFO L231 Difference]: Finished difference. Result has 73 places, 96 transitions, 1067 flow
[2023-11-19 07:41:24,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1067, PETRI_PLACES=73, PETRI_TRANSITIONS=96}
[2023-11-19 07:41:24,298 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 33 predicate places.
[2023-11-19 07:41:24,298 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 96 transitions, 1067 flow
[2023-11-19 07:41:24,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 104.0) internal successors, (728), 7 states have internal predecessors, (728), 0 states have call successors, (0), 0 states 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:41:24,299 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:41:24,299 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:41:24,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2023-11-19 07:41:24,299 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-11-19 07:41:24,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:41:24,300 INFO L85 PathProgramCache]: Analyzing trace with hash 787120443, now seen corresponding path program 2 times
[2023-11-19 07:41:24,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:41:24,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447267437]
[2023-11-19 07:41:24,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:41:24,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:41:24,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:25,089 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:41:25,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:41:25,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447267437]
[2023-11-19 07:41:25,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447267437] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:41:25,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:41:25,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-11-19 07:41:25,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051135195]
[2023-11-19 07:41:25,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:41:25,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-19 07:41:25,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:41:25,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-19 07:41:25,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2023-11-19 07:41:25,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 260
[2023-11-19 07:41:25,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 96 transitions, 1067 flow. Second operand has 6 states, 6 states have (on average 107.33333333333333) internal successors, (644), 6 states have internal predecessors, (644), 0 states have call successors, (0), 0 states 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:41:25,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:41:25,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 260
[2023-11-19 07:41:25,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:41:25,652 INFO L124 PetriNetUnfolderBase]: 947/1533 cut-off events.
[2023-11-19 07:41:25,653 INFO L125 PetriNetUnfolderBase]: For 8677/8677 co-relation queries the response was YES.
[2023-11-19 07:41:25,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7751 conditions, 1533 events. 947/1533 cut-off events. For 8677/8677 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 7276 event pairs, 242 based on Foata normal form. 15/1548 useless extension candidates. Maximal degree in co-relation 7728. Up to 1153 conditions per place.
[2023-11-19 07:41:25,671 INFO L140 encePairwiseOnDemand]: 251/260 looper letters, 71 selfloop transitions, 53 changer transitions 2/127 dead transitions.
[2023-11-19 07:41:25,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 127 transitions, 1551 flow
[2023-11-19 07:41:25,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2023-11-19 07:41:25,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-19 07:41:25,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 678 transitions.
[2023-11-19 07:41:25,675 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4346153846153846
[2023-11-19 07:41:25,675 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 678 transitions.
[2023-11-19 07:41:25,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 678 transitions.
[2023-11-19 07:41:25,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:41:25,676 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 678 transitions.
[2023-11-19 07:41:25,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 0 states 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:41:25,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 260.0) internal successors, (1820), 7 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states 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:41:25,714 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 260.0) internal successors, (1820), 7 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states 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:41:25,714 INFO L175 Difference]: Start difference. First operand has 73 places, 96 transitions, 1067 flow. Second operand 6 states and 678 transitions.
[2023-11-19 07:41:25,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 127 transitions, 1551 flow
[2023-11-19 07:41:25,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 127 transitions, 1403 flow, removed 68 selfloop flow, removed 3 redundant places.
[2023-11-19 07:41:25,753 INFO L231 Difference]: Finished difference. Result has 77 places, 108 transitions, 1292 flow
[2023-11-19 07:41:25,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=934, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1292, PETRI_PLACES=77, PETRI_TRANSITIONS=108}
[2023-11-19 07:41:25,754 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 37 predicate places.
[2023-11-19 07:41:25,755 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 108 transitions, 1292 flow
[2023-11-19 07:41:25,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.33333333333333) internal successors, (644), 6 states have internal predecessors, (644), 0 states have call successors, (0), 0 states 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:41:25,756 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:41:25,756 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:41:25,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-11-19 07:41:25,756 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-11-19 07:41:25,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:41:25,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1815224481, now seen corresponding path program 1 times
[2023-11-19 07:41:25,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:41:25,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156493537]
[2023-11-19 07:41:25,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:41:25,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:41:25,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:26,439 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:41:26,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:41:26,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156493537]
[2023-11-19 07:41:26,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156493537] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:41:26,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:41:26,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-11-19 07:41:26,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807488800]
[2023-11-19 07:41:26,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:41:26,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-19 07:41:26,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:41:26,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-19 07:41:26,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2023-11-19 07:41:26,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 260
[2023-11-19 07:41:26,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 108 transitions, 1292 flow. Second operand has 6 states, 6 states have (on average 109.33333333333333) internal successors, (656), 6 states have internal predecessors, (656), 0 states have call successors, (0), 0 states 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:41:26,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:41:26,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 260
[2023-11-19 07:41:26,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:41:27,072 INFO L124 PetriNetUnfolderBase]: 989/1625 cut-off events.
[2023-11-19 07:41:27,072 INFO L125 PetriNetUnfolderBase]: For 11362/11362 co-relation queries the response was YES.
[2023-11-19 07:41:27,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8397 conditions, 1625 events. 989/1625 cut-off events. For 11362/11362 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 7905 event pairs, 140 based on Foata normal form. 46/1671 useless extension candidates. Maximal degree in co-relation 8373. Up to 1133 conditions per place.
[2023-11-19 07:41:27,087 INFO L140 encePairwiseOnDemand]: 253/260 looper letters, 98 selfloop transitions, 15 changer transitions 48/162 dead transitions.
[2023-11-19 07:41:27,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 162 transitions, 2146 flow
[2023-11-19 07:41:27,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-11-19 07:41:27,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-11-19 07:41:27,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions.
[2023-11-19 07:41:27,095 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4546153846153846
[2023-11-19 07:41:27,096 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 591 transitions.
[2023-11-19 07:41:27,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 591 transitions.
[2023-11-19 07:41:27,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:41:27,097 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 591 transitions.
[2023-11-19 07:41:27,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.2) internal successors, (591), 5 states have internal predecessors, (591), 0 states have call successors, (0), 0 states 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:41:27,103 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 260.0) internal successors, (1560), 6 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states 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:41:27,104 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 260.0) internal successors, (1560), 6 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states 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:41:27,104 INFO L175 Difference]: Start difference. First operand has 77 places, 108 transitions, 1292 flow. Second operand 5 states and 591 transitions.
[2023-11-19 07:41:27,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 162 transitions, 2146 flow
[2023-11-19 07:41:27,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 162 transitions, 2104 flow, removed 12 selfloop flow, removed 3 redundant places.
[2023-11-19 07:41:27,153 INFO L231 Difference]: Finished difference. Result has 80 places, 87 transitions, 1054 flow
[2023-11-19 07:41:27,154 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=1261, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1054, PETRI_PLACES=80, PETRI_TRANSITIONS=87}
[2023-11-19 07:41:27,155 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 40 predicate places.
[2023-11-19 07:41:27,155 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 87 transitions, 1054 flow
[2023-11-19 07:41:27,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.33333333333333) internal successors, (656), 6 states have internal predecessors, (656), 0 states have call successors, (0), 0 states 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:41:27,156 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:41:27,156 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:41:27,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2023-11-19 07:41:27,157 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-11-19 07:41:27,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:41:27,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1326145180, now seen corresponding path program 1 times
[2023-11-19 07:41:27,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:41:27,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382785033]
[2023-11-19 07:41:27,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:41:27,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:41:27,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:29,196 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:41:29,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:41:29,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382785033]
[2023-11-19 07:41:29,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382785033] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:41:29,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:41:29,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2023-11-19 07:41:29,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116547733]
[2023-11-19 07:41:29,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:41:29,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2023-11-19 07:41:29,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:41:29,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2023-11-19 07:41:29,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2023-11-19 07:41:29,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 260
[2023-11-19 07:41:29,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 87 transitions, 1054 flow. Second operand has 9 states, 9 states have (on average 104.66666666666667) internal successors, (942), 9 states have internal predecessors, (942), 0 states have call successors, (0), 0 states 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:41:29,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:41:29,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 260
[2023-11-19 07:41:29,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:41:30,219 INFO L124 PetriNetUnfolderBase]: 962/1554 cut-off events.
[2023-11-19 07:41:30,219 INFO L125 PetriNetUnfolderBase]: For 9321/9321 co-relation queries the response was YES.
[2023-11-19 07:41:30,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8009 conditions, 1554 events. 962/1554 cut-off events. For 9321/9321 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 7316 event pairs, 102 based on Foata normal form. 10/1564 useless extension candidates. Maximal degree in co-relation 7985. Up to 941 conditions per place.
[2023-11-19 07:41:30,240 INFO L140 encePairwiseOnDemand]: 251/260 looper letters, 85 selfloop transitions, 57 changer transitions 3/146 dead transitions.
[2023-11-19 07:41:30,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 146 transitions, 1762 flow
[2023-11-19 07:41:30,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2023-11-19 07:41:30,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2023-11-19 07:41:30,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1016 transitions.
[2023-11-19 07:41:30,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4341880341880342
[2023-11-19 07:41:30,248 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1016 transitions.
[2023-11-19 07:41:30,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1016 transitions.
[2023-11-19 07:41:30,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:41:30,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1016 transitions.
[2023-11-19 07:41:30,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 112.88888888888889) internal successors, (1016), 9 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states 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:41:30,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 260.0) internal successors, (2600), 10 states have internal predecessors, (2600), 0 states have call successors, (0), 0 states 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:41:30,264 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 260.0) internal successors, (2600), 10 states have internal predecessors, (2600), 0 states have call successors, (0), 0 states 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:41:30,264 INFO L175 Difference]: Start difference. First operand has 80 places, 87 transitions, 1054 flow. Second operand 9 states and 1016 transitions.
[2023-11-19 07:41:30,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 146 transitions, 1762 flow
[2023-11-19 07:41:30,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 146 transitions, 1630 flow, removed 30 selfloop flow, removed 11 redundant places.
[2023-11-19 07:41:30,302 INFO L231 Difference]: Finished difference. Result has 78 places, 105 transitions, 1383 flow
[2023-11-19 07:41:30,302 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=935, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1383, PETRI_PLACES=78, PETRI_TRANSITIONS=105}
[2023-11-19 07:41:30,303 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 38 predicate places.
[2023-11-19 07:41:30,303 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 105 transitions, 1383 flow
[2023-11-19 07:41:30,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 104.66666666666667) internal successors, (942), 9 states have internal predecessors, (942), 0 states have call successors, (0), 0 states 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:41:30,304 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:41:30,305 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:41:30,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2023-11-19 07:41:30,305 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-11-19 07:41:30,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:41:30,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1369166267, now seen corresponding path program 1 times
[2023-11-19 07:41:30,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:41:30,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737057603]
[2023-11-19 07:41:30,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:41:30,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:41:30,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:31,990 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:41:31,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:41:31,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737057603]
[2023-11-19 07:41:31,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737057603] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:41:31,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:41:31,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2023-11-19 07:41:31,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988460555]
[2023-11-19 07:41:31,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:41:31,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2023-11-19 07:41:31,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:41:31,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2023-11-19 07:41:31,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2023-11-19 07:41:32,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 260
[2023-11-19 07:41:32,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 105 transitions, 1383 flow. Second operand has 9 states, 9 states have (on average 103.66666666666667) internal successors, (933), 9 states have internal predecessors, (933), 0 states have call successors, (0), 0 states 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:41:32,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:41:32,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 260
[2023-11-19 07:41:32,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:41:32,927 INFO L124 PetriNetUnfolderBase]: 1057/1731 cut-off events.
[2023-11-19 07:41:32,927 INFO L125 PetriNetUnfolderBase]: For 10873/10873 co-relation queries the response was YES.
[2023-11-19 07:41:32,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9193 conditions, 1731 events. 1057/1731 cut-off events. For 10873/10873 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 8568 event pairs, 168 based on Foata normal form. 36/1767 useless extension candidates. Maximal degree in co-relation 9169. Up to 858 conditions per place.
[2023-11-19 07:41:32,940 INFO L140 encePairwiseOnDemand]: 252/260 looper letters, 63 selfloop transitions, 35 changer transitions 62/161 dead transitions.
[2023-11-19 07:41:32,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 161 transitions, 2250 flow
[2023-11-19 07:41:32,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2023-11-19 07:41:32,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-11-19 07:41:32,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 771 transitions.
[2023-11-19 07:41:32,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4236263736263736
[2023-11-19 07:41:32,945 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 771 transitions.
[2023-11-19 07:41:32,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 771 transitions.
[2023-11-19 07:41:32,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:41:32,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 771 transitions.
[2023-11-19 07:41:32,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 110.14285714285714) internal successors, (771), 7 states have internal predecessors, (771), 0 states have call successors, (0), 0 states 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:41:32,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 260.0) internal successors, (2080), 8 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states 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:41:32,956 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 260.0) internal successors, (2080), 8 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states 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:41:32,957 INFO L175 Difference]: Start difference. First operand has 78 places, 105 transitions, 1383 flow. Second operand 7 states and 771 transitions.
[2023-11-19 07:41:32,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 161 transitions, 2250 flow
[2023-11-19 07:41:32,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 161 transitions, 2171 flow, removed 38 selfloop flow, removed 1 redundant places.
[2023-11-19 07:41:33,001 INFO L231 Difference]: Finished difference. Result has 86 places, 78 transitions, 1080 flow
[2023-11-19 07:41:33,001 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=1328, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1080, PETRI_PLACES=86, PETRI_TRANSITIONS=78}
[2023-11-19 07:41:33,002 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 46 predicate places.
[2023-11-19 07:41:33,002 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 78 transitions, 1080 flow
[2023-11-19 07:41:33,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 103.66666666666667) internal successors, (933), 9 states have internal predecessors, (933), 0 states have call successors, (0), 0 states 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:41:33,003 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:41:33,003 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:41:33,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2023-11-19 07:41:33,004 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-11-19 07:41:33,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:41:33,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1369172994, now seen corresponding path program 1 times
[2023-11-19 07:41:33,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:41:33,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564450196]
[2023-11-19 07:41:33,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:41:33,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:41:33,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:33,280 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:41:33,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:41:33,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564450196]
[2023-11-19 07:41:33,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564450196] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:41:33,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:41:33,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-19 07:41:33,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398806457]
[2023-11-19 07:41:33,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:41:33,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-19 07:41:33,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:41:33,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-19 07:41:33,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-11-19 07:41:33,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 260
[2023-11-19 07:41:33,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 78 transitions, 1080 flow. Second operand has 4 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 0 states have call successors, (0), 0 states 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:41:33,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:41:33,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 260
[2023-11-19 07:41:33,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:41:33,554 INFO L124 PetriNetUnfolderBase]: 305/565 cut-off events.
[2023-11-19 07:41:33,554 INFO L125 PetriNetUnfolderBase]: For 6605/6608 co-relation queries the response was YES.
[2023-11-19 07:41:33,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3184 conditions, 565 events. 305/565 cut-off events. For 6605/6608 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2546 event pairs, 47 based on Foata normal form. 64/628 useless extension candidates. Maximal degree in co-relation 3156. Up to 370 conditions per place.
[2023-11-19 07:41:33,559 INFO L140 encePairwiseOnDemand]: 254/260 looper letters, 73 selfloop transitions, 4 changer transitions 48/127 dead transitions.
[2023-11-19 07:41:33,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 127 transitions, 1961 flow
[2023-11-19 07:41:33,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-11-19 07:41:33,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-11-19 07:41:33,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 570 transitions.
[2023-11-19 07:41:33,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43846153846153846
[2023-11-19 07:41:33,563 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 570 transitions.
[2023-11-19 07:41:33,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 570 transitions.
[2023-11-19 07:41:33,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:41:33,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 570 transitions.
[2023-11-19 07:41:33,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 0 states have call successors, (0), 0 states 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:41:33,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 260.0) internal successors, (1560), 6 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states 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:41:33,570 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 260.0) internal successors, (1560), 6 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states 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:41:33,570 INFO L175 Difference]: Start difference. First operand has 86 places, 78 transitions, 1080 flow. Second operand 5 states and 570 transitions.
[2023-11-19 07:41:33,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 127 transitions, 1961 flow
[2023-11-19 07:41:33,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 127 transitions, 1423 flow, removed 158 selfloop flow, removed 22 redundant places.
[2023-11-19 07:41:33,585 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 574 flow
[2023-11-19 07:41:33,586 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=574, PETRI_PLACES=67, PETRI_TRANSITIONS=61}
[2023-11-19 07:41:33,586 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 27 predicate places.
[2023-11-19 07:41:33,587 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 574 flow
[2023-11-19 07:41:33,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 0 states have call successors, (0), 0 states 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:41:33,587 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:41:33,587 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:41:33,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2023-11-19 07:41:33,588 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-11-19 07:41:33,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:41:33,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1822326779, now seen corresponding path program 1 times
[2023-11-19 07:41:33,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:41:33,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97144654]
[2023-11-19 07:41:33,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:41:33,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:41:33,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:33,815 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:41:33,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:41:33,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97144654]
[2023-11-19 07:41:33,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97144654] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:41:33,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:41:33,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-11-19 07:41:33,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320894923]
[2023-11-19 07:41:33,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:41:33,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-11-19 07:41:33,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:41:33,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-11-19 07:41:33,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2023-11-19 07:41:33,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 260
[2023-11-19 07:41:33,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 574 flow. Second operand has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:41:33,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:41:33,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 260
[2023-11-19 07:41:33,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:41:34,037 INFO L124 PetriNetUnfolderBase]: 146/306 cut-off events.
[2023-11-19 07:41:34,037 INFO L125 PetriNetUnfolderBase]: For 1587/1588 co-relation queries the response was YES.
[2023-11-19 07:41:34,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1620 conditions, 306 events. 146/306 cut-off events. For 1587/1588 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1220 event pairs, 13 based on Foata normal form. 39/344 useless extension candidates. Maximal degree in co-relation 1599. Up to 138 conditions per place.
[2023-11-19 07:41:34,040 INFO L140 encePairwiseOnDemand]: 254/260 looper letters, 66 selfloop transitions, 7 changer transitions 31/106 dead transitions.
[2023-11-19 07:41:34,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 106 transitions, 1212 flow
[2023-11-19 07:41:34,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2023-11-19 07:41:34,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-19 07:41:34,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 678 transitions.
[2023-11-19 07:41:34,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4346153846153846
[2023-11-19 07:41:34,044 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 678 transitions.
[2023-11-19 07:41:34,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 678 transitions.
[2023-11-19 07:41:34,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:41:34,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 678 transitions.
[2023-11-19 07:41:34,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 0 states have call successors, (0), 0 states 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:41:34,051 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 260.0) internal successors, (1820), 7 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states 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:41:34,052 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 260.0) internal successors, (1820), 7 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states 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:41:34,052 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 574 flow. Second operand 6 states and 678 transitions.
[2023-11-19 07:41:34,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 106 transitions, 1212 flow
[2023-11-19 07:41:34,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 106 transitions, 1095 flow, removed 29 selfloop flow, removed 5 redundant places.
[2023-11-19 07:41:34,061 INFO L231 Difference]: Finished difference. Result has 68 places, 51 transitions, 441 flow
[2023-11-19 07:41:34,061 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=441, PETRI_PLACES=68, PETRI_TRANSITIONS=51}
[2023-11-19 07:41:34,062 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 28 predicate places.
[2023-11-19 07:41:34,062 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 51 transitions, 441 flow
[2023-11-19 07:41:34,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 07:41:34,063 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:41:34,063 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:41:34,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2023-11-19 07:41:34,064 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-11-19 07:41:34,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:41:34,064 INFO L85 PathProgramCache]: Analyzing trace with hash -841464665, now seen corresponding path program 1 times
[2023-11-19 07:41:34,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:41:34,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421727493]
[2023-11-19 07:41:34,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:41:34,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:41:34,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 07:41:34,310 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:41:34,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 07:41:34,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421727493]
[2023-11-19 07:41:34,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421727493] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 07:41:34,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 07:41:34,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-19 07:41:34,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219928090]
[2023-11-19 07:41:34,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 07:41:34,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-19 07:41:34,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 07:41:34,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-19 07:41:34,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2023-11-19 07:41:34,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 260
[2023-11-19 07:41:34,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 51 transitions, 441 flow. Second operand has 6 states, 6 states have (on average 106.83333333333333) internal successors, (641), 6 states have internal predecessors, (641), 0 states have call successors, (0), 0 states 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:41:34,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 07:41:34,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 260
[2023-11-19 07:41:34,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 07:41:34,513 INFO L124 PetriNetUnfolderBase]: 85/187 cut-off events.
[2023-11-19 07:41:34,513 INFO L125 PetriNetUnfolderBase]: For 782/783 co-relation queries the response was YES.
[2023-11-19 07:41:34,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 982 conditions, 187 events. 85/187 cut-off events. For 782/783 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 617 event pairs, 10 based on Foata normal form. 12/198 useless extension candidates. Maximal degree in co-relation 961. Up to 78 conditions per place.
[2023-11-19 07:41:34,515 INFO L140 encePairwiseOnDemand]: 254/260 looper letters, 57 selfloop transitions, 10 changer transitions 12/81 dead transitions.
[2023-11-19 07:41:34,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 81 transitions, 867 flow
[2023-11-19 07:41:34,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2023-11-19 07:41:34,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-11-19 07:41:34,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 774 transitions.
[2023-11-19 07:41:34,519 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42527472527472526
[2023-11-19 07:41:34,520 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 774 transitions.
[2023-11-19 07:41:34,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 774 transitions.
[2023-11-19 07:41:34,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 07:41:34,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 774 transitions.
[2023-11-19 07:41:34,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 110.57142857142857) internal successors, (774), 7 states have internal predecessors, (774), 0 states have call successors, (0), 0 states 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:41:34,527 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 260.0) internal successors, (2080), 8 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states 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:41:34,527 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 260.0) internal successors, (2080), 8 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states 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:41:34,528 INFO L175 Difference]: Start difference. First operand has 68 places, 51 transitions, 441 flow. Second operand 7 states and 774 transitions.
[2023-11-19 07:41:34,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 81 transitions, 867 flow
[2023-11-19 07:41:34,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 81 transitions, 692 flow, removed 46 selfloop flow, removed 10 redundant places.
[2023-11-19 07:41:34,534 INFO L231 Difference]: Finished difference. Result has 65 places, 45 transitions, 321 flow
[2023-11-19 07:41:34,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=321, PETRI_PLACES=65, PETRI_TRANSITIONS=45}
[2023-11-19 07:41:34,535 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 25 predicate places.
[2023-11-19 07:41:34,535 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 45 transitions, 321 flow
[2023-11-19 07:41:34,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.83333333333333) internal successors, (641), 6 states have internal predecessors, (641), 0 states have call successors, (0), 0 states 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:41:34,536 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 07:41:34,536 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:41:34,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2023-11-19 07:41:34,536 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-11-19 07:41:34,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 07:41:34,537 INFO L85 PathProgramCache]: Analyzing trace with hash 865466659, now seen corresponding path program 1 times
[2023-11-19 07:41:34,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 07:41:34,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30168570]
[2023-11-19 07:41:34,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 07:41:34,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 07:41:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-19 07:41:34,601 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-19 07:41:34,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-19 07:41:34,685 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-19 07:41:34,686 INFO L360 BasicCegarLoop]: Counterexample is feasible
[2023-11-19 07:41:34,687 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining)
[2023-11-19 07:41:34,688 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining)
[2023-11-19 07:41:34,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining)
[2023-11-19 07:41:34,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining)
[2023-11-19 07:41:34,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining)
[2023-11-19 07:41:34,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining)
[2023-11-19 07:41:34,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining)
[2023-11-19 07:41:34,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining)
[2023-11-19 07:41:34,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining)
[2023-11-19 07:41:34,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining)
[2023-11-19 07:41:34,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining)
[2023-11-19 07:41:34,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining)
[2023-11-19 07:41:34,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining)
[2023-11-19 07:41:34,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2023-11-19 07:41:34,692 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 07:41:34,697 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2023-11-19 07:41:34,698 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2023-11-19 07:41:34,743 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated
[2023-11-19 07:41:34,746 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated
[2023-11-19 07:41:34,749 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated
[2023-11-19 07:41:34,765 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0
[2023-11-19 07:41:34,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:41:34 BasicIcfg
[2023-11-19 07:41:34,789 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-11-19 07:41:34,790 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2023-11-19 07:41:34,790 INFO L270 PluginConnector]: Initializing Witness Printer...
[2023-11-19 07:41:34,790 INFO L274 PluginConnector]: Witness Printer initialized
[2023-11-19 07:41:34,791 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:41:01" (3/4) ...
[2023-11-19 07:41:34,792 INFO L140 WitnessPrinter]: No result that supports witness generation found
[2023-11-19 07:41:34,793 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2023-11-19 07:41:34,794 INFO L158 Benchmark]: Toolchain (without parser) took 35114.18ms. Allocated memory was 140.5MB in the beginning and 532.7MB in the end (delta: 392.2MB). Free memory was 106.4MB in the beginning and 348.2MB in the end (delta: -241.9MB). Peak memory consumption was 152.1MB. Max. memory is 16.1GB.
[2023-11-19 07:41:34,794 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 140.5MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 16.1GB.
[2023-11-19 07:41:34,795 INFO L158 Benchmark]: CACSL2BoogieTranslator took 766.11ms. Allocated memory is still 140.5MB. Free memory was 106.4MB in the beginning and 80.4MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2023-11-19 07:41:34,795 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.27ms. Allocated memory is still 140.5MB. Free memory was 80.4MB in the beginning and 77.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2023-11-19 07:41:34,796 INFO L158 Benchmark]: Boogie Preprocessor took 57.44ms. Allocated memory is still 140.5MB. Free memory was 77.4MB in the beginning and 75.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-11-19 07:41:34,796 INFO L158 Benchmark]: RCFGBuilder took 1128.93ms. Allocated memory was 140.5MB in the beginning and 174.1MB in the end (delta: 33.6MB). Free memory was 75.3MB in the beginning and 96.2MB in the end (delta: -20.9MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB.
[2023-11-19 07:41:34,796 INFO L158 Benchmark]: TraceAbstraction took 33066.10ms. Allocated memory was 174.1MB in the beginning and 532.7MB in the end (delta: 358.6MB). Free memory was 95.4MB in the beginning and 349.3MB in the end (delta: -253.9MB). Peak memory consumption was 105.5MB. Max. memory is 16.1GB.
[2023-11-19 07:41:34,797 INFO L158 Benchmark]: Witness Printer took 4.02ms. Allocated memory is still 532.7MB. Free memory was 349.3MB in the beginning and 348.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB.
[2023-11-19 07:41:34,799 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.28ms. Allocated memory is still 140.5MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 766.11ms. Allocated memory is still 140.5MB. Free memory was 106.4MB in the beginning and 80.4MB in the end (delta: 25.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 83.27ms. Allocated memory is still 140.5MB. Free memory was 80.4MB in the beginning and 77.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 57.44ms. Allocated memory is still 140.5MB. Free memory was 77.4MB in the beginning and 75.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 1128.93ms. Allocated memory was 140.5MB in the beginning and 174.1MB in the end (delta: 33.6MB). Free memory was 75.3MB in the beginning and 96.2MB in the end (delta: -20.9MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB.
* TraceAbstraction took 33066.10ms. Allocated memory was 174.1MB in the beginning and 532.7MB in the end (delta: 358.6MB). Free memory was 95.4MB in the beginning and 349.3MB in the end (delta: -253.9MB). Peak memory consumption was 105.5MB. Max. memory is 16.1GB.
* Witness Printer took 4.02ms. Allocated memory is still 532.7MB. Free memory was 349.3MB in the beginning and 348.2MB in the end (delta: 1.0MB). 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~pre7 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: unknown boogie variable #t~nondet0
- GenericResult: Unfinished Backtranslation
The program execution was not completely translated back.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 7.1s, 130 PlacesBefore, 40 PlacesAfterwards, 124 TransitionsBefore, 31 TransitionsAfterwards, 2686 CoEnabledTransitionPairs, 7 FixpointIterations, 48 TrivialSequentialCompositions, 71 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 3 ChoiceCompositions, 133 TotalNumberOfCompositions, 6592 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3258, independent: 3094, independent conditional: 0, independent unconditional: 3094, dependent: 164, dependent conditional: 0, dependent unconditional: 164, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1449, independent: 1417, independent conditional: 0, independent unconditional: 1417, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3258, independent: 1677, independent conditional: 0, independent unconditional: 1677, dependent: 132, dependent conditional: 0, dependent unconditional: 132, unknown: 1449, unknown conditional: 0, unknown unconditional: 1449] , Statistics on independence cache: Total cache size (in pairs): 88, Positive cache size: 76, Positive conditional cache size: 0, Positive unconditional cache size: 76, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
- UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: overapproximation of memtrack at line 17.
Possible FailurePath:
[L709] 0 int __unbuffered_cnt = 0;
[L711] 0 int __unbuffered_p1_EAX = 0;
[L713] 0 int __unbuffered_p2_EAX = 0;
[L715] 0 int __unbuffered_p2_EBX = 0;
[L716] 0 _Bool main$tmp_guard0;
[L717] 0 _Bool main$tmp_guard1;
[L719] 0 int x = 0;
[L721] 0 int y = 0;
[L722] 0 _Bool y$flush_delayed;
[L723] 0 int y$mem_tmp;
[L724] 0 _Bool y$r_buff0_thd0;
[L725] 0 _Bool y$r_buff0_thd1;
[L726] 0 _Bool y$r_buff0_thd2;
[L727] 0 _Bool y$r_buff0_thd3;
[L728] 0 _Bool y$r_buff1_thd0;
[L729] 0 _Bool y$r_buff1_thd1;
[L730] 0 _Bool y$r_buff1_thd2;
[L731] 0 _Bool y$r_buff1_thd3;
[L732] 0 _Bool y$read_delayed;
[L733] 0 int *y$read_delayed_var;
[L734] 0 int y$w_buff0;
[L735] 0 _Bool y$w_buff0_used;
[L736] 0 int y$w_buff1;
[L737] 0 _Bool y$w_buff1_used;
[L738] 0 _Bool weak$$choice0;
[L739] 0 _Bool weak$$choice2;
[L846] 0 pthread_t t1849;
[L847] FCALL, FORK 0 pthread_create(&t1849, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1849={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L743] 1 y$w_buff1 = y$w_buff0
[L744] 1 y$w_buff0 = 2
[L745] 1 y$w_buff1_used = y$w_buff0_used
[L746] 1 y$w_buff0_used = (_Bool)1
[L747] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L18] COND FALSE 1 !(!expression)
[L747] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L748] 1 y$r_buff1_thd0 = y$r_buff0_thd0
[L749] 1 y$r_buff1_thd1 = y$r_buff0_thd1
[L750] 1 y$r_buff1_thd2 = y$r_buff0_thd2
[L751] 1 y$r_buff1_thd3 = y$r_buff0_thd3
[L752] 1 y$r_buff0_thd1 = (_Bool)1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L755] 1 x = 1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L848] 0 pthread_t t1850;
[L849] FCALL, FORK 0 pthread_create(&t1850, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1849={5:0}, t1850={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L850] 0 pthread_t t1851;
[L772] 2 __unbuffered_p1_EAX = x
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L775] 2 y = 1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L778] 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)
[L779] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L780] 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
[L781] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L782] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L851] FCALL, FORK 0 pthread_create(&t1851, ((void *)0), P2, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1849={5:0}, t1850={6:0}, t1851={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L792] 3 weak$$choice0 = __VERIFIER_nondet_bool()
[L793] 3 weak$$choice2 = __VERIFIER_nondet_bool()
[L794] 3 y$flush_delayed = weak$$choice2
[L795] 3 y$mem_tmp = y
[L796] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L797] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L798] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L799] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L800] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L801] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L802] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L803] 3 __unbuffered_p2_EAX = y
[L804] 3 y = y$flush_delayed ? y$mem_tmp : y
[L805] 3 y$flush_delayed = (_Bool)0
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L808] 3 weak$$choice0 = __VERIFIER_nondet_bool()
[L809] 3 weak$$choice2 = __VERIFIER_nondet_bool()
[L810] 3 y$flush_delayed = weak$$choice2
[L811] 3 y$mem_tmp = y
[L812] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L813] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L814] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L815] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L816] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L817] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L818] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L819] 3 __unbuffered_p2_EBX = y
[L820] 3 y = y$flush_delayed ? y$mem_tmp : y
[L821] 3 y$flush_delayed = (_Bool)0
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L758] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)
[L759] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used
[L760] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used
[L761] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1
[L762] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L824] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L825] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L826] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L827] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L828] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1
[L787] 2 return 0;
[L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1
[L767] 1 return 0;
[L831] 3 __unbuffered_cnt = __unbuffered_cnt + 1
[L833] 3 return 0;
[L853] 0 main$tmp_guard0 = __unbuffered_cnt == 3
[L855] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L3] COND FALSE 0 !(!cond)
[L855] RET 0 assume_abort_if_not(main$tmp_guard0)
[L857] 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)
[L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L859] 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
[L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L861] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1849={5:0}, t1850={6:0}, t1851={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
[L864] 0 weak$$choice0 = __VERIFIER_nondet_bool()
[L865] 0 weak$$choice2 = __VERIFIER_nondet_bool()
[L866] 0 y$flush_delayed = weak$$choice2
[L867] 0 y$mem_tmp = y
[L868] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L869] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L870] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L871] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L872] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L873] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L874] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L875] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1)
[L876] 0 y = y$flush_delayed ? y$mem_tmp : y
[L877] 0 y$flush_delayed = (_Bool)0
[L879] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L18] COND TRUE 0 !expression
[L18] CALL 0 reach_error()
[L17] COND FALSE 0 !(0)
[L17] 0 __assert_fail ("0", "safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__)
VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2]
- UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: 844]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: Not analyzed.
- UnprovableResult [Line: 847]: 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: 849]: 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: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
CFG has 7 procedures, 152 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 32.8s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 10.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 908 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 706 mSDsluCounter, 458 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 349 mSDsCounter, 343 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2176 IncrementalHoareTripleChecker+Invalid, 2519 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 343 mSolverCounterUnsat, 109 mSDtfsCounter, 2176 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1383occurred in iteration=15, InterpolantAutomatonStates: 102, 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.6s SatisfiabilityAnalysisTime, 13.5s InterpolantComputationTime, 262 NumberOfCodeBlocks, 262 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 222 ConstructedInterpolants, 0 QuantifiedInterpolants, 2795 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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:41:34,835 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e40b510-3772-4305-ad97-fdb984c17e16/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_2e40b510-3772-4305-ad97-fdb984c17e16/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e40b510-3772-4305-ad97-fdb984c17e16/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_2e40b510-3772-4305-ad97-fdb984c17e16/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e40b510-3772-4305-ad97-fdb984c17e16/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e40b510-3772-4305-ad97-fdb984c17e16/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_2e40b510-3772-4305-ad97-fdb984c17e16/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 5e0f2637c3745e36a3708f37a9783771b3e1c15cb350f0e936eafd42058bd9cf
--- Real Ultimate output ---
This is Ultimate 0.2.3-dev-9bd2c7f
[2023-11-19 07:41:37,405 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2023-11-19 07:41:37,537 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e40b510-3772-4305-ad97-fdb984c17e16/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf
[2023-11-19 07:41:37,546 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2023-11-19 07:41:37,547 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2023-11-19 07:41:37,598 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-19 07:41:37,599 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-19 07:41:37,600 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-19 07:41:37,601 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-19 07:41:37,606 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-19 07:41:37,607 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-19 07:41:37,607 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2023-11-19 07:41:37,608 INFO L153 SettingsManager]: * Use SBE=true
[2023-11-19 07:41:37,610 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-19 07:41:37,610 INFO L153 SettingsManager]: * sizeof long=4
[2023-11-19 07:41:37,611 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2023-11-19 07:41:37,611 INFO L153 SettingsManager]: * sizeof POINTER=4
[2023-11-19 07:41:37,611 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2023-11-19 07:41:37,612 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2023-11-19 07:41:37,612 INFO L153 SettingsManager]: * Bitprecise bitfields=true
[2023-11-19 07:41:37,613 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2023-11-19 07:41:37,613 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-19 07:41:37,614 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2023-11-19 07:41:37,614 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2023-11-19 07:41:37,614 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2023-11-19 07:41:37,615 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2023-11-19 07:41:37,615 INFO L153 SettingsManager]: * sizeof long double=12
[2023-11-19 07:41:37,616 INFO L153 SettingsManager]: * Use constant arrays=true
[2023-11-19 07:41:37,617 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-19 07:41:37,617 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2023-11-19 07:41:37,619 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2023-11-19 07:41:37,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-19 07:41:37,619 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-19 07:41:37,620 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2023-11-19 07:41:37,620 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF
[2023-11-19 07:41:37,620 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2023-11-19 07:41:37,621 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-19 07:41:37,621 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2023-11-19 07:41:37,621 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2023-11-19 07:41:37,622 INFO L153 SettingsManager]: * Logic for external solver=AUFBV
[2023-11-19 07:41:37,623 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-11-19 07:41:37,623 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_2e40b510-3772-4305-ad97-fdb984c17e16/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_2e40b510-3772-4305-ad97-fdb984c17e16/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 -> 5e0f2637c3745e36a3708f37a9783771b3e1c15cb350f0e936eafd42058bd9cf
[2023-11-19 07:41:38,025 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-19 07:41:38,060 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-19 07:41:38,063 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-19 07:41:38,064 INFO L270 PluginConnector]: Initializing CDTParser...
[2023-11-19 07:41:38,065 INFO L274 PluginConnector]: CDTParser initialized
[2023-11-19 07:41:38,066 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e40b510-3772-4305-ad97-fdb984c17e16/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i