./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix041_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for memory safety (deref-memtrack)
Using default analysis
Version a0165632
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix041_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX --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 8a4342b982522a964cfb4ed0b81a3c247fa38eb769cbb37584570f60425c66cb
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-a016563
[2024-11-08 18:32:16,609 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-08 18:32:16,702 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf
[2024-11-08 18:32:16,712 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-08 18:32:16,713 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-08 18:32:16,752 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-08 18:32:16,753 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-08 18:32:16,754 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-08 18:32:16,756 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-08 18:32:16,757 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-08 18:32:16,758 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-08 18:32:16,759 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-08 18:32:16,760 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-08 18:32:16,761 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-08 18:32:16,764 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-08 18:32:16,765 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-08 18:32:16,765 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-08 18:32:16,766 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-08 18:32:16,766 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-08 18:32:16,767 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-08 18:32:16,767 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2024-11-08 18:32:16,768 INFO L153 SettingsManager]: * Bitprecise bitfields=true
[2024-11-08 18:32:16,772 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2024-11-08 18:32:16,773 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-08 18:32:16,774 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-08 18:32:16,774 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-08 18:32:16,774 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-11-08 18:32:16,775 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-08 18:32:16,775 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-08 18:32:16,776 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-08 18:32:16,778 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-08 18:32:16,778 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-08 18:32:16,778 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-08 18:32:16,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 18:32:16,779 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-08 18:32:16,780 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-08 18:32:16,781 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-08 18:32:16,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-08 18:32:16,782 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-08 18:32:16,782 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-08 18:32:16,783 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-08 18:32:16,783 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-08 18:32:16,783 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_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/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_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX
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 -> 8a4342b982522a964cfb4ed0b81a3c247fa38eb769cbb37584570f60425c66cb
[2024-11-08 18:32:17,140 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-08 18:32:17,210 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-08 18:32:17,215 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-08 18:32:17,217 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-08 18:32:17,217 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-08 18:32:17,219 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/pthread-wmm/mix041_power.oepc_pso.oepc_rmo.oepc.i
Unable to find full path for "g++"
[2024-11-08 18:32:19,746 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-08 18:32:20,151 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-08 18:32:20,152 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/sv-benchmarks/c/pthread-wmm/mix041_power.oepc_pso.oepc_rmo.oepc.i
[2024-11-08 18:32:20,181 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/data/fa3bc612a/c1ebbb2271df4a2584f911edabae2318/FLAG187c360c6
[2024-11-08 18:32:20,202 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/data/fa3bc612a/c1ebbb2271df4a2584f911edabae2318
[2024-11-08 18:32:20,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-08 18:32:20,207 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-08 18:32:20,209 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-08 18:32:20,209 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-08 18:32:20,217 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-08 18:32:20,218 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:32:20" (1/1) ...
[2024-11-08 18:32:20,219 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18b51f8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:32:20, skipping insertion in model container
[2024-11-08 18:32:20,220 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:32:20" (1/1) ...
[2024-11-08 18:32:20,301 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-08 18:32:20,848 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 18:32:20,873 INFO L200 MainTranslator]: Completed pre-run
[2024-11-08 18:32:20,997 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 18:32:21,070 INFO L204 MainTranslator]: Completed translation
[2024-11-08 18:32:21,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:32:21 WrapperNode
[2024-11-08 18:32:21,071 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-08 18:32:21,072 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-08 18:32:21,073 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-08 18:32:21,073 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-08 18:32:21,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:32:21" (1/1) ...
[2024-11-08 18:32:21,102 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:32:21" (1/1) ...
[2024-11-08 18:32:21,139 INFO L138 Inliner]: procedures = 174, calls = 38, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 109
[2024-11-08 18:32:21,140 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-08 18:32:21,141 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-08 18:32:21,141 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-08 18:32:21,142 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-08 18:32:21,159 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:32:21" (1/1) ...
[2024-11-08 18:32:21,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:32:21" (1/1) ...
[2024-11-08 18:32:21,163 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:32:21" (1/1) ...
[2024-11-08 18:32:21,185 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-11-08 18:32:21,186 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:32:21" (1/1) ...
[2024-11-08 18:32:21,186 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:32:21" (1/1) ...
[2024-11-08 18:32:21,201 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:32:21" (1/1) ...
[2024-11-08 18:32:21,208 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:32:21" (1/1) ...
[2024-11-08 18:32:21,210 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:32:21" (1/1) ...
[2024-11-08 18:32:21,216 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:32:21" (1/1) ...
[2024-11-08 18:32:21,223 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-08 18:32:21,225 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-08 18:32:21,228 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-08 18:32:21,229 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-08 18:32:21,230 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:32:21" (1/1) ...
[2024-11-08 18:32:21,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 18:32:21,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 18:32:21,302 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-08 18:32:21,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-08 18:32:21,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-11-08 18:32:21,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-08 18:32:21,355 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2024-11-08 18:32:21,355 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2024-11-08 18:32:21,355 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2024-11-08 18:32:21,355 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2024-11-08 18:32:21,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-08 18:32:21,356 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-11-08 18:32:21,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-08 18:32:21,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-08 18:32:21,360 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-11-08 18:32:21,545 INFO L238 CfgBuilder]: Building ICFG
[2024-11-08 18:32:21,548 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-08 18:32:21,950 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-11-08 18:32:21,950 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-08 18:32:22,397 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-08 18:32:22,398 INFO L316 CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-08 18:32:22,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:32:22 BoogieIcfgContainer
[2024-11-08 18:32:22,399 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-08 18:32:22,403 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-08 18:32:22,403 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-08 18:32:22,409 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-08 18:32:22,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:32:20" (1/3) ...
[2024-11-08 18:32:22,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e150b85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:32:22, skipping insertion in model container
[2024-11-08 18:32:22,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:32:21" (2/3) ...
[2024-11-08 18:32:22,413 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e150b85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:32:22, skipping insertion in model container
[2024-11-08 18:32:22,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:32:22" (3/3) ...
[2024-11-08 18:32:22,429 INFO L112 eAbstractionObserver]: Analyzing ICFG mix041_power.oepc_pso.oepc_rmo.oepc.i
[2024-11-08 18:32:22,468 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-08 18:32:22,468 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-11-08 18:32:22,469 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-11-08 18:32:22,551 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-11-08 18:32:22,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 37 transitions, 82 flow
[2024-11-08 18:32:22,643 INFO L124 PetriNetUnfolderBase]: 2/35 cut-off events.
[2024-11-08 18:32:22,644 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-08 18:32:22,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 35 events. 2/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 58 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place.
[2024-11-08 18:32:22,648 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 37 transitions, 82 flow
[2024-11-08 18:32:22,652 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 35 transitions, 76 flow
[2024-11-08 18:32:22,671 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-08 18:32:22,680 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@32c284ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-08 18:32:22,680 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-11-08 18:32:22,685 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-11-08 18:32:22,686 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events.
[2024-11-08 18:32:22,686 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-08 18:32:22,686 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 18:32:22,687 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2024-11-08 18:32:22,688 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] ===
[2024-11-08 18:32:22,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:32:22,696 INFO L85 PathProgramCache]: Analyzing trace with hash 10852339, now seen corresponding path program 1 times
[2024-11-08 18:32:22,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:32:22,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079619960]
[2024-11-08 18:32:22,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:32:22,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:32:22,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:32:23,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 18:32:23,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:32:23,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079619960]
[2024-11-08 18:32:23,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079619960] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:32:23,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:32:23,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-08 18:32:23,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090874989]
[2024-11-08 18:32:23,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:32:23,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 18:32:23,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:32:23,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 18:32:23,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 18:32:23,467 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 37
[2024-11-08 18:32:23,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:32:23,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 18:32:23,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 37
[2024-11-08 18:32:23,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 18:32:23,899 INFO L124 PetriNetUnfolderBase]: 183/415 cut-off events.
[2024-11-08 18:32:23,899 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES.
[2024-11-08 18:32:23,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 749 conditions, 415 events. 183/415 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2225 event pairs, 21 based on Foata normal form. 32/439 useless extension candidates. Maximal degree in co-relation 739. Up to 265 conditions per place.
[2024-11-08 18:32:23,911 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 25 selfloop transitions, 2 changer transitions 2/43 dead transitions.
[2024-11-08 18:32:23,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 43 transitions, 153 flow
[2024-11-08 18:32:23,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 18:32:23,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-08 18:32:23,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions.
[2024-11-08 18:32:23,929 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7387387387387387
[2024-11-08 18:32:23,932 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 76 flow. Second operand 3 states and 82 transitions.
[2024-11-08 18:32:23,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 43 transitions, 153 flow
[2024-11-08 18:32:23,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 43 transitions, 150 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-08 18:32:23,940 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 68 flow
[2024-11-08 18:32:23,943 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=38, PETRI_TRANSITIONS=30}
[2024-11-08 18:32:23,949 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places.
[2024-11-08 18:32:23,950 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 68 flow
[2024-11-08 18:32:23,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:32:23,952 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 18:32:23,952 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:32:23,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-08 18:32:23,953 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] ===
[2024-11-08 18:32:23,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:32:23,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1742249253, now seen corresponding path program 1 times
[2024-11-08 18:32:23,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:32:23,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110879643]
[2024-11-08 18:32:23,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:32:23,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:32:24,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:32:24,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 18:32:24,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:32:24,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110879643]
[2024-11-08 18:32:24,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110879643] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:32:24,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:32:24,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-08 18:32:24,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526748471]
[2024-11-08 18:32:24,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:32:24,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 18:32:24,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:32:24,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 18:32:24,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 18:32:24,106 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37
[2024-11-08 18:32:24,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:32:24,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 18:32:24,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37
[2024-11-08 18:32:24,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 18:32:24,308 INFO L124 PetriNetUnfolderBase]: 159/379 cut-off events.
[2024-11-08 18:32:24,308 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES.
[2024-11-08 18:32:24,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 703 conditions, 379 events. 159/379 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2039 event pairs, 159 based on Foata normal form. 16/372 useless extension candidates. Maximal degree in co-relation 693. Up to 280 conditions per place.
[2024-11-08 18:32:24,316 INFO L140 encePairwiseOnDemand]: 35/37 looper letters, 14 selfloop transitions, 1 changer transitions 1/29 dead transitions.
[2024-11-08 18:32:24,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 29 transitions, 98 flow
[2024-11-08 18:32:24,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 18:32:24,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-08 18:32:24,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions.
[2024-11-08 18:32:24,321 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5585585585585585
[2024-11-08 18:32:24,321 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 68 flow. Second operand 3 states and 62 transitions.
[2024-11-08 18:32:24,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 29 transitions, 98 flow
[2024-11-08 18:32:24,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 29 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-08 18:32:24,324 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 62 flow
[2024-11-08 18:32:24,325 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=36, PETRI_TRANSITIONS=28}
[2024-11-08 18:32:24,326 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places.
[2024-11-08 18:32:24,327 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 62 flow
[2024-11-08 18:32:24,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:32:24,328 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 18:32:24,328 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:32:24,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-08 18:32:24,329 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] ===
[2024-11-08 18:32:24,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:32:24,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1742250718, now seen corresponding path program 1 times
[2024-11-08 18:32:24,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:32:24,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040476122]
[2024-11-08 18:32:24,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:32:24,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:32:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:32:24,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 18:32:24,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:32:24,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040476122]
[2024-11-08 18:32:24,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040476122] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:32:24,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:32:24,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-08 18:32:24,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322679726]
[2024-11-08 18:32:24,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:32:24,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-08 18:32:24,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:32:24,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-08 18:32:24,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-08 18:32:24,765 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 37
[2024-11-08 18:32:24,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 62 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:32:24,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 18:32:24,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 37
[2024-11-08 18:32:24,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 18:32:25,254 INFO L124 PetriNetUnfolderBase]: 284/568 cut-off events.
[2024-11-08 18:32:25,255 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-08 18:32:25,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1079 conditions, 568 events. 284/568 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3066 event pairs, 51 based on Foata normal form. 0/541 useless extension candidates. Maximal degree in co-relation 1073. Up to 281 conditions per place.
[2024-11-08 18:32:25,262 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 21 selfloop transitions, 2 changer transitions 32/65 dead transitions.
[2024-11-08 18:32:25,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 65 transitions, 246 flow
[2024-11-08 18:32:25,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-08 18:32:25,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-11-08 18:32:25,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 161 transitions.
[2024-11-08 18:32:25,268 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.543918918918919
[2024-11-08 18:32:25,268 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 62 flow. Second operand 8 states and 161 transitions.
[2024-11-08 18:32:25,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 65 transitions, 246 flow
[2024-11-08 18:32:25,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 65 transitions, 245 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-11-08 18:32:25,272 INFO L231 Difference]: Finished difference. Result has 46 places, 27 transitions, 75 flow
[2024-11-08 18:32:25,273 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=75, PETRI_PLACES=46, PETRI_TRANSITIONS=27}
[2024-11-08 18:32:25,274 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places.
[2024-11-08 18:32:25,275 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 27 transitions, 75 flow
[2024-11-08 18:32:25,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:32:25,276 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 18:32:25,277 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:32:25,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-08 18:32:25,277 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] ===
[2024-11-08 18:32:25,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:32:25,278 INFO L85 PathProgramCache]: Analyzing trace with hash -473348070, now seen corresponding path program 1 times
[2024-11-08 18:32:25,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:32:25,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30389710]
[2024-11-08 18:32:25,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:32:25,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:32:25,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:32:25,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 18:32:25,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:32:25,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30389710]
[2024-11-08 18:32:25,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30389710] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:32:25,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:32:25,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 18:32:25,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17379615]
[2024-11-08 18:32:25,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:32:25,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 18:32:25,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:32:25,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 18:32:25,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-08 18:32:25,520 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 37
[2024-11-08 18:32:25,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 27 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:32:25,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 18:32:25,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 37
[2024-11-08 18:32:25,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 18:32:25,762 INFO L124 PetriNetUnfolderBase]: 198/426 cut-off events.
[2024-11-08 18:32:25,762 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES.
[2024-11-08 18:32:25,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 898 conditions, 426 events. 198/426 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1972 event pairs, 38 based on Foata normal form. 25/436 useless extension candidates. Maximal degree in co-relation 886. Up to 191 conditions per place.
[2024-11-08 18:32:25,767 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 31 selfloop transitions, 4 changer transitions 1/45 dead transitions.
[2024-11-08 18:32:25,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 45 transitions, 185 flow
[2024-11-08 18:32:25,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-08 18:32:25,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-08 18:32:25,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions.
[2024-11-08 18:32:25,771 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6081081081081081
[2024-11-08 18:32:25,771 INFO L175 Difference]: Start difference. First operand has 46 places, 27 transitions, 75 flow. Second operand 4 states and 90 transitions.
[2024-11-08 18:32:25,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 45 transitions, 185 flow
[2024-11-08 18:32:25,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 45 transitions, 173 flow, removed 4 selfloop flow, removed 6 redundant places.
[2024-11-08 18:32:25,780 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 89 flow
[2024-11-08 18:32:25,781 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=89, PETRI_PLACES=39, PETRI_TRANSITIONS=29}
[2024-11-08 18:32:25,782 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places.
[2024-11-08 18:32:25,784 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 89 flow
[2024-11-08 18:32:25,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:32:25,784 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 18:32:25,785 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:32:25,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-08 18:32:25,785 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] ===
[2024-11-08 18:32:25,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:32:25,788 INFO L85 PathProgramCache]: Analyzing trace with hash -311855967, now seen corresponding path program 1 times
[2024-11-08 18:32:25,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:32:25,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074279937]
[2024-11-08 18:32:25,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:32:25,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:32:25,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:32:26,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 18:32:26,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:32:26,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074279937]
[2024-11-08 18:32:26,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074279937] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:32:26,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:32:26,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-08 18:32:26,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583725554]
[2024-11-08 18:32:26,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:32:26,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-08 18:32:26,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:32:26,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-08 18:32:26,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-08 18:32:26,304 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 37
[2024-11-08 18:32:26,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 89 flow. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:32:26,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 18:32:26,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 37
[2024-11-08 18:32:26,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 18:32:26,500 INFO L124 PetriNetUnfolderBase]: 102/225 cut-off events.
[2024-11-08 18:32:26,500 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES.
[2024-11-08 18:32:26,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 531 conditions, 225 events. 102/225 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 749 event pairs, 26 based on Foata normal form. 16/231 useless extension candidates. Maximal degree in co-relation 521. Up to 86 conditions per place.
[2024-11-08 18:32:26,503 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 26 selfloop transitions, 6 changer transitions 1/42 dead transitions.
[2024-11-08 18:32:26,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 42 transitions, 186 flow
[2024-11-08 18:32:26,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-08 18:32:26,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-11-08 18:32:26,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions.
[2024-11-08 18:32:26,506 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5405405405405406
[2024-11-08 18:32:26,506 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 89 flow. Second operand 5 states and 100 transitions.
[2024-11-08 18:32:26,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 42 transitions, 186 flow
[2024-11-08 18:32:26,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 42 transitions, 173 flow, removed 2 selfloop flow, removed 3 redundant places.
[2024-11-08 18:32:26,510 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 101 flow
[2024-11-08 18:32:26,511 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=101, PETRI_PLACES=42, PETRI_TRANSITIONS=29}
[2024-11-08 18:32:26,512 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 2 predicate places.
[2024-11-08 18:32:26,515 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 101 flow
[2024-11-08 18:32:26,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:32:26,515 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 18:32:26,516 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:32:26,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-08 18:32:26,516 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] ===
[2024-11-08 18:32:26,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:32:26,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1875798284, now seen corresponding path program 1 times
[2024-11-08 18:32:26,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:32:26,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282051917]
[2024-11-08 18:32:26,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:32:26,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:32:26,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:32:27,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 18:32:27,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:32:27,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282051917]
[2024-11-08 18:32:27,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282051917] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:32:27,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:32:27,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-08 18:32:27,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298390817]
[2024-11-08 18:32:27,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:32:27,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-08 18:32:27,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:32:27,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-08 18:32:27,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2024-11-08 18:32:27,836 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37
[2024-11-08 18:32:27,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 101 flow. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:32:27,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 18:32:27,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37
[2024-11-08 18:32:27,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 18:32:28,264 INFO L124 PetriNetUnfolderBase]: 116/288 cut-off events.
[2024-11-08 18:32:28,265 INFO L125 PetriNetUnfolderBase]: For 132/132 co-relation queries the response was YES.
[2024-11-08 18:32:28,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 679 conditions, 288 events. 116/288 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1191 event pairs, 31 based on Foata normal form. 4/280 useless extension candidates. Maximal degree in co-relation 668. Up to 103 conditions per place.
[2024-11-08 18:32:28,267 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 23 selfloop transitions, 6 changer transitions 17/59 dead transitions.
[2024-11-08 18:32:28,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 59 transitions, 269 flow
[2024-11-08 18:32:28,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-08 18:32:28,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-11-08 18:32:28,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions.
[2024-11-08 18:32:28,269 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5371621621621622
[2024-11-08 18:32:28,269 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 101 flow. Second operand 8 states and 159 transitions.
[2024-11-08 18:32:28,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 59 transitions, 269 flow
[2024-11-08 18:32:28,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 59 transitions, 229 flow, removed 11 selfloop flow, removed 6 redundant places.
[2024-11-08 18:32:28,273 INFO L231 Difference]: Finished difference. Result has 48 places, 34 transitions, 118 flow
[2024-11-08 18:32:28,273 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=118, PETRI_PLACES=48, PETRI_TRANSITIONS=34}
[2024-11-08 18:32:28,274 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places.
[2024-11-08 18:32:28,274 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 34 transitions, 118 flow
[2024-11-08 18:32:28,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:32:28,275 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 18:32:28,275 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:32:28,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-08 18:32:28,275 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] ===
[2024-11-08 18:32:28,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:32:28,276 INFO L85 PathProgramCache]: Analyzing trace with hash -73270978, now seen corresponding path program 2 times
[2024-11-08 18:32:28,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:32:28,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048412304]
[2024-11-08 18:32:28,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:32:28,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:32:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:32:28,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 18:32:28,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:32:28,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048412304]
[2024-11-08 18:32:28,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048412304] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:32:28,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:32:28,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-08 18:32:28,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913408032]
[2024-11-08 18:32:28,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:32:28,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-08 18:32:28,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:32:28,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-08 18:32:28,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-08 18:32:28,651 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37
[2024-11-08 18:32:28,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 34 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:32:28,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 18:32:28,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37
[2024-11-08 18:32:28,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 18:32:28,920 INFO L124 PetriNetUnfolderBase]: 179/406 cut-off events.
[2024-11-08 18:32:28,920 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES.
[2024-11-08 18:32:28,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 956 conditions, 406 events. 179/406 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1810 event pairs, 84 based on Foata normal form. 4/395 useless extension candidates. Maximal degree in co-relation 944. Up to 163 conditions per place.
[2024-11-08 18:32:28,925 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 19 selfloop transitions, 5 changer transitions 19/53 dead transitions.
[2024-11-08 18:32:28,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 53 transitions, 265 flow
[2024-11-08 18:32:28,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-08 18:32:28,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-11-08 18:32:28,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions.
[2024-11-08 18:32:28,927 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4972972972972973
[2024-11-08 18:32:28,927 INFO L175 Difference]: Start difference. First operand has 48 places, 34 transitions, 118 flow. Second operand 5 states and 92 transitions.
[2024-11-08 18:32:28,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 53 transitions, 265 flow
[2024-11-08 18:32:28,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 255 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-11-08 18:32:28,930 INFO L231 Difference]: Finished difference. Result has 49 places, 32 transitions, 126 flow
[2024-11-08 18:32:28,931 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=126, PETRI_PLACES=49, PETRI_TRANSITIONS=32}
[2024-11-08 18:32:28,931 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 9 predicate places.
[2024-11-08 18:32:28,932 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 32 transitions, 126 flow
[2024-11-08 18:32:28,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:32:28,932 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 18:32:28,932 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:32:28,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-08 18:32:28,933 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] ===
[2024-11-08 18:32:28,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:32:28,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1872615202, now seen corresponding path program 3 times
[2024-11-08 18:32:28,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:32:28,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74908032]
[2024-11-08 18:32:28,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:32:28,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:32:29,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 18:32:29,055 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 18:32:29,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 18:32:29,191 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 18:32:29,191 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-08 18:32:29,192 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining)
[2024-11-08 18:32:29,195 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining)
[2024-11-08 18:32:29,195 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining)
[2024-11-08 18:32:29,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining)
[2024-11-08 18:32:29,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining)
[2024-11-08 18:32:29,197 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining)
[2024-11-08 18:32:29,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-08 18:32:29,197 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1]
[2024-11-08 18:32:29,269 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-11-08 18:32:29,269 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-08 18:32:29,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 06:32:29 BasicIcfg
[2024-11-08 18:32:29,276 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-08 18:32:29,277 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-08 18:32:29,277 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-08 18:32:29,277 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-08 18:32:29,278 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:32:22" (3/4) ...
[2024-11-08 18:32:29,282 INFO L145 WitnessPrinter]: No result that supports witness generation found
[2024-11-08 18:32:29,283 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-08 18:32:29,284 INFO L158 Benchmark]: Toolchain (without parser) took 9077.17ms. Allocated memory was 184.5MB in the beginning and 243.3MB in the end (delta: 58.7MB). Free memory was 150.5MB in the beginning and 165.8MB in the end (delta: -15.3MB). Peak memory consumption was 45.4MB. Max. memory is 16.1GB.
[2024-11-08 18:32:29,285 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 91.8MB in the end (delta: 29.0kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 18:32:29,285 INFO L158 Benchmark]: CACSL2BoogieTranslator took 862.65ms. Allocated memory is still 184.5MB. Free memory was 149.7MB in the beginning and 124.2MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2024-11-08 18:32:29,286 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.10ms. Allocated memory is still 184.5MB. Free memory was 124.2MB in the beginning and 122.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-11-08 18:32:29,286 INFO L158 Benchmark]: Boogie Preprocessor took 82.64ms. Allocated memory is still 184.5MB. Free memory was 122.1MB in the beginning and 118.3MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-11-08 18:32:29,287 INFO L158 Benchmark]: RCFGBuilder took 1174.76ms. Allocated memory is still 184.5MB. Free memory was 118.3MB in the beginning and 144.3MB in the end (delta: -25.9MB). Peak memory consumption was 47.0MB. Max. memory is 16.1GB.
[2024-11-08 18:32:29,287 INFO L158 Benchmark]: TraceAbstraction took 6873.33ms. Allocated memory was 184.5MB in the beginning and 243.3MB in the end (delta: 58.7MB). Free memory was 143.2MB in the beginning and 166.8MB in the end (delta: -23.6MB). Peak memory consumption was 36.2MB. Max. memory is 16.1GB.
[2024-11-08 18:32:29,292 INFO L158 Benchmark]: Witness Printer took 6.14ms. Allocated memory is still 243.3MB. Free memory was 166.8MB in the beginning and 165.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 18:32:29,295 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.34ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 91.8MB in the end (delta: 29.0kB). There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 862.65ms. Allocated memory is still 184.5MB. Free memory was 149.7MB in the beginning and 124.2MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 68.10ms. Allocated memory is still 184.5MB. Free memory was 124.2MB in the beginning and 122.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 82.64ms. Allocated memory is still 184.5MB. Free memory was 122.1MB in the beginning and 118.3MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 1174.76ms. Allocated memory is still 184.5MB. Free memory was 118.3MB in the beginning and 144.3MB in the end (delta: -25.9MB). Peak memory consumption was 47.0MB. Max. memory is 16.1GB.
* TraceAbstraction took 6873.33ms. Allocated memory was 184.5MB in the beginning and 243.3MB in the end (delta: 58.7MB). Free memory was 143.2MB in the beginning and 166.8MB in the end (delta: -23.6MB). Peak memory consumption was 36.2MB. Max. memory is 16.1GB.
* Witness Printer took 6.14ms. Allocated memory is still 243.3MB. Free memory was 166.8MB in the beginning and 165.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: overapproximation of memtrack at line 17.
Possible FailurePath:
[L708] 0 int __unbuffered_cnt = 0;
[L710] 0 int __unbuffered_p1_EAX = 0;
[L712] 0 int __unbuffered_p1_EBX = 0;
[L713] 0 _Bool main$tmp_guard0;
[L714] 0 _Bool main$tmp_guard1;
[L716] 0 int x = 0;
[L718] 0 int y = 0;
[L720] 0 int z = 0;
[L721] 0 _Bool z$flush_delayed;
[L722] 0 int z$mem_tmp;
[L723] 0 _Bool z$r_buff0_thd0;
[L724] 0 _Bool z$r_buff0_thd1;
[L725] 0 _Bool z$r_buff0_thd2;
[L726] 0 _Bool z$r_buff1_thd0;
[L727] 0 _Bool z$r_buff1_thd1;
[L728] 0 _Bool z$r_buff1_thd2;
[L729] 0 _Bool z$read_delayed;
[L730] 0 int *z$read_delayed_var;
[L731] 0 int z$w_buff0;
[L732] 0 _Bool z$w_buff0_used;
[L733] 0 int z$w_buff1;
[L734] 0 _Bool z$w_buff1_used;
[L735] 0 _Bool weak$$choice0;
[L736] 0 _Bool weak$$choice2;
[L815] 0 pthread_t t1089;
[L816] FCALL, FORK 0 pthread_create(&t1089, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1089=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L740] 1 z$w_buff1 = z$w_buff0
[L741] 1 z$w_buff0 = 1
[L742] 1 z$w_buff1_used = z$w_buff0_used
[L743] 1 z$w_buff0_used = (_Bool)1
[L744] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used))
[L18] COND FALSE 1 !(!expression)
[L744] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used))
[L745] 1 z$r_buff1_thd0 = z$r_buff0_thd0
[L746] 1 z$r_buff1_thd1 = z$r_buff0_thd1
[L747] 1 z$r_buff1_thd2 = z$r_buff0_thd2
[L748] 1 z$r_buff0_thd1 = (_Bool)1
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L817] 0 pthread_t t1090;
[L818] FCALL, FORK 0 pthread_create(&t1090, ((void *)0), P1, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1089=-2, t1090=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L751] 1 x = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L768] 2 x = 2
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L771] 2 y = 1
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L774] 2 __unbuffered_p1_EAX = y
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L777] 2 weak$$choice0 = __VERIFIER_nondet_bool()
[L778] 2 weak$$choice2 = __VERIFIER_nondet_bool()
[L779] 2 z$flush_delayed = weak$$choice2
[L780] 2 z$mem_tmp = z
[L781] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)
[L782] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))
[L783] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))
[L784] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))
[L785] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L786] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))
[L787] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L788] 2 __unbuffered_p1_EBX = z
[L789] 2 z = z$flush_delayed ? z$mem_tmp : z
[L790] 2 z$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L793] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)
[L794] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used
[L795] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used
[L796] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2
[L797] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z)
[L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used
[L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used
[L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1
[L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L820] 0 main$tmp_guard0 = __unbuffered_cnt == 2
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1089=-2, t1090=-1, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L822] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L3] COND FALSE 0 !(!cond)
[L822] RET 0 assume_abort_if_not(main$tmp_guard0)
[L824] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L825] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L826] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L827] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L828] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1089=-2, t1090=-1, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L831] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0)
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1089=-2, t1090=-1, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L833] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L18] COND TRUE 0 !expression
[L18] CALL 0 reach_error()
[L17] COND FALSE 0 !(0)
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L17] 0 __assert_fail ("0", "mix041_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__)
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
- UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: Not analyzed.
- UnprovableResult [Line: 813]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: Not analyzed.
- UnprovableResult [Line: 818]: 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: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
CFG has 5 procedures, 55 locations, 6 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: 6.6s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 156 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 150 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 540 IncrementalHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 3 mSDtfsCounter, 540 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126occurred in iteration=7, InterpolantAutomatonStates: 36, 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.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 142 NumberOfCodeBlocks, 142 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 110 ConstructedInterpolants, 0 QuantifiedInterpolants, 463 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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
[2024-11-08 18:32:29,345 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix041_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX --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 8a4342b982522a964cfb4ed0b81a3c247fa38eb769cbb37584570f60425c66cb
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-a016563
[2024-11-08 18:32:32,333 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-08 18:32:32,427 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf
[2024-11-08 18:32:32,432 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-08 18:32:32,433 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-08 18:32:32,478 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-08 18:32:32,478 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-08 18:32:32,479 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-08 18:32:32,482 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-08 18:32:32,483 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-08 18:32:32,484 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-08 18:32:32,485 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-08 18:32:32,486 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-08 18:32:32,486 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-08 18:32:32,489 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-08 18:32:32,489 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-08 18:32:32,490 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-08 18:32:32,490 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-08 18:32:32,490 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-08 18:32:32,491 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-08 18:32:32,491 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2024-11-08 18:32:32,495 INFO L153 SettingsManager]: * Bitprecise bitfields=true
[2024-11-08 18:32:32,495 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2024-11-08 18:32:32,496 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-08 18:32:32,496 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-08 18:32:32,496 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-11-08 18:32:32,496 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-08 18:32:32,497 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-08 18:32:32,497 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-11-08 18:32:32,497 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-08 18:32:32,498 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-08 18:32:32,498 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-08 18:32:32,498 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-08 18:32:32,501 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-08 18:32:32,502 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-08 18:32:32,502 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 18:32:32,503 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-08 18:32:32,504 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-08 18:32:32,504 INFO L153 SettingsManager]: * Trace refinement strategy=FOX
[2024-11-08 18:32:32,504 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-08 18:32:32,504 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-08 18:32:32,505 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-08 18:32:32,516 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-08 18:32:32,517 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-08 18:32:32,517 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_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/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_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX
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 -> 8a4342b982522a964cfb4ed0b81a3c247fa38eb769cbb37584570f60425c66cb
[2024-11-08 18:32:32,976 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-08 18:32:33,011 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-08 18:32:33,016 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-08 18:32:33,017 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-08 18:32:33,018 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-08 18:32:33,020 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/pthread-wmm/mix041_power.oepc_pso.oepc_rmo.oepc.i
Unable to find full path for "g++"
[2024-11-08 18:32:35,232 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-08 18:32:35,638 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-08 18:32:35,639 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/sv-benchmarks/c/pthread-wmm/mix041_power.oepc_pso.oepc_rmo.oepc.i
[2024-11-08 18:32:35,656 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/data/9341bed58/1382692230354353bce94595e4168378/FLAG9b0fe4be9
[2024-11-08 18:32:35,681 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/data/9341bed58/1382692230354353bce94595e4168378
[2024-11-08 18:32:35,686 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-08 18:32:35,688 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-08 18:32:35,691 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-08 18:32:35,693 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-08 18:32:35,700 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-08 18:32:35,701 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:32:35" (1/1) ...
[2024-11-08 18:32:35,703 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ad906c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:32:35, skipping insertion in model container
[2024-11-08 18:32:35,703 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:32:35" (1/1) ...
[2024-11-08 18:32:35,785 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-08 18:32:36,474 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 18:32:36,517 INFO L200 MainTranslator]: Completed pre-run
[2024-11-08 18:32:36,589 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 18:32:36,651 INFO L204 MainTranslator]: Completed translation
[2024-11-08 18:32:36,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:32:36 WrapperNode
[2024-11-08 18:32:36,652 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-08 18:32:36,654 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-08 18:32:36,654 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-08 18:32:36,654 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-08 18:32:36,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:32:36" (1/1) ...
[2024-11-08 18:32:36,691 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:32:36" (1/1) ...
[2024-11-08 18:32:36,738 INFO L138 Inliner]: procedures = 175, calls = 38, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 110
[2024-11-08 18:32:36,738 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-08 18:32:36,739 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-08 18:32:36,742 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-08 18:32:36,743 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-08 18:32:36,760 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:32:36" (1/1) ...
[2024-11-08 18:32:36,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:32:36" (1/1) ...
[2024-11-08 18:32:36,769 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:32:36" (1/1) ...
[2024-11-08 18:32:36,809 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-11-08 18:32:36,812 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:32:36" (1/1) ...
[2024-11-08 18:32:36,812 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:32:36" (1/1) ...
[2024-11-08 18:32:36,829 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:32:36" (1/1) ...
[2024-11-08 18:32:36,836 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:32:36" (1/1) ...
[2024-11-08 18:32:36,842 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:32:36" (1/1) ...
[2024-11-08 18:32:36,844 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:32:36" (1/1) ...
[2024-11-08 18:32:36,855 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-08 18:32:36,860 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-08 18:32:36,860 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-08 18:32:36,861 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-08 18:32:36,862 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:32:36" (1/1) ...
[2024-11-08 18:32:36,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 18:32:36,885 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 18:32:36,901 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-08 18:32:36,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-08 18:32:36,952 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-11-08 18:32:36,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-08 18:32:36,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-08 18:32:36,953 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2024-11-08 18:32:36,953 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2024-11-08 18:32:36,954 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2024-11-08 18:32:36,954 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2024-11-08 18:32:36,954 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-11-08 18:32:36,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-08 18:32:36,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-08 18:32:36,958 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-11-08 18:32:37,176 INFO L238 CfgBuilder]: Building ICFG
[2024-11-08 18:32:37,179 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-08 18:32:37,662 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-11-08 18:32:37,662 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-08 18:32:38,013 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-08 18:32:38,015 INFO L316 CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-08 18:32:38,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:32:38 BoogieIcfgContainer
[2024-11-08 18:32:38,016 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-08 18:32:38,018 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-08 18:32:38,020 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-08 18:32:38,024 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-08 18:32:38,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:32:35" (1/3) ...
[2024-11-08 18:32:38,026 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43bb50dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:32:38, skipping insertion in model container
[2024-11-08 18:32:38,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:32:36" (2/3) ...
[2024-11-08 18:32:38,027 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43bb50dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:32:38, skipping insertion in model container
[2024-11-08 18:32:38,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:32:38" (3/3) ...
[2024-11-08 18:32:38,029 INFO L112 eAbstractionObserver]: Analyzing ICFG mix041_power.oepc_pso.oepc_rmo.oepc.i
[2024-11-08 18:32:38,053 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-08 18:32:38,054 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-11-08 18:32:38,054 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-11-08 18:32:38,138 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-11-08 18:32:38,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 37 transitions, 82 flow
[2024-11-08 18:32:38,233 INFO L124 PetriNetUnfolderBase]: 2/35 cut-off events.
[2024-11-08 18:32:38,235 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-08 18:32:38,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 35 events. 2/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 58 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place.
[2024-11-08 18:32:38,240 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 37 transitions, 82 flow
[2024-11-08 18:32:38,246 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 35 transitions, 76 flow
[2024-11-08 18:32:38,263 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-08 18:32:38,273 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@17427f42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-08 18:32:38,274 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-11-08 18:32:38,280 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-11-08 18:32:38,281 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events.
[2024-11-08 18:32:38,281 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-08 18:32:38,283 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 18:32:38,284 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2024-11-08 18:32:38,285 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] ===
[2024-11-08 18:32:38,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:32:38,292 INFO L85 PathProgramCache]: Analyzing trace with hash 10913907, now seen corresponding path program 1 times
[2024-11-08 18:32:38,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 18:32:38,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [34022917]
[2024-11-08 18:32:38,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:32:38,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:32:38,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 18:32:38,313 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 18:32:38,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-08 18:32:38,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:32:38,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-08 18:32:38,469 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 18:32:38,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 18:32:38,517 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 18:32:38,519 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 18:32:38,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34022917]
[2024-11-08 18:32:38,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34022917] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:32:38,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:32:38,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-08 18:32:38,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868704139]
[2024-11-08 18:32:38,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:32:38,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 18:32:38,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 18:32:38,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 18:32:38,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 18:32:38,596 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 37
[2024-11-08 18:32:38,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:32:38,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 18:32:38,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 37
[2024-11-08 18:32:38,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 18:32:38,872 INFO L124 PetriNetUnfolderBase]: 183/415 cut-off events.
[2024-11-08 18:32:38,873 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES.
[2024-11-08 18:32:38,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 749 conditions, 415 events. 183/415 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2225 event pairs, 21 based on Foata normal form. 32/439 useless extension candidates. Maximal degree in co-relation 739. Up to 265 conditions per place.
[2024-11-08 18:32:38,880 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 25 selfloop transitions, 2 changer transitions 2/43 dead transitions.
[2024-11-08 18:32:38,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 43 transitions, 153 flow
[2024-11-08 18:32:38,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 18:32:38,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-08 18:32:38,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions.
[2024-11-08 18:32:38,895 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7387387387387387
[2024-11-08 18:32:38,898 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 76 flow. Second operand 3 states and 82 transitions.
[2024-11-08 18:32:38,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 43 transitions, 153 flow
[2024-11-08 18:32:38,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 43 transitions, 150 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-08 18:32:38,905 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 68 flow
[2024-11-08 18:32:38,907 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=38, PETRI_TRANSITIONS=30}
[2024-11-08 18:32:38,911 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places.
[2024-11-08 18:32:38,912 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 68 flow
[2024-11-08 18:32:38,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:32:38,913 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 18:32:38,913 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:32:38,939 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-11-08 18:32:39,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:32:39,114 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] ===
[2024-11-08 18:32:39,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:32:39,118 INFO L85 PathProgramCache]: Analyzing trace with hash -868435033, now seen corresponding path program 1 times
[2024-11-08 18:32:39,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 18:32:39,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [188126994]
[2024-11-08 18:32:39,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:32:39,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:32:39,120 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 18:32:39,122 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 18:32:39,125 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-11-08 18:32:39,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:32:39,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-08 18:32:39,268 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 18:32:39,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 18:32:39,331 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 18:32:39,332 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 18:32:39,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188126994]
[2024-11-08 18:32:39,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188126994] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:32:39,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:32:39,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-08 18:32:39,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906355407]
[2024-11-08 18:32:39,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:32:39,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 18:32:39,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 18:32:39,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 18:32:39,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 18:32:39,343 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37
[2024-11-08 18:32:39,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:32:39,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 18:32:39,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37
[2024-11-08 18:32:39,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 18:32:39,550 INFO L124 PetriNetUnfolderBase]: 159/379 cut-off events.
[2024-11-08 18:32:39,550 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES.
[2024-11-08 18:32:39,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 703 conditions, 379 events. 159/379 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2054 event pairs, 159 based on Foata normal form. 16/372 useless extension candidates. Maximal degree in co-relation 693. Up to 280 conditions per place.
[2024-11-08 18:32:39,558 INFO L140 encePairwiseOnDemand]: 35/37 looper letters, 14 selfloop transitions, 1 changer transitions 1/29 dead transitions.
[2024-11-08 18:32:39,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 29 transitions, 98 flow
[2024-11-08 18:32:39,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 18:32:39,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-08 18:32:39,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions.
[2024-11-08 18:32:39,563 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5585585585585585
[2024-11-08 18:32:39,563 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 68 flow. Second operand 3 states and 62 transitions.
[2024-11-08 18:32:39,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 29 transitions, 98 flow
[2024-11-08 18:32:39,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 29 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-08 18:32:39,565 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 62 flow
[2024-11-08 18:32:39,565 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=36, PETRI_TRANSITIONS=28}
[2024-11-08 18:32:39,566 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places.
[2024-11-08 18:32:39,567 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 62 flow
[2024-11-08 18:32:39,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:32:39,568 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 18:32:39,569 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:32:39,593 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2024-11-08 18:32:39,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:32:39,771 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] ===
[2024-11-08 18:32:39,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:32:39,772 INFO L85 PathProgramCache]: Analyzing trace with hash -868433568, now seen corresponding path program 1 times
[2024-11-08 18:32:39,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 18:32:39,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2109604570]
[2024-11-08 18:32:39,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:32:39,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:32:39,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 18:32:39,776 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 18:32:39,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-11-08 18:32:39,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:32:39,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-08 18:32:39,899 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 18:32:39,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 18:32:39,948 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 18:32:39,948 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 18:32:39,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109604570]
[2024-11-08 18:32:39,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109604570] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:32:39,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:32:39,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 18:32:39,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194894216]
[2024-11-08 18:32:39,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:32:39,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 18:32:39,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 18:32:39,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 18:32:39,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-08 18:32:39,957 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 37
[2024-11-08 18:32:39,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:32:39,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 18:32:39,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 37
[2024-11-08 18:32:39,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 18:32:40,205 INFO L124 PetriNetUnfolderBase]: 198/442 cut-off events.
[2024-11-08 18:32:40,206 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-08 18:32:40,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 822 conditions, 442 events. 198/442 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2172 event pairs, 38 based on Foata normal form. 25/452 useless extension candidates. Maximal degree in co-relation 816. Up to 191 conditions per place.
[2024-11-08 18:32:40,209 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 31 selfloop transitions, 4 changer transitions 1/46 dead transitions.
[2024-11-08 18:32:40,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 46 transitions, 172 flow
[2024-11-08 18:32:40,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-08 18:32:40,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-08 18:32:40,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions.
[2024-11-08 18:32:40,212 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6081081081081081
[2024-11-08 18:32:40,212 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 62 flow. Second operand 4 states and 90 transitions.
[2024-11-08 18:32:40,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 46 transitions, 172 flow
[2024-11-08 18:32:40,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 46 transitions, 171 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-11-08 18:32:40,215 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 87 flow
[2024-11-08 18:32:40,216 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=87, PETRI_PLACES=39, PETRI_TRANSITIONS=30}
[2024-11-08 18:32:40,216 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places.
[2024-11-08 18:32:40,217 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 87 flow
[2024-11-08 18:32:40,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:32:40,217 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 18:32:40,218 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:32:40,245 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2024-11-08 18:32:40,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:32:40,419 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] ===
[2024-11-08 18:32:40,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:32:40,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1740384581, now seen corresponding path program 1 times
[2024-11-08 18:32:40,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 18:32:40,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [435002746]
[2024-11-08 18:32:40,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:32:40,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:32:40,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 18:32:40,426 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 18:32:40,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-11-08 18:32:40,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:32:40,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-08 18:32:40,558 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 18:32:40,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 18:32:40,625 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 18:32:40,626 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 18:32:40,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435002746]
[2024-11-08 18:32:40,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435002746] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:32:40,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:32:40,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-08 18:32:40,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350433879]
[2024-11-08 18:32:40,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:32:40,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-08 18:32:40,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 18:32:40,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-08 18:32:40,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-08 18:32:40,646 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 37
[2024-11-08 18:32:40,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 87 flow. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:32:40,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 18:32:40,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 37
[2024-11-08 18:32:40,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 18:32:40,876 INFO L124 PetriNetUnfolderBase]: 102/229 cut-off events.
[2024-11-08 18:32:40,877 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES.
[2024-11-08 18:32:40,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 527 conditions, 229 events. 102/229 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 780 event pairs, 26 based on Foata normal form. 16/235 useless extension candidates. Maximal degree in co-relation 518. Up to 86 conditions per place.
[2024-11-08 18:32:40,879 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 26 selfloop transitions, 6 changer transitions 1/43 dead transitions.
[2024-11-08 18:32:40,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 184 flow
[2024-11-08 18:32:40,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-08 18:32:40,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-11-08 18:32:40,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions.
[2024-11-08 18:32:40,883 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5405405405405406
[2024-11-08 18:32:40,883 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 87 flow. Second operand 5 states and 100 transitions.
[2024-11-08 18:32:40,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 184 flow
[2024-11-08 18:32:40,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 43 transitions, 175 flow, removed 1 selfloop flow, removed 2 redundant places.
[2024-11-08 18:32:40,897 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 103 flow
[2024-11-08 18:32:40,897 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=103, PETRI_PLACES=43, PETRI_TRANSITIONS=30}
[2024-11-08 18:32:40,898 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places.
[2024-11-08 18:32:40,898 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 103 flow
[2024-11-08 18:32:40,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:32:40,899 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 18:32:40,899 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:32:40,925 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-11-08 18:32:41,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:32:41,100 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] ===
[2024-11-08 18:32:41,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:32:41,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1591535118, now seen corresponding path program 1 times
[2024-11-08 18:32:41,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 18:32:41,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [908088854]
[2024-11-08 18:32:41,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:32:41,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:32:41,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 18:32:41,104 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 18:32:41,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-11-08 18:32:41,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:32:41,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 13 conjuncts are in the unsatisfiable core
[2024-11-08 18:32:41,249 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 18:32:41,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 18:32:41,749 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 18:32:41,750 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 18:32:41,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908088854]
[2024-11-08 18:32:41,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908088854] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:32:41,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:32:41,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-08 18:32:41,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014456433]
[2024-11-08 18:32:41,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:32:41,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-08 18:32:41,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 18:32:41,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-08 18:32:41,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-11-08 18:32:41,786 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37
[2024-11-08 18:32:41,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 103 flow. Second operand has 9 states, 9 states have (on average 15.666666666666666) internal successors, (141), 9 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:32:41,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 18:32:41,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37
[2024-11-08 18:32:41,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 18:32:42,251 INFO L124 PetriNetUnfolderBase]: 99/249 cut-off events.
[2024-11-08 18:32:42,252 INFO L125 PetriNetUnfolderBase]: For 101/101 co-relation queries the response was YES.
[2024-11-08 18:32:42,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 574 conditions, 249 events. 99/249 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 912 event pairs, 19 based on Foata normal form. 4/247 useless extension candidates. Maximal degree in co-relation 563. Up to 59 conditions per place.
[2024-11-08 18:32:42,255 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 23 selfloop transitions, 4 changer transitions 20/60 dead transitions.
[2024-11-08 18:32:42,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 60 transitions, 271 flow
[2024-11-08 18:32:42,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-11-08 18:32:42,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-11-08 18:32:42,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 188 transitions.
[2024-11-08 18:32:42,258 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5081081081081081
[2024-11-08 18:32:42,258 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 103 flow. Second operand 10 states and 188 transitions.
[2024-11-08 18:32:42,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 60 transitions, 271 flow
[2024-11-08 18:32:42,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 60 transitions, 234 flow, removed 8 selfloop flow, removed 6 redundant places.
[2024-11-08 18:32:42,262 INFO L231 Difference]: Finished difference. Result has 51 places, 30 transitions, 95 flow
[2024-11-08 18:32:42,262 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=95, PETRI_PLACES=51, PETRI_TRANSITIONS=30}
[2024-11-08 18:32:42,263 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places.
[2024-11-08 18:32:42,263 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 30 transitions, 95 flow
[2024-11-08 18:32:42,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.666666666666666) internal successors, (141), 9 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:32:42,264 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 18:32:42,264 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:32:42,293 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2024-11-08 18:32:42,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:32:42,466 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] ===
[2024-11-08 18:32:42,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:32:42,467 INFO L85 PathProgramCache]: Analyzing trace with hash -357534144, now seen corresponding path program 2 times
[2024-11-08 18:32:42,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 18:32:42,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [662713229]
[2024-11-08 18:32:42,468 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-08 18:32:42,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:32:42,468 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 18:32:42,470 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 18:32:42,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-11-08 18:32:42,597 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-11-08 18:32:42,597 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 18:32:42,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 11 conjuncts are in the unsatisfiable core
[2024-11-08 18:32:42,602 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 18:32:42,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 18:32:42,811 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 18:32:42,811 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 18:32:42,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662713229]
[2024-11-08 18:32:42,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662713229] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:32:42,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:32:42,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-11-08 18:32:42,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349568630]
[2024-11-08 18:32:42,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:32:42,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-11-08 18:32:42,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 18:32:42,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-11-08 18:32:42,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2024-11-08 18:32:42,885 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37
[2024-11-08 18:32:42,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 30 transitions, 95 flow. Second operand has 10 states, 10 states have (on average 11.9) internal successors, (119), 10 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:32:42,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 18:32:42,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37
[2024-11-08 18:32:42,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 18:32:43,416 INFO L124 PetriNetUnfolderBase]: 201/449 cut-off events.
[2024-11-08 18:32:43,417 INFO L125 PetriNetUnfolderBase]: For 114/115 co-relation queries the response was YES.
[2024-11-08 18:32:43,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1042 conditions, 449 events. 201/449 cut-off events. For 114/115 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1834 event pairs, 57 based on Foata normal form. 8/451 useless extension candidates. Maximal degree in co-relation 1029. Up to 127 conditions per place.
[2024-11-08 18:32:43,420 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 24 selfloop transitions, 5 changer transitions 46/82 dead transitions.
[2024-11-08 18:32:43,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 82 transitions, 399 flow
[2024-11-08 18:32:43,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2024-11-08 18:32:43,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2024-11-08 18:32:43,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 197 transitions.
[2024-11-08 18:32:43,422 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4436936936936937
[2024-11-08 18:32:43,422 INFO L175 Difference]: Start difference. First operand has 51 places, 30 transitions, 95 flow. Second operand 12 states and 197 transitions.
[2024-11-08 18:32:43,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 82 transitions, 399 flow
[2024-11-08 18:32:43,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 82 transitions, 357 flow, removed 10 selfloop flow, removed 8 redundant places.
[2024-11-08 18:32:43,427 INFO L231 Difference]: Finished difference. Result has 57 places, 30 transitions, 107 flow
[2024-11-08 18:32:43,428 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=107, PETRI_PLACES=57, PETRI_TRANSITIONS=30}
[2024-11-08 18:32:43,428 INFO L277 CegarLoopForPetriNet]: 40 programPoint places, 17 predicate places.
[2024-11-08 18:32:43,429 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 30 transitions, 107 flow
[2024-11-08 18:32:43,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.9) internal successors, (119), 10 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 18:32:43,429 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-08 18:32:43,429 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:32:43,454 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2024-11-08 18:32:43,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:32:43,634 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 3 more)] ===
[2024-11-08 18:32:43,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:32:43,635 INFO L85 PathProgramCache]: Analyzing trace with hash -935018700, now seen corresponding path program 3 times
[2024-11-08 18:32:43,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 18:32:43,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1969239657]
[2024-11-08 18:32:43,636 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-08 18:32:43,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:32:43,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 18:32:43,638 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 18:32:43,641 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2024-11-08 18:32:43,746 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2024-11-08 18:32:43,746 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat
[2024-11-08 18:32:43,747 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 18:32:43,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 18:32:43,834 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace
[2024-11-08 18:32:43,834 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-08 18:32:43,835 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 6 remaining)
[2024-11-08 18:32:43,838 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 6 remaining)
[2024-11-08 18:32:43,838 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 6 remaining)
[2024-11-08 18:32:43,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining)
[2024-11-08 18:32:43,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining)
[2024-11-08 18:32:43,839 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 6 remaining)
[2024-11-08 18:32:43,863 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2024-11-08 18:32:44,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 18:32:44,040 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1]
[2024-11-08 18:32:44,117 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-11-08 18:32:44,117 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-08 18:32:44,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 06:32:44 BasicIcfg
[2024-11-08 18:32:44,131 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-08 18:32:44,132 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-08 18:32:44,132 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-08 18:32:44,132 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-08 18:32:44,133 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:32:38" (3/4) ...
[2024-11-08 18:32:44,135 INFO L145 WitnessPrinter]: No result that supports witness generation found
[2024-11-08 18:32:44,136 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-08 18:32:44,137 INFO L158 Benchmark]: Toolchain (without parser) took 8449.80ms. Allocated memory was 81.8MB in the beginning and 157.3MB in the end (delta: 75.5MB). Free memory was 56.5MB in the beginning and 66.6MB in the end (delta: -10.1MB). Peak memory consumption was 65.6MB. Max. memory is 16.1GB.
[2024-11-08 18:32:44,138 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 81.8MB. Free memory was 58.4MB in the beginning and 58.3MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 18:32:44,139 INFO L158 Benchmark]: CACSL2BoogieTranslator took 961.67ms. Allocated memory was 81.8MB in the beginning and 107.0MB in the end (delta: 25.2MB). Free memory was 56.3MB in the beginning and 75.9MB in the end (delta: -19.6MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB.
[2024-11-08 18:32:44,139 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.87ms. Allocated memory is still 107.0MB. Free memory was 75.5MB in the beginning and 73.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-11-08 18:32:44,143 INFO L158 Benchmark]: Boogie Preprocessor took 116.16ms. Allocated memory is still 107.0MB. Free memory was 73.3MB in the beginning and 70.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-11-08 18:32:44,144 INFO L158 Benchmark]: RCFGBuilder took 1155.79ms. Allocated memory is still 107.0MB. Free memory was 70.1MB in the beginning and 71.4MB in the end (delta: -1.3MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB.
[2024-11-08 18:32:44,144 INFO L158 Benchmark]: TraceAbstraction took 6113.29ms. Allocated memory was 107.0MB in the beginning and 157.3MB in the end (delta: 50.3MB). Free memory was 70.7MB in the beginning and 66.6MB in the end (delta: 4.1MB). Peak memory consumption was 53.6MB. Max. memory is 16.1GB.
[2024-11-08 18:32:44,145 INFO L158 Benchmark]: Witness Printer took 4.76ms. Allocated memory is still 157.3MB. Free memory is still 66.6MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 18:32:44,148 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.39ms. Allocated memory is still 81.8MB. Free memory was 58.4MB in the beginning and 58.3MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 961.67ms. Allocated memory was 81.8MB in the beginning and 107.0MB in the end (delta: 25.2MB). Free memory was 56.3MB in the beginning and 75.9MB in the end (delta: -19.6MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 84.87ms. Allocated memory is still 107.0MB. Free memory was 75.5MB in the beginning and 73.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 116.16ms. Allocated memory is still 107.0MB. Free memory was 73.3MB in the beginning and 70.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
* RCFGBuilder took 1155.79ms. Allocated memory is still 107.0MB. Free memory was 70.1MB in the beginning and 71.4MB in the end (delta: -1.3MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB.
* TraceAbstraction took 6113.29ms. Allocated memory was 107.0MB in the beginning and 157.3MB in the end (delta: 50.3MB). Free memory was 70.7MB in the beginning and 66.6MB in the end (delta: 4.1MB). Peak memory consumption was 53.6MB. Max. memory is 16.1GB.
* Witness Printer took 4.76ms. Allocated memory is still 157.3MB. Free memory is still 66.6MB. There was no memory consumed. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: overapproximation of memtrack at line 17.
Possible FailurePath:
[L708] 0 int __unbuffered_cnt = 0;
[L710] 0 int __unbuffered_p1_EAX = 0;
[L712] 0 int __unbuffered_p1_EBX = 0;
[L713] 0 _Bool main$tmp_guard0;
[L714] 0 _Bool main$tmp_guard1;
[L716] 0 int x = 0;
[L718] 0 int y = 0;
[L720] 0 int z = 0;
[L721] 0 _Bool z$flush_delayed;
[L722] 0 int z$mem_tmp;
[L723] 0 _Bool z$r_buff0_thd0;
[L724] 0 _Bool z$r_buff0_thd1;
[L725] 0 _Bool z$r_buff0_thd2;
[L726] 0 _Bool z$r_buff1_thd0;
[L727] 0 _Bool z$r_buff1_thd1;
[L728] 0 _Bool z$r_buff1_thd2;
[L729] 0 _Bool z$read_delayed;
[L730] 0 int *z$read_delayed_var;
[L731] 0 int z$w_buff0;
[L732] 0 _Bool z$w_buff0_used;
[L733] 0 int z$w_buff1;
[L734] 0 _Bool z$w_buff1_used;
[L735] 0 _Bool weak$$choice0;
[L736] 0 _Bool weak$$choice2;
[L815] 0 pthread_t t1089;
[L816] FCALL, FORK 0 pthread_create(&t1089, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1089=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L740] 1 z$w_buff1 = z$w_buff0
[L741] 1 z$w_buff0 = 1
[L742] 1 z$w_buff1_used = z$w_buff0_used
[L743] 1 z$w_buff0_used = (_Bool)1
[L744] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used))
[L18] COND FALSE 1 !(!expression)
[L744] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used))
[L745] 1 z$r_buff1_thd0 = z$r_buff0_thd0
[L746] 1 z$r_buff1_thd1 = z$r_buff0_thd1
[L747] 1 z$r_buff1_thd2 = z$r_buff0_thd2
[L748] 1 z$r_buff0_thd1 = (_Bool)1
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L817] 0 pthread_t t1090;
[L818] FCALL, FORK 0 pthread_create(&t1090, ((void *)0), P1, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1089=-1, t1090=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L751] 1 x = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L768] 2 x = 2
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L771] 2 y = 1
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L774] 2 __unbuffered_p1_EAX = y
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L777] 2 weak$$choice0 = __VERIFIER_nondet_bool()
[L778] 2 weak$$choice2 = __VERIFIER_nondet_bool()
[L779] 2 z$flush_delayed = weak$$choice2
[L780] 2 z$mem_tmp = z
[L781] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)
[L782] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))
[L783] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))
[L784] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))
[L785] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L786] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))
[L787] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L788] 2 __unbuffered_p1_EBX = z
[L789] 2 z = z$flush_delayed ? z$mem_tmp : z
[L790] 2 z$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z)
[L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used
[L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used
[L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1
[L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L793] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)
[L794] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used
[L795] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used
[L796] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2
[L797] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L820] 0 main$tmp_guard0 = __unbuffered_cnt == 2
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1089=-1, t1090=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L822] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L3] COND FALSE 0 !(!cond)
[L822] RET 0 assume_abort_if_not(main$tmp_guard0)
[L824] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L825] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L826] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L827] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L828] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1089=-1, t1090=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L831] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0)
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1089=-1, t1090=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L833] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L18] COND TRUE 0 !expression
[L18] CALL 0 reach_error()
[L17] COND FALSE 0 !(0)
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L17] 0 __assert_fail ("0", "mix041_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__)
VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
- UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: Not analyzed.
- UnprovableResult [Line: 813]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: Not analyzed.
- UnprovableResult [Line: 818]: 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: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message)
Unable to prove that petrification did provide enough thread instances (tool internal message)
Reason: Not analyzed.
- StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
CFG has 5 procedures, 55 locations, 6 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: 5.9s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 205 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 194 mSDsluCounter, 86 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 80 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 689 IncrementalHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 6 mSDtfsCounter, 689 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 105 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=6, InterpolantAutomatonStates: 37, 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.2s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 123 NumberOfCodeBlocks, 123 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 92 ConstructedInterpolants, 0 QuantifiedInterpolants, 368 SizeOfPredicates, 13 NumberOfNonLiveVariables, 493 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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
[2024-11-08 18:32:44,204 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c2cc6fe3-2894-4bf4-badd-c84262161e3e/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Writing output log to file Ultimate.log
Result:
UNKNOWN: Overapproximated counterexample