./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix028_tso.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_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/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_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix028_tso.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/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_d6d549b0-4f01-4427-a06c-774865c854ec/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 381687e0b1f81c1857e97f802385548d8501e57e279b70a993237277b7cd3e3a
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-a016563
[2024-11-08 17:29:25,600 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-08 17:29:25,689 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf
[2024-11-08 17:29:25,697 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-08 17:29:25,698 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-08 17:29:25,746 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-08 17:29:25,747 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-08 17:29:25,747 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-08 17:29:25,748 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-08 17:29:25,748 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-08 17:29:25,749 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-08 17:29:25,749 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-08 17:29:25,750 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-08 17:29:25,750 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-08 17:29:25,750 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-08 17:29:25,751 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-08 17:29:25,751 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-08 17:29:25,752 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-11-08 17:29:25,752 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-08 17:29:25,753 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-08 17:29:25,753 INFO  L153        SettingsManager]:  * Check for the main procedure if all allocated memory was freed=true
[2024-11-08 17:29:25,757 INFO  L153        SettingsManager]:  * Bitprecise bitfields=true
[2024-11-08 17:29:25,757 INFO  L153        SettingsManager]:  * SV-COMP memtrack compatibility mode=true
[2024-11-08 17:29:25,757 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-08 17:29:25,758 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2024-11-08 17:29:25,758 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-08 17:29:25,758 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-11-08 17:29:25,759 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-08 17:29:25,759 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-08 17:29:25,770 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-08 17:29:25,771 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-08 17:29:25,771 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-08 17:29:25,771 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-08 17:29:25,772 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 17:29:25,772 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-08 17:29:25,772 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-08 17:29:25,773 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-11-08 17:29:25,773 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-08 17:29:25,773 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-08 17:29:25,774 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-08 17:29:25,774 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-08 17:29:25,778 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-08 17:29:25,778 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_d6d549b0-4f01-4427-a06c-774865c854ec/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_d6d549b0-4f01-4427-a06c-774865c854ec/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 -> 381687e0b1f81c1857e97f802385548d8501e57e279b70a993237277b7cd3e3a
[2024-11-08 17:29:26,100 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-08 17:29:26,124 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-08 17:29:26,127 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-08 17:29:26,128 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-08 17:29:26,128 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-08 17:29:26,129 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/pthread-wmm/mix028_tso.i
Unable to find full path for "g++"
[2024-11-08 17:29:28,072 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-08 17:29:28,310 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-08 17:29:28,311 INFO  L180              CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/sv-benchmarks/c/pthread-wmm/mix028_tso.i
[2024-11-08 17:29:28,357 INFO  L427              CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/data/7e6c3d6a0/09d9b1f62b1045588babd5e01467eeb8/FLAG614e5ef28
[2024-11-08 17:29:28,380 INFO  L435              CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/data/7e6c3d6a0/09d9b1f62b1045588babd5e01467eeb8
[2024-11-08 17:29:28,383 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-08 17:29:28,397 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-08 17:29:28,402 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-08 17:29:28,402 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-08 17:29:28,410 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-08 17:29:28,410 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:29:28" (1/1) ...
[2024-11-08 17:29:28,411 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bc13b4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:28, skipping insertion in model container
[2024-11-08 17:29:28,412 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:29:28" (1/1) ...
[2024-11-08 17:29:28,491 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-08 17:29:29,001 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-08 17:29:29,014 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-08 17:29:29,087 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-08 17:29:29,129 INFO  L204         MainTranslator]: Completed translation
[2024-11-08 17:29:29,129 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:29 WrapperNode
[2024-11-08 17:29:29,129 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-08 17:29:29,131 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-08 17:29:29,131 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-08 17:29:29,131 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-08 17:29:29,140 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:29" (1/1) ...
[2024-11-08 17:29:29,156 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:29" (1/1) ...
[2024-11-08 17:29:29,187 INFO  L138                Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 160
[2024-11-08 17:29:29,188 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-08 17:29:29,189 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-08 17:29:29,189 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-08 17:29:29,189 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-08 17:29:29,211 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:29" (1/1) ...
[2024-11-08 17:29:29,211 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:29" (1/1) ...
[2024-11-08 17:29:29,218 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:29" (1/1) ...
[2024-11-08 17:29:29,248 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 17:29:29,248 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:29" (1/1) ...
[2024-11-08 17:29:29,248 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:29" (1/1) ...
[2024-11-08 17:29:29,256 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:29" (1/1) ...
[2024-11-08 17:29:29,258 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:29" (1/1) ...
[2024-11-08 17:29:29,260 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:29" (1/1) ...
[2024-11-08 17:29:29,262 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:29" (1/1) ...
[2024-11-08 17:29:29,265 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-08 17:29:29,266 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-08 17:29:29,267 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-08 17:29:29,267 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-08 17:29:29,268 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:29" (1/1) ...
[2024-11-08 17:29:29,274 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 17:29:29,288 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:29:29,304 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-08 17:29:29,307 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-08 17:29:29,342 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-11-08 17:29:29,342 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-08 17:29:29,342 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-11-08 17:29:29,342 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-11-08 17:29:29,343 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-11-08 17:29:29,343 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-11-08 17:29:29,343 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-11-08 17:29:29,343 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-11-08 17:29:29,343 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-08 17:29:29,343 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-11-08 17:29:29,344 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-08 17:29:29,344 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-08 17:29:29,345 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 17:29:29,525 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-08 17:29:29,527 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-08 17:29:29,926 INFO  L283             CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-11-08 17:29:29,927 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-08 17:29:30,279 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-08 17:29:30,280 INFO  L316             CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-08 17:29:30,280 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:29:30 BoogieIcfgContainer
[2024-11-08 17:29:30,281 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-08 17:29:30,283 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-08 17:29:30,285 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-08 17:29:30,289 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-08 17:29:30,289 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:29:28" (1/3) ...
[2024-11-08 17:29:30,290 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d4b18c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:29:30, skipping insertion in model container
[2024-11-08 17:29:30,290 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:29" (2/3) ...
[2024-11-08 17:29:30,291 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d4b18c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:29:30, skipping insertion in model container
[2024-11-08 17:29:30,291 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:29:30" (3/3) ...
[2024-11-08 17:29:30,294 INFO  L112   eAbstractionObserver]: Analyzing ICFG mix028_tso.i
[2024-11-08 17:29:30,313 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-08 17:29:30,314 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-11-08 17:29:30,315 INFO  L489   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-11-08 17:29:30,386 INFO  L143    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-11-08 17:29:30,428 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 53 places, 45 transitions, 102 flow
[2024-11-08 17:29:30,472 INFO  L124   PetriNetUnfolderBase]: 2/42 cut-off events.
[2024-11-08 17:29:30,473 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-08 17:29:30,476 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 52 conditions, 42 events. 2/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 80 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. 
[2024-11-08 17:29:30,478 INFO  L82        GeneralOperation]: Start removeDead. Operand has 53 places, 45 transitions, 102 flow
[2024-11-08 17:29:30,485 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 50 places, 42 transitions, 93 flow
[2024-11-08 17:29:30,499 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-08 17:29:30,506 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;@48cf2a25, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-08 17:29:30,506 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2024-11-08 17:29:30,515 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-11-08 17:29:30,516 INFO  L124   PetriNetUnfolderBase]: 0/17 cut-off events.
[2024-11-08 17:29:30,517 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-08 17:29:30,517 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 17:29:30,518 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:29:30,518 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 17:29:30,525 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:29:30,525 INFO  L85        PathProgramCache]: Analyzing trace with hash 679767499, now seen corresponding path program 1 times
[2024-11-08 17:29:30,536 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:29:30,537 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196537241]
[2024-11-08 17:29:30,537 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:29:30,538 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:29:30,691 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:29:31,057 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 17:29:31,058 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:29:31,058 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196537241]
[2024-11-08 17:29:31,059 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196537241] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:29:31,059 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:29:31,059 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-08 17:29:31,061 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144754105]
[2024-11-08 17:29:31,062 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:29:31,072 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 17:29:31,078 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:29:31,141 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 17:29:31,142 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 17:29:31,143 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 20 out of 45
[2024-11-08 17:29:31,146 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 93 flow. Second operand  has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 17:29:31,146 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 17:29:31,146 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 45
[2024-11-08 17:29:31,147 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 17:29:31,578 INFO  L124   PetriNetUnfolderBase]: 518/962 cut-off events.
[2024-11-08 17:29:31,578 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-08 17:29:31,584 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1790 conditions, 962 events. 518/962 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 6572 event pairs, 74 based on Foata normal form. 60/1012 useless extension candidates. Maximal degree in co-relation 1779. Up to 661 conditions per place. 
[2024-11-08 17:29:31,594 INFO  L140   encePairwiseOnDemand]: 40/45 looper letters, 28 selfloop transitions, 2 changer transitions 2/49 dead transitions.
[2024-11-08 17:29:31,595 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 49 transitions, 171 flow
[2024-11-08 17:29:31,596 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 17:29:31,600 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-08 17:29:31,607 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions.
[2024-11-08 17:29:31,610 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.7185185185185186
[2024-11-08 17:29:31,612 INFO  L175             Difference]: Start difference. First operand has 50 places, 42 transitions, 93 flow. Second operand 3 states and 97 transitions.
[2024-11-08 17:29:31,613 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 49 transitions, 171 flow
[2024-11-08 17:29:31,616 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 49 transitions, 168 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-11-08 17:29:31,620 INFO  L231             Difference]: Finished difference. Result has 47 places, 37 transitions, 84 flow
[2024-11-08 17:29:31,622 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=47, PETRI_TRANSITIONS=37}
[2024-11-08 17:29:31,627 INFO  L277   CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places.
[2024-11-08 17:29:31,628 INFO  L471      AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 84 flow
[2024-11-08 17:29:31,629 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 17:29:31,629 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 17:29:31,630 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:29:31,630 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-08 17:29:31,630 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 17:29:31,631 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:29:31,631 INFO  L85        PathProgramCache]: Analyzing trace with hash 1029601294, now seen corresponding path program 1 times
[2024-11-08 17:29:31,632 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:29:31,632 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357932868]
[2024-11-08 17:29:31,632 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:29:31,632 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:29:31,685 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:29:31,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 17:29:31,745 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:29:31,746 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357932868]
[2024-11-08 17:29:31,746 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357932868] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:29:31,746 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:29:31,746 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-08 17:29:31,746 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293763820]
[2024-11-08 17:29:31,747 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:29:31,748 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 17:29:31,748 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:29:31,750 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 17:29:31,750 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 17:29:31,753 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 19 out of 45
[2024-11-08 17:29:31,753 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 84 flow. Second operand  has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 17:29:31,753 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 17:29:31,754 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 45
[2024-11-08 17:29:31,754 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 17:29:32,009 INFO  L124   PetriNetUnfolderBase]: 459/873 cut-off events.
[2024-11-08 17:29:32,009 INFO  L125   PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES.
[2024-11-08 17:29:32,012 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1659 conditions, 873 events. 459/873 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 6043 event pairs, 459 based on Foata normal form. 30/887 useless extension candidates. Maximal degree in co-relation 1649. Up to 716 conditions per place. 
[2024-11-08 17:29:32,017 INFO  L140   encePairwiseOnDemand]: 43/45 looper letters, 18 selfloop transitions, 1 changer transitions 1/36 dead transitions.
[2024-11-08 17:29:32,017 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 36 transitions, 122 flow
[2024-11-08 17:29:32,018 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 17:29:32,018 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-08 17:29:32,020 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions.
[2024-11-08 17:29:32,021 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.5777777777777777
[2024-11-08 17:29:32,021 INFO  L175             Difference]: Start difference. First operand has 47 places, 37 transitions, 84 flow. Second operand 3 states and 78 transitions.
[2024-11-08 17:29:32,021 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 36 transitions, 122 flow
[2024-11-08 17:29:32,022 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 36 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-08 17:29:32,037 INFO  L231             Difference]: Finished difference. Result has 45 places, 35 transitions, 78 flow
[2024-11-08 17:29:32,040 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=45, PETRI_TRANSITIONS=35}
[2024-11-08 17:29:32,041 INFO  L277   CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places.
[2024-11-08 17:29:32,042 INFO  L471      AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 78 flow
[2024-11-08 17:29:32,042 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 17:29:32,042 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 17:29:32,042 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:29:32,043 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-08 17:29:32,043 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 17:29:32,044 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:29:32,044 INFO  L85        PathProgramCache]: Analyzing trace with hash 1029602936, now seen corresponding path program 1 times
[2024-11-08 17:29:32,044 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:29:32,044 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260664089]
[2024-11-08 17:29:32,044 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:29:32,045 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:29:32,101 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:29:32,384 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 17:29:32,384 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:29:32,384 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260664089]
[2024-11-08 17:29:32,384 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260664089] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:29:32,385 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:29:32,385 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 17:29:32,385 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352190018]
[2024-11-08 17:29:32,385 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:29:32,386 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 17:29:32,386 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:29:32,386 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 17:29:32,387 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-08 17:29:32,400 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45
[2024-11-08 17:29:32,401 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 78 flow. Second operand  has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 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 17:29:32,401 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 17:29:32,401 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45
[2024-11-08 17:29:32,401 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 17:29:32,915 INFO  L124   PetriNetUnfolderBase]: 1217/2055 cut-off events.
[2024-11-08 17:29:32,915 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-08 17:29:32,922 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3939 conditions, 2055 events. 1217/2055 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 12788 event pairs, 107 based on Foata normal form. 72/2122 useless extension candidates. Maximal degree in co-relation 3933. Up to 1213 conditions per place. 
[2024-11-08 17:29:32,931 INFO  L140   encePairwiseOnDemand]: 39/45 looper letters, 40 selfloop transitions, 5 changer transitions 1/58 dead transitions.
[2024-11-08 17:29:32,932 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 58 transitions, 220 flow
[2024-11-08 17:29:32,932 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-08 17:29:32,932 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-08 17:29:32,934 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions.
[2024-11-08 17:29:32,935 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.6222222222222222
[2024-11-08 17:29:32,936 INFO  L175             Difference]: Start difference. First operand has 45 places, 35 transitions, 78 flow. Second operand 4 states and 112 transitions.
[2024-11-08 17:29:32,937 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 58 transitions, 220 flow
[2024-11-08 17:29:32,937 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 58 transitions, 219 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-11-08 17:29:32,939 INFO  L231             Difference]: Finished difference. Result has 48 places, 38 transitions, 111 flow
[2024-11-08 17:29:32,940 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=111, PETRI_PLACES=48, PETRI_TRANSITIONS=38}
[2024-11-08 17:29:32,941 INFO  L277   CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places.
[2024-11-08 17:29:32,942 INFO  L471      AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 111 flow
[2024-11-08 17:29:32,942 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 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 17:29:32,943 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 17:29:32,943 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 17:29:32,943 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-08 17:29:32,943 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 17:29:32,944 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:29:32,945 INFO  L85        PathProgramCache]: Analyzing trace with hash 801018793, now seen corresponding path program 1 times
[2024-11-08 17:29:32,945 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:29:32,945 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212327646]
[2024-11-08 17:29:32,945 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:29:32,946 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:29:33,032 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:29:33,267 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 17:29:33,268 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:29:33,268 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212327646]
[2024-11-08 17:29:33,268 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212327646] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:29:33,268 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:29:33,269 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-08 17:29:33,269 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674760953]
[2024-11-08 17:29:33,269 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:29:33,269 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-08 17:29:33,270 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:29:33,270 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-08 17:29:33,270 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-08 17:29:33,279 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45
[2024-11-08 17:29:33,279 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 111 flow. Second operand  has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:29:33,279 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 17:29:33,280 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45
[2024-11-08 17:29:33,280 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 17:29:33,722 INFO  L124   PetriNetUnfolderBase]: 801/1377 cut-off events.
[2024-11-08 17:29:33,723 INFO  L125   PetriNetUnfolderBase]: For 364/364 co-relation queries the response was YES.
[2024-11-08 17:29:33,726 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3144 conditions, 1377 events. 801/1377 cut-off events. For 364/364 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7528 event pairs, 41 based on Foata normal form. 64/1436 useless extension candidates. Maximal degree in co-relation 3135. Up to 625 conditions per place. 
[2024-11-08 17:29:33,731 INFO  L140   encePairwiseOnDemand]: 39/45 looper letters, 50 selfloop transitions, 8 changer transitions 1/71 dead transitions.
[2024-11-08 17:29:33,732 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 71 transitions, 316 flow
[2024-11-08 17:29:33,732 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-11-08 17:29:33,732 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-11-08 17:29:33,733 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 141 transitions.
[2024-11-08 17:29:33,733 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.6266666666666667
[2024-11-08 17:29:33,734 INFO  L175             Difference]: Start difference. First operand has 48 places, 38 transitions, 111 flow. Second operand 5 states and 141 transitions.
[2024-11-08 17:29:33,734 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 71 transitions, 316 flow
[2024-11-08 17:29:33,735 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 71 transitions, 306 flow, removed 1 selfloop flow, removed 2 redundant places.
[2024-11-08 17:29:33,739 INFO  L231             Difference]: Finished difference. Result has 52 places, 41 transitions, 151 flow
[2024-11-08 17:29:33,739 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=151, PETRI_PLACES=52, PETRI_TRANSITIONS=41}
[2024-11-08 17:29:33,740 INFO  L277   CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places.
[2024-11-08 17:29:33,740 INFO  L471      AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 151 flow
[2024-11-08 17:29:33,740 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:29:33,740 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 17:29:33,740 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 17:29:33,741 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-08 17:29:33,741 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 17:29:33,741 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:29:33,741 INFO  L85        PathProgramCache]: Analyzing trace with hash -1506520034, now seen corresponding path program 1 times
[2024-11-08 17:29:33,743 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:29:33,744 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476393751]
[2024-11-08 17:29:33,744 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:29:33,744 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:29:33,842 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:29:34,165 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 17:29:34,166 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:29:34,166 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476393751]
[2024-11-08 17:29:34,166 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476393751] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:29:34,166 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:29:34,166 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-08 17:29:34,167 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984378867]
[2024-11-08 17:29:34,167 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:29:34,167 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-08 17:29:34,168 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:29:34,168 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-08 17:29:34,168 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-11-08 17:29:34,177 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45
[2024-11-08 17:29:34,177 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 151 flow. Second operand  has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 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 17:29:34,178 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 17:29:34,178 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45
[2024-11-08 17:29:34,178 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 17:29:34,528 INFO  L124   PetriNetUnfolderBase]: 423/719 cut-off events.
[2024-11-08 17:29:34,529 INFO  L125   PetriNetUnfolderBase]: For 671/671 co-relation queries the response was YES.
[2024-11-08 17:29:34,532 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1910 conditions, 719 events. 423/719 cut-off events. For 671/671 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3146 event pairs, 29 based on Foata normal form. 36/750 useless extension candidates. Maximal degree in co-relation 1899. Up to 268 conditions per place. 
[2024-11-08 17:29:34,535 INFO  L140   encePairwiseOnDemand]: 39/45 looper letters, 44 selfloop transitions, 11 changer transitions 1/68 dead transitions.
[2024-11-08 17:29:34,536 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 68 transitions, 327 flow
[2024-11-08 17:29:34,536 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-11-08 17:29:34,536 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-08 17:29:34,537 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions.
[2024-11-08 17:29:34,537 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.5703703703703704
[2024-11-08 17:29:34,537 INFO  L175             Difference]: Start difference. First operand has 52 places, 41 transitions, 151 flow. Second operand 6 states and 154 transitions.
[2024-11-08 17:29:34,538 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 68 transitions, 327 flow
[2024-11-08 17:29:34,544 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 68 transitions, 302 flow, removed 4 selfloop flow, removed 4 redundant places.
[2024-11-08 17:29:34,546 INFO  L231             Difference]: Finished difference. Result has 55 places, 41 transitions, 165 flow
[2024-11-08 17:29:34,547 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=165, PETRI_PLACES=55, PETRI_TRANSITIONS=41}
[2024-11-08 17:29:34,548 INFO  L277   CegarLoopForPetriNet]: 50 programPoint places, 5 predicate places.
[2024-11-08 17:29:34,549 INFO  L471      AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 165 flow
[2024-11-08 17:29:34,550 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 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 17:29:34,550 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 17:29:34,550 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, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:29:34,550 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-08 17:29:34,551 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 17:29:34,551 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:29:34,551 INFO  L85        PathProgramCache]: Analyzing trace with hash -502981714, now seen corresponding path program 1 times
[2024-11-08 17:29:34,552 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:29:34,553 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571989205]
[2024-11-08 17:29:34,553 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:29:34,553 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:29:34,772 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:29:35,829 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 17:29:35,829 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:29:35,829 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571989205]
[2024-11-08 17:29:35,829 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571989205] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:29:35,831 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:29:35,831 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-08 17:29:35,831 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510251604]
[2024-11-08 17:29:35,832 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:29:35,832 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-08 17:29:35,832 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:29:35,833 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-08 17:29:35,833 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-08 17:29:35,863 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45
[2024-11-08 17:29:35,864 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 41 transitions, 165 flow. Second operand  has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 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 17:29:35,864 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 17:29:35,864 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45
[2024-11-08 17:29:35,864 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 17:29:36,270 INFO  L124   PetriNetUnfolderBase]: 648/1243 cut-off events.
[2024-11-08 17:29:36,270 INFO  L125   PetriNetUnfolderBase]: For 626/646 co-relation queries the response was YES.
[2024-11-08 17:29:36,274 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2888 conditions, 1243 events. 648/1243 cut-off events. For 626/646 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6864 event pairs, 170 based on Foata normal form. 8/1207 useless extension candidates. Maximal degree in co-relation 2876. Up to 502 conditions per place. 
[2024-11-08 17:29:36,278 INFO  L140   encePairwiseOnDemand]: 38/45 looper letters, 33 selfloop transitions, 5 changer transitions 14/71 dead transitions.
[2024-11-08 17:29:36,278 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 71 transitions, 343 flow
[2024-11-08 17:29:36,279 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-11-08 17:29:36,279 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-08 17:29:36,280 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 155 transitions.
[2024-11-08 17:29:36,280 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.5740740740740741
[2024-11-08 17:29:36,280 INFO  L175             Difference]: Start difference. First operand has 55 places, 41 transitions, 165 flow. Second operand 6 states and 155 transitions.
[2024-11-08 17:29:36,281 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 71 transitions, 343 flow
[2024-11-08 17:29:36,289 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 71 transitions, 279 flow, removed 14 selfloop flow, removed 8 redundant places.
[2024-11-08 17:29:36,291 INFO  L231             Difference]: Finished difference. Result has 56 places, 43 transitions, 137 flow
[2024-11-08 17:29:36,291 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=137, PETRI_PLACES=56, PETRI_TRANSITIONS=43}
[2024-11-08 17:29:36,293 INFO  L277   CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places.
[2024-11-08 17:29:36,293 INFO  L471      AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 137 flow
[2024-11-08 17:29:36,294 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 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 17:29:36,294 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 17:29:36,294 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, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:29:36,294 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-08 17:29:36,295 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 17:29:36,295 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:29:36,295 INFO  L85        PathProgramCache]: Analyzing trace with hash -2075817778, now seen corresponding path program 2 times
[2024-11-08 17:29:36,296 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:29:36,296 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081342540]
[2024-11-08 17:29:36,296 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:29:36,296 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:29:36,462 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:29:37,351 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 17:29:37,351 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:29:37,352 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081342540]
[2024-11-08 17:29:37,352 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081342540] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:29:37,353 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:29:37,354 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-08 17:29:37,354 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322909498]
[2024-11-08 17:29:37,354 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:29:37,355 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-08 17:29:37,355 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:29:37,355 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-08 17:29:37,357 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-11-08 17:29:37,381 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45
[2024-11-08 17:29:37,382 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 137 flow. Second operand  has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:29:37,382 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 17:29:37,382 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45
[2024-11-08 17:29:37,382 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 17:29:37,937 INFO  L124   PetriNetUnfolderBase]: 520/1018 cut-off events.
[2024-11-08 17:29:37,938 INFO  L125   PetriNetUnfolderBase]: For 106/106 co-relation queries the response was YES.
[2024-11-08 17:29:37,942 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2221 conditions, 1018 events. 520/1018 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5230 event pairs, 80 based on Foata normal form. 8/994 useless extension candidates. Maximal degree in co-relation 2209. Up to 453 conditions per place. 
[2024-11-08 17:29:37,945 INFO  L140   encePairwiseOnDemand]: 34/45 looper letters, 26 selfloop transitions, 6 changer transitions 33/83 dead transitions.
[2024-11-08 17:29:37,945 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 83 transitions, 371 flow
[2024-11-08 17:29:37,946 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-11-08 17:29:37,946 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-11-08 17:29:37,947 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 193 transitions.
[2024-11-08 17:29:37,947 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.5361111111111111
[2024-11-08 17:29:37,947 INFO  L175             Difference]: Start difference. First operand has 56 places, 43 transitions, 137 flow. Second operand 8 states and 193 transitions.
[2024-11-08 17:29:37,947 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 83 transitions, 371 flow
[2024-11-08 17:29:37,948 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 83 transitions, 355 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-11-08 17:29:37,951 INFO  L231             Difference]: Finished difference. Result has 63 places, 43 transitions, 160 flow
[2024-11-08 17:29:37,952 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=160, PETRI_PLACES=63, PETRI_TRANSITIONS=43}
[2024-11-08 17:29:37,952 INFO  L277   CegarLoopForPetriNet]: 50 programPoint places, 13 predicate places.
[2024-11-08 17:29:37,953 INFO  L471      AbstractCegarLoop]: Abstraction has has 63 places, 43 transitions, 160 flow
[2024-11-08 17:29:37,953 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:29:37,954 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 17:29:37,954 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, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:29:37,954 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-08 17:29:37,955 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 17:29:37,955 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:29:37,955 INFO  L85        PathProgramCache]: Analyzing trace with hash 709056054, now seen corresponding path program 3 times
[2024-11-08 17:29:37,955 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:29:37,956 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362558615]
[2024-11-08 17:29:37,956 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:29:37,957 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:29:38,117 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:29:40,248 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 17:29:40,249 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 17:29:40,250 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362558615]
[2024-11-08 17:29:40,250 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362558615] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:29:40,250 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:29:40,250 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-08 17:29:40,250 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773695378]
[2024-11-08 17:29:40,251 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:29:40,251 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-08 17:29:40,251 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 17:29:40,252 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-08 17:29:40,252 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-11-08 17:29:40,289 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45
[2024-11-08 17:29:40,290 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 43 transitions, 160 flow. Second operand  has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 9 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:29:40,290 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 17:29:40,290 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45
[2024-11-08 17:29:40,290 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 17:29:40,825 INFO  L124   PetriNetUnfolderBase]: 399/793 cut-off events.
[2024-11-08 17:29:40,825 INFO  L125   PetriNetUnfolderBase]: For 180/188 co-relation queries the response was YES.
[2024-11-08 17:29:40,828 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1771 conditions, 793 events. 399/793 cut-off events. For 180/188 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3988 event pairs, 120 based on Foata normal form. 8/760 useless extension candidates. Maximal degree in co-relation 1755. Up to 327 conditions per place. 
[2024-11-08 17:29:40,830 INFO  L140   encePairwiseOnDemand]: 34/45 looper letters, 24 selfloop transitions, 9 changer transitions 20/71 dead transitions.
[2024-11-08 17:29:40,830 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 71 transitions, 344 flow
[2024-11-08 17:29:40,830 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-11-08 17:29:40,831 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-11-08 17:29:40,831 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 198 transitions.
[2024-11-08 17:29:40,832 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.4888888888888889
[2024-11-08 17:29:40,832 INFO  L175             Difference]: Start difference. First operand has 63 places, 43 transitions, 160 flow. Second operand 9 states and 198 transitions.
[2024-11-08 17:29:40,832 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 71 transitions, 344 flow
[2024-11-08 17:29:40,834 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 71 transitions, 315 flow, removed 5 selfloop flow, removed 8 redundant places.
[2024-11-08 17:29:40,836 INFO  L231             Difference]: Finished difference. Result has 64 places, 43 transitions, 168 flow
[2024-11-08 17:29:40,837 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=168, PETRI_PLACES=64, PETRI_TRANSITIONS=43}
[2024-11-08 17:29:40,837 INFO  L277   CegarLoopForPetriNet]: 50 programPoint places, 14 predicate places.
[2024-11-08 17:29:40,839 INFO  L471      AbstractCegarLoop]: Abstraction has has 64 places, 43 transitions, 168 flow
[2024-11-08 17:29:40,839 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 18.22222222222222) internal successors, (164), 9 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:29:40,839 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 17:29:40,840 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, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:29:40,840 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-08 17:29:40,840 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 17:29:40,840 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:29:40,840 INFO  L85        PathProgramCache]: Analyzing trace with hash 1031678284, now seen corresponding path program 4 times
[2024-11-08 17:29:40,841 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 17:29:40,841 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718563699]
[2024-11-08 17:29:40,841 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:29:40,841 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 17:29:40,983 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:29:40,986 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:29:41,133 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:29:41,177 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 17:29:41,178 INFO  L325         BasicCegarLoop]: Counterexample is feasible
[2024-11-08 17:29:41,179 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining)
[2024-11-08 17:29:41,182 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining)
[2024-11-08 17:29:41,183 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining)
[2024-11-08 17:29:41,183 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining)
[2024-11-08 17:29:41,184 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining)
[2024-11-08 17:29:41,184 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining)
[2024-11-08 17:29:41,184 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining)
[2024-11-08 17:29:41,184 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-08 17:29:41,185 INFO  L407         BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1]
[2024-11-08 17:29:41,273 INFO  L239   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-11-08 17:29:41,274 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2024-11-08 17:29:41,284 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 05:29:41 BasicIcfg
[2024-11-08 17:29:41,284 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-08 17:29:41,285 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-08 17:29:41,285 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-11-08 17:29:41,285 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-11-08 17:29:41,286 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:29:30" (3/4) ...
[2024-11-08 17:29:41,289 INFO  L145         WitnessPrinter]: No result that supports witness generation found
[2024-11-08 17:29:41,290 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-08 17:29:41,293 INFO  L158              Benchmark]: Toolchain (without parser) took 12893.92ms. Allocated memory was 172.0MB in the beginning and 302.0MB in the end (delta: 130.0MB). Free memory was 141.8MB in the beginning and 193.3MB in the end (delta: -51.5MB). Peak memory consumption was 78.0MB. Max. memory is 16.1GB.
[2024-11-08 17:29:41,293 INFO  L158              Benchmark]: CDTParser took 0.21ms. Allocated memory is still 130.0MB. Free memory is still 102.7MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 17:29:41,294 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 728.18ms. Allocated memory is still 172.0MB. Free memory was 141.3MB in the beginning and 114.5MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2024-11-08 17:29:41,297 INFO  L158              Benchmark]: Boogie Procedure Inliner took 57.43ms. Allocated memory is still 172.0MB. Free memory was 114.5MB in the beginning and 111.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-11-08 17:29:41,297 INFO  L158              Benchmark]: Boogie Preprocessor took 77.04ms. Allocated memory is still 172.0MB. Free memory was 111.4MB in the beginning and 107.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-11-08 17:29:41,298 INFO  L158              Benchmark]: RCFGBuilder took 1014.41ms. Allocated memory is still 172.0MB. Free memory was 107.2MB in the beginning and 106.4MB in the end (delta: 842.7kB). Peak memory consumption was 33.9MB. Max. memory is 16.1GB.
[2024-11-08 17:29:41,298 INFO  L158              Benchmark]: TraceAbstraction took 11001.23ms. Allocated memory was 172.0MB in the beginning and 302.0MB in the end (delta: 130.0MB). Free memory was 105.3MB in the beginning and 193.3MB in the end (delta: -88.0MB). Peak memory consumption was 42.0MB. Max. memory is 16.1GB.
[2024-11-08 17:29:41,299 INFO  L158              Benchmark]: Witness Printer took 5.05ms. Allocated memory is still 302.0MB. Free memory is still 193.3MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 17:29:41,301 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.21ms. Allocated memory is still 130.0MB. Free memory is still 102.7MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 728.18ms. Allocated memory is still 172.0MB. Free memory was 141.3MB in the beginning and 114.5MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 57.43ms. Allocated memory is still 172.0MB. Free memory was 114.5MB in the beginning and 111.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 77.04ms. Allocated memory is still 172.0MB. Free memory was 111.4MB in the beginning and 107.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
 * RCFGBuilder took 1014.41ms. Allocated memory is still 172.0MB. Free memory was 107.2MB in the beginning and 106.4MB in the end (delta: 842.7kB). Peak memory consumption was 33.9MB. Max. memory is 16.1GB.
 * TraceAbstraction took 11001.23ms. Allocated memory was 172.0MB in the beginning and 302.0MB in the end (delta: 130.0MB). Free memory was 105.3MB in the beginning and 193.3MB in the end (delta: -88.0MB). Peak memory consumption was 42.0MB. Max. memory is 16.1GB.
 * Witness Printer took 5.05ms. Allocated memory is still 302.0MB. Free memory is still 193.3MB. 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: 
[L709]               0  int __unbuffered_cnt = 0;
[L711]               0  int __unbuffered_p2_EAX = 0;
[L713]               0  int __unbuffered_p2_EBX = 0;
[L714]               0  _Bool main$tmp_guard0;
[L715]               0  _Bool main$tmp_guard1;
[L717]               0  int x = 0;
[L719]               0  int y = 0;
[L720]               0  _Bool y$flush_delayed;
[L721]               0  int y$mem_tmp;
[L722]               0  _Bool y$r_buff0_thd0;
[L723]               0  _Bool y$r_buff0_thd1;
[L724]               0  _Bool y$r_buff0_thd2;
[L725]               0  _Bool y$r_buff0_thd3;
[L726]               0  _Bool y$r_buff1_thd0;
[L727]               0  _Bool y$r_buff1_thd1;
[L728]               0  _Bool y$r_buff1_thd2;
[L729]               0  _Bool y$r_buff1_thd3;
[L730]               0  _Bool y$read_delayed;
[L731]               0  int *y$read_delayed_var;
[L732]               0  int y$w_buff0;
[L733]               0  _Bool y$w_buff0_used;
[L734]               0  int y$w_buff1;
[L735]               0  _Bool y$w_buff1_used;
[L737]               0  int z = 0;
[L738]               0  _Bool weak$$choice0;
[L739]               0  _Bool weak$$choice2;
[L831]               0  pthread_t t763;
[L832]  FCALL, FORK  0  pthread_create(&t763, ((void *)0), P0, ((void *)0))
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t763=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L833]               0  pthread_t t764;
[L834]  FCALL, FORK  0  pthread_create(&t764, ((void *)0), P1, ((void *)0))
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t763=-2, t764=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L835]               0  pthread_t t765;
[L836]  FCALL, FORK  0  pthread_create(&t765, ((void *)0), P2, ((void *)0))
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t763=-2, t764=-1, t765=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L778]               3  y$w_buff1 = y$w_buff0
[L779]               3  y$w_buff0 = 2
[L780]               3  y$w_buff1_used = y$w_buff0_used
[L781]               3  y$w_buff0_used = (_Bool)1
[L782]  CALL         3  __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L18]   COND FALSE   3  !(!expression)
[L782]  RET          3  __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L783]               3  y$r_buff1_thd0 = y$r_buff0_thd0
[L784]               3  y$r_buff1_thd1 = y$r_buff0_thd1
[L785]               3  y$r_buff1_thd2 = y$r_buff0_thd2
[L786]               3  y$r_buff1_thd3 = y$r_buff0_thd3
[L787]               3  y$r_buff0_thd3 = (_Bool)1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L790]               3  weak$$choice0 = __VERIFIER_nondet_bool()
[L791]               3  weak$$choice2 = __VERIFIER_nondet_bool()
[L792]               3  y$flush_delayed = weak$$choice2
[L793]               3  y$mem_tmp = y
[L794]               3  y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L795]               3  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L796]               3  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L797]               3  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L798]               3  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L799]               3  y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L800]               3  y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L801]               3  __unbuffered_p2_EAX = y
[L802]               3  y = y$flush_delayed ? y$mem_tmp : y
[L803]               3  y$flush_delayed = (_Bool)0
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L806]               3  __unbuffered_p2_EBX = z
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L743]               1  z = 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L746]               1  x = 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L758]               2  x = 2
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L761]               2  y = 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1]
[L764]               2  y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L765]               2  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L766]               2  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L767]               2  y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L768]               2  y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1]
[L809]               3  y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L810]               3  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L811]               3  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L812]               3  y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L813]               3  y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1]
[L816]               3  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1]
[L771]               2  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1]
[L751]               1  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1]
[L838]               0  main$tmp_guard0 = __unbuffered_cnt == 3
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t763=-2, t764=-1, t765=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1]
[L840]  CALL         0  assume_abort_if_not(main$tmp_guard0)
[L3]    COND FALSE   0  !(!cond)
[L840]  RET          0  assume_abort_if_not(main$tmp_guard0)
[L842]               0  y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L843]               0  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L844]               0  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L845]               0  y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L846]               0  y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t763=-2, t764=-1, t765=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1]
[L849]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L850]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L851]               0  y$flush_delayed = weak$$choice2
[L852]               0  y$mem_tmp = y
[L853]               0  y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L854]               0  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L855]               0  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L856]               0  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L857]               0  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L858]               0  y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L859]               0  y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L860]               0  main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0)
[L861]               0  y = y$flush_delayed ? y$mem_tmp : y
[L862]               0  y$flush_delayed = (_Bool)0
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t763=-2, t764=-1, t765=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1]
[L864]  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}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1]
[L17]                0  __assert_fail ("0", "mix028_tso.c", 8, __extension__ __PRETTY_FUNCTION__)
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, 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: 829]: Unable to prove that all allocated memory was freed
    Unable to prove that all allocated memory was freed
 Reason: Not analyzed. 
  - UnprovableResult [Line: 832]: 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: 836]: 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: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 7 procedures, 70 locations, 7 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: 10.8s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 388 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 364 mSDsluCounter, 170 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 150 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 796 IncrementalHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 20 mSDtfsCounter, 796 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=168occurred in iteration=8, InterpolantAutomatonStates: 44, 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.9s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 207 NumberOfCodeBlocks, 207 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 168 ConstructedInterpolants, 0 QuantifiedInterpolants, 1004 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 17:29:41,341 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/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_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/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_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix028_tso.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/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_d6d549b0-4f01-4427-a06c-774865c854ec/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 381687e0b1f81c1857e97f802385548d8501e57e279b70a993237277b7cd3e3a
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-a016563
[2024-11-08 17:29:43,739 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-11-08 17:29:43,848 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf
[2024-11-08 17:29:43,855 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-11-08 17:29:43,856 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-08 17:29:43,894 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-08 17:29:43,894 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-08 17:29:43,895 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-08 17:29:43,895 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-08 17:29:43,900 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-11-08 17:29:43,900 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-08 17:29:43,901 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-08 17:29:43,901 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-08 17:29:43,902 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-11-08 17:29:43,902 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-11-08 17:29:43,902 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-08 17:29:43,903 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-11-08 17:29:43,903 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-11-08 17:29:43,903 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-11-08 17:29:43,907 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-11-08 17:29:43,907 INFO  L153        SettingsManager]:  * Check for the main procedure if all allocated memory was freed=true
[2024-11-08 17:29:43,908 INFO  L153        SettingsManager]:  * Bitprecise bitfields=true
[2024-11-08 17:29:43,908 INFO  L153        SettingsManager]:  * SV-COMP memtrack compatibility mode=true
[2024-11-08 17:29:43,908 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-08 17:29:43,910 INFO  L153        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2024-11-08 17:29:43,911 INFO  L153        SettingsManager]:  * Use bitvectors instead of ints=true
[2024-11-08 17:29:43,911 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-11-08 17:29:43,911 INFO  L153        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-08 17:29:43,912 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-11-08 17:29:43,912 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-11-08 17:29:43,912 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-11-08 17:29:43,913 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-08 17:29:43,913 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-11-08 17:29:43,913 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-11-08 17:29:43,914 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-11-08 17:29:43,915 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 17:29:43,915 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-08 17:29:43,916 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-11-08 17:29:43,917 INFO  L153        SettingsManager]:  * Trace refinement strategy=FOX
[2024-11-08 17:29:43,917 INFO  L153        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-08 17:29:43,917 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-08 17:29:43,918 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-08 17:29:43,918 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-11-08 17:29:43,918 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-08 17:29:43,919 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_d6d549b0-4f01-4427-a06c-774865c854ec/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_d6d549b0-4f01-4427-a06c-774865c854ec/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 -> 381687e0b1f81c1857e97f802385548d8501e57e279b70a993237277b7cd3e3a
[2024-11-08 17:29:44,333 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-08 17:29:44,366 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-08 17:29:44,370 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-08 17:29:44,372 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-11-08 17:29:44,372 INFO  L274        PluginConnector]: CDTParser initialized
[2024-11-08 17:29:44,374 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/pthread-wmm/mix028_tso.i
Unable to find full path for "g++"
[2024-11-08 17:29:46,529 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-11-08 17:29:46,824 INFO  L384              CDTParser]: Found 1 translation units.
[2024-11-08 17:29:46,824 INFO  L180              CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/sv-benchmarks/c/pthread-wmm/mix028_tso.i
[2024-11-08 17:29:46,844 INFO  L427              CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/data/113da4e3c/0bd4863d07a14ccaa888adaf6ceaadda/FLAG1a79be5e6
[2024-11-08 17:29:46,858 INFO  L435              CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/data/113da4e3c/0bd4863d07a14ccaa888adaf6ceaadda
[2024-11-08 17:29:46,860 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-08 17:29:46,861 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-08 17:29:46,862 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-08 17:29:46,863 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-08 17:29:46,868 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-08 17:29:46,869 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:29:46" (1/1) ...
[2024-11-08 17:29:46,870 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@612efe56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:46, skipping insertion in model container
[2024-11-08 17:29:46,870 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:29:46" (1/1) ...
[2024-11-08 17:29:46,922 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-11-08 17:29:47,545 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-08 17:29:47,564 INFO  L200         MainTranslator]: Completed pre-run
[2024-11-08 17:29:47,667 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-11-08 17:29:47,727 INFO  L204         MainTranslator]: Completed translation
[2024-11-08 17:29:47,728 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:47 WrapperNode
[2024-11-08 17:29:47,728 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-08 17:29:47,729 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-08 17:29:47,729 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-08 17:29:47,729 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-08 17:29:47,737 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:47" (1/1) ...
[2024-11-08 17:29:47,763 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:47" (1/1) ...
[2024-11-08 17:29:47,817 INFO  L138                Inliner]: procedures = 176, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 161
[2024-11-08 17:29:47,817 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-08 17:29:47,818 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-08 17:29:47,818 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-08 17:29:47,818 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-11-08 17:29:47,832 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:47" (1/1) ...
[2024-11-08 17:29:47,832 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:47" (1/1) ...
[2024-11-08 17:29:47,838 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:47" (1/1) ...
[2024-11-08 17:29:47,873 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 17:29:47,874 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:47" (1/1) ...
[2024-11-08 17:29:47,874 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:47" (1/1) ...
[2024-11-08 17:29:47,901 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:47" (1/1) ...
[2024-11-08 17:29:47,903 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:47" (1/1) ...
[2024-11-08 17:29:47,905 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:47" (1/1) ...
[2024-11-08 17:29:47,911 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:47" (1/1) ...
[2024-11-08 17:29:47,920 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-08 17:29:47,921 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-08 17:29:47,921 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-11-08 17:29:47,921 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-11-08 17:29:47,922 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:47" (1/1) ...
[2024-11-08 17:29:47,930 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 17:29:47,945 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:29:47,964 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-08 17:29:47,971 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-08 17:29:47,997 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-11-08 17:29:47,998 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-08 17:29:47,998 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-08 17:29:47,998 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2024-11-08 17:29:47,998 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2024-11-08 17:29:47,999 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2024-11-08 17:29:47,999 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2024-11-08 17:29:47,999 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2024-11-08 17:29:47,999 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2024-11-08 17:29:47,999 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-11-08 17:29:48,000 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-08 17:29:48,000 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-08 17:29:48,001 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 17:29:48,194 INFO  L238             CfgBuilder]: Building ICFG
[2024-11-08 17:29:48,198 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-08 17:29:48,709 INFO  L283             CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-11-08 17:29:48,709 INFO  L287             CfgBuilder]: Performing block encoding
[2024-11-08 17:29:48,992 INFO  L311             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-08 17:29:48,993 INFO  L316             CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-08 17:29:48,994 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:29:48 BoogieIcfgContainer
[2024-11-08 17:29:48,994 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-08 17:29:48,997 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-08 17:29:48,997 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-11-08 17:29:49,002 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-11-08 17:29:49,003 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:29:46" (1/3) ...
[2024-11-08 17:29:49,005 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27163533 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:29:49, skipping insertion in model container
[2024-11-08 17:29:49,005 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:29:47" (2/3) ...
[2024-11-08 17:29:49,007 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27163533 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:29:49, skipping insertion in model container
[2024-11-08 17:29:49,007 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:29:48" (3/3) ...
[2024-11-08 17:29:49,009 INFO  L112   eAbstractionObserver]: Analyzing ICFG mix028_tso.i
[2024-11-08 17:29:49,029 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-08 17:29:49,030 INFO  L154   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2024-11-08 17:29:49,030 INFO  L489   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-11-08 17:29:49,114 INFO  L143    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-11-08 17:29:49,155 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 53 places, 45 transitions, 102 flow
[2024-11-08 17:29:49,200 INFO  L124   PetriNetUnfolderBase]: 2/42 cut-off events.
[2024-11-08 17:29:49,201 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-08 17:29:49,205 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 52 conditions, 42 events. 2/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 80 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. 
[2024-11-08 17:29:49,206 INFO  L82        GeneralOperation]: Start removeDead. Operand has 53 places, 45 transitions, 102 flow
[2024-11-08 17:29:49,210 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 50 places, 42 transitions, 93 flow
[2024-11-08 17:29:49,227 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-08 17:29:49,234 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;@78884e58, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-08 17:29:49,234 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2024-11-08 17:29:49,241 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-11-08 17:29:49,241 INFO  L124   PetriNetUnfolderBase]: 0/17 cut-off events.
[2024-11-08 17:29:49,241 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-08 17:29:49,241 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 17:29:49,242 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:29:49,242 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 17:29:49,248 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:29:49,248 INFO  L85        PathProgramCache]: Analyzing trace with hash 1704595147, now seen corresponding path program 1 times
[2024-11-08 17:29:49,279 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 17:29:49,282 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1102411094]
[2024-11-08 17:29:49,282 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:29:49,283 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:29:49,283 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:29:49,285 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:29:49,289 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-08 17:29:49,427 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:29:49,430 INFO  L255         TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-08 17:29:49,435 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:29:49,483 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 17:29:49,483 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 17:29:49,484 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 17:29:49,484 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102411094]
[2024-11-08 17:29:49,485 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102411094] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:29:49,485 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:29:49,486 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-08 17:29:49,488 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947418705]
[2024-11-08 17:29:49,488 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:29:49,498 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 17:29:49,504 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 17:29:49,537 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 17:29:49,538 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 17:29:49,540 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 20 out of 45
[2024-11-08 17:29:49,543 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 93 flow. Second operand  has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 17:29:49,544 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 17:29:49,545 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 45
[2024-11-08 17:29:49,546 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 17:29:50,010 INFO  L124   PetriNetUnfolderBase]: 518/962 cut-off events.
[2024-11-08 17:29:50,010 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-08 17:29:50,016 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1790 conditions, 962 events. 518/962 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 6599 event pairs, 74 based on Foata normal form. 60/1012 useless extension candidates. Maximal degree in co-relation 1779. Up to 661 conditions per place. 
[2024-11-08 17:29:50,026 INFO  L140   encePairwiseOnDemand]: 40/45 looper letters, 28 selfloop transitions, 2 changer transitions 2/49 dead transitions.
[2024-11-08 17:29:50,026 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 49 transitions, 171 flow
[2024-11-08 17:29:50,028 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 17:29:50,030 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-08 17:29:50,039 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions.
[2024-11-08 17:29:50,041 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.7185185185185186
[2024-11-08 17:29:50,043 INFO  L175             Difference]: Start difference. First operand has 50 places, 42 transitions, 93 flow. Second operand 3 states and 97 transitions.
[2024-11-08 17:29:50,044 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 49 transitions, 171 flow
[2024-11-08 17:29:50,047 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 49 transitions, 168 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-11-08 17:29:50,052 INFO  L231             Difference]: Finished difference. Result has 47 places, 37 transitions, 84 flow
[2024-11-08 17:29:50,053 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=47, PETRI_TRANSITIONS=37}
[2024-11-08 17:29:50,059 INFO  L277   CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places.
[2024-11-08 17:29:50,060 INFO  L471      AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 84 flow
[2024-11-08 17:29:50,060 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 17:29:50,061 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 17:29:50,061 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:29:50,085 INFO  L540       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-11-08 17:29:50,262 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:29:50,262 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 17:29:50,263 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:29:50,263 INFO  L85        PathProgramCache]: Analyzing trace with hash 422903376, now seen corresponding path program 1 times
[2024-11-08 17:29:50,264 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 17:29:50,265 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1591724274]
[2024-11-08 17:29:50,265 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:29:50,265 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:29:50,265 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:29:50,267 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:29:50,270 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-11-08 17:29:50,393 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:29:50,395 INFO  L255         TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-08 17:29:50,396 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:29:50,442 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 17:29:50,443 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 17:29:50,443 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 17:29:50,443 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591724274]
[2024-11-08 17:29:50,444 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591724274] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:29:50,444 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:29:50,444 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-08 17:29:50,444 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038474521]
[2024-11-08 17:29:50,445 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:29:50,447 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 17:29:50,448 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 17:29:50,448 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 17:29:50,449 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 17:29:50,449 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 19 out of 45
[2024-11-08 17:29:50,450 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 84 flow. Second operand  has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 17:29:50,451 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 17:29:50,452 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 45
[2024-11-08 17:29:50,452 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 17:29:50,721 INFO  L124   PetriNetUnfolderBase]: 459/873 cut-off events.
[2024-11-08 17:29:50,722 INFO  L125   PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES.
[2024-11-08 17:29:50,725 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1659 conditions, 873 events. 459/873 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 6049 event pairs, 459 based on Foata normal form. 30/887 useless extension candidates. Maximal degree in co-relation 1649. Up to 716 conditions per place. 
[2024-11-08 17:29:50,729 INFO  L140   encePairwiseOnDemand]: 43/45 looper letters, 18 selfloop transitions, 1 changer transitions 1/36 dead transitions.
[2024-11-08 17:29:50,730 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 36 transitions, 122 flow
[2024-11-08 17:29:50,730 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-11-08 17:29:50,731 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-08 17:29:50,732 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions.
[2024-11-08 17:29:50,732 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.5777777777777777
[2024-11-08 17:29:50,732 INFO  L175             Difference]: Start difference. First operand has 47 places, 37 transitions, 84 flow. Second operand 3 states and 78 transitions.
[2024-11-08 17:29:50,732 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 36 transitions, 122 flow
[2024-11-08 17:29:50,733 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 36 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-08 17:29:50,734 INFO  L231             Difference]: Finished difference. Result has 45 places, 35 transitions, 78 flow
[2024-11-08 17:29:50,734 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=45, PETRI_TRANSITIONS=35}
[2024-11-08 17:29:50,737 INFO  L277   CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places.
[2024-11-08 17:29:50,737 INFO  L471      AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 78 flow
[2024-11-08 17:29:50,738 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 17:29:50,739 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 17:29:50,740 INFO  L204   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:29:50,762 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-11-08 17:29:50,941 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:29:50,942 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 17:29:50,942 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:29:50,942 INFO  L85        PathProgramCache]: Analyzing trace with hash 422905018, now seen corresponding path program 1 times
[2024-11-08 17:29:50,943 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 17:29:50,943 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1947955974]
[2024-11-08 17:29:50,944 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:29:50,944 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:29:50,944 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:29:50,946 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:29:50,950 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-11-08 17:29:51,071 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:29:51,075 INFO  L255         TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-08 17:29:51,078 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:29:51,136 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 17:29:51,136 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 17:29:51,137 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 17:29:51,137 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947955974]
[2024-11-08 17:29:51,137 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947955974] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:29:51,137 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:29:51,138 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 17:29:51,138 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541139208]
[2024-11-08 17:29:51,138 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:29:51,139 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 17:29:51,139 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 17:29:51,140 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 17:29:51,140 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-08 17:29:51,148 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45
[2024-11-08 17:29:51,150 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 78 flow. Second operand  has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 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 17:29:51,150 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 17:29:51,150 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45
[2024-11-08 17:29:51,151 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 17:29:51,578 INFO  L124   PetriNetUnfolderBase]: 1217/2055 cut-off events.
[2024-11-08 17:29:51,579 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-08 17:29:51,583 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3939 conditions, 2055 events. 1217/2055 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 12799 event pairs, 107 based on Foata normal form. 72/2122 useless extension candidates. Maximal degree in co-relation 3933. Up to 1213 conditions per place. 
[2024-11-08 17:29:51,608 INFO  L140   encePairwiseOnDemand]: 39/45 looper letters, 40 selfloop transitions, 5 changer transitions 1/58 dead transitions.
[2024-11-08 17:29:51,609 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 58 transitions, 220 flow
[2024-11-08 17:29:51,609 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-11-08 17:29:51,609 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-08 17:29:51,613 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions.
[2024-11-08 17:29:51,614 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.6222222222222222
[2024-11-08 17:29:51,615 INFO  L175             Difference]: Start difference. First operand has 45 places, 35 transitions, 78 flow. Second operand 4 states and 112 transitions.
[2024-11-08 17:29:51,615 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 58 transitions, 220 flow
[2024-11-08 17:29:51,616 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 58 transitions, 219 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-11-08 17:29:51,620 INFO  L231             Difference]: Finished difference. Result has 48 places, 38 transitions, 111 flow
[2024-11-08 17:29:51,621 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=111, PETRI_PLACES=48, PETRI_TRANSITIONS=38}
[2024-11-08 17:29:51,621 INFO  L277   CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places.
[2024-11-08 17:29:51,622 INFO  L471      AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 111 flow
[2024-11-08 17:29:51,622 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 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 17:29:51,622 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 17:29:51,622 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 17:29:51,644 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-11-08 17:29:51,828 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:29:51,828 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 17:29:51,829 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:29:51,829 INFO  L85        PathProgramCache]: Analyzing trace with hash 1674102313, now seen corresponding path program 1 times
[2024-11-08 17:29:51,830 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 17:29:51,830 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [563173307]
[2024-11-08 17:29:51,831 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:29:51,831 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:29:51,831 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:29:51,833 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:29:51,835 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-11-08 17:29:51,952 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:29:51,954 INFO  L255         TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-08 17:29:51,955 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:29:52,022 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 17:29:52,023 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 17:29:52,023 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 17:29:52,023 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563173307]
[2024-11-08 17:29:52,024 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [563173307] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:29:52,024 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:29:52,024 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-08 17:29:52,024 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278143534]
[2024-11-08 17:29:52,025 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:29:52,025 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-08 17:29:52,026 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 17:29:52,026 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-08 17:29:52,026 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-08 17:29:52,034 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45
[2024-11-08 17:29:52,035 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 111 flow. Second operand  has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:29:52,035 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 17:29:52,035 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45
[2024-11-08 17:29:52,035 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 17:29:52,418 INFO  L124   PetriNetUnfolderBase]: 801/1377 cut-off events.
[2024-11-08 17:29:52,418 INFO  L125   PetriNetUnfolderBase]: For 364/364 co-relation queries the response was YES.
[2024-11-08 17:29:52,421 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3144 conditions, 1377 events. 801/1377 cut-off events. For 364/364 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7541 event pairs, 41 based on Foata normal form. 64/1436 useless extension candidates. Maximal degree in co-relation 3135. Up to 625 conditions per place. 
[2024-11-08 17:29:52,427 INFO  L140   encePairwiseOnDemand]: 39/45 looper letters, 50 selfloop transitions, 8 changer transitions 1/71 dead transitions.
[2024-11-08 17:29:52,427 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 71 transitions, 316 flow
[2024-11-08 17:29:52,427 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-11-08 17:29:52,428 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-11-08 17:29:52,428 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 141 transitions.
[2024-11-08 17:29:52,433 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.6266666666666667
[2024-11-08 17:29:52,433 INFO  L175             Difference]: Start difference. First operand has 48 places, 38 transitions, 111 flow. Second operand 5 states and 141 transitions.
[2024-11-08 17:29:52,433 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 71 transitions, 316 flow
[2024-11-08 17:29:52,435 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 71 transitions, 306 flow, removed 1 selfloop flow, removed 2 redundant places.
[2024-11-08 17:29:52,436 INFO  L231             Difference]: Finished difference. Result has 52 places, 41 transitions, 151 flow
[2024-11-08 17:29:52,436 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=151, PETRI_PLACES=52, PETRI_TRANSITIONS=41}
[2024-11-08 17:29:52,437 INFO  L277   CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places.
[2024-11-08 17:29:52,437 INFO  L471      AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 151 flow
[2024-11-08 17:29:52,437 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 17:29:52,437 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 17:29:52,437 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 17:29:52,459 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-11-08 17:29:52,638 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:29:52,638 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 17:29:52,639 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:29:52,639 INFO  L85        PathProgramCache]: Analyzing trace with hash -1790783200, now seen corresponding path program 1 times
[2024-11-08 17:29:52,639 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 17:29:52,639 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1493654479]
[2024-11-08 17:29:52,640 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:29:52,640 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:29:52,640 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:29:52,642 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:29:52,644 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-11-08 17:29:52,773 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:29:52,775 INFO  L255         TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-08 17:29:52,778 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:29:52,855 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 17:29:52,855 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 17:29:52,855 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 17:29:52,855 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493654479]
[2024-11-08 17:29:52,856 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493654479] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:29:52,856 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:29:52,856 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-08 17:29:52,856 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688837005]
[2024-11-08 17:29:52,856 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:29:52,856 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-08 17:29:52,857 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 17:29:52,857 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-08 17:29:52,857 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-08 17:29:52,866 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 16 out of 45
[2024-11-08 17:29:52,867 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 151 flow. Second operand  has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 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 17:29:52,867 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 17:29:52,867 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 45
[2024-11-08 17:29:52,867 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 17:29:53,244 INFO  L124   PetriNetUnfolderBase]: 423/719 cut-off events.
[2024-11-08 17:29:53,245 INFO  L125   PetriNetUnfolderBase]: For 671/671 co-relation queries the response was YES.
[2024-11-08 17:29:53,246 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1910 conditions, 719 events. 423/719 cut-off events. For 671/671 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3144 event pairs, 29 based on Foata normal form. 36/750 useless extension candidates. Maximal degree in co-relation 1899. Up to 268 conditions per place. 
[2024-11-08 17:29:53,250 INFO  L140   encePairwiseOnDemand]: 39/45 looper letters, 44 selfloop transitions, 11 changer transitions 1/68 dead transitions.
[2024-11-08 17:29:53,250 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 68 transitions, 327 flow
[2024-11-08 17:29:53,255 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-11-08 17:29:53,255 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-08 17:29:53,256 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions.
[2024-11-08 17:29:53,256 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.5703703703703704
[2024-11-08 17:29:53,256 INFO  L175             Difference]: Start difference. First operand has 52 places, 41 transitions, 151 flow. Second operand 6 states and 154 transitions.
[2024-11-08 17:29:53,256 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 68 transitions, 327 flow
[2024-11-08 17:29:53,260 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 68 transitions, 302 flow, removed 4 selfloop flow, removed 4 redundant places.
[2024-11-08 17:29:53,261 INFO  L231             Difference]: Finished difference. Result has 55 places, 41 transitions, 165 flow
[2024-11-08 17:29:53,262 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=165, PETRI_PLACES=55, PETRI_TRANSITIONS=41}
[2024-11-08 17:29:53,262 INFO  L277   CegarLoopForPetriNet]: 50 programPoint places, 5 predicate places.
[2024-11-08 17:29:53,263 INFO  L471      AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 165 flow
[2024-11-08 17:29:53,263 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 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 17:29:53,263 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 17:29:53,263 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, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:29:53,284 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2024-11-08 17:29:53,464 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:29:53,465 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 17:29:53,466 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:29:53,466 INFO  L85        PathProgramCache]: Analyzing trace with hash -1495982096, now seen corresponding path program 1 times
[2024-11-08 17:29:53,467 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 17:29:53,467 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1399415356]
[2024-11-08 17:29:53,467 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 17:29:53,467 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:29:53,468 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:29:53,469 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:29:53,471 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-11-08 17:29:53,586 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 17:29:53,589 INFO  L255         TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 8 conjuncts are in the unsatisfiable core
[2024-11-08 17:29:53,591 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:29:54,036 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 17:29:54,036 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 17:29:54,036 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 17:29:54,036 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399415356]
[2024-11-08 17:29:54,037 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399415356] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:29:54,041 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:29:54,041 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-08 17:29:54,041 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20442963]
[2024-11-08 17:29:54,041 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:29:54,042 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-08 17:29:54,042 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 17:29:54,042 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-08 17:29:54,043 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2024-11-08 17:29:54,062 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 17 out of 45
[2024-11-08 17:29:54,063 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 41 transitions, 165 flow. Second operand  has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 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 17:29:54,063 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 17:29:54,063 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 45
[2024-11-08 17:29:54,063 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 17:29:54,466 INFO  L124   PetriNetUnfolderBase]: 595/1169 cut-off events.
[2024-11-08 17:29:54,467 INFO  L125   PetriNetUnfolderBase]: For 553/577 co-relation queries the response was YES.
[2024-11-08 17:29:54,471 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2695 conditions, 1169 events. 595/1169 cut-off events. For 553/577 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6415 event pairs, 232 based on Foata normal form. 8/1133 useless extension candidates. Maximal degree in co-relation 2683. Up to 470 conditions per place. 
[2024-11-08 17:29:54,475 INFO  L140   encePairwiseOnDemand]: 39/45 looper letters, 30 selfloop transitions, 2 changer transitions 17/68 dead transitions.
[2024-11-08 17:29:54,476 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 68 transitions, 333 flow
[2024-11-08 17:29:54,476 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-11-08 17:29:54,477 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-08 17:29:54,477 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 152 transitions.
[2024-11-08 17:29:54,478 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.562962962962963
[2024-11-08 17:29:54,478 INFO  L175             Difference]: Start difference. First operand has 55 places, 41 transitions, 165 flow. Second operand 6 states and 152 transitions.
[2024-11-08 17:29:54,478 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 68 transitions, 333 flow
[2024-11-08 17:29:54,488 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 68 transitions, 266 flow, removed 14 selfloop flow, removed 8 redundant places.
[2024-11-08 17:29:54,489 INFO  L231             Difference]: Finished difference. Result has 56 places, 41 transitions, 123 flow
[2024-11-08 17:29:54,490 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=123, PETRI_PLACES=56, PETRI_TRANSITIONS=41}
[2024-11-08 17:29:54,491 INFO  L277   CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places.
[2024-11-08 17:29:54,492 INFO  L471      AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 123 flow
[2024-11-08 17:29:54,493 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 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 17:29:54,493 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 17:29:54,493 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, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:29:54,514 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2024-11-08 17:29:54,694 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:29:54,694 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 17:29:54,695 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:29:54,695 INFO  L85        PathProgramCache]: Analyzing trace with hash -1504880936, now seen corresponding path program 2 times
[2024-11-08 17:29:54,695 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 17:29:54,696 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [533246205]
[2024-11-08 17:29:54,696 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-08 17:29:54,696 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:29:54,696 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:29:54,698 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:29:54,701 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2024-11-08 17:29:54,821 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-11-08 17:29:54,822 INFO  L228   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 17:29:54,824 INFO  L255         TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 11 conjuncts are in the unsatisfiable core
[2024-11-08 17:29:54,827 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:29:55,082 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 17:29:55,082 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 17:29:55,083 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 17:29:55,083 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533246205]
[2024-11-08 17:29:55,083 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [533246205] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:29:55,083 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:29:55,083 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-08 17:29:55,084 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871485161]
[2024-11-08 17:29:55,084 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:29:55,084 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-08 17:29:55,085 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 17:29:55,085 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-08 17:29:55,086 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-11-08 17:29:55,128 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 14 out of 45
[2024-11-08 17:29:55,128 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 41 transitions, 123 flow. Second operand  has 9 states, 9 states have (on average 16.444444444444443) internal successors, (148), 9 states have internal predecessors, (148), 0 states have call successors, (0), 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 17:29:55,128 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 17:29:55,129 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 45
[2024-11-08 17:29:55,129 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 17:29:55,644 INFO  L124   PetriNetUnfolderBase]: 652/1140 cut-off events.
[2024-11-08 17:29:55,645 INFO  L125   PetriNetUnfolderBase]: For 162/166 co-relation queries the response was YES.
[2024-11-08 17:29:55,648 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2552 conditions, 1140 events. 652/1140 cut-off events. For 162/166 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5161 event pairs, 186 based on Foata normal form. 12/1146 useless extension candidates. Maximal degree in co-relation 2541. Up to 621 conditions per place. 
[2024-11-08 17:29:55,653 INFO  L140   encePairwiseOnDemand]: 35/45 looper letters, 45 selfloop transitions, 6 changer transitions 33/94 dead transitions.
[2024-11-08 17:29:55,653 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 94 transitions, 432 flow
[2024-11-08 17:29:55,654 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-11-08 17:29:55,655 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-11-08 17:29:55,655 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 205 transitions.
[2024-11-08 17:29:55,656 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.5061728395061729
[2024-11-08 17:29:55,656 INFO  L175             Difference]: Start difference. First operand has 56 places, 41 transitions, 123 flow. Second operand 9 states and 205 transitions.
[2024-11-08 17:29:55,656 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 94 transitions, 432 flow
[2024-11-08 17:29:55,658 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 94 transitions, 414 flow, removed 7 selfloop flow, removed 5 redundant places.
[2024-11-08 17:29:55,663 INFO  L231             Difference]: Finished difference. Result has 62 places, 43 transitions, 148 flow
[2024-11-08 17:29:55,665 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=148, PETRI_PLACES=62, PETRI_TRANSITIONS=43}
[2024-11-08 17:29:55,665 INFO  L277   CegarLoopForPetriNet]: 50 programPoint places, 12 predicate places.
[2024-11-08 17:29:55,666 INFO  L471      AbstractCegarLoop]: Abstraction has has 62 places, 43 transitions, 148 flow
[2024-11-08 17:29:55,666 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 16.444444444444443) internal successors, (148), 9 states have internal predecessors, (148), 0 states have call successors, (0), 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 17:29:55,666 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 17:29:55,666 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, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:29:55,688 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2024-11-08 17:29:55,871 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:29:55,871 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 17:29:55,872 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:29:55,872 INFO  L85        PathProgramCache]: Analyzing trace with hash -1952476492, now seen corresponding path program 3 times
[2024-11-08 17:29:55,872 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 17:29:55,872 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1027827690]
[2024-11-08 17:29:55,873 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-08 17:29:55,873 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:29:55,873 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:29:55,874 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:29:55,875 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2024-11-08 17:29:56,001 INFO  L227   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2024-11-08 17:29:56,002 INFO  L228   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 17:29:56,004 INFO  L255         TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 16 conjuncts are in the unsatisfiable core
[2024-11-08 17:29:56,006 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 17:29:56,401 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 17:29:56,401 INFO  L307         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-08 17:29:56,402 INFO  L136   FreeRefinementEngine]: Strategy FOX found an infeasible trace
[2024-11-08 17:29:56,402 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027827690]
[2024-11-08 17:29:56,402 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027827690] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 17:29:56,402 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 17:29:56,402 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-08 17:29:56,402 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197387972]
[2024-11-08 17:29:56,403 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 17:29:56,403 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-11-08 17:29:56,403 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX
[2024-11-08 17:29:56,404 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-11-08 17:29:56,404 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2024-11-08 17:29:56,417 INFO  L467   CegarLoopForPetriNet]: Number of universal loopers: 18 out of 45
[2024-11-08 17:29:56,418 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 43 transitions, 148 flow. Second operand  has 9 states, 9 states have (on average 20.0) internal successors, (180), 9 states have internal predecessors, (180), 0 states have call successors, (0), 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 17:29:56,418 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-08 17:29:56,418 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 45
[2024-11-08 17:29:56,418 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-08 17:29:56,800 INFO  L124   PetriNetUnfolderBase]: 455/889 cut-off events.
[2024-11-08 17:29:56,801 INFO  L125   PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES.
[2024-11-08 17:29:56,803 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1875 conditions, 889 events. 455/889 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4415 event pairs, 136 based on Foata normal form. 8/866 useless extension candidates. Maximal degree in co-relation 1861. Up to 343 conditions per place. 
[2024-11-08 17:29:56,806 INFO  L140   encePairwiseOnDemand]: 37/45 looper letters, 26 selfloop transitions, 4 changer transitions 17/67 dead transitions.
[2024-11-08 17:29:56,806 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 67 transitions, 295 flow
[2024-11-08 17:29:56,807 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-11-08 17:29:56,807 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-11-08 17:29:56,808 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 172 transitions.
[2024-11-08 17:29:56,808 INFO  L512   CegarLoopForPetriNet]: DFA transition density 0.546031746031746
[2024-11-08 17:29:56,808 INFO  L175             Difference]: Start difference. First operand has 62 places, 43 transitions, 148 flow. Second operand 7 states and 172 transitions.
[2024-11-08 17:29:56,808 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 67 transitions, 295 flow
[2024-11-08 17:29:56,810 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 67 transitions, 271 flow, removed 7 selfloop flow, removed 6 redundant places.
[2024-11-08 17:29:56,811 INFO  L231             Difference]: Finished difference. Result has 61 places, 43 transitions, 148 flow
[2024-11-08 17:29:56,811 INFO  L260   CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=148, PETRI_PLACES=61, PETRI_TRANSITIONS=43}
[2024-11-08 17:29:56,812 INFO  L277   CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places.
[2024-11-08 17:29:56,812 INFO  L471      AbstractCegarLoop]: Abstraction has has 61 places, 43 transitions, 148 flow
[2024-11-08 17:29:56,812 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 20.0) internal successors, (180), 9 states have internal predecessors, (180), 0 states have call successors, (0), 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 17:29:56,813 INFO  L196   CegarLoopForPetriNet]: Found error trace
[2024-11-08 17:29:56,813 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, 1, 1, 1, 1, 1, 1]
[2024-11-08 17:29:56,834 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0
[2024-11-08 17:29:57,013 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:29:57,014 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] ===
[2024-11-08 17:29:57,014 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 17:29:57,014 INFO  L85        PathProgramCache]: Analyzing trace with hash 2078474944, now seen corresponding path program 4 times
[2024-11-08 17:29:57,015 INFO  L118   FreeRefinementEngine]: Executing refinement strategy FOX
[2024-11-08 17:29:57,015 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [175170679]
[2024-11-08 17:29:57,015 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-11-08 17:29:57,015 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:29:57,015 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 17:29:57,023 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 17:29:57,025 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2024-11-08 17:29:57,144 INFO  L227   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-11-08 17:29:57,144 INFO  L228   tOrderPrioritization]: Conjunction of SSA is sat
[2024-11-08 17:29:57,144 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 17:29:57,187 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 17:29:57,243 INFO  L130   FreeRefinementEngine]: Strategy FOX found a feasible trace
[2024-11-08 17:29:57,243 INFO  L325         BasicCegarLoop]: Counterexample is feasible
[2024-11-08 17:29:57,244 INFO  L782   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining)
[2024-11-08 17:29:57,246 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining)
[2024-11-08 17:29:57,247 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining)
[2024-11-08 17:29:57,247 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining)
[2024-11-08 17:29:57,247 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining)
[2024-11-08 17:29:57,247 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining)
[2024-11-08 17:29:57,247 INFO  L782   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining)
[2024-11-08 17:29:57,269 INFO  L540       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0
[2024-11-08 17:29:57,448 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 17:29:57,449 INFO  L407         BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1]
[2024-11-08 17:29:57,538 INFO  L239   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-11-08 17:29:57,539 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2024-11-08 17:29:57,545 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 05:29:57 BasicIcfg
[2024-11-08 17:29:57,546 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-08 17:29:57,546 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-08 17:29:57,546 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2024-11-08 17:29:57,547 INFO  L274        PluginConnector]: Witness Printer initialized
[2024-11-08 17:29:57,547 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:29:48" (3/4) ...
[2024-11-08 17:29:57,550 INFO  L145         WitnessPrinter]: No result that supports witness generation found
[2024-11-08 17:29:57,551 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-08 17:29:57,552 INFO  L158              Benchmark]: Toolchain (without parser) took 10690.82ms. Allocated memory was 65.0MB in the beginning and 201.3MB in the end (delta: 136.3MB). Free memory was 39.4MB in the beginning and 118.6MB in the end (delta: -79.2MB). Peak memory consumption was 59.2MB. Max. memory is 16.1GB.
[2024-11-08 17:29:57,552 INFO  L158              Benchmark]: CDTParser took 0.23ms. Allocated memory is still 65.0MB. Free memory was 40.6MB in the beginning and 40.5MB in the end (delta: 81.7kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 17:29:57,553 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 865.77ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 39.2MB in the beginning and 42.4MB in the end (delta: -3.2MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB.
[2024-11-08 17:29:57,553 INFO  L158              Benchmark]: Boogie Procedure Inliner took 88.23ms. Allocated memory is still 79.7MB. Free memory was 42.4MB in the beginning and 39.4MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-11-08 17:29:57,554 INFO  L158              Benchmark]: Boogie Preprocessor took 102.56ms. Allocated memory is still 79.7MB. Free memory was 39.4MB in the beginning and 56.2MB in the end (delta: -16.8MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB.
[2024-11-08 17:29:57,554 INFO  L158              Benchmark]: RCFGBuilder took 1073.74ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 55.8MB in the beginning and 62.2MB in the end (delta: -6.3MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB.
[2024-11-08 17:29:57,555 INFO  L158              Benchmark]: TraceAbstraction took 8548.91ms. Allocated memory was 96.5MB in the beginning and 201.3MB in the end (delta: 104.9MB). Free memory was 61.6MB in the beginning and 118.6MB in the end (delta: -57.0MB). Peak memory consumption was 46.9MB. Max. memory is 16.1GB.
[2024-11-08 17:29:57,555 INFO  L158              Benchmark]: Witness Printer took 4.71ms. Allocated memory is still 201.3MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 17:29:57,557 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.23ms. Allocated memory is still 65.0MB. Free memory was 40.6MB in the beginning and 40.5MB in the end (delta: 81.7kB). There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 865.77ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 39.2MB in the beginning and 42.4MB in the end (delta: -3.2MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 88.23ms. Allocated memory is still 79.7MB. Free memory was 42.4MB in the beginning and 39.4MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 102.56ms. Allocated memory is still 79.7MB. Free memory was 39.4MB in the beginning and 56.2MB in the end (delta: -16.8MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB.
 * RCFGBuilder took 1073.74ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 55.8MB in the beginning and 62.2MB in the end (delta: -6.3MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB.
 * TraceAbstraction took 8548.91ms. Allocated memory was 96.5MB in the beginning and 201.3MB in the end (delta: 104.9MB). Free memory was 61.6MB in the beginning and 118.6MB in the end (delta: -57.0MB). Peak memory consumption was 46.9MB. Max. memory is 16.1GB.
 * Witness Printer took 4.71ms. Allocated memory is still 201.3MB. Free memory is still 118.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: 
[L709]               0  int __unbuffered_cnt = 0;
[L711]               0  int __unbuffered_p2_EAX = 0;
[L713]               0  int __unbuffered_p2_EBX = 0;
[L714]               0  _Bool main$tmp_guard0;
[L715]               0  _Bool main$tmp_guard1;
[L717]               0  int x = 0;
[L719]               0  int y = 0;
[L720]               0  _Bool y$flush_delayed;
[L721]               0  int y$mem_tmp;
[L722]               0  _Bool y$r_buff0_thd0;
[L723]               0  _Bool y$r_buff0_thd1;
[L724]               0  _Bool y$r_buff0_thd2;
[L725]               0  _Bool y$r_buff0_thd3;
[L726]               0  _Bool y$r_buff1_thd0;
[L727]               0  _Bool y$r_buff1_thd1;
[L728]               0  _Bool y$r_buff1_thd2;
[L729]               0  _Bool y$r_buff1_thd3;
[L730]               0  _Bool y$read_delayed;
[L731]               0  int *y$read_delayed_var;
[L732]               0  int y$w_buff0;
[L733]               0  _Bool y$w_buff0_used;
[L734]               0  int y$w_buff1;
[L735]               0  _Bool y$w_buff1_used;
[L737]               0  int z = 0;
[L738]               0  _Bool weak$$choice0;
[L739]               0  _Bool weak$$choice2;
[L831]               0  pthread_t t763;
[L832]  FCALL, FORK  0  pthread_create(&t763, ((void *)0), P0, ((void *)0))
        VAL             [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t763=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L833]               0  pthread_t t764;
[L834]  FCALL, FORK  0  pthread_create(&t764, ((void *)0), P1, ((void *)0))
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t763=-2, t764=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L835]               0  pthread_t t765;
[L836]  FCALL, FORK  0  pthread_create(&t765, ((void *)0), P2, ((void *)0))
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t763=-2, t764=-1, t765=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L778]               3  y$w_buff1 = y$w_buff0
[L779]               3  y$w_buff0 = 2
[L780]               3  y$w_buff1_used = y$w_buff0_used
[L781]               3  y$w_buff0_used = (_Bool)1
[L782]  CALL         3  __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L18]   COND FALSE   3  !(!expression)
[L782]  RET          3  __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L783]               3  y$r_buff1_thd0 = y$r_buff0_thd0
[L784]               3  y$r_buff1_thd1 = y$r_buff0_thd1
[L785]               3  y$r_buff1_thd2 = y$r_buff0_thd2
[L786]               3  y$r_buff1_thd3 = y$r_buff0_thd3
[L787]               3  y$r_buff0_thd3 = (_Bool)1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L790]               3  weak$$choice0 = __VERIFIER_nondet_bool()
[L791]               3  weak$$choice2 = __VERIFIER_nondet_bool()
[L792]               3  y$flush_delayed = weak$$choice2
[L793]               3  y$mem_tmp = y
[L794]               3  y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L795]               3  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L796]               3  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L797]               3  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L798]               3  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L799]               3  y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L800]               3  y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L801]               3  __unbuffered_p2_EAX = y
[L802]               3  y = y$flush_delayed ? y$mem_tmp : y
[L803]               3  y$flush_delayed = (_Bool)0
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L806]               3  __unbuffered_p2_EBX = z
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L743]               1  z = 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L746]               1  x = 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L751]               1  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L758]               2  x = 2
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L761]               2  y = 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1]
[L764]               2  y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L765]               2  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L766]               2  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L767]               2  y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L768]               2  y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1]
[L771]               2  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1]
[L809]               3  y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L810]               3  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L811]               3  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L812]               3  y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L813]               3  y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1]
[L816]               3  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1]
[L838]               0  main$tmp_guard0 = __unbuffered_cnt == 3
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t763=-2, t764=-1, t765=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1]
[L840]  CALL         0  assume_abort_if_not(main$tmp_guard0)
[L3]    COND FALSE   0  !(!cond)
[L840]  RET          0  assume_abort_if_not(main$tmp_guard0)
[L842]               0  y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L843]               0  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L844]               0  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L845]               0  y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L846]               0  y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t763=-2, t764=-1, t765=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1]
[L849]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L850]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L851]               0  y$flush_delayed = weak$$choice2
[L852]               0  y$mem_tmp = y
[L853]               0  y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L854]               0  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L855]               0  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L856]               0  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L857]               0  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L858]               0  y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L859]               0  y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L860]               0  main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0)
[L861]               0  y = y$flush_delayed ? y$mem_tmp : y
[L862]               0  y$flush_delayed = (_Bool)0
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t763=-2, t764=-1, t765=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1]
[L864]  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}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1]
[L17]                0  __assert_fail ("0", "mix028_tso.c", 8, __extension__ __PRETTY_FUNCTION__)
        VAL             [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, 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: 829]: Unable to prove that all allocated memory was freed
    Unable to prove that all allocated memory was freed
 Reason: Not analyzed. 
  - UnprovableResult [Line: 834]: 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: 832]: 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: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 7 procedures, 70 locations, 7 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: 8.3s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 321 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 309 mSDsluCounter, 133 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 130 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1065 IncrementalHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 3 mSDtfsCounter, 1065 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 182 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=165occurred in iteration=5, InterpolantAutomatonStates: 43, 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.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 207 NumberOfCodeBlocks, 207 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 168 ConstructedInterpolants, 0 QuantifiedInterpolants, 714 SizeOfPredicates, 22 NumberOfNonLiveVariables, 877 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 17:29:57,592 INFO  L552       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d549b0-4f01-4427-a06c-774865c854ec/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