./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.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_2e8badf9-088a-40ab-80e0-7e787e16b1c0/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8badf9-088a-40ab-80e0-7e787e16b1c0/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_2e8badf9-088a-40ab-80e0-7e787e16b1c0/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8badf9-088a-40ab-80e0-7e787e16b1c0/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8badf9-088a-40ab-80e0-7e787e16b1c0/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_2e8badf9-088a-40ab-80e0-7e787e16b1c0/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 c0fbd235801aa6198331442d567d46062ed57d086b0069ca7d1e131a6b5917b8
--- Real Ultimate output ---
This is Ultimate 0.2.3-dev-9bd2c7f
[2023-11-19 08:06:23,586 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2023-11-19 08:06:23,661 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8badf9-088a-40ab-80e0-7e787e16b1c0/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf
[2023-11-19 08:06:23,667 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2023-11-19 08:06:23,667 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2023-11-19 08:06:23,696 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-19 08:06:23,697 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-19 08:06:23,698 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-19 08:06:23,699 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-19 08:06:23,699 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-19 08:06:23,700 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-19 08:06:23,701 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2023-11-19 08:06:23,702 INFO L153 SettingsManager]: * Use SBE=true
[2023-11-19 08:06:23,702 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-19 08:06:23,703 INFO L153 SettingsManager]: * sizeof long=4
[2023-11-19 08:06:23,703 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2023-11-19 08:06:23,704 INFO L153 SettingsManager]: * sizeof POINTER=4
[2023-11-19 08:06:23,704 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2023-11-19 08:06:23,705 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2023-11-19 08:06:23,705 INFO L153 SettingsManager]: * Bitprecise bitfields=true
[2023-11-19 08:06:23,706 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2023-11-19 08:06:23,708 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-19 08:06:23,708 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2023-11-19 08:06:23,709 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2023-11-19 08:06:23,709 INFO L153 SettingsManager]: * sizeof long double=12
[2023-11-19 08:06:23,710 INFO L153 SettingsManager]: * Use constant arrays=true
[2023-11-19 08:06:23,711 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-19 08:06:23,712 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2023-11-19 08:06:23,712 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2023-11-19 08:06:23,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-19 08:06:23,714 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-19 08:06:23,714 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2023-11-19 08:06:23,715 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2023-11-19 08:06:23,715 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-11-19 08:06:23,715 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-19 08:06:23,715 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2023-11-19 08:06:23,716 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2023-11-19 08:06:23,716 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-11-19 08:06:23,716 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_2e8badf9-088a-40ab-80e0-7e787e16b1c0/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_2e8badf9-088a-40ab-80e0-7e787e16b1c0/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 -> c0fbd235801aa6198331442d567d46062ed57d086b0069ca7d1e131a6b5917b8
[2023-11-19 08:06:23,987 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-19 08:06:24,043 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-19 08:06:24,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-19 08:06:24,049 INFO L270 PluginConnector]: Initializing CDTParser...
[2023-11-19 08:06:24,050 INFO L274 PluginConnector]: CDTParser initialized
[2023-11-19 08:06:24,052 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8badf9-088a-40ab-80e0-7e787e16b1c0/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i
[2023-11-19 08:06:27,532 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2023-11-19 08:06:27,890 INFO L384 CDTParser]: Found 1 translation units.
[2023-11-19 08:06:27,891 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8badf9-088a-40ab-80e0-7e787e16b1c0/sv-benchmarks/c/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i
[2023-11-19 08:06:27,912 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8badf9-088a-40ab-80e0-7e787e16b1c0/bin/uautomizer-verify-uCwYo4JHxu/data/5e88527f1/e46bbd88b05544489afaf7d3ee9b1c59/FLAG84dde39ec
[2023-11-19 08:06:27,927 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8badf9-088a-40ab-80e0-7e787e16b1c0/bin/uautomizer-verify-uCwYo4JHxu/data/5e88527f1/e46bbd88b05544489afaf7d3ee9b1c59
[2023-11-19 08:06:27,930 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-19 08:06:27,932 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-19 08:06:27,935 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-19 08:06:27,935 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-19 08:06:27,942 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-19 08:06:27,943 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:06:27" (1/1) ...
[2023-11-19 08:06:27,945 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f6c804a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:27, skipping insertion in model container
[2023-11-19 08:06:27,945 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:06:27" (1/1) ...
[2023-11-19 08:06:28,044 INFO L177 MainTranslator]: Built tables and reachable declarations
[2023-11-19 08:06:28,707 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-19 08:06:28,725 INFO L202 MainTranslator]: Completed pre-run
[2023-11-19 08:06:28,840 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-19 08:06:28,908 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler.
[2023-11-19 08:06:28,908 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler.
[2023-11-19 08:06:28,919 INFO L206 MainTranslator]: Completed translation
[2023-11-19 08:06:28,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:28 WrapperNode
[2023-11-19 08:06:28,920 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-19 08:06:28,922 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-19 08:06:28,922 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-19 08:06:28,922 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-19 08:06:28,932 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:28" (1/1) ...
[2023-11-19 08:06:28,979 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:28" (1/1) ...
[2023-11-19 08:06:29,038 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 154
[2023-11-19 08:06:29,041 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-19 08:06:29,043 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-19 08:06:29,044 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-19 08:06:29,044 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2023-11-19 08:06:29,055 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:28" (1/1) ...
[2023-11-19 08:06:29,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:28" (1/1) ...
[2023-11-19 08:06:29,074 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:28" (1/1) ...
[2023-11-19 08:06:29,079 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:28" (1/1) ...
[2023-11-19 08:06:29,090 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:28" (1/1) ...
[2023-11-19 08:06:29,108 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:28" (1/1) ...
[2023-11-19 08:06:29,111 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:28" (1/1) ...
[2023-11-19 08:06:29,124 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:28" (1/1) ...
[2023-11-19 08:06:29,128 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-19 08:06:29,129 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-19 08:06:29,130 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2023-11-19 08:06:29,130 INFO L274 PluginConnector]: RCFGBuilder initialized
[2023-11-19 08:06:29,131 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:28" (1/1) ...
[2023-11-19 08:06:29,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-19 08:06:29,154 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8badf9-088a-40ab-80e0-7e787e16b1c0/bin/uautomizer-verify-uCwYo4JHxu/z3
[2023-11-19 08:06:29,176 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8badf9-088a-40ab-80e0-7e787e16b1c0/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-11-19 08:06:29,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8badf9-088a-40ab-80e0-7e787e16b1c0/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-11-19 08:06:29,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2023-11-19 08:06:29,227 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2023-11-19 08:06:29,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-11-19 08:06:29,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-11-19 08:06:29,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-11-19 08:06:29,228 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2023-11-19 08:06:29,228 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2023-11-19 08:06:29,229 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2023-11-19 08:06:29,229 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2023-11-19 08:06:29,229 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2023-11-19 08:06:29,229 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2023-11-19 08:06:29,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2023-11-19 08:06:29,230 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2023-11-19 08:06:29,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-19 08:06:29,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-19 08:06:29,234 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 08:06:29,438 INFO L236 CfgBuilder]: Building ICFG
[2023-11-19 08:06:29,440 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-19 08:06:29,861 INFO L277 CfgBuilder]: Performing block encoding
[2023-11-19 08:06:30,095 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-19 08:06:30,095 INFO L302 CfgBuilder]: Removed 0 assume(true) statements.
[2023-11-19 08:06:30,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:06:30 BoogieIcfgContainer
[2023-11-19 08:06:30,100 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-19 08:06:30,102 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-19 08:06:30,103 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2023-11-19 08:06:30,107 INFO L274 PluginConnector]: TraceAbstraction initialized
[2023-11-19 08:06:30,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:06:27" (1/3) ...
[2023-11-19 08:06:30,108 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df425fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:06:30, skipping insertion in model container
[2023-11-19 08:06:30,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:28" (2/3) ...
[2023-11-19 08:06:30,109 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df425fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:06:30, skipping insertion in model container
[2023-11-19 08:06:30,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:06:30" (3/3) ...
[2023-11-19 08:06:30,111 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i
[2023-11-19 08:06:30,133 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-19 08:06:30,162 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations.
[2023-11-19 08:06:30,163 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-11-19 08:06:30,306 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-11-19 08:06:30,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 129 transitions, 270 flow
[2023-11-19 08:06:30,419 INFO L124 PetriNetUnfolderBase]: 5/126 cut-off events.
[2023-11-19 08:06:30,420 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-19 08:06:30,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 126 events. 5/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 101 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 87. Up to 3 conditions per place.
[2023-11-19 08:06:30,431 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 129 transitions, 270 flow
[2023-11-19 08:06:30,442 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 126 transitions, 261 flow
[2023-11-19 08:06:30,447 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-19 08:06:30,463 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 126 transitions, 261 flow
[2023-11-19 08:06:30,466 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 126 transitions, 261 flow
[2023-11-19 08:06:30,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 126 transitions, 261 flow
[2023-11-19 08:06:30,507 INFO L124 PetriNetUnfolderBase]: 5/126 cut-off events.
[2023-11-19 08:06:30,508 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-19 08:06:30,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 126 events. 5/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 100 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 87. Up to 3 conditions per place.
[2023-11-19 08:06:30,513 INFO L119 LiptonReduction]: Number of co-enabled transitions 2788
[2023-11-19 08:06:36,386 INFO L134 LiptonReduction]: Checked pairs total: 5737
[2023-11-19 08:06:36,387 INFO L136 LiptonReduction]: Total number of compositions: 131
[2023-11-19 08:06:36,406 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-19 08:06:36,415 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;@13fd4f67, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-19 08:06:36,415 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations.
[2023-11-19 08:06:36,417 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2023-11-19 08:06:36,417 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events.
[2023-11-19 08:06:36,417 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-19 08:06:36,418 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 08:06:36,418 INFO L208 CegarLoopForPetriNet]: trace histogram [1]
[2023-11-19 08:06:36,419 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-11-19 08:06:36,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 08:06:36,426 INFO L85 PathProgramCache]: Analyzing trace with hash 604, now seen corresponding path program 1 times
[2023-11-19 08:06:36,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 08:06:36,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717118610]
[2023-11-19 08:06:36,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 08:06:36,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 08:06:36,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 08:06:36,580 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 08:06:36,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 08:06:36,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717118610]
[2023-11-19 08:06:36,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717118610] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 08:06:36,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 08:06:36,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-11-19 08:06:36,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914123134]
[2023-11-19 08:06:36,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 08:06:36,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-19 08:06:36,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 08:06:36,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-19 08:06:36,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-19 08:06:36,647 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 260
[2023-11-19 08:06:36,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 73 flow. Second operand has 2 states, 2 states have (on average 113.5) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 08:06:36,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 08:06:36,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 260
[2023-11-19 08:06:36,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 08:06:37,304 INFO L124 PetriNetUnfolderBase]: 1779/2612 cut-off events.
[2023-11-19 08:06:37,305 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES.
[2023-11-19 08:06:37,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5279 conditions, 2612 events. 1779/2612 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 11664 event pairs, 1779 based on Foata normal form. 96/2280 useless extension candidates. Maximal degree in co-relation 5268. Up to 2605 conditions per place.
[2023-11-19 08:06:37,336 INFO L140 encePairwiseOnDemand]: 253/260 looper letters, 24 selfloop transitions, 0 changer transitions 0/25 dead transitions.
[2023-11-19 08:06:37,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 107 flow
[2023-11-19 08:06:37,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2023-11-19 08:06:37,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-11-19 08:06:37,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 257 transitions.
[2023-11-19 08:06:37,369 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49423076923076925
[2023-11-19 08:06:37,370 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 257 transitions.
[2023-11-19 08:06:37,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 257 transitions.
[2023-11-19 08:06:37,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 08:06:37,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 257 transitions.
[2023-11-19 08:06:37,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states 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 08:06:37,392 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 08:06:37,393 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 08:06:37,396 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 73 flow. Second operand 2 states and 257 transitions.
[2023-11-19 08:06:37,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 107 flow
[2023-11-19 08:06:37,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 104 flow, removed 0 selfloop flow, removed 3 redundant places.
[2023-11-19 08:06:37,406 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 56 flow
[2023-11-19 08:06:37,409 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=25}
[2023-11-19 08:06:37,415 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -8 predicate places.
[2023-11-19 08:06:37,415 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 56 flow
[2023-11-19 08:06:37,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 113.5) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 08:06:37,416 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 08:06:37,417 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1]
[2023-11-19 08:06:37,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-11-19 08:06:37,417 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-11-19 08:06:37,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 08:06:37,418 INFO L85 PathProgramCache]: Analyzing trace with hash 572465518, now seen corresponding path program 1 times
[2023-11-19 08:06:37,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 08:06:37,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772166503]
[2023-11-19 08:06:37,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 08:06:37,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 08:06:37,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 08:06:37,924 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 08:06:37,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 08:06:37,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772166503]
[2023-11-19 08:06:37,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772166503] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 08:06:37,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 08:06:37,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-19 08:06:37,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690406245]
[2023-11-19 08:06:37,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 08:06:37,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 08:06:37,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 08:06:37,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 08:06:37,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 08:06:37,938 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 260
[2023-11-19 08:06:37,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states 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 08:06:37,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 08:06:37,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 260
[2023-11-19 08:06:37,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 08:06:38,541 INFO L124 PetriNetUnfolderBase]: 1461/2286 cut-off events.
[2023-11-19 08:06:38,541 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-19 08:06:38,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4489 conditions, 2286 events. 1461/2286 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 11608 event pairs, 189 based on Foata normal form. 0/2046 useless extension candidates. Maximal degree in co-relation 4486. Up to 1817 conditions per place.
[2023-11-19 08:06:38,562 INFO L140 encePairwiseOnDemand]: 257/260 looper letters, 32 selfloop transitions, 2 changer transitions 4/39 dead transitions.
[2023-11-19 08:06:38,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 39 transitions, 162 flow
[2023-11-19 08:06:38,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-19 08:06:38,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-19 08:06:38,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions.
[2023-11-19 08:06:38,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4807692307692308
[2023-11-19 08:06:38,569 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 375 transitions.
[2023-11-19 08:06:38,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 375 transitions.
[2023-11-19 08:06:38,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 08:06:38,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 375 transitions.
[2023-11-19 08:06:38,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states 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 08:06:38,578 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 08:06:38,580 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 08:06:38,581 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 56 flow. Second operand 3 states and 375 transitions.
[2023-11-19 08:06:38,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 39 transitions, 162 flow
[2023-11-19 08:06:38,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 39 transitions, 162 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-19 08:06:38,588 INFO L231 Difference]: Finished difference. Result has 34 places, 22 transitions, 54 flow
[2023-11-19 08:06:38,588 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=34, PETRI_TRANSITIONS=22}
[2023-11-19 08:06:38,589 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places.
[2023-11-19 08:06:38,589 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 22 transitions, 54 flow
[2023-11-19 08:06:38,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states 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 08:06:38,591 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 08:06:38,592 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 08:06:38,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-11-19 08:06:38,599 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-11-19 08:06:38,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 08:06:38,600 INFO L85 PathProgramCache]: Analyzing trace with hash -170334551, now seen corresponding path program 1 times
[2023-11-19 08:06:38,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 08:06:38,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976974101]
[2023-11-19 08:06:38,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 08:06:38,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 08:06:38,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 08:06:39,142 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 08:06:39,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 08:06:39,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976974101]
[2023-11-19 08:06:39,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976974101] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 08:06:39,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 08:06:39,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-19 08:06:39,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567431732]
[2023-11-19 08:06:39,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 08:06:39,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-19 08:06:39,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 08:06:39,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-19 08:06:39,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-11-19 08:06:39,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 260
[2023-11-19 08:06:39,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 22 transitions, 54 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 08:06:39,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 08:06:39,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 260
[2023-11-19 08:06:39,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 08:06:39,753 INFO L124 PetriNetUnfolderBase]: 1511/2224 cut-off events.
[2023-11-19 08:06:39,754 INFO L125 PetriNetUnfolderBase]: For 111/111 co-relation queries the response was YES.
[2023-11-19 08:06:39,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4623 conditions, 2224 events. 1511/2224 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 9834 event pairs, 427 based on Foata normal form. 0/2136 useless extension candidates. Maximal degree in co-relation 4619. Up to 1919 conditions per place.
[2023-11-19 08:06:39,776 INFO L140 encePairwiseOnDemand]: 254/260 looper letters, 46 selfloop transitions, 8 changer transitions 0/54 dead transitions.
[2023-11-19 08:06:39,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 54 transitions, 236 flow
[2023-11-19 08:06:39,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-11-19 08:06:39,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-11-19 08:06:39,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 581 transitions.
[2023-11-19 08:06:39,780 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4469230769230769
[2023-11-19 08:06:39,780 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 581 transitions.
[2023-11-19 08:06:39,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 581 transitions.
[2023-11-19 08:06:39,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 08:06:39,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 581 transitions.
[2023-11-19 08:06:39,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.2) internal successors, (581), 5 states have internal predecessors, (581), 0 states have call successors, (0), 0 states 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 08:06:39,788 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 08:06:39,789 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 08:06:39,790 INFO L175 Difference]: Start difference. First operand has 34 places, 22 transitions, 54 flow. Second operand 5 states and 581 transitions.
[2023-11-19 08:06:39,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 54 transitions, 236 flow
[2023-11-19 08:06:39,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 54 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-19 08:06:39,794 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 108 flow
[2023-11-19 08:06:39,794 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=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=108, PETRI_PLACES=37, PETRI_TRANSITIONS=29}
[2023-11-19 08:06:39,796 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -4 predicate places.
[2023-11-19 08:06:39,796 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 108 flow
[2023-11-19 08:06:39,797 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 08:06:39,797 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 08:06:39,797 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 08:06:39,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-11-19 08:06:39,803 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-11-19 08:06:39,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 08:06:39,805 INFO L85 PathProgramCache]: Analyzing trace with hash -170334516, now seen corresponding path program 1 times
[2023-11-19 08:06:39,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 08:06:39,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306461572]
[2023-11-19 08:06:39,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 08:06:39,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 08:06:39,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 08:06:40,385 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 08:06:40,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 08:06:40,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306461572]
[2023-11-19 08:06:40,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306461572] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 08:06:40,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 08:06:40,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-11-19 08:06:40,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972459801]
[2023-11-19 08:06:40,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 08:06:40,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-19 08:06:40,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 08:06:40,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-19 08:06:40,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2023-11-19 08:06:40,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 260
[2023-11-19 08:06:40,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 108 flow. Second operand has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 0 states 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 08:06:40,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 08:06:40,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 260
[2023-11-19 08:06:40,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 08:06:41,240 INFO L124 PetriNetUnfolderBase]: 1737/2636 cut-off events.
[2023-11-19 08:06:41,240 INFO L125 PetriNetUnfolderBase]: For 910/910 co-relation queries the response was YES.
[2023-11-19 08:06:41,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6395 conditions, 2636 events. 1737/2636 cut-off events. For 910/910 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 13052 event pairs, 849 based on Foata normal form. 152/2785 useless extension candidates. Maximal degree in co-relation 6388. Up to 1190 conditions per place.
[2023-11-19 08:06:41,265 INFO L140 encePairwiseOnDemand]: 255/260 looper letters, 50 selfloop transitions, 8 changer transitions 3/62 dead transitions.
[2023-11-19 08:06:41,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 62 transitions, 324 flow
[2023-11-19 08:06:41,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2023-11-19 08:06:41,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-19 08:06:41,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 640 transitions.
[2023-11-19 08:06:41,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41025641025641024
[2023-11-19 08:06:41,269 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 640 transitions.
[2023-11-19 08:06:41,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 640 transitions.
[2023-11-19 08:06:41,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 08:06:41,270 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 640 transitions.
[2023-11-19 08:06:41,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 106.66666666666667) internal successors, (640), 6 states have internal predecessors, (640), 0 states have call successors, (0), 0 states 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 08:06:41,276 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 08:06:41,277 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 08:06:41,277 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 108 flow. Second operand 6 states and 640 transitions.
[2023-11-19 08:06:41,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 62 transitions, 324 flow
[2023-11-19 08:06:41,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 62 transitions, 324 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-19 08:06:41,287 INFO L231 Difference]: Finished difference. Result has 46 places, 29 transitions, 135 flow
[2023-11-19 08:06:41,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=135, PETRI_PLACES=46, PETRI_TRANSITIONS=29}
[2023-11-19 08:06:41,288 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 5 predicate places.
[2023-11-19 08:06:41,288 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 29 transitions, 135 flow
[2023-11-19 08:06:41,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 0 states 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 08:06:41,289 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 08:06:41,289 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 08:06:41,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-11-19 08:06:41,289 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-11-19 08:06:41,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 08:06:41,290 INFO L85 PathProgramCache]: Analyzing trace with hash 783731200, now seen corresponding path program 1 times
[2023-11-19 08:06:41,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 08:06:41,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430380908]
[2023-11-19 08:06:41,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 08:06:41,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 08:06:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 08:06:41,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 08:06:41,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 08:06:41,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430380908]
[2023-11-19 08:06:41,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430380908] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 08:06:41,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 08:06:41,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-11-19 08:06:41,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712142571]
[2023-11-19 08:06:41,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 08:06:41,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-19 08:06:41,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 08:06:41,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-19 08:06:41,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2023-11-19 08:06:41,968 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 260
[2023-11-19 08:06:41,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 29 transitions, 135 flow. Second operand has 6 states, 6 states have (on average 99.83333333333333) internal successors, (599), 6 states have internal predecessors, (599), 0 states have call successors, (0), 0 states 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 08:06:41,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 08:06:41,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 260
[2023-11-19 08:06:41,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 08:06:42,792 INFO L124 PetriNetUnfolderBase]: 2407/3775 cut-off events.
[2023-11-19 08:06:42,793 INFO L125 PetriNetUnfolderBase]: For 2416/2416 co-relation queries the response was YES.
[2023-11-19 08:06:42,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9251 conditions, 3775 events. 2407/3775 cut-off events. For 2416/2416 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 20893 event pairs, 1053 based on Foata normal form. 60/3835 useless extension candidates. Maximal degree in co-relation 9239. Up to 1426 conditions per place.
[2023-11-19 08:06:42,840 INFO L140 encePairwiseOnDemand]: 255/260 looper letters, 51 selfloop transitions, 9 changer transitions 0/61 dead transitions.
[2023-11-19 08:06:42,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 61 transitions, 356 flow
[2023-11-19 08:06:42,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2023-11-19 08:06:42,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-19 08:06:42,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 644 transitions.
[2023-11-19 08:06:42,852 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4128205128205128
[2023-11-19 08:06:42,853 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 644 transitions.
[2023-11-19 08:06:42,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 644 transitions.
[2023-11-19 08:06:42,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 08:06:42,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 644 transitions.
[2023-11-19 08:06:42,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 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 08:06:42,863 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 08:06:42,864 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 08:06:42,865 INFO L175 Difference]: Start difference. First operand has 46 places, 29 transitions, 135 flow. Second operand 6 states and 644 transitions.
[2023-11-19 08:06:42,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 61 transitions, 356 flow
[2023-11-19 08:06:42,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 61 transitions, 336 flow, removed 5 selfloop flow, removed 3 redundant places.
[2023-11-19 08:06:42,886 INFO L231 Difference]: Finished difference. Result has 49 places, 33 transitions, 178 flow
[2023-11-19 08:06:42,887 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=178, PETRI_PLACES=49, PETRI_TRANSITIONS=33}
[2023-11-19 08:06:42,888 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 8 predicate places.
[2023-11-19 08:06:42,888 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 33 transitions, 178 flow
[2023-11-19 08:06:42,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.83333333333333) internal successors, (599), 6 states have internal predecessors, (599), 0 states have call successors, (0), 0 states 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 08:06:42,889 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 08:06:42,889 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 08:06:42,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-11-19 08:06:42,889 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-11-19 08:06:42,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 08:06:42,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1380069811, now seen corresponding path program 1 times
[2023-11-19 08:06:42,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 08:06:42,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670819715]
[2023-11-19 08:06:42,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 08:06:42,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 08:06:42,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 08:06:43,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-19 08:06:43,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 08:06:43,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670819715]
[2023-11-19 08:06:43,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670819715] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 08:06:43,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 08:06:43,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-19 08:06:43,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770367543]
[2023-11-19 08:06:43,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 08:06:43,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-11-19 08:06:43,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 08:06:43,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-11-19 08:06:43,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2023-11-19 08:06:43,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 260
[2023-11-19 08:06:43,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 33 transitions, 178 flow. Second operand has 5 states, 5 states have (on average 109.2) internal successors, (546), 5 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 08:06:43,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 08:06:43,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 260
[2023-11-19 08:06:43,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 08:06:44,007 INFO L124 PetriNetUnfolderBase]: 2665/4112 cut-off events.
[2023-11-19 08:06:44,008 INFO L125 PetriNetUnfolderBase]: For 2987/2987 co-relation queries the response was YES.
[2023-11-19 08:06:44,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10046 conditions, 4112 events. 2665/4112 cut-off events. For 2987/2987 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 23161 event pairs, 400 based on Foata normal form. 270/4381 useless extension candidates. Maximal degree in co-relation 10033. Up to 1596 conditions per place.
[2023-11-19 08:06:44,045 INFO L140 encePairwiseOnDemand]: 254/260 looper letters, 53 selfloop transitions, 9 changer transitions 17/80 dead transitions.
[2023-11-19 08:06:44,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 80 transitions, 510 flow
[2023-11-19 08:06:44,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2023-11-19 08:06:44,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-11-19 08:06:44,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 818 transitions.
[2023-11-19 08:06:44,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44945054945054946
[2023-11-19 08:06:44,050 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 818 transitions.
[2023-11-19 08:06:44,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 818 transitions.
[2023-11-19 08:06:44,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 08:06:44,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 818 transitions.
[2023-11-19 08:06:44,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.85714285714286) internal successors, (818), 7 states have internal predecessors, (818), 0 states have call successors, (0), 0 states 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 08:06:44,060 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 08:06:44,061 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 08:06:44,061 INFO L175 Difference]: Start difference. First operand has 49 places, 33 transitions, 178 flow. Second operand 7 states and 818 transitions.
[2023-11-19 08:06:44,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 80 transitions, 510 flow
[2023-11-19 08:06:44,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 80 transitions, 494 flow, removed 5 selfloop flow, removed 2 redundant places.
[2023-11-19 08:06:44,069 INFO L231 Difference]: Finished difference. Result has 56 places, 36 transitions, 212 flow
[2023-11-19 08:06:44,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=212, PETRI_PLACES=56, PETRI_TRANSITIONS=36}
[2023-11-19 08:06:44,070 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 15 predicate places.
[2023-11-19 08:06:44,070 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 36 transitions, 212 flow
[2023-11-19 08:06:44,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.2) internal successors, (546), 5 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 08:06:44,071 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 08:06:44,071 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 08:06:44,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-11-19 08:06:44,072 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-11-19 08:06:44,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 08:06:44,072 INFO L85 PathProgramCache]: Analyzing trace with hash -483234438, now seen corresponding path program 1 times
[2023-11-19 08:06:44,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 08:06:44,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167531489]
[2023-11-19 08:06:44,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 08:06:44,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 08:06:44,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 08:06:44,304 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 08:06:44,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 08:06:44,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167531489]
[2023-11-19 08:06:44,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167531489] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 08:06:44,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 08:06:44,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-19 08:06:44,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034678396]
[2023-11-19 08:06:44,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 08:06:44,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-11-19 08:06:44,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 08:06:44,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-11-19 08:06:44,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2023-11-19 08:06:44,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 260
[2023-11-19 08:06:44,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 36 transitions, 212 flow. Second operand has 5 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 0 states have call successors, (0), 0 states 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 08:06:44,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 08:06:44,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 260
[2023-11-19 08:06:44,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 08:06:44,931 INFO L124 PetriNetUnfolderBase]: 1687/2602 cut-off events.
[2023-11-19 08:06:44,931 INFO L125 PetriNetUnfolderBase]: For 3036/3036 co-relation queries the response was YES.
[2023-11-19 08:06:44,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6931 conditions, 2602 events. 1687/2602 cut-off events. For 3036/3036 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 12475 event pairs, 966 based on Foata normal form. 54/2656 useless extension candidates. Maximal degree in co-relation 6915. Up to 2238 conditions per place.
[2023-11-19 08:06:44,962 INFO L140 encePairwiseOnDemand]: 256/260 looper letters, 39 selfloop transitions, 5 changer transitions 14/58 dead transitions.
[2023-11-19 08:06:44,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 58 transitions, 388 flow
[2023-11-19 08:06:44,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-11-19 08:06:44,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-11-19 08:06:44,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 573 transitions.
[2023-11-19 08:06:44,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44076923076923075
[2023-11-19 08:06:44,966 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 573 transitions.
[2023-11-19 08:06:44,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 573 transitions.
[2023-11-19 08:06:44,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 08:06:44,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 573 transitions.
[2023-11-19 08:06:44,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 114.6) internal successors, (573), 5 states have internal predecessors, (573), 0 states have call successors, (0), 0 states 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 08:06:44,974 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 08:06:44,975 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 08:06:44,975 INFO L175 Difference]: Start difference. First operand has 56 places, 36 transitions, 212 flow. Second operand 5 states and 573 transitions.
[2023-11-19 08:06:44,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 58 transitions, 388 flow
[2023-11-19 08:06:44,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 58 transitions, 368 flow, removed 7 selfloop flow, removed 3 redundant places.
[2023-11-19 08:06:44,997 INFO L231 Difference]: Finished difference. Result has 59 places, 36 transitions, 216 flow
[2023-11-19 08:06:44,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=216, PETRI_PLACES=59, PETRI_TRANSITIONS=36}
[2023-11-19 08:06:44,998 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 18 predicate places.
[2023-11-19 08:06:44,998 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 36 transitions, 216 flow
[2023-11-19 08:06:44,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 0 states have call successors, (0), 0 states 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 08:06:44,999 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 08:06:44,999 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 08:06:44,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-11-19 08:06:44,999 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-11-19 08:06:45,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 08:06:45,000 INFO L85 PathProgramCache]: Analyzing trace with hash 649665767, now seen corresponding path program 1 times
[2023-11-19 08:06:45,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 08:06:45,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704043874]
[2023-11-19 08:06:45,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 08:06:45,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 08:06:45,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 08:06:45,755 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 08:06:45,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 08:06:45,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704043874]
[2023-11-19 08:06:45,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704043874] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 08:06:45,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 08:06:45,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-19 08:06:45,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478821272]
[2023-11-19 08:06:45,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 08:06:45,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-11-19 08:06:45,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 08:06:45,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-11-19 08:06:45,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2023-11-19 08:06:46,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 260
[2023-11-19 08:06:46,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 36 transitions, 216 flow. Second operand has 7 states, 7 states have (on average 95.85714285714286) internal successors, (671), 7 states have internal predecessors, (671), 0 states have call successors, (0), 0 states 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 08:06:46,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 08:06:46,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 260
[2023-11-19 08:06:46,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 08:06:46,534 INFO L124 PetriNetUnfolderBase]: 1127/1769 cut-off events.
[2023-11-19 08:06:46,535 INFO L125 PetriNetUnfolderBase]: For 2061/2061 co-relation queries the response was YES.
[2023-11-19 08:06:46,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4760 conditions, 1769 events. 1127/1769 cut-off events. For 2061/2061 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 8528 event pairs, 916 based on Foata normal form. 36/1805 useless extension candidates. Maximal degree in co-relation 4743. Up to 1713 conditions per place.
[2023-11-19 08:06:46,550 INFO L140 encePairwiseOnDemand]: 253/260 looper letters, 21 selfloop transitions, 7 changer transitions 19/48 dead transitions.
[2023-11-19 08:06:46,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 48 transitions, 338 flow
[2023-11-19 08:06:46,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2023-11-19 08:06:46,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-11-19 08:06:46,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 698 transitions.
[2023-11-19 08:06:46,555 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38351648351648354
[2023-11-19 08:06:46,555 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 698 transitions.
[2023-11-19 08:06:46,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 698 transitions.
[2023-11-19 08:06:46,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 08:06:46,557 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 698 transitions.
[2023-11-19 08:06:46,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 99.71428571428571) internal successors, (698), 7 states have internal predecessors, (698), 0 states have call successors, (0), 0 states 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 08:06:46,564 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 08:06:46,565 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 08:06:46,565 INFO L175 Difference]: Start difference. First operand has 59 places, 36 transitions, 216 flow. Second operand 7 states and 698 transitions.
[2023-11-19 08:06:46,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 48 transitions, 338 flow
[2023-11-19 08:06:46,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 48 transitions, 313 flow, removed 3 selfloop flow, removed 7 redundant places.
[2023-11-19 08:06:46,578 INFO L231 Difference]: Finished difference. Result has 57 places, 27 transitions, 153 flow
[2023-11-19 08:06:46,578 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=153, PETRI_PLACES=57, PETRI_TRANSITIONS=27}
[2023-11-19 08:06:46,579 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 16 predicate places.
[2023-11-19 08:06:46,579 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 27 transitions, 153 flow
[2023-11-19 08:06:46,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.85714285714286) internal successors, (671), 7 states have internal predecessors, (671), 0 states have call successors, (0), 0 states 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 08:06:46,580 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 08:06:46,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 08:06:46,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-11-19 08:06:46,581 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-11-19 08:06:46,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 08:06:46,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1301498471, now seen corresponding path program 1 times
[2023-11-19 08:06:46,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 08:06:46,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777087123]
[2023-11-19 08:06:46,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 08:06:46,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 08:06:46,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 08:06:46,783 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 08:06:46,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 08:06:46,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777087123]
[2023-11-19 08:06:46,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777087123] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 08:06:46,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 08:06:46,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-19 08:06:46,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539046885]
[2023-11-19 08:06:46,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 08:06:46,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 08:06:46,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 08:06:46,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 08:06:46,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 08:06:46,795 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 260
[2023-11-19 08:06:46,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 27 transitions, 153 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states 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 08:06:46,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 08:06:46,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 260
[2023-11-19 08:06:46,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 08:06:47,029 INFO L124 PetriNetUnfolderBase]: 453/776 cut-off events.
[2023-11-19 08:06:47,030 INFO L125 PetriNetUnfolderBase]: For 656/656 co-relation queries the response was YES.
[2023-11-19 08:06:47,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2140 conditions, 776 events. 453/776 cut-off events. For 656/656 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3464 event pairs, 104 based on Foata normal form. 42/818 useless extension candidates. Maximal degree in co-relation 2126. Up to 677 conditions per place.
[2023-11-19 08:06:47,037 INFO L140 encePairwiseOnDemand]: 255/260 looper letters, 36 selfloop transitions, 4 changer transitions 0/41 dead transitions.
[2023-11-19 08:06:47,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 41 transitions, 298 flow
[2023-11-19 08:06:47,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-11-19 08:06:47,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-19 08:06:47,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions.
[2023-11-19 08:06:47,040 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156
[2023-11-19 08:06:47,041 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 360 transitions.
[2023-11-19 08:06:47,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 360 transitions.
[2023-11-19 08:06:47,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 08:06:47,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 360 transitions.
[2023-11-19 08:06:47,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states 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 08:06:47,045 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 08:06:47,046 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 08:06:47,047 INFO L175 Difference]: Start difference. First operand has 57 places, 27 transitions, 153 flow. Second operand 3 states and 360 transitions.
[2023-11-19 08:06:47,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 41 transitions, 298 flow
[2023-11-19 08:06:47,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 41 transitions, 242 flow, removed 6 selfloop flow, removed 14 redundant places.
[2023-11-19 08:06:47,051 INFO L231 Difference]: Finished difference. Result has 44 places, 30 transitions, 135 flow
[2023-11-19 08:06:47,052 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=135, PETRI_PLACES=44, PETRI_TRANSITIONS=30}
[2023-11-19 08:06:47,053 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places.
[2023-11-19 08:06:47,053 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 30 transitions, 135 flow
[2023-11-19 08:06:47,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states 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 08:06:47,053 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 08:06:47,054 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 08:06:47,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-11-19 08:06:47,054 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-11-19 08:06:47,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 08:06:47,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1416686952, now seen corresponding path program 1 times
[2023-11-19 08:06:47,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 08:06:47,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811020031]
[2023-11-19 08:06:47,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 08:06:47,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 08:06:47,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 08:06:47,389 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 08:06:47,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 08:06:47,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811020031]
[2023-11-19 08:06:47,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811020031] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 08:06:47,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 08:06:47,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-19 08:06:47,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507686702]
[2023-11-19 08:06:47,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 08:06:47,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-19 08:06:47,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 08:06:47,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-19 08:06:47,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2023-11-19 08:06:47,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 260
[2023-11-19 08:06:47,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 30 transitions, 135 flow. Second operand has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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 08:06:47,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 08:06:47,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 260
[2023-11-19 08:06:47,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 08:06:47,569 INFO L124 PetriNetUnfolderBase]: 185/372 cut-off events.
[2023-11-19 08:06:47,569 INFO L125 PetriNetUnfolderBase]: For 173/173 co-relation queries the response was YES.
[2023-11-19 08:06:47,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1157 conditions, 372 events. 185/372 cut-off events. For 173/173 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1520 event pairs, 45 based on Foata normal form. 44/414 useless extension candidates. Maximal degree in co-relation 1148. Up to 169 conditions per place.
[2023-11-19 08:06:47,573 INFO L140 encePairwiseOnDemand]: 255/260 looper letters, 42 selfloop transitions, 7 changer transitions 0/50 dead transitions.
[2023-11-19 08:06:47,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 50 transitions, 315 flow
[2023-11-19 08:06:47,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2023-11-19 08:06:47,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-19 08:06:47,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 478 transitions.
[2023-11-19 08:06:47,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4596153846153846
[2023-11-19 08:06:47,577 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 478 transitions.
[2023-11-19 08:06:47,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 478 transitions.
[2023-11-19 08:06:47,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 08:06:47,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 478 transitions.
[2023-11-19 08:06:47,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 0 states 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 08:06:47,584 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 08:06:47,584 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 08:06:47,585 INFO L175 Difference]: Start difference. First operand has 44 places, 30 transitions, 135 flow. Second operand 4 states and 478 transitions.
[2023-11-19 08:06:47,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 50 transitions, 315 flow
[2023-11-19 08:06:47,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 50 transitions, 311 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-19 08:06:47,588 INFO L231 Difference]: Finished difference. Result has 47 places, 33 transitions, 171 flow
[2023-11-19 08:06:47,589 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=171, PETRI_PLACES=47, PETRI_TRANSITIONS=33}
[2023-11-19 08:06:47,590 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 6 predicate places.
[2023-11-19 08:06:47,590 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 33 transitions, 171 flow
[2023-11-19 08:06:47,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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 08:06:47,591 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 08:06:47,591 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 08:06:47,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-11-19 08:06:47,591 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-11-19 08:06:47,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 08:06:47,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1433535183, now seen corresponding path program 1 times
[2023-11-19 08:06:47,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 08:06:47,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760343351]
[2023-11-19 08:06:47,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 08:06:47,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 08:06:47,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 08:06:47,883 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 08:06:47,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 08:06:47,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760343351]
[2023-11-19 08:06:47,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760343351] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 08:06:47,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 08:06:47,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-11-19 08:06:47,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917474053]
[2023-11-19 08:06:47,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 08:06:47,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-11-19 08:06:47,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 08:06:47,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-11-19 08:06:47,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2023-11-19 08:06:47,896 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 260
[2023-11-19 08:06:47,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 33 transitions, 171 flow. Second operand has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 states 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 08:06:47,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 08:06:47,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 260
[2023-11-19 08:06:47,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 08:06:48,049 INFO L124 PetriNetUnfolderBase]: 129/260 cut-off events.
[2023-11-19 08:06:48,050 INFO L125 PetriNetUnfolderBase]: For 290/290 co-relation queries the response was YES.
[2023-11-19 08:06:48,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 911 conditions, 260 events. 129/260 cut-off events. For 290/290 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 998 event pairs, 37 based on Foata normal form. 16/274 useless extension candidates. Maximal degree in co-relation 901. Up to 104 conditions per place.
[2023-11-19 08:06:48,052 INFO L140 encePairwiseOnDemand]: 255/260 looper letters, 39 selfloop transitions, 10 changer transitions 0/50 dead transitions.
[2023-11-19 08:06:48,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 50 transitions, 339 flow
[2023-11-19 08:06:48,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-11-19 08:06:48,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-11-19 08:06:48,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 587 transitions.
[2023-11-19 08:06:48,056 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45153846153846156
[2023-11-19 08:06:48,056 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 587 transitions.
[2023-11-19 08:06:48,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 587 transitions.
[2023-11-19 08:06:48,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 08:06:48,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 587 transitions.
[2023-11-19 08:06:48,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 0 states have call successors, (0), 0 states 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 08:06:48,063 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 08:06:48,063 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 08:06:48,064 INFO L175 Difference]: Start difference. First operand has 47 places, 33 transitions, 171 flow. Second operand 5 states and 587 transitions.
[2023-11-19 08:06:48,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 50 transitions, 339 flow
[2023-11-19 08:06:48,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 50 transitions, 306 flow, removed 6 selfloop flow, removed 4 redundant places.
[2023-11-19 08:06:48,067 INFO L231 Difference]: Finished difference. Result has 48 places, 33 transitions, 172 flow
[2023-11-19 08:06:48,067 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=172, PETRI_PLACES=48, PETRI_TRANSITIONS=33}
[2023-11-19 08:06:48,068 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 7 predicate places.
[2023-11-19 08:06:48,068 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 33 transitions, 172 flow
[2023-11-19 08:06:48,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 states 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 08:06:48,069 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 08:06:48,069 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 08:06:48,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-11-19 08:06:48,069 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-11-19 08:06:48,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 08:06:48,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1444866828, now seen corresponding path program 1 times
[2023-11-19 08:06:48,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 08:06:48,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925001912]
[2023-11-19 08:06:48,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 08:06:48,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 08:06:48,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 08:06:49,892 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 08:06:49,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 08:06:49,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925001912]
[2023-11-19 08:06:49,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925001912] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 08:06:49,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 08:06:49,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2023-11-19 08:06:49,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544752892]
[2023-11-19 08:06:49,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 08:06:49,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2023-11-19 08:06:49,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 08:06:49,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2023-11-19 08:06:49,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2023-11-19 08:06:50,042 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 260
[2023-11-19 08:06:50,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 33 transitions, 172 flow. Second operand has 9 states, 9 states have (on average 106.22222222222223) internal successors, (956), 9 states have internal predecessors, (956), 0 states have call successors, (0), 0 states 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 08:06:50,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 08:06:50,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 260
[2023-11-19 08:06:50,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 08:06:50,675 INFO L124 PetriNetUnfolderBase]: 176/370 cut-off events.
[2023-11-19 08:06:50,675 INFO L125 PetriNetUnfolderBase]: For 550/550 co-relation queries the response was YES.
[2023-11-19 08:06:50,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1298 conditions, 370 events. 176/370 cut-off events. For 550/550 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1602 event pairs, 9 based on Foata normal form. 2/371 useless extension candidates. Maximal degree in co-relation 1289. Up to 133 conditions per place.
[2023-11-19 08:06:50,679 INFO L140 encePairwiseOnDemand]: 251/260 looper letters, 50 selfloop transitions, 15 changer transitions 24/90 dead transitions.
[2023-11-19 08:06:50,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 90 transitions, 646 flow
[2023-11-19 08:06:50,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2023-11-19 08:06:50,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2023-11-19 08:06:50,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1212 transitions.
[2023-11-19 08:06:50,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42377622377622376
[2023-11-19 08:06:50,687 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1212 transitions.
[2023-11-19 08:06:50,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1212 transitions.
[2023-11-19 08:06:50,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 08:06:50,689 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1212 transitions.
[2023-11-19 08:06:50,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 110.18181818181819) internal successors, (1212), 11 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states 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 08:06:50,701 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 08:06:50,702 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 08:06:50,703 INFO L175 Difference]: Start difference. First operand has 48 places, 33 transitions, 172 flow. Second operand 11 states and 1212 transitions.
[2023-11-19 08:06:50,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 90 transitions, 646 flow
[2023-11-19 08:06:50,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 90 transitions, 574 flow, removed 12 selfloop flow, removed 3 redundant places.
[2023-11-19 08:06:50,710 INFO L231 Difference]: Finished difference. Result has 60 places, 44 transitions, 241 flow
[2023-11-19 08:06:50,710 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=241, PETRI_PLACES=60, PETRI_TRANSITIONS=44}
[2023-11-19 08:06:50,711 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 19 predicate places.
[2023-11-19 08:06:50,711 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 44 transitions, 241 flow
[2023-11-19 08:06:50,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 106.22222222222223) internal successors, (956), 9 states have internal predecessors, (956), 0 states have call successors, (0), 0 states 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 08:06:50,712 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 08:06:50,713 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 08:06:50,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2023-11-19 08:06:50,713 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-11-19 08:06:50,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 08:06:50,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1759766580, now seen corresponding path program 2 times
[2023-11-19 08:06:50,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 08:06:50,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275166819]
[2023-11-19 08:06:50,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 08:06:50,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 08:06:50,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 08:06:51,011 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 08:06:51,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-19 08:06:51,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275166819]
[2023-11-19 08:06:51,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275166819] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 08:06:51,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 08:06:51,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-11-19 08:06:51,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338852646]
[2023-11-19 08:06:51,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 08:06:51,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-11-19 08:06:51,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-19 08:06:51,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-11-19 08:06:51,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2023-11-19 08:06:51,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 260
[2023-11-19 08:06:51,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 44 transitions, 241 flow. Second operand has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 08:06:51,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 08:06:51,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 260
[2023-11-19 08:06:51,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 08:06:51,255 INFO L124 PetriNetUnfolderBase]: 193/400 cut-off events.
[2023-11-19 08:06:51,256 INFO L125 PetriNetUnfolderBase]: For 523/523 co-relation queries the response was YES.
[2023-11-19 08:06:51,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1466 conditions, 400 events. 193/400 cut-off events. For 523/523 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1671 event pairs, 60 based on Foata normal form. 2/402 useless extension candidates. Maximal degree in co-relation 1452. Up to 229 conditions per place.
[2023-11-19 08:06:51,259 INFO L140 encePairwiseOnDemand]: 256/260 looper letters, 30 selfloop transitions, 1 changer transitions 33/64 dead transitions.
[2023-11-19 08:06:51,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 64 transitions, 473 flow
[2023-11-19 08:06:51,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-11-19 08:06:51,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-11-19 08:06:51,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 570 transitions.
[2023-11-19 08:06:51,263 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43846153846153846
[2023-11-19 08:06:51,264 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 570 transitions.
[2023-11-19 08:06:51,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 570 transitions.
[2023-11-19 08:06:51,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 08:06:51,265 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 570 transitions.
[2023-11-19 08:06:51,267 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 08:06:51,271 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 08:06:51,272 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 08:06:51,272 INFO L175 Difference]: Start difference. First operand has 60 places, 44 transitions, 241 flow. Second operand 5 states and 570 transitions.
[2023-11-19 08:06:51,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 64 transitions, 473 flow
[2023-11-19 08:06:51,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 64 transitions, 461 flow, removed 6 selfloop flow, removed 3 redundant places.
[2023-11-19 08:06:51,278 INFO L231 Difference]: Finished difference. Result has 60 places, 31 transitions, 166 flow
[2023-11-19 08:06:51,278 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=166, PETRI_PLACES=60, PETRI_TRANSITIONS=31}
[2023-11-19 08:06:51,279 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 19 predicate places.
[2023-11-19 08:06:51,279 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 31 transitions, 166 flow
[2023-11-19 08:06:51,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 08:06:51,280 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 08:06:51,280 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 08:06:51,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-11-19 08:06:51,281 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-11-19 08:06:51,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 08:06:51,281 INFO L85 PathProgramCache]: Analyzing trace with hash 27522732, now seen corresponding path program 3 times
[2023-11-19 08:06:51,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-19 08:06:51,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77781438]
[2023-11-19 08:06:51,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 08:06:51,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-19 08:06:51,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-19 08:06:51,375 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-19 08:06:51,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-19 08:06:51,512 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-19 08:06:51,513 INFO L360 BasicCegarLoop]: Counterexample is feasible
[2023-11-19 08:06:51,514 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining)
[2023-11-19 08:06:51,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining)
[2023-11-19 08:06:51,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining)
[2023-11-19 08:06:51,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining)
[2023-11-19 08:06:51,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining)
[2023-11-19 08:06:51,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining)
[2023-11-19 08:06:51,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining)
[2023-11-19 08:06:51,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining)
[2023-11-19 08:06:51,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining)
[2023-11-19 08:06:51,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining)
[2023-11-19 08:06:51,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining)
[2023-11-19 08:06:51,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining)
[2023-11-19 08:06:51,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining)
[2023-11-19 08:06:51,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2023-11-19 08:06:51,521 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-19 08:06:51,529 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2023-11-19 08:06:51,529 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2023-11-19 08:06:51,586 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated
[2023-11-19 08:06:51,589 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated
[2023-11-19 08:06:51,591 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated
[2023-11-19 08:06:51,600 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0
[2023-11-19 08:06:51,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:06:51 BasicIcfg
[2023-11-19 08:06:51,614 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-11-19 08:06:51,614 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2023-11-19 08:06:51,614 INFO L270 PluginConnector]: Initializing Witness Printer...
[2023-11-19 08:06:51,615 INFO L274 PluginConnector]: Witness Printer initialized
[2023-11-19 08:06:51,615 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:06:30" (3/4) ...
[2023-11-19 08:06:51,618 INFO L140 WitnessPrinter]: No result that supports witness generation found
[2023-11-19 08:06:51,619 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2023-11-19 08:06:51,620 INFO L158 Benchmark]: Toolchain (without parser) took 23688.16ms. Allocated memory was 138.4MB in the beginning and 497.0MB in the end (delta: 358.6MB). Free memory was 79.7MB in the beginning and 427.0MB in the end (delta: -347.3MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB.
[2023-11-19 08:06:51,621 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 138.4MB. Free memory was 105.1MB in the beginning and 105.0MB in the end (delta: 29.1kB). There was no memory consumed. Max. memory is 16.1GB.
[2023-11-19 08:06:51,621 INFO L158 Benchmark]: CACSL2BoogieTranslator took 985.79ms. Allocated memory was 138.4MB in the beginning and 180.4MB in the end (delta: 41.9MB). Free memory was 79.3MB in the beginning and 140.1MB in the end (delta: -60.8MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB.
[2023-11-19 08:06:51,622 INFO L158 Benchmark]: Boogie Procedure Inliner took 119.27ms. Allocated memory is still 180.4MB. Free memory was 140.1MB in the beginning and 137.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-11-19 08:06:51,622 INFO L158 Benchmark]: Boogie Preprocessor took 85.90ms. Allocated memory is still 180.4MB. Free memory was 137.2MB in the beginning and 135.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-11-19 08:06:51,623 INFO L158 Benchmark]: RCFGBuilder took 970.54ms. Allocated memory is still 180.4MB. Free memory was 135.1MB in the beginning and 92.7MB in the end (delta: 42.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB.
[2023-11-19 08:06:51,623 INFO L158 Benchmark]: TraceAbstraction took 21511.37ms. Allocated memory was 180.4MB in the beginning and 497.0MB in the end (delta: 316.7MB). Free memory was 91.9MB in the beginning and 427.0MB in the end (delta: -335.1MB). There was no memory consumed. Max. memory is 16.1GB.
[2023-11-19 08:06:51,623 INFO L158 Benchmark]: Witness Printer took 5.21ms. Allocated memory is still 497.0MB. Free memory is still 427.0MB. There was no memory consumed. Max. memory is 16.1GB.
[2023-11-19 08:06:51,626 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.35ms. Allocated memory is still 138.4MB. Free memory was 105.1MB in the beginning and 105.0MB in the end (delta: 29.1kB). There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 985.79ms. Allocated memory was 138.4MB in the beginning and 180.4MB in the end (delta: 41.9MB). Free memory was 79.3MB in the beginning and 140.1MB in the end (delta: -60.8MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 119.27ms. Allocated memory is still 180.4MB. Free memory was 140.1MB in the beginning and 137.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 85.90ms. Allocated memory is still 180.4MB. Free memory was 137.2MB in the beginning and 135.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 970.54ms. Allocated memory is still 180.4MB. Free memory was 135.1MB in the beginning and 92.7MB in the end (delta: 42.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB.
* TraceAbstraction took 21511.37ms. Allocated memory was 180.4MB in the beginning and 497.0MB in the end (delta: 316.7MB). Free memory was 91.9MB in the beginning and 427.0MB in the end (delta: -335.1MB). There was no memory consumed. Max. memory is 16.1GB.
* Witness Printer took 5.21ms. Allocated memory is still 497.0MB. Free memory is still 427.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: 5.9s, 131 PlacesBefore, 41 PlacesAfterwards, 126 TransitionsBefore, 32 TransitionsAfterwards, 2788 CoEnabledTransitionPairs, 6 FixpointIterations, 45 TrivialSequentialCompositions, 73 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 4 ChoiceCompositions, 131 TotalNumberOfCompositions, 5737 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2851, independent: 2707, independent conditional: 0, independent unconditional: 2707, dependent: 144, dependent conditional: 0, dependent unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1420, independent: 1384, independent conditional: 0, independent unconditional: 1384, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2851, independent: 1323, independent conditional: 0, independent unconditional: 1323, dependent: 108, dependent conditional: 0, dependent unconditional: 108, unknown: 1420, unknown conditional: 0, unknown unconditional: 1420] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 79, Positive conditional cache size: 0, Positive unconditional cache size: 79, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
- UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: overapproximation of memtrack at line 18.
Possible FailurePath:
[L710] 0 int __unbuffered_cnt = 0;
[L712] 0 int __unbuffered_p0_EAX = 0;
[L714] 0 int __unbuffered_p0_EBX = 0;
[L716] 0 int __unbuffered_p1_EAX = 0;
[L718] 0 int __unbuffered_p1_EBX = 0;
[L719] 0 _Bool main$tmp_guard0;
[L720] 0 _Bool main$tmp_guard1;
[L722] 0 int x = 0;
[L724] 0 int y = 0;
[L725] 0 _Bool y$flush_delayed;
[L726] 0 int y$mem_tmp;
[L727] 0 _Bool y$r_buff0_thd0;
[L728] 0 _Bool y$r_buff0_thd1;
[L729] 0 _Bool y$r_buff0_thd2;
[L730] 0 _Bool y$r_buff0_thd3;
[L731] 0 _Bool y$r_buff1_thd0;
[L732] 0 _Bool y$r_buff1_thd1;
[L733] 0 _Bool y$r_buff1_thd2;
[L734] 0 _Bool y$r_buff1_thd3;
[L735] 0 _Bool y$read_delayed;
[L736] 0 int *y$read_delayed_var;
[L737] 0 int y$w_buff0;
[L738] 0 _Bool y$w_buff0_used;
[L739] 0 int y$w_buff1;
[L740] 0 _Bool y$w_buff1_used;
[L741] 0 _Bool weak$$choice0;
[L742] 0 _Bool weak$$choice2;
[L844] 0 pthread_t t1740;
[L845] FCALL, FORK 0 pthread_create(&t1740, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1740={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]
[L846] 0 pthread_t t1741;
[L847] FCALL, FORK 0 pthread_create(&t1741, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1740={5:0}, t1741={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L848] 0 pthread_t t1742;
[L774] 2 y$w_buff1 = y$w_buff0
[L775] 2 y$w_buff0 = 1
[L776] 2 y$w_buff1_used = y$w_buff0_used
[L777] 2 y$w_buff0_used = (_Bool)1
[L778] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L19] COND FALSE 2 !(!expression)
[L778] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L779] 2 y$r_buff1_thd0 = y$r_buff0_thd0
[L780] 2 y$r_buff1_thd1 = y$r_buff0_thd1
[L781] 2 y$r_buff1_thd2 = y$r_buff0_thd2
[L782] 2 y$r_buff1_thd3 = y$r_buff0_thd3
[L783] 2 y$r_buff0_thd2 = (_Bool)1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, 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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L849] FCALL, FORK 0 pthread_create(&t1742, ((void *)0), P2, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1740={5:0}, t1741={6:0}, t1742={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L786] 2 weak$$choice0 = __VERIFIER_nondet_bool()
[L787] 2 weak$$choice2 = __VERIFIER_nondet_bool()
[L788] 2 y$flush_delayed = weak$$choice2
[L789] 2 y$mem_tmp = y
[L790] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)
[L791] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))
[L792] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))
[L793] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))
[L794] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L795] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))
[L796] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L797] 2 __unbuffered_p1_EAX = y
[L798] 2 y = y$flush_delayed ? y$mem_tmp : y
[L799] 2 y$flush_delayed = (_Bool)0
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L802] 2 __unbuffered_p1_EBX = x
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L819] 3 x = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L822] 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)
[L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L824] 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
[L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L826] 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_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1
[L831] 3 return 0;
[L746] 1 __unbuffered_p0_EAX = x
VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L749] 1 weak$$choice0 = __VERIFIER_nondet_bool()
[L750] 1 weak$$choice2 = __VERIFIER_nondet_bool()
[L751] 1 y$flush_delayed = weak$$choice2
[L752] 1 y$mem_tmp = y
[L753] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)
[L754] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))
[L755] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))
[L756] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))
[L757] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L758] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))
[L759] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L760] 1 __unbuffered_p0_EBX = y
[L761] 1 y = y$flush_delayed ? y$mem_tmp : y
[L762] 1 y$flush_delayed = (_Bool)0
VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0]
[L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1
[L769] 1 return 0;
[L805] 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)
[L806] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L807] 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
[L808] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L809] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L812] 2 __unbuffered_cnt = __unbuffered_cnt + 1
[L814] 2 return 0;
[L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3
[L853] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L4] COND FALSE 0 !(!cond)
[L853] RET 0 assume_abort_if_not(main$tmp_guard0)
[L855] 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)
[L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L857] 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
[L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L859] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1740={5:0}, t1741={6:0}, t1742={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1]
[L862] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0)
[L864] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L19] COND TRUE 0 !expression
[L19] CALL 0 reach_error()
[L18] COND FALSE 0 !(0)
[L18] 0 __assert_fail ("0", "rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.c", 9, __extension__ __PRETTY_FUNCTION__)
VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1]
- UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: 842]: 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: 845]: 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.
- StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
CFG has 7 procedures, 153 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: 21.2s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 820 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 646 mSDsluCounter, 268 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 259 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1960 IncrementalHoareTripleChecker+Invalid, 2048 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 9 mSDtfsCounter, 1960 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=241occurred in iteration=12, InterpolantAutomatonStates: 69, 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, 5.5s InterpolantComputationTime, 184 NumberOfCodeBlocks, 184 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 150 ConstructedInterpolants, 0 QuantifiedInterpolants, 1564 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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 08:06:51,677 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8badf9-088a-40ab-80e0-7e787e16b1c0/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_2e8badf9-088a-40ab-80e0-7e787e16b1c0/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8badf9-088a-40ab-80e0-7e787e16b1c0/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_2e8badf9-088a-40ab-80e0-7e787e16b1c0/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8badf9-088a-40ab-80e0-7e787e16b1c0/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8badf9-088a-40ab-80e0-7e787e16b1c0/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_2e8badf9-088a-40ab-80e0-7e787e16b1c0/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 c0fbd235801aa6198331442d567d46062ed57d086b0069ca7d1e131a6b5917b8
--- Real Ultimate output ---
This is Ultimate 0.2.3-dev-9bd2c7f
[2023-11-19 08:06:54,206 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2023-11-19 08:06:54,283 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8badf9-088a-40ab-80e0-7e787e16b1c0/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf
[2023-11-19 08:06:54,309 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2023-11-19 08:06:54,310 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2023-11-19 08:06:54,336 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-19 08:06:54,337 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-19 08:06:54,337 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-19 08:06:54,338 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-19 08:06:54,339 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-19 08:06:54,339 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-19 08:06:54,340 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2023-11-19 08:06:54,341 INFO L153 SettingsManager]: * Use SBE=true
[2023-11-19 08:06:54,341 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-19 08:06:54,342 INFO L153 SettingsManager]: * sizeof long=4
[2023-11-19 08:06:54,342 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2023-11-19 08:06:54,343 INFO L153 SettingsManager]: * sizeof POINTER=4
[2023-11-19 08:06:54,344 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2023-11-19 08:06:54,344 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2023-11-19 08:06:54,345 INFO L153 SettingsManager]: * Bitprecise bitfields=true
[2023-11-19 08:06:54,345 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2023-11-19 08:06:54,346 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-19 08:06:54,346 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2023-11-19 08:06:54,347 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2023-11-19 08:06:54,347 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2023-11-19 08:06:54,348 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2023-11-19 08:06:54,348 INFO L153 SettingsManager]: * sizeof long double=12
[2023-11-19 08:06:54,349 INFO L153 SettingsManager]: * Use constant arrays=true
[2023-11-19 08:06:54,349 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-19 08:06:54,350 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2023-11-19 08:06:54,351 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2023-11-19 08:06:54,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-19 08:06:54,352 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-19 08:06:54,352 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2023-11-19 08:06:54,353 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF
[2023-11-19 08:06:54,353 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2023-11-19 08:06:54,354 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-19 08:06:54,354 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2023-11-19 08:06:54,355 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2023-11-19 08:06:54,355 INFO L153 SettingsManager]: * Logic for external solver=AUFBV
[2023-11-19 08:06:54,356 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-11-19 08:06:54,357 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_2e8badf9-088a-40ab-80e0-7e787e16b1c0/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_2e8badf9-088a-40ab-80e0-7e787e16b1c0/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 -> c0fbd235801aa6198331442d567d46062ed57d086b0069ca7d1e131a6b5917b8
[2023-11-19 08:06:54,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-19 08:06:54,803 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-19 08:06:54,809 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-19 08:06:54,811 INFO L270 PluginConnector]: Initializing CDTParser...
[2023-11-19 08:06:54,812 INFO L274 PluginConnector]: CDTParser initialized
[2023-11-19 08:06:54,813 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8badf9-088a-40ab-80e0-7e787e16b1c0/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i
[2023-11-19 08:06:58,117 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2023-11-19 08:06:58,490 INFO L384 CDTParser]: Found 1 translation units.
[2023-11-19 08:06:58,491 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8badf9-088a-40ab-80e0-7e787e16b1c0/sv-benchmarks/c/pthread-wmm/rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i
[2023-11-19 08:06:58,513 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8badf9-088a-40ab-80e0-7e787e16b1c0/bin/uautomizer-verify-uCwYo4JHxu/data/24de33930/692530cf246d4da18f3b342e9761361c/FLAGb8cc42684
[2023-11-19 08:06:58,703 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8badf9-088a-40ab-80e0-7e787e16b1c0/bin/uautomizer-verify-uCwYo4JHxu/data/24de33930/692530cf246d4da18f3b342e9761361c
[2023-11-19 08:06:58,705 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-19 08:06:58,707 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-19 08:06:58,709 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-19 08:06:58,709 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-19 08:06:58,714 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-19 08:06:58,714 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:06:58" (1/1) ...
[2023-11-19 08:06:58,716 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57e924d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:58, skipping insertion in model container
[2023-11-19 08:06:58,716 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:06:58" (1/1) ...
[2023-11-19 08:06:58,776 INFO L177 MainTranslator]: Built tables and reachable declarations
[2023-11-19 08:06:59,351 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-19 08:06:59,371 INFO L202 MainTranslator]: Completed pre-run
[2023-11-19 08:06:59,470 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-11-19 08:06:59,535 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler.
[2023-11-19 08:06:59,536 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler.
[2023-11-19 08:06:59,544 INFO L206 MainTranslator]: Completed translation
[2023-11-19 08:06:59,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:59 WrapperNode
[2023-11-19 08:06:59,544 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-19 08:06:59,546 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-19 08:06:59,547 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-19 08:06:59,547 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-19 08:06:59,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:59" (1/1) ...
[2023-11-19 08:06:59,606 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:59" (1/1) ...
[2023-11-19 08:06:59,649 INFO L138 Inliner]: procedures = 179, calls = 55, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 155
[2023-11-19 08:06:59,651 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-19 08:06:59,652 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-19 08:06:59,652 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-19 08:06:59,653 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2023-11-19 08:06:59,663 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:59" (1/1) ...
[2023-11-19 08:06:59,663 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:59" (1/1) ...
[2023-11-19 08:06:59,678 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:59" (1/1) ...
[2023-11-19 08:06:59,682 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:59" (1/1) ...
[2023-11-19 08:06:59,699 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:59" (1/1) ...
[2023-11-19 08:06:59,720 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:59" (1/1) ...
[2023-11-19 08:06:59,723 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:59" (1/1) ...
[2023-11-19 08:06:59,726 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:59" (1/1) ...
[2023-11-19 08:06:59,730 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-19 08:06:59,739 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-19 08:06:59,740 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2023-11-19 08:06:59,740 INFO L274 PluginConnector]: RCFGBuilder initialized
[2023-11-19 08:06:59,741 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:59" (1/1) ...
[2023-11-19 08:06:59,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-19 08:06:59,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8badf9-088a-40ab-80e0-7e787e16b1c0/bin/uautomizer-verify-uCwYo4JHxu/z3
[2023-11-19 08:06:59,772 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8badf9-088a-40ab-80e0-7e787e16b1c0/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-11-19 08:06:59,801 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8badf9-088a-40ab-80e0-7e787e16b1c0/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-11-19 08:06:59,824 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2023-11-19 08:06:59,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-11-19 08:06:59,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-11-19 08:06:59,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-11-19 08:06:59,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4
[2023-11-19 08:06:59,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1
[2023-11-19 08:06:59,825 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2023-11-19 08:06:59,826 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2023-11-19 08:06:59,826 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2023-11-19 08:06:59,826 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2023-11-19 08:06:59,826 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2023-11-19 08:06:59,827 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2023-11-19 08:06:59,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2023-11-19 08:06:59,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-19 08:06:59,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-19 08:06:59,831 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 08:07:00,035 INFO L236 CfgBuilder]: Building ICFG
[2023-11-19 08:07:00,038 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-19 08:07:00,568 INFO L277 CfgBuilder]: Performing block encoding
[2023-11-19 08:07:00,771 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-19 08:07:00,772 INFO L302 CfgBuilder]: Removed 0 assume(true) statements.
[2023-11-19 08:07:00,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:07:00 BoogieIcfgContainer
[2023-11-19 08:07:00,778 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-19 08:07:00,782 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-19 08:07:00,782 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2023-11-19 08:07:00,785 INFO L274 PluginConnector]: TraceAbstraction initialized
[2023-11-19 08:07:00,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:06:58" (1/3) ...
[2023-11-19 08:07:00,786 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@567f252f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:07:00, skipping insertion in model container
[2023-11-19 08:07:00,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:59" (2/3) ...
[2023-11-19 08:07:00,788 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@567f252f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:07:00, skipping insertion in model container
[2023-11-19 08:07:00,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:07:00" (3/3) ...
[2023-11-19 08:07:00,789 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi009_power.opt_pso.oepc_pso.opt_rmo.opt_tso.oepc_tso.opt.i
[2023-11-19 08:07:00,810 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-19 08:07:00,810 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations.
[2023-11-19 08:07:00,810 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-11-19 08:07:00,903 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-11-19 08:07:00,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 130 transitions, 272 flow
[2023-11-19 08:07:01,042 INFO L124 PetriNetUnfolderBase]: 5/127 cut-off events.
[2023-11-19 08:07:01,044 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-19 08:07:01,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 127 events. 5/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 101 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 87. Up to 3 conditions per place.
[2023-11-19 08:07:01,051 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 130 transitions, 272 flow
[2023-11-19 08:07:01,066 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 127 transitions, 263 flow
[2023-11-19 08:07:01,072 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-19 08:07:01,084 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 127 transitions, 263 flow
[2023-11-19 08:07:01,087 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 127 transitions, 263 flow
[2023-11-19 08:07:01,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 127 transitions, 263 flow
[2023-11-19 08:07:01,118 INFO L124 PetriNetUnfolderBase]: 5/127 cut-off events.
[2023-11-19 08:07:01,119 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-19 08:07:01,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 127 events. 5/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 100 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 87. Up to 3 conditions per place.
[2023-11-19 08:07:01,124 INFO L119 LiptonReduction]: Number of co-enabled transitions 2788
[2023-11-19 08:07:09,759 INFO L134 LiptonReduction]: Checked pairs total: 6199
[2023-11-19 08:07:09,760 INFO L136 LiptonReduction]: Total number of compositions: 136
[2023-11-19 08:07:09,778 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-19 08:07:09,784 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;@615d70ef, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-19 08:07:09,785 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations.
[2023-11-19 08:07:09,787 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2023-11-19 08:07:09,787 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events.
[2023-11-19 08:07:09,788 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-19 08:07:09,788 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 08:07:09,788 INFO L208 CegarLoopForPetriNet]: trace histogram [1]
[2023-11-19 08:07:09,789 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-11-19 08:07:09,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 08:07:09,794 INFO L85 PathProgramCache]: Analyzing trace with hash 612, now seen corresponding path program 1 times
[2023-11-19 08:07:09,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-11-19 08:07:09,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [185538971]
[2023-11-19 08:07:09,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 08:07:09,808 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-11-19 08:07:09,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8badf9-088a-40ab-80e0-7e787e16b1c0/bin/uautomizer-verify-uCwYo4JHxu/mathsat
[2023-11-19 08:07:09,810 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8badf9-088a-40ab-80e0-7e787e16b1c0/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-11-19 08:07:09,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8badf9-088a-40ab-80e0-7e787e16b1c0/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process
[2023-11-19 08:07:09,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 08:07:09,923 INFO L262 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core
[2023-11-19 08:07:09,927 INFO L285 TraceCheckSpWp]: Computing forward predicates...
[2023-11-19 08:07:09,931 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 08:07:09,932 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-19 08:07:09,933 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-11-19 08:07:09,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [185538971]
[2023-11-19 08:07:09,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [185538971] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 08:07:09,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 08:07:09,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-11-19 08:07:09,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807692765]
[2023-11-19 08:07:09,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 08:07:09,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-19 08:07:09,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-11-19 08:07:09,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-19 08:07:09,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-19 08:07:09,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 266
[2023-11-19 08:07:09,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 71 flow. Second operand has 2 states, 2 states have (on average 114.5) internal successors, (229), 2 states have internal predecessors, (229), 0 states have call successors, (0), 0 states 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 08:07:09,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 08:07:09,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 266
[2023-11-19 08:07:09,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-19 08:07:10,578 INFO L124 PetriNetUnfolderBase]: 1555/2292 cut-off events.
[2023-11-19 08:07:10,578 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES.
[2023-11-19 08:07:10,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4639 conditions, 2292 events. 1555/2292 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 10027 event pairs, 1555 based on Foata normal form. 0/1976 useless extension candidates. Maximal degree in co-relation 4628. Up to 2285 conditions per place.
[2023-11-19 08:07:10,604 INFO L140 encePairwiseOnDemand]: 259/266 looper letters, 23 selfloop transitions, 0 changer transitions 0/24 dead transitions.
[2023-11-19 08:07:10,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 24 transitions, 103 flow
[2023-11-19 08:07:10,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2023-11-19 08:07:10,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-11-19 08:07:10,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 258 transitions.
[2023-11-19 08:07:10,629 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4849624060150376
[2023-11-19 08:07:10,630 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 258 transitions.
[2023-11-19 08:07:10,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 258 transitions.
[2023-11-19 08:07:10,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-19 08:07:10,637 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 258 transitions.
[2023-11-19 08:07:10,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 129.0) internal successors, (258), 2 states have internal predecessors, (258), 0 states have call successors, (0), 0 states 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 08:07:10,647 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 266.0) internal successors, (798), 3 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 08:07:10,648 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 266.0) internal successors, (798), 3 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-19 08:07:10,650 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 71 flow. Second operand 2 states and 258 transitions.
[2023-11-19 08:07:10,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 24 transitions, 103 flow
[2023-11-19 08:07:10,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 24 transitions, 100 flow, removed 0 selfloop flow, removed 3 redundant places.
[2023-11-19 08:07:10,658 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 54 flow
[2023-11-19 08:07:10,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, 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 08:07:10,664 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -8 predicate places.
[2023-11-19 08:07:10,665 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 54 flow
[2023-11-19 08:07:10,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 114.5) internal successors, (229), 2 states have internal predecessors, (229), 0 states have call successors, (0), 0 states 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 08:07:10,666 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-11-19 08:07:10,666 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1]
[2023-11-19 08:07:10,677 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8badf9-088a-40ab-80e0-7e787e16b1c0/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0
[2023-11-19 08:07:10,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8badf9-088a-40ab-80e0-7e787e16b1c0/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-11-19 08:07:10,869 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-11-19 08:07:10,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2023-11-19 08:07:10,869 INFO L85 PathProgramCache]: Analyzing trace with hash 580851268, now seen corresponding path program 1 times
[2023-11-19 08:07:10,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-11-19 08:07:10,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [366352904]
[2023-11-19 08:07:10,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-19 08:07:10,871 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-11-19 08:07:10,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8badf9-088a-40ab-80e0-7e787e16b1c0/bin/uautomizer-verify-uCwYo4JHxu/mathsat
[2023-11-19 08:07:10,880 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8badf9-088a-40ab-80e0-7e787e16b1c0/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-11-19 08:07:10,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e8badf9-088a-40ab-80e0-7e787e16b1c0/bin/uautomizer-verify-uCwYo4JHxu/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process
[2023-11-19 08:07:10,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-19 08:07:10,975 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjunts are in the unsatisfiable core
[2023-11-19 08:07:10,976 INFO L285 TraceCheckSpWp]: Computing forward predicates...
[2023-11-19 08:07:11,005 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 08:07:11,005 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-19 08:07:11,005 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-11-19 08:07:11,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [366352904]
[2023-11-19 08:07:11,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [366352904] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-19 08:07:11,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-19 08:07:11,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-19 08:07:11,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067891080]
[2023-11-19 08:07:11,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-19 08:07:11,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-19 08:07:11,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-11-19 08:07:11,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-19 08:07:11,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-19 08:07:11,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 266
[2023-11-19 08:07:11,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states 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 08:07:11,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-19 08:07:11,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 266
[2023-11-19 08:07:11,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand