./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/rfi006_rmo.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for memory safety (deref-memtrack)
Using default analysis
Version 023d838f
Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/rfi006_rmo.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 304137b4cdfcb1cb721c511de7faa38271d71a9e3815c7f79977f44461721381
--- Real Ultimate output ---
This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m
[2024-11-10 17:57:43,182 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-10 17:57:43,259 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf
[2024-11-10 17:57:43,262 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-10 17:57:43,262 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-10 17:57:43,287 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-10 17:57:43,288 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-10 17:57:43,288 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-10 17:57:43,289 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-10 17:57:43,290 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-10 17:57:43,290 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-10 17:57:43,291 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-10 17:57:43,291 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-10 17:57:43,291 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-10 17:57:43,292 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-10 17:57:43,292 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-10 17:57:43,292 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-10 17:57:43,292 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-10 17:57:43,292 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-10 17:57:43,293 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-10 17:57:43,293 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2024-11-10 17:57:43,299 INFO L153 SettingsManager]: * Bitprecise bitfields=true
[2024-11-10 17:57:43,300 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2024-11-10 17:57:43,300 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-10 17:57:43,300 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-10 17:57:43,300 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-10 17:57:43,300 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-11-10 17:57:43,300 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-10 17:57:43,301 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-10 17:57:43,301 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2024-11-10 17:57:43,301 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-10 17:57:43,301 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-10 17:57:43,302 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-10 17:57:43,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-10 17:57:43,302 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-10 17:57:43,303 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-10 17:57:43,303 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-10 17:57:43,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-10 17:57:43,303 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-10 17:57:43,303 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-10 17:57:43,303 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-10 17:57:43,304 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-10 17:57:43,304 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux
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 -> 304137b4cdfcb1cb721c511de7faa38271d71a9e3815c7f79977f44461721381
[2024-11-10 17:57:43,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-10 17:57:43,541 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-10 17:57:43,544 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-10 17:57:43,545 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-10 17:57:43,546 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-10 17:57:43,547 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi006_rmo.i
[2024-11-10 17:57:44,824 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-10 17:57:45,010 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-10 17:57:45,010 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi006_rmo.i
[2024-11-10 17:57:45,024 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a371be5bb/a1dd749a049945e38c8a76313cf16fdb/FLAG729ab08f4
[2024-11-10 17:57:45,384 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a371be5bb/a1dd749a049945e38c8a76313cf16fdb
[2024-11-10 17:57:45,386 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-10 17:57:45,387 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-10 17:57:45,389 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-10 17:57:45,389 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-10 17:57:45,393 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-10 17:57:45,394 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:57:45" (1/1) ...
[2024-11-10 17:57:45,395 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47740eff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:57:45, skipping insertion in model container
[2024-11-10 17:57:45,395 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:57:45" (1/1) ...
[2024-11-10 17:57:45,435 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-10 17:57:45,740 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-10 17:57:45,755 INFO L200 MainTranslator]: Completed pre-run
[2024-11-10 17:57:45,821 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-10 17:57:45,856 INFO L204 MainTranslator]: Completed translation
[2024-11-10 17:57:45,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:57:45 WrapperNode
[2024-11-10 17:57:45,857 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-10 17:57:45,857 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-10 17:57:45,858 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-10 17:57:45,858 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-10 17:57:45,863 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:57:45" (1/1) ...
[2024-11-10 17:57:45,876 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:57:45" (1/1) ...
[2024-11-10 17:57:45,894 INFO L138 Inliner]: procedures = 175, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127
[2024-11-10 17:57:45,895 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-10 17:57:45,895 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-10 17:57:45,895 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-10 17:57:45,896 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-10 17:57:45,904 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:57:45" (1/1) ...
[2024-11-10 17:57:45,904 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:57:45" (1/1) ...
[2024-11-10 17:57:45,907 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:57:45" (1/1) ...
[2024-11-10 17:57:45,928 INFO L175 MemorySlicer]: Split 21 memory accesses to 2 slices as follows [2, 19]. 90 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 7 writes are split as follows [0, 7].
[2024-11-10 17:57:45,928 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:57:45" (1/1) ...
[2024-11-10 17:57:45,929 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:57:45" (1/1) ...
[2024-11-10 17:57:45,935 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:57:45" (1/1) ...
[2024-11-10 17:57:45,936 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:57:45" (1/1) ...
[2024-11-10 17:57:45,937 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:57:45" (1/1) ...
[2024-11-10 17:57:45,939 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:57:45" (1/1) ...
[2024-11-10 17:57:45,942 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-10 17:57:45,942 INFO L112 PluginConnector]: ------------------------IcfgBuilder----------------------------
[2024-11-10 17:57:45,942 INFO L270 PluginConnector]: Initializing IcfgBuilder...
[2024-11-10 17:57:45,943 INFO L274 PluginConnector]: IcfgBuilder initialized
[2024-11-10 17:57:45,943 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:57:45" (1/1) ...
[2024-11-10 17:57:45,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-10 17:57:45,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-10 17:57:45,970 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-10 17:57:45,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-10 17:57:46,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0
[2024-11-10 17:57:46,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1
[2024-11-10 17:57:46,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0
[2024-11-10 17:57:46,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1
[2024-11-10 17:57:46,017 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-11-10 17:57:46,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-10 17:57:46,018 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2024-11-10 17:57:46,018 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2024-11-10 17:57:46,018 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2024-11-10 17:57:46,018 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2024-11-10 17:57:46,018 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2024-11-10 17:57:46,019 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2024-11-10 17:57:46,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-10 17:57:46,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1
[2024-11-10 17:57:46,020 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-11-10 17:57:46,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-10 17:57:46,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-10 17:57:46,022 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-11-10 17:57:46,157 INFO L256 CfgBuilder]: Building ICFG
[2024-11-10 17:57:46,159 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-10 17:57:46,641 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-11-10 17:57:46,642 INFO L307 CfgBuilder]: Performing block encoding
[2024-11-10 17:57:47,010 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-10 17:57:47,010 INFO L336 CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-10 17:57:47,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:57:47 BoogieIcfgContainer
[2024-11-10 17:57:47,010 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2024-11-10 17:57:47,012 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-10 17:57:47,012 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-10 17:57:47,015 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-10 17:57:47,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:57:45" (1/3) ...
[2024-11-10 17:57:47,015 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@668cb97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:57:47, skipping insertion in model container
[2024-11-10 17:57:47,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:57:45" (2/3) ...
[2024-11-10 17:57:47,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@668cb97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:57:47, skipping insertion in model container
[2024-11-10 17:57:47,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:57:47" (3/3) ...
[2024-11-10 17:57:47,018 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi006_rmo.i
[2024-11-10 17:57:47,032 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-10 17:57:47,032 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations.
[2024-11-10 17:57:47,032 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-11-10 17:57:47,137 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-11-10 17:57:47,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 79 transitions, 170 flow
[2024-11-10 17:57:47,200 INFO L124 PetriNetUnfolderBase]: 2/76 cut-off events.
[2024-11-10 17:57:47,201 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-10 17:57:47,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 76 events. 2/76 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 276 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place.
[2024-11-10 17:57:47,207 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 79 transitions, 170 flow
[2024-11-10 17:57:47,211 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 76 transitions, 161 flow
[2024-11-10 17:57:47,220 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-10 17:57:47,225 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;@69843ae8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-10 17:57:47,226 INFO L334 AbstractCegarLoop]: Starting to check reachability of 71 error locations.
[2024-11-10 17:57:47,229 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-11-10 17:57:47,229 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events.
[2024-11-10 17:57:47,230 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-10 17:57:47,230 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-10 17:57:47,230 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2024-11-10 17:57:47,230 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] ===
[2024-11-10 17:57:47,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-10 17:57:47,234 INFO L85 PathProgramCache]: Analyzing trace with hash 21617673, now seen corresponding path program 1 times
[2024-11-10 17:57:47,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-10 17:57:47,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249489860]
[2024-11-10 17:57:47,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-10 17:57:47,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-10 17:57:47,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 17:57:47,626 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-10 17:57:47,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-10 17:57:47,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249489860]
[2024-11-10 17:57:47,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249489860] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-10 17:57:47,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-10 17:57:47,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-10 17:57:47,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54606880]
[2024-11-10 17:57:47,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-10 17:57:47,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-10 17:57:47,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-10 17:57:47,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-10 17:57:47,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-10 17:57:47,660 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 79
[2024-11-10 17:57:47,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 76 transitions, 161 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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-10 17:57:47,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-10 17:57:47,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 79
[2024-11-10 17:57:47,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-10 17:57:50,125 INFO L124 PetriNetUnfolderBase]: 16111/24314 cut-off events.
[2024-11-10 17:57:50,127 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES.
[2024-11-10 17:57:50,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46957 conditions, 24314 events. 16111/24314 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 1052. Compared 167982 event pairs, 16111 based on Foata normal form. 896/19339 useless extension candidates. Maximal degree in co-relation 46946. Up to 22510 conditions per place.
[2024-11-10 17:57:50,302 INFO L140 encePairwiseOnDemand]: 49/79 looper letters, 38 selfloop transitions, 1 changer transitions 0/46 dead transitions.
[2024-11-10 17:57:50,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 46 transitions, 179 flow
[2024-11-10 17:57:50,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-10 17:57:50,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-10 17:57:50,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions.
[2024-11-10 17:57:50,312 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.41350210970464135
[2024-11-10 17:57:50,313 INFO L175 Difference]: Start difference. First operand has 84 places, 76 transitions, 161 flow. Second operand 3 states and 98 transitions.
[2024-11-10 17:57:50,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 46 transitions, 179 flow
[2024-11-10 17:57:50,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 46 transitions, 176 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-11-10 17:57:50,318 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 100 flow
[2024-11-10 17:57:50,320 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=55, PETRI_TRANSITIONS=46}
[2024-11-10 17:57:50,322 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -29 predicate places.
[2024-11-10 17:57:50,323 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 100 flow
[2024-11-10 17:57:50,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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-10 17:57:50,323 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-10 17:57:50,323 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2024-11-10 17:57:50,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-10 17:57:50,324 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] ===
[2024-11-10 17:57:50,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-10 17:57:50,324 INFO L85 PathProgramCache]: Analyzing trace with hash 21617674, now seen corresponding path program 1 times
[2024-11-10 17:57:50,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-10 17:57:50,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279083111]
[2024-11-10 17:57:50,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-10 17:57:50,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-10 17:57:50,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 17:57:50,405 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-10 17:57:50,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-10 17:57:50,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279083111]
[2024-11-10 17:57:50,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279083111] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-10 17:57:50,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-10 17:57:50,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-10 17:57:50,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973590341]
[2024-11-10 17:57:50,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-10 17:57:50,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-10 17:57:50,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-10 17:57:50,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-10 17:57:50,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-10 17:57:50,407 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 79
[2024-11-10 17:57:50,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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-10 17:57:50,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-10 17:57:50,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 79
[2024-11-10 17:57:50,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-10 17:57:51,535 INFO L124 PetriNetUnfolderBase]: 6219/9685 cut-off events.
[2024-11-10 17:57:51,535 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-10 17:57:51,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18623 conditions, 9685 events. 6219/9685 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 59910 event pairs, 6219 based on Foata normal form. 0/9253 useless extension candidates. Maximal degree in co-relation 18617. Up to 8836 conditions per place.
[2024-11-10 17:57:51,567 INFO L140 encePairwiseOnDemand]: 71/79 looper letters, 30 selfloop transitions, 1 changer transitions 1/39 dead transitions.
[2024-11-10 17:57:51,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 150 flow
[2024-11-10 17:57:51,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-10 17:57:51,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-10 17:57:51,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions.
[2024-11-10 17:57:51,569 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2911392405063291
[2024-11-10 17:57:51,569 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 100 flow. Second operand 3 states and 69 transitions.
[2024-11-10 17:57:51,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 150 flow
[2024-11-10 17:57:51,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 39 transitions, 149 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-11-10 17:57:51,570 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 85 flow
[2024-11-10 17:57:51,570 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=49, PETRI_TRANSITIONS=38}
[2024-11-10 17:57:51,571 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -35 predicate places.
[2024-11-10 17:57:51,571 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 85 flow
[2024-11-10 17:57:51,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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-10 17:57:51,572 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-10 17:57:51,572 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-10 17:57:51,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-10 17:57:51,572 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] ===
[2024-11-10 17:57:51,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-10 17:57:51,573 INFO L85 PathProgramCache]: Analyzing trace with hash -515144654, now seen corresponding path program 1 times
[2024-11-10 17:57:51,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-10 17:57:51,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393627605]
[2024-11-10 17:57:51,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-10 17:57:51,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-10 17:57:51,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 17:57:51,650 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-10 17:57:51,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-10 17:57:51,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393627605]
[2024-11-10 17:57:51,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393627605] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-10 17:57:51,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-10 17:57:51,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-10 17:57:51,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902423456]
[2024-11-10 17:57:51,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-10 17:57:51,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-10 17:57:51,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-10 17:57:51,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-10 17:57:51,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-10 17:57:51,653 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 79
[2024-11-10 17:57:51,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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-10 17:57:51,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-10 17:57:51,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 79
[2024-11-10 17:57:51,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-10 17:57:52,444 INFO L124 PetriNetUnfolderBase]: 5510/7991 cut-off events.
[2024-11-10 17:57:52,445 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-10 17:57:52,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15941 conditions, 7991 events. 5510/7991 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 45328 event pairs, 780 based on Foata normal form. 0/7637 useless extension candidates. Maximal degree in co-relation 15934. Up to 7016 conditions per place.
[2024-11-10 17:57:52,481 INFO L140 encePairwiseOnDemand]: 75/79 looper letters, 51 selfloop transitions, 2 changer transitions 0/60 dead transitions.
[2024-11-10 17:57:52,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 60 transitions, 239 flow
[2024-11-10 17:57:52,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-10 17:57:52,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-10 17:57:52,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions.
[2024-11-10 17:57:52,483 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.35864978902953587
[2024-11-10 17:57:52,483 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 85 flow. Second operand 3 states and 85 transitions.
[2024-11-10 17:57:52,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 60 transitions, 239 flow
[2024-11-10 17:57:52,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 60 transitions, 238 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-11-10 17:57:52,485 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 94 flow
[2024-11-10 17:57:52,485 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, 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=94, PETRI_PLACES=50, PETRI_TRANSITIONS=38}
[2024-11-10 17:57:52,486 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -34 predicate places.
[2024-11-10 17:57:52,486 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 94 flow
[2024-11-10 17:57:52,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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-10 17:57:52,486 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-10 17:57:52,487 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-10 17:57:52,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-10 17:57:52,487 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] ===
[2024-11-10 17:57:52,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-10 17:57:52,487 INFO L85 PathProgramCache]: Analyzing trace with hash -283110625, now seen corresponding path program 1 times
[2024-11-10 17:57:52,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-10 17:57:52,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782274716]
[2024-11-10 17:57:52,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-10 17:57:52,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-10 17:57:52,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 17:57:52,568 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-10 17:57:52,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-10 17:57:52,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782274716]
[2024-11-10 17:57:52,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782274716] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-10 17:57:52,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-10 17:57:52,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-10 17:57:52,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920783442]
[2024-11-10 17:57:52,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-10 17:57:52,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-10 17:57:52,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-10 17:57:52,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-10 17:57:52,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-10 17:57:52,574 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 79
[2024-11-10 17:57:52,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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-10 17:57:52,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-10 17:57:52,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 79
[2024-11-10 17:57:52,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-10 17:57:53,395 INFO L124 PetriNetUnfolderBase]: 5080/7386 cut-off events.
[2024-11-10 17:57:53,395 INFO L125 PetriNetUnfolderBase]: For 471/471 co-relation queries the response was YES.
[2024-11-10 17:57:53,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15570 conditions, 7386 events. 5080/7386 cut-off events. For 471/471 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 41603 event pairs, 640 based on Foata normal form. 0/7382 useless extension candidates. Maximal degree in co-relation 15561. Up to 6410 conditions per place.
[2024-11-10 17:57:53,421 INFO L140 encePairwiseOnDemand]: 76/79 looper letters, 50 selfloop transitions, 2 changer transitions 0/59 dead transitions.
[2024-11-10 17:57:53,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 59 transitions, 242 flow
[2024-11-10 17:57:53,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-10 17:57:53,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-10 17:57:53,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions.
[2024-11-10 17:57:53,423 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.29430379746835444
[2024-11-10 17:57:53,423 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 94 flow. Second operand 4 states and 93 transitions.
[2024-11-10 17:57:53,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 59 transitions, 242 flow
[2024-11-10 17:57:53,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 59 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-10 17:57:53,424 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 90 flow
[2024-11-10 17:57:53,424 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=50, PETRI_TRANSITIONS=37}
[2024-11-10 17:57:53,425 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -34 predicate places.
[2024-11-10 17:57:53,425 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 90 flow
[2024-11-10 17:57:53,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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-10 17:57:53,425 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-10 17:57:53,425 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-10 17:57:53,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-10 17:57:53,425 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] ===
[2024-11-10 17:57:53,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-10 17:57:53,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1132725050, now seen corresponding path program 1 times
[2024-11-10 17:57:53,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-10 17:57:53,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645741645]
[2024-11-10 17:57:53,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-10 17:57:53,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-10 17:57:53,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 17:57:53,564 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-10 17:57:53,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-10 17:57:53,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645741645]
[2024-11-10 17:57:53,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645741645] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-10 17:57:53,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-10 17:57:53,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-10 17:57:53,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324349970]
[2024-11-10 17:57:53,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-10 17:57:53,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-10 17:57:53,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-10 17:57:53,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-10 17:57:53,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-10 17:57:53,566 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 79
[2024-11-10 17:57:53,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-10 17:57:53,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-10 17:57:53,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 79
[2024-11-10 17:57:53,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-10 17:57:54,057 INFO L124 PetriNetUnfolderBase]: 4650/6781 cut-off events.
[2024-11-10 17:57:54,058 INFO L125 PetriNetUnfolderBase]: For 471/471 co-relation queries the response was YES.
[2024-11-10 17:57:54,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14185 conditions, 6781 events. 4650/6781 cut-off events. For 471/471 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 38097 event pairs, 500 based on Foata normal form. 175/6952 useless extension candidates. Maximal degree in co-relation 14176. Up to 5805 conditions per place.
[2024-11-10 17:57:54,092 INFO L140 encePairwiseOnDemand]: 76/79 looper letters, 49 selfloop transitions, 2 changer transitions 0/58 dead transitions.
[2024-11-10 17:57:54,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 58 transitions, 236 flow
[2024-11-10 17:57:54,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-10 17:57:54,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-10 17:57:54,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions.
[2024-11-10 17:57:54,093 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2911392405063291
[2024-11-10 17:57:54,094 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 90 flow. Second operand 4 states and 92 transitions.
[2024-11-10 17:57:54,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 58 transitions, 236 flow
[2024-11-10 17:57:54,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 231 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-11-10 17:57:54,095 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 85 flow
[2024-11-10 17:57:54,095 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=85, PETRI_PLACES=49, PETRI_TRANSITIONS=36}
[2024-11-10 17:57:54,096 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -35 predicate places.
[2024-11-10 17:57:54,096 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 85 flow
[2024-11-10 17:57:54,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-10 17:57:54,096 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-10 17:57:54,096 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-10 17:57:54,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-10 17:57:54,096 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] ===
[2024-11-10 17:57:54,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-10 17:57:54,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1945957182, now seen corresponding path program 1 times
[2024-11-10 17:57:54,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-10 17:57:54,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835391910]
[2024-11-10 17:57:54,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-10 17:57:54,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-10 17:57:54,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 17:57:54,134 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-10 17:57:54,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-10 17:57:54,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835391910]
[2024-11-10 17:57:54,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835391910] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-10 17:57:54,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-10 17:57:54,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-10 17:57:54,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663731784]
[2024-11-10 17:57:54,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-10 17:57:54,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-10 17:57:54,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-10 17:57:54,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-10 17:57:54,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-10 17:57:54,136 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 79
[2024-11-10 17:57:54,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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-10 17:57:54,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-10 17:57:54,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 79
[2024-11-10 17:57:54,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-10 17:57:54,871 INFO L124 PetriNetUnfolderBase]: 4650/7276 cut-off events.
[2024-11-10 17:57:54,871 INFO L125 PetriNetUnfolderBase]: For 331/331 co-relation queries the response was YES.
[2024-11-10 17:57:54,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14679 conditions, 7276 events. 4650/7276 cut-off events. For 331/331 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 43024 event pairs, 4650 based on Foata normal form. 210/7474 useless extension candidates. Maximal degree in co-relation 14671. Up to 6637 conditions per place.
[2024-11-10 17:57:54,889 INFO L140 encePairwiseOnDemand]: 77/79 looper letters, 27 selfloop transitions, 1 changer transitions 1/35 dead transitions.
[2024-11-10 17:57:54,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 35 transitions, 141 flow
[2024-11-10 17:57:54,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-10 17:57:54,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-10 17:57:54,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions.
[2024-11-10 17:57:54,891 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.24050632911392406
[2024-11-10 17:57:54,891 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 85 flow. Second operand 3 states and 57 transitions.
[2024-11-10 17:57:54,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 35 transitions, 141 flow
[2024-11-10 17:57:54,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 35 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-10 17:57:54,892 INFO L231 Difference]: Finished difference. Result has 48 places, 34 transitions, 80 flow
[2024-11-10 17:57:54,892 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=48, PETRI_TRANSITIONS=34}
[2024-11-10 17:57:54,892 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -36 predicate places.
[2024-11-10 17:57:54,892 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 34 transitions, 80 flow
[2024-11-10 17:57:54,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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-10 17:57:54,893 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-10 17:57:54,893 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-10 17:57:54,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-10 17:57:54,893 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] ===
[2024-11-10 17:57:54,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-10 17:57:54,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1945955547, now seen corresponding path program 1 times
[2024-11-10 17:57:54,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-10 17:57:54,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630581459]
[2024-11-10 17:57:54,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-10 17:57:54,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-10 17:57:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 17:57:55,061 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-10 17:57:55,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-10 17:57:55,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630581459]
[2024-11-10 17:57:55,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630581459] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-10 17:57:55,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-10 17:57:55,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-10 17:57:55,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788278939]
[2024-11-10 17:57:55,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-10 17:57:55,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-10 17:57:55,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-10 17:57:55,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-10 17:57:55,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-10 17:57:55,066 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 79
[2024-11-10 17:57:55,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 34 transitions, 80 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 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-10 17:57:55,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-10 17:57:55,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 79
[2024-11-10 17:57:55,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-10 17:57:55,736 INFO L124 PetriNetUnfolderBase]: 5907/8889 cut-off events.
[2024-11-10 17:57:55,736 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-10 17:57:55,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18309 conditions, 8889 events. 5907/8889 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 52448 event pairs, 1671 based on Foata normal form. 0/8686 useless extension candidates. Maximal degree in co-relation 18301. Up to 5672 conditions per place.
[2024-11-10 17:57:55,763 INFO L140 encePairwiseOnDemand]: 72/79 looper letters, 40 selfloop transitions, 3 changer transitions 65/113 dead transitions.
[2024-11-10 17:57:55,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 113 transitions, 470 flow
[2024-11-10 17:57:55,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-10 17:57:55,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-11-10 17:57:55,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 182 transitions.
[2024-11-10 17:57:55,765 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2879746835443038
[2024-11-10 17:57:55,765 INFO L175 Difference]: Start difference. First operand has 48 places, 34 transitions, 80 flow. Second operand 8 states and 182 transitions.
[2024-11-10 17:57:55,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 113 transitions, 470 flow
[2024-11-10 17:57:55,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 113 transitions, 469 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-11-10 17:57:55,766 INFO L231 Difference]: Finished difference. Result has 58 places, 35 transitions, 112 flow
[2024-11-10 17:57:55,766 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=112, PETRI_PLACES=58, PETRI_TRANSITIONS=35}
[2024-11-10 17:57:55,767 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -26 predicate places.
[2024-11-10 17:57:55,767 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 35 transitions, 112 flow
[2024-11-10 17:57:55,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 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-10 17:57:55,767 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-10 17:57:55,767 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-10 17:57:55,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-10 17:57:55,768 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] ===
[2024-11-10 17:57:55,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-10 17:57:55,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1262729084, now seen corresponding path program 1 times
[2024-11-10 17:57:55,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-10 17:57:55,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639589244]
[2024-11-10 17:57:55,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-10 17:57:55,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-10 17:57:55,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 17:57:55,886 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-10 17:57:55,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-10 17:57:55,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639589244]
[2024-11-10 17:57:55,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639589244] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-10 17:57:55,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-10 17:57:55,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-10 17:57:55,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780958219]
[2024-11-10 17:57:55,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-10 17:57:55,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-10 17:57:55,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-10 17:57:55,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-10 17:57:55,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-10 17:57:55,889 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 79
[2024-11-10 17:57:55,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 35 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 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-10 17:57:55,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-10 17:57:55,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 79
[2024-11-10 17:57:55,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-10 17:57:56,511 INFO L124 PetriNetUnfolderBase]: 4493/6798 cut-off events.
[2024-11-10 17:57:56,511 INFO L125 PetriNetUnfolderBase]: For 3838/3838 co-relation queries the response was YES.
[2024-11-10 17:57:56,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16751 conditions, 6798 events. 4493/6798 cut-off events. For 3838/3838 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 38570 event pairs, 956 based on Foata normal form. 200/6991 useless extension candidates. Maximal degree in co-relation 16737. Up to 4291 conditions per place.
[2024-11-10 17:57:56,531 INFO L140 encePairwiseOnDemand]: 74/79 looper letters, 43 selfloop transitions, 2 changer transitions 51/101 dead transitions.
[2024-11-10 17:57:56,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 101 transitions, 500 flow
[2024-11-10 17:57:56,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-10 17:57:56,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-11-10 17:57:56,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 159 transitions.
[2024-11-10 17:57:56,533 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2875226039783002
[2024-11-10 17:57:56,533 INFO L175 Difference]: Start difference. First operand has 58 places, 35 transitions, 112 flow. Second operand 7 states and 159 transitions.
[2024-11-10 17:57:56,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 101 transitions, 500 flow
[2024-11-10 17:57:56,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 101 transitions, 483 flow, removed 7 selfloop flow, removed 3 redundant places.
[2024-11-10 17:57:56,552 INFO L231 Difference]: Finished difference. Result has 60 places, 35 transitions, 119 flow
[2024-11-10 17:57:56,552 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=119, PETRI_PLACES=60, PETRI_TRANSITIONS=35}
[2024-11-10 17:57:56,553 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -24 predicate places.
[2024-11-10 17:57:56,555 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 35 transitions, 119 flow
[2024-11-10 17:57:56,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 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-10 17:57:56,555 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-10 17:57:56,556 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-10 17:57:56,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-10 17:57:56,556 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] ===
[2024-11-10 17:57:56,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-10 17:57:56,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1831329846, now seen corresponding path program 1 times
[2024-11-10 17:57:56,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-10 17:57:56,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577227115]
[2024-11-10 17:57:56,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-10 17:57:56,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-10 17:57:56,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 17:57:56,806 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-10 17:57:56,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-10 17:57:56,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577227115]
[2024-11-10 17:57:56,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577227115] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-10 17:57:56,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-10 17:57:56,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-10 17:57:56,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679326040]
[2024-11-10 17:57:56,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-10 17:57:56,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-10 17:57:56,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-10 17:57:56,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-10 17:57:56,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-10 17:57:56,812 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 79
[2024-11-10 17:57:56,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 35 transitions, 119 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 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-10 17:57:56,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-10 17:57:56,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 79
[2024-11-10 17:57:56,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-10 17:57:57,375 INFO L124 PetriNetUnfolderBase]: 4063/6139 cut-off events.
[2024-11-10 17:57:57,375 INFO L125 PetriNetUnfolderBase]: For 3901/3901 co-relation queries the response was YES.
[2024-11-10 17:57:57,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15604 conditions, 6139 events. 4063/6139 cut-off events. For 3901/3901 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 32656 event pairs, 1219 based on Foata normal form. 150/6285 useless extension candidates. Maximal degree in co-relation 15586. Up to 4521 conditions per place.
[2024-11-10 17:57:57,398 INFO L140 encePairwiseOnDemand]: 74/79 looper letters, 46 selfloop transitions, 2 changer transitions 45/98 dead transitions.
[2024-11-10 17:57:57,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 98 transitions, 472 flow
[2024-11-10 17:57:57,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-10 17:57:57,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-11-10 17:57:57,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 156 transitions.
[2024-11-10 17:57:57,399 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2820976491862568
[2024-11-10 17:57:57,399 INFO L175 Difference]: Start difference. First operand has 60 places, 35 transitions, 119 flow. Second operand 7 states and 156 transitions.
[2024-11-10 17:57:57,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 98 transitions, 472 flow
[2024-11-10 17:57:57,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 98 transitions, 448 flow, removed 9 selfloop flow, removed 6 redundant places.
[2024-11-10 17:57:57,417 INFO L231 Difference]: Finished difference. Result has 61 places, 35 transitions, 121 flow
[2024-11-10 17:57:57,418 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=121, PETRI_PLACES=61, PETRI_TRANSITIONS=35}
[2024-11-10 17:57:57,418 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -23 predicate places.
[2024-11-10 17:57:57,418 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 35 transitions, 121 flow
[2024-11-10 17:57:57,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 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-10 17:57:57,418 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-10 17:57:57,419 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-10 17:57:57,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-10 17:57:57,419 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] ===
[2024-11-10 17:57:57,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-10 17:57:57,419 INFO L85 PathProgramCache]: Analyzing trace with hash -15119333, now seen corresponding path program 1 times
[2024-11-10 17:57:57,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-10 17:57:57,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175299230]
[2024-11-10 17:57:57,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-10 17:57:57,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-10 17:57:57,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 17:57:57,972 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-10 17:57:57,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-10 17:57:57,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175299230]
[2024-11-10 17:57:57,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175299230] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-10 17:57:57,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-10 17:57:57,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-10 17:57:57,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262088267]
[2024-11-10 17:57:57,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-10 17:57:57,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-10 17:57:57,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-10 17:57:57,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-10 17:57:57,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-11-10 17:57:57,980 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 79
[2024-11-10 17:57:57,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 35 transitions, 121 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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-10 17:57:57,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-10 17:57:57,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 79
[2024-11-10 17:57:57,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-10 17:57:58,868 INFO L124 PetriNetUnfolderBase]: 3763/5664 cut-off events.
[2024-11-10 17:57:58,868 INFO L125 PetriNetUnfolderBase]: For 3975/3975 co-relation queries the response was YES.
[2024-11-10 17:57:58,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14522 conditions, 5664 events. 3763/5664 cut-off events. For 3975/3975 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 29034 event pairs, 387 based on Foata normal form. 125/5785 useless extension candidates. Maximal degree in co-relation 14503. Up to 3938 conditions per place.
[2024-11-10 17:57:58,894 INFO L140 encePairwiseOnDemand]: 73/79 looper letters, 58 selfloop transitions, 4 changer transitions 43/110 dead transitions.
[2024-11-10 17:57:58,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 110 transitions, 548 flow
[2024-11-10 17:57:58,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-10 17:57:58,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-11-10 17:57:58,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 175 transitions.
[2024-11-10 17:57:58,896 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.27689873417721517
[2024-11-10 17:57:58,896 INFO L175 Difference]: Start difference. First operand has 61 places, 35 transitions, 121 flow. Second operand 8 states and 175 transitions.
[2024-11-10 17:57:58,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 110 transitions, 548 flow
[2024-11-10 17:57:58,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 110 transitions, 526 flow, removed 8 selfloop flow, removed 6 redundant places.
[2024-11-10 17:57:58,911 INFO L231 Difference]: Finished difference. Result has 64 places, 37 transitions, 141 flow
[2024-11-10 17:57:58,911 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=141, PETRI_PLACES=64, PETRI_TRANSITIONS=37}
[2024-11-10 17:57:58,912 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -20 predicate places.
[2024-11-10 17:57:58,912 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 37 transitions, 141 flow
[2024-11-10 17:57:58,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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-10 17:57:58,912 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-10 17:57:58,912 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]
[2024-11-10 17:57:58,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-11-10 17:57:58,913 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] ===
[2024-11-10 17:57:58,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-10 17:57:58,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1778976482, now seen corresponding path program 1 times
[2024-11-10 17:57:58,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-10 17:57:58,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509756296]
[2024-11-10 17:57:58,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-10 17:57:58,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-10 17:57:58,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 17:57:59,051 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-10 17:57:59,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-10 17:57:59,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509756296]
[2024-11-10 17:57:59,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509756296] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-10 17:57:59,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-10 17:57:59,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-10 17:57:59,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376327732]
[2024-11-10 17:57:59,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-10 17:57:59,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-10 17:57:59,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-10 17:57:59,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-10 17:57:59,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-10 17:57:59,054 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 79
[2024-11-10 17:57:59,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 37 transitions, 141 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 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-10 17:57:59,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-10 17:57:59,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 79
[2024-11-10 17:57:59,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-10 17:57:59,634 INFO L124 PetriNetUnfolderBase]: 2934/4529 cut-off events.
[2024-11-10 17:57:59,634 INFO L125 PetriNetUnfolderBase]: For 2678/2678 co-relation queries the response was YES.
[2024-11-10 17:57:59,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11905 conditions, 4529 events. 2934/4529 cut-off events. For 2678/2678 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 23678 event pairs, 446 based on Foata normal form. 210/4730 useless extension candidates. Maximal degree in co-relation 11884. Up to 2269 conditions per place.
[2024-11-10 17:57:59,656 INFO L140 encePairwiseOnDemand]: 73/79 looper letters, 67 selfloop transitions, 5 changer transitions 1/78 dead transitions.
[2024-11-10 17:57:59,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 78 transitions, 435 flow
[2024-11-10 17:57:59,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-10 17:57:59,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-10 17:57:59,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions.
[2024-11-10 17:57:59,658 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3259493670886076
[2024-11-10 17:57:59,658 INFO L175 Difference]: Start difference. First operand has 64 places, 37 transitions, 141 flow. Second operand 4 states and 103 transitions.
[2024-11-10 17:57:59,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 78 transitions, 435 flow
[2024-11-10 17:57:59,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 78 transitions, 420 flow, removed 4 selfloop flow, removed 5 redundant places.
[2024-11-10 17:57:59,664 INFO L231 Difference]: Finished difference. Result has 60 places, 40 transitions, 164 flow
[2024-11-10 17:57:59,664 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=164, PETRI_PLACES=60, PETRI_TRANSITIONS=40}
[2024-11-10 17:57:59,665 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -24 predicate places.
[2024-11-10 17:57:59,665 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 40 transitions, 164 flow
[2024-11-10 17:57:59,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 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-10 17:57:59,665 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-10 17:57:59,665 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]
[2024-11-10 17:57:59,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-11-10 17:57:59,665 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] ===
[2024-11-10 17:57:59,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-10 17:57:59,666 INFO L85 PathProgramCache]: Analyzing trace with hash 2141814729, now seen corresponding path program 1 times
[2024-11-10 17:57:59,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-10 17:57:59,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667966538]
[2024-11-10 17:57:59,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-10 17:57:59,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-10 17:57:59,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 17:57:59,850 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-10 17:57:59,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-10 17:57:59,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667966538]
[2024-11-10 17:57:59,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667966538] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-10 17:57:59,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-10 17:57:59,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-10 17:57:59,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176247844]
[2024-11-10 17:57:59,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-10 17:57:59,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-10 17:57:59,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-10 17:57:59,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-10 17:57:59,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-10 17:57:59,852 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 79
[2024-11-10 17:57:59,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 40 transitions, 164 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 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-10 17:57:59,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-10 17:57:59,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 79
[2024-11-10 17:57:59,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-10 17:58:00,277 INFO L124 PetriNetUnfolderBase]: 1828/2871 cut-off events.
[2024-11-10 17:58:00,278 INFO L125 PetriNetUnfolderBase]: For 1893/1893 co-relation queries the response was YES.
[2024-11-10 17:58:00,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8094 conditions, 2871 events. 1828/2871 cut-off events. For 1893/1893 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 13728 event pairs, 282 based on Foata normal form. 150/3012 useless extension candidates. Maximal degree in co-relation 8074. Up to 951 conditions per place.
[2024-11-10 17:58:00,292 INFO L140 encePairwiseOnDemand]: 73/79 looper letters, 78 selfloop transitions, 8 changer transitions 1/92 dead transitions.
[2024-11-10 17:58:00,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 92 transitions, 524 flow
[2024-11-10 17:58:00,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-10 17:58:00,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-11-10 17:58:00,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions.
[2024-11-10 17:58:00,293 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.33164556962025316
[2024-11-10 17:58:00,293 INFO L175 Difference]: Start difference. First operand has 60 places, 40 transitions, 164 flow. Second operand 5 states and 131 transitions.
[2024-11-10 17:58:00,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 92 transitions, 524 flow
[2024-11-10 17:58:00,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 92 transitions, 514 flow, removed 1 selfloop flow, removed 2 redundant places.
[2024-11-10 17:58:00,297 INFO L231 Difference]: Finished difference. Result has 64 places, 43 transitions, 204 flow
[2024-11-10 17:58:00,298 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=204, PETRI_PLACES=64, PETRI_TRANSITIONS=43}
[2024-11-10 17:58:00,298 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -20 predicate places.
[2024-11-10 17:58:00,298 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 43 transitions, 204 flow
[2024-11-10 17:58:00,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 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-10 17:58:00,299 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-10 17:58:00,299 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]
[2024-11-10 17:58:00,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-11-10 17:58:00,299 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] ===
[2024-11-10 17:58:00,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-10 17:58:00,299 INFO L85 PathProgramCache]: Analyzing trace with hash -743263584, now seen corresponding path program 1 times
[2024-11-10 17:58:00,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-10 17:58:00,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279224082]
[2024-11-10 17:58:00,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-10 17:58:00,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-10 17:58:00,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 17:58:00,514 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-10 17:58:00,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-10 17:58:00,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279224082]
[2024-11-10 17:58:00,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279224082] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-10 17:58:00,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-10 17:58:00,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-10 17:58:00,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009447388]
[2024-11-10 17:58:00,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-10 17:58:00,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-10 17:58:00,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-10 17:58:00,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-10 17:58:00,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-11-10 17:58:00,516 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 79
[2024-11-10 17:58:00,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 43 transitions, 204 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 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-10 17:58:00,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-10 17:58:00,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 79
[2024-11-10 17:58:00,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-10 17:58:00,936 INFO L124 PetriNetUnfolderBase]: 1161/1806 cut-off events.
[2024-11-10 17:58:00,936 INFO L125 PetriNetUnfolderBase]: For 1938/1938 co-relation queries the response was YES.
[2024-11-10 17:58:00,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5488 conditions, 1806 events. 1161/1806 cut-off events. For 1938/1938 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 7875 event pairs, 247 based on Foata normal form. 56/1853 useless extension candidates. Maximal degree in co-relation 5466. Up to 670 conditions per place.
[2024-11-10 17:58:00,945 INFO L140 encePairwiseOnDemand]: 73/79 looper letters, 67 selfloop transitions, 11 changer transitions 1/84 dead transitions.
[2024-11-10 17:58:00,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 84 transitions, 499 flow
[2024-11-10 17:58:00,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-10 17:58:00,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-10 17:58:00,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions.
[2024-11-10 17:58:00,947 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2805907172995781
[2024-11-10 17:58:00,947 INFO L175 Difference]: Start difference. First operand has 64 places, 43 transitions, 204 flow. Second operand 6 states and 133 transitions.
[2024-11-10 17:58:00,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 84 transitions, 499 flow
[2024-11-10 17:58:00,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 84 transitions, 435 flow, removed 16 selfloop flow, removed 9 redundant places.
[2024-11-10 17:58:00,953 INFO L231 Difference]: Finished difference. Result has 62 places, 43 transitions, 195 flow
[2024-11-10 17:58:00,954 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=195, PETRI_PLACES=62, PETRI_TRANSITIONS=43}
[2024-11-10 17:58:00,954 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -22 predicate places.
[2024-11-10 17:58:00,955 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 43 transitions, 195 flow
[2024-11-10 17:58:00,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 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-10 17:58:00,955 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-10 17:58:00,955 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]
[2024-11-10 17:58:00,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-11-10 17:58:00,955 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] ===
[2024-11-10 17:58:00,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-10 17:58:00,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1720276024, now seen corresponding path program 1 times
[2024-11-10 17:58:00,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-10 17:58:00,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998904746]
[2024-11-10 17:58:00,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-10 17:58:00,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-10 17:58:00,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 17:58:01,505 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-10 17:58:01,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-10 17:58:01,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998904746]
[2024-11-10 17:58:01,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998904746] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-10 17:58:01,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-10 17:58:01,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-10 17:58:01,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267405117]
[2024-11-10 17:58:01,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-10 17:58:01,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-10 17:58:01,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-10 17:58:01,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-10 17:58:01,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-11-10 17:58:01,512 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 79
[2024-11-10 17:58:01,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 43 transitions, 195 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 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-10 17:58:01,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-10 17:58:01,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 79
[2024-11-10 17:58:01,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-10 17:58:02,057 INFO L124 PetriNetUnfolderBase]: 1706/2637 cut-off events.
[2024-11-10 17:58:02,057 INFO L125 PetriNetUnfolderBase]: For 2341/2341 co-relation queries the response was YES.
[2024-11-10 17:58:02,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7364 conditions, 2637 events. 1706/2637 cut-off events. For 2341/2341 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 12272 event pairs, 818 based on Foata normal form. 8/2636 useless extension candidates. Maximal degree in co-relation 7346. Up to 1593 conditions per place.
[2024-11-10 17:58:02,070 INFO L140 encePairwiseOnDemand]: 71/79 looper letters, 49 selfloop transitions, 5 changer transitions 42/101 dead transitions.
[2024-11-10 17:58:02,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 101 transitions, 647 flow
[2024-11-10 17:58:02,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-10 17:58:02,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-11-10 17:58:02,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions.
[2024-11-10 17:58:02,072 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.23259493670886075
[2024-11-10 17:58:02,072 INFO L175 Difference]: Start difference. First operand has 62 places, 43 transitions, 195 flow. Second operand 8 states and 147 transitions.
[2024-11-10 17:58:02,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 101 transitions, 647 flow
[2024-11-10 17:58:02,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 101 transitions, 506 flow, removed 20 selfloop flow, removed 8 redundant places.
[2024-11-10 17:58:02,081 INFO L231 Difference]: Finished difference. Result has 66 places, 45 transitions, 177 flow
[2024-11-10 17:58:02,081 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=177, PETRI_PLACES=66, PETRI_TRANSITIONS=45}
[2024-11-10 17:58:02,081 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -18 predicate places.
[2024-11-10 17:58:02,082 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 45 transitions, 177 flow
[2024-11-10 17:58:02,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 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-10 17:58:02,082 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-10 17:58:02,082 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]
[2024-11-10 17:58:02,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-11-10 17:58:02,082 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] ===
[2024-11-10 17:58:02,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-10 17:58:02,083 INFO L85 PathProgramCache]: Analyzing trace with hash -215333626, now seen corresponding path program 2 times
[2024-11-10 17:58:02,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-10 17:58:02,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441481423]
[2024-11-10 17:58:02,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-10 17:58:02,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-10 17:58:02,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 17:58:02,817 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-10 17:58:02,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-10 17:58:02,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441481423]
[2024-11-10 17:58:02,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441481423] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-10 17:58:02,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-10 17:58:02,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-10 17:58:02,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815505272]
[2024-11-10 17:58:02,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-10 17:58:02,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-10 17:58:02,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-10 17:58:02,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-10 17:58:02,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2024-11-10 17:58:02,821 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 79
[2024-11-10 17:58:02,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 45 transitions, 177 flow. Second operand has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 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-10 17:58:02,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-10 17:58:02,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 79
[2024-11-10 17:58:02,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-10 17:58:03,326 INFO L124 PetriNetUnfolderBase]: 2165/3370 cut-off events.
[2024-11-10 17:58:03,326 INFO L125 PetriNetUnfolderBase]: For 1669/1669 co-relation queries the response was YES.
[2024-11-10 17:58:03,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8809 conditions, 3370 events. 2165/3370 cut-off events. For 1669/1669 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 16515 event pairs, 649 based on Foata normal form. 8/3369 useless extension candidates. Maximal degree in co-relation 8790. Up to 1432 conditions per place.
[2024-11-10 17:58:03,336 INFO L140 encePairwiseOnDemand]: 71/79 looper letters, 55 selfloop transitions, 6 changer transitions 50/116 dead transitions.
[2024-11-10 17:58:03,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 116 transitions, 624 flow
[2024-11-10 17:58:03,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-10 17:58:03,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-11-10 17:58:03,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions.
[2024-11-10 17:58:03,337 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.24367088607594936
[2024-11-10 17:58:03,337 INFO L175 Difference]: Start difference. First operand has 66 places, 45 transitions, 177 flow. Second operand 8 states and 154 transitions.
[2024-11-10 17:58:03,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 116 transitions, 624 flow
[2024-11-10 17:58:03,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 116 transitions, 600 flow, removed 9 selfloop flow, removed 6 redundant places.
[2024-11-10 17:58:03,341 INFO L231 Difference]: Finished difference. Result has 68 places, 46 transitions, 190 flow
[2024-11-10 17:58:03,342 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=190, PETRI_PLACES=68, PETRI_TRANSITIONS=46}
[2024-11-10 17:58:03,345 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -16 predicate places.
[2024-11-10 17:58:03,345 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 46 transitions, 190 flow
[2024-11-10 17:58:03,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.125) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 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-10 17:58:03,345 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-10 17:58:03,345 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]
[2024-11-10 17:58:03,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-11-10 17:58:03,346 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] ===
[2024-11-10 17:58:03,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-10 17:58:03,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1987527764, now seen corresponding path program 3 times
[2024-11-10 17:58:03,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-10 17:58:03,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374819303]
[2024-11-10 17:58:03,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-10 17:58:03,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-10 17:58:03,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-10 17:58:03,435 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-10 17:58:03,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-10 17:58:03,518 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-10 17:58:03,520 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-10 17:58:03,521 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (70 of 71 remaining)
[2024-11-10 17:58:03,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 71 remaining)
[2024-11-10 17:58:03,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 71 remaining)
[2024-11-10 17:58:03,523 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 71 remaining)
[2024-11-10 17:58:03,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 71 remaining)
[2024-11-10 17:58:03,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 71 remaining)
[2024-11-10 17:58:03,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 71 remaining)
[2024-11-10 17:58:03,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 71 remaining)
[2024-11-10 17:58:03,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 71 remaining)
[2024-11-10 17:58:03,524 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 71 remaining)
[2024-11-10 17:58:03,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 71 remaining)
[2024-11-10 17:58:03,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 71 remaining)
[2024-11-10 17:58:03,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 71 remaining)
[2024-11-10 17:58:03,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 71 remaining)
[2024-11-10 17:58:03,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 71 remaining)
[2024-11-10 17:58:03,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 71 remaining)
[2024-11-10 17:58:03,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 71 remaining)
[2024-11-10 17:58:03,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 71 remaining)
[2024-11-10 17:58:03,526 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 71 remaining)
[2024-11-10 17:58:03,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 71 remaining)
[2024-11-10 17:58:03,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 71 remaining)
[2024-11-10 17:58:03,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 71 remaining)
[2024-11-10 17:58:03,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 71 remaining)
[2024-11-10 17:58:03,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 71 remaining)
[2024-11-10 17:58:03,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 71 remaining)
[2024-11-10 17:58:03,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 71 remaining)
[2024-11-10 17:58:03,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 71 remaining)
[2024-11-10 17:58:03,527 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 71 remaining)
[2024-11-10 17:58:03,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 71 remaining)
[2024-11-10 17:58:03,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 71 remaining)
[2024-11-10 17:58:03,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 71 remaining)
[2024-11-10 17:58:03,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 71 remaining)
[2024-11-10 17:58:03,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 71 remaining)
[2024-11-10 17:58:03,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 71 remaining)
[2024-11-10 17:58:03,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 71 remaining)
[2024-11-10 17:58:03,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 71 remaining)
[2024-11-10 17:58:03,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 71 remaining)
[2024-11-10 17:58:03,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (33 of 71 remaining)
[2024-11-10 17:58:03,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 71 remaining)
[2024-11-10 17:58:03,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 71 remaining)
[2024-11-10 17:58:03,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 71 remaining)
[2024-11-10 17:58:03,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 71 remaining)
[2024-11-10 17:58:03,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 71 remaining)
[2024-11-10 17:58:03,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 71 remaining)
[2024-11-10 17:58:03,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 71 remaining)
[2024-11-10 17:58:03,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 71 remaining)
[2024-11-10 17:58:03,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 71 remaining)
[2024-11-10 17:58:03,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 71 remaining)
[2024-11-10 17:58:03,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 71 remaining)
[2024-11-10 17:58:03,529 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 71 remaining)
[2024-11-10 17:58:03,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 71 remaining)
[2024-11-10 17:58:03,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 71 remaining)
[2024-11-10 17:58:03,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 71 remaining)
[2024-11-10 17:58:03,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 71 remaining)
[2024-11-10 17:58:03,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 71 remaining)
[2024-11-10 17:58:03,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 71 remaining)
[2024-11-10 17:58:03,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 71 remaining)
[2024-11-10 17:58:03,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 71 remaining)
[2024-11-10 17:58:03,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 71 remaining)
[2024-11-10 17:58:03,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 71 remaining)
[2024-11-10 17:58:03,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 71 remaining)
[2024-11-10 17:58:03,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 71 remaining)
[2024-11-10 17:58:03,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 71 remaining)
[2024-11-10 17:58:03,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 71 remaining)
[2024-11-10 17:58:03,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 71 remaining)
[2024-11-10 17:58:03,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 71 remaining)
[2024-11-10 17:58:03,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 71 remaining)
[2024-11-10 17:58:03,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 71 remaining)
[2024-11-10 17:58:03,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 71 remaining)
[2024-11-10 17:58:03,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 71 remaining)
[2024-11-10 17:58:03,531 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 71 remaining)
[2024-11-10 17:58:03,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-11-10 17:58:03,532 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-10 17:58:03,627 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-11-10 17:58:03,628 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-10 17:58:03,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 05:58:03 BasicIcfg
[2024-11-10 17:58:03,633 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-10 17:58:03,633 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-10 17:58:03,633 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-10 17:58:03,633 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-10 17:58:03,633 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:57:47" (3/4) ...
[2024-11-10 17:58:03,635 INFO L146 WitnessPrinter]: No result that supports witness generation found
[2024-11-10 17:58:03,636 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-10 17:58:03,636 INFO L158 Benchmark]: Toolchain (without parser) took 18249.13ms. Allocated memory was 184.5MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 125.8MB in the beginning and 3.9GB in the end (delta: -3.8GB). Peak memory consumption was 239.2MB. Max. memory is 16.1GB.
[2024-11-10 17:58:03,637 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 184.5MB. Free memory is still 144.5MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-10 17:58:03,637 INFO L158 Benchmark]: CACSL2BoogieTranslator took 468.17ms. Allocated memory is still 184.5MB. Free memory was 125.8MB in the beginning and 99.1MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2024-11-10 17:58:03,637 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.36ms. Allocated memory is still 184.5MB. Free memory was 99.1MB in the beginning and 96.5MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-11-10 17:58:03,637 INFO L158 Benchmark]: Boogie Preprocessor took 46.51ms. Allocated memory is still 184.5MB. Free memory was 96.5MB in the beginning and 92.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-11-10 17:58:03,637 INFO L158 Benchmark]: IcfgBuilder took 1068.15ms. Allocated memory was 184.5MB in the beginning and 272.6MB in the end (delta: 88.1MB). Free memory was 92.3MB in the beginning and 128.0MB in the end (delta: -35.7MB). Peak memory consumption was 62.3MB. Max. memory is 16.1GB.
[2024-11-10 17:58:03,637 INFO L158 Benchmark]: TraceAbstraction took 16620.79ms. Allocated memory was 272.6MB in the beginning and 4.2GB in the end (delta: 3.9GB). Free memory was 128.0MB in the beginning and 3.9GB in the end (delta: -3.8GB). Peak memory consumption was 151.7MB. Max. memory is 16.1GB.
[2024-11-10 17:58:03,638 INFO L158 Benchmark]: Witness Printer took 3.09ms. Allocated memory is still 4.2GB. Free memory was 3.9GB in the beginning and 3.9GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-10 17:58:03,639 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.16ms. Allocated memory is still 184.5MB. Free memory is still 144.5MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 468.17ms. Allocated memory is still 184.5MB. Free memory was 125.8MB in the beginning and 99.1MB in the end (delta: 26.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 37.36ms. Allocated memory is still 184.5MB. Free memory was 99.1MB in the beginning and 96.5MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 46.51ms. Allocated memory is still 184.5MB. Free memory was 96.5MB in the beginning and 92.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
* IcfgBuilder took 1068.15ms. Allocated memory was 184.5MB in the beginning and 272.6MB in the end (delta: 88.1MB). Free memory was 92.3MB in the beginning and 128.0MB in the end (delta: -35.7MB). Peak memory consumption was 62.3MB. Max. memory is 16.1GB.
* TraceAbstraction took 16620.79ms. Allocated memory was 272.6MB in the beginning and 4.2GB in the end (delta: 3.9GB). Free memory was 128.0MB in the beginning and 3.9GB in the end (delta: -3.8GB). Peak memory consumption was 151.7MB. Max. memory is 16.1GB.
* Witness Printer took 3.09ms. Allocated memory is still 4.2GB. Free memory was 3.9GB in the beginning and 3.9GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: overapproximation of memtrack at line 18.
Possible FailurePath:
[L710] 0 int __unbuffered_cnt = 0;
[L712] 0 int __unbuffered_p0_EAX = 0;
[L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed;
[L714] 0 int __unbuffered_p0_EAX$mem_tmp;
[L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0;
[L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1;
[L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2;
[L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3;
[L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0;
[L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1;
[L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2;
[L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3;
[L723] 0 _Bool __unbuffered_p0_EAX$read_delayed;
[L724] 0 int *__unbuffered_p0_EAX$read_delayed_var;
[L725] 0 int __unbuffered_p0_EAX$w_buff0;
[L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used;
[L727] 0 int __unbuffered_p0_EAX$w_buff1;
[L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used;
[L730] 0 int __unbuffered_p1_EAX = 0;
[L732] 0 int __unbuffered_p1_EBX = 0;
[L733] 0 _Bool main$tmp_guard0;
[L734] 0 _Bool main$tmp_guard1;
[L736] 0 int x = 0;
[L736] 0 int x = 0;
[L737] 0 _Bool x$flush_delayed;
[L738] 0 int x$mem_tmp;
[L739] 0 _Bool x$r_buff0_thd0;
[L740] 0 _Bool x$r_buff0_thd1;
[L741] 0 _Bool x$r_buff0_thd2;
[L742] 0 _Bool x$r_buff0_thd3;
[L743] 0 _Bool x$r_buff1_thd0;
[L744] 0 _Bool x$r_buff1_thd1;
[L745] 0 _Bool x$r_buff1_thd2;
[L746] 0 _Bool x$r_buff1_thd3;
[L747] 0 _Bool x$read_delayed;
[L748] 0 int *x$read_delayed_var;
[L749] 0 int x$w_buff0;
[L750] 0 _Bool x$w_buff0_used;
[L751] 0 int x$w_buff1;
[L752] 0 _Bool x$w_buff1_used;
[L754] 0 int y = 0;
[L755] 0 _Bool weak$$choice0;
[L756] 0 _Bool weak$$choice1;
[L757] 0 _Bool weak$$choice2;
[L847] 0 pthread_t t1693;
[L848] FCALL, FORK 0 pthread_create(&t1693, ((void *)0), P0, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1693=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0]
[L761] 1 weak$$choice0 = __VERIFIER_nondet_bool()
[L762] 1 weak$$choice2 = __VERIFIER_nondet_bool()
[L763] 1 x$flush_delayed = weak$$choice2
[L764] EXPR 1 \read(x)
[L764] 1 x$mem_tmp = x
[L765] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L765] EXPR 1 \read(x)
[L765] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L765] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L766] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))
[L767] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))
[L768] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))
[L769] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L770] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))
[L771] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1
[L773] 1 __unbuffered_p0_EAX$read_delayed_var = &x
[L774] EXPR 1 \read(x)
[L774] 1 __unbuffered_p0_EAX = x
[L775] EXPR 1 x$flush_delayed ? x$mem_tmp : x
[L775] EXPR 1 x$flush_delayed ? x$mem_tmp : x
[L775] 1 x = x$flush_delayed ? x$mem_tmp : x
[L776] 1 x$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0]
[L849] 0 pthread_t t1694;
[L850] FCALL, FORK 0 pthread_create(&t1694, ((void *)0), P1, ((void *)0))
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1693=-1, t1694=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0]
[L851] 0 pthread_t t1695;
[L779] 1 y = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1]
[L852] FCALL, FORK 0 pthread_create(&t1695, ((void *)0), P2, ((void *)0))
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1693=-1, t1694=0, t1695=1, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1]
[L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1]
[L791] 2 y = 2
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2]
[L794] 2 __unbuffered_p1_EAX = y
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2]
[L797] 2 weak$$choice0 = __VERIFIER_nondet_bool()
[L798] 2 weak$$choice2 = __VERIFIER_nondet_bool()
[L799] 2 x$flush_delayed = weak$$choice2
[L800] EXPR 2 \read(x)
[L800] 2 x$mem_tmp = x
[L801] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)
[L801] EXPR 2 \read(x)
[L801] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)
[L801] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)
[L802] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))
[L803] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))
[L804] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))
[L805] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L806] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))
[L807] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L808] EXPR 2 \read(x)
[L808] 2 __unbuffered_p1_EBX = x
[L809] EXPR 2 x$flush_delayed ? x$mem_tmp : x
[L809] EXPR 2 x$flush_delayed ? x$mem_tmp : x
[L809] 2 x = x$flush_delayed ? x$mem_tmp : x
[L810] 2 x$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2]
[L815] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2]
[L822] 3 x = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2]
[L825] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L825] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x
[L825] EXPR 3 \read(x)
[L825] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x
[L825] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L825] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L826] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L827] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L828] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L829] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2]
[L832] 3 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2]
[L854] 0 main$tmp_guard0 = __unbuffered_cnt == 3
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1693=-1, t1694=0, t1695=1, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2]
[L856] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L4] COND FALSE 0 !(!cond)
[L856] RET 0 assume_abort_if_not(main$tmp_guard0)
[L858] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L858] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x
[L858] EXPR 0 \read(x)
[L858] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x
[L858] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L858] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L859] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L860] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L861] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L862] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1693=-1, t1694=0, t1695=1, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2]
[L865] 0 weak$$choice1 = __VERIFIER_nondet_bool()
[L866] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX
[L866] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX
[L866] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var)
[L866] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX
[L866] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX
[L866] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX
[L867] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0)
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1693=-1, t1694=0, t1695=1, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2]
[L869] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L19] COND TRUE 0 !expression
[L19] CALL 0 reach_error()
[L18] COND FALSE 0 !(0)
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2]
[L18] 0 __assert_fail ("0", "rfi006_rmo.c", 9, __extension__ __PRETTY_FUNCTION__)
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2]
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: 845]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: Not analyzed.
- UnprovableResult [Line: 852]: 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: 850]: 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: 848]: 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, 132 locations, 71 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: 16.4s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 12.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 824 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 815 mSDsluCounter, 14 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1955 IncrementalHoareTripleChecker+Invalid, 2013 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 3 mSDtfsCounter, 1955 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=204occurred in iteration=12, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 293 NumberOfCodeBlocks, 293 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 248 ConstructedInterpolants, 0 QuantifiedInterpolants, 1541 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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-10 17:58:03,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/rfi006_rmo.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 304137b4cdfcb1cb721c511de7faa38271d71a9e3815c7f79977f44461721381
--- Real Ultimate output ---
This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m
[2024-11-10 17:58:06,223 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-10 17:58:06,281 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf
[2024-11-10 17:58:06,285 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-10 17:58:06,285 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-10 17:58:06,315 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-10 17:58:06,315 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-10 17:58:06,316 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-10 17:58:06,316 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-10 17:58:06,317 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-10 17:58:06,318 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-10 17:58:06,318 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-10 17:58:06,318 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-10 17:58:06,319 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-10 17:58:06,320 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-10 17:58:06,320 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-10 17:58:06,320 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-10 17:58:06,321 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-10 17:58:06,321 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-10 17:58:06,321 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-10 17:58:06,324 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2024-11-10 17:58:06,324 INFO L153 SettingsManager]: * Bitprecise bitfields=true
[2024-11-10 17:58:06,325 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2024-11-10 17:58:06,325 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-10 17:58:06,325 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2024-11-10 17:58:06,325 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true
[2024-11-10 17:58:06,325 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-10 17:58:06,326 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2024-11-10 17:58:06,326 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-11-10 17:58:06,326 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-10 17:58:06,326 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-10 17:58:06,326 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2024-11-10 17:58:06,326 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-10 17:58:06,326 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-10 17:58:06,327 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-10 17:58:06,327 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-10 17:58:06,327 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-10 17:58:06,327 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-10 17:58:06,327 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF
[2024-11-10 17:58:06,327 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2024-11-10 17:58:06,328 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-10 17:58:06,329 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-10 17:58:06,330 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-10 17:58:06,330 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-10 17:58:06,330 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux
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 -> 304137b4cdfcb1cb721c511de7faa38271d71a9e3815c7f79977f44461721381
[2024-11-10 17:58:06,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-10 17:58:06,609 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-10 17:58:06,612 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-10 17:58:06,613 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-10 17:58:06,613 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-10 17:58:06,614 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi006_rmo.i
[2024-11-10 17:58:07,978 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-10 17:58:08,181 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-10 17:58:08,182 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi006_rmo.i
[2024-11-10 17:58:08,197 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a3bf45f9/17e9dcc2bca749638e7627711522d2e0/FLAGe1f5f8d43
[2024-11-10 17:58:08,208 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a3bf45f9/17e9dcc2bca749638e7627711522d2e0
[2024-11-10 17:58:08,210 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-10 17:58:08,211 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-10 17:58:08,212 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-10 17:58:08,212 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-10 17:58:08,218 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-10 17:58:08,221 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:58:08" (1/1) ...
[2024-11-10 17:58:08,224 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c02938b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:58:08, skipping insertion in model container
[2024-11-10 17:58:08,224 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:58:08" (1/1) ...
[2024-11-10 17:58:08,270 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-10 17:58:08,605 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-10 17:58:08,621 INFO L200 MainTranslator]: Completed pre-run
[2024-11-10 17:58:08,676 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-10 17:58:08,706 INFO L204 MainTranslator]: Completed translation
[2024-11-10 17:58:08,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:58:08 WrapperNode
[2024-11-10 17:58:08,706 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-10 17:58:08,707 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-10 17:58:08,707 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-10 17:58:08,707 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-10 17:58:08,711 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:58:08" (1/1) ...
[2024-11-10 17:58:08,731 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:58:08" (1/1) ...
[2024-11-10 17:58:08,764 INFO L138 Inliner]: procedures = 179, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128
[2024-11-10 17:58:08,764 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-10 17:58:08,764 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-10 17:58:08,764 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-10 17:58:08,764 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-10 17:58:08,772 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:58:08" (1/1) ...
[2024-11-10 17:58:08,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:58:08" (1/1) ...
[2024-11-10 17:58:08,774 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:58:08" (1/1) ...
[2024-11-10 17:58:08,795 INFO L175 MemorySlicer]: Split 21 memory accesses to 2 slices as follows [2, 19]. 90 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 7 writes are split as follows [0, 7].
[2024-11-10 17:58:08,796 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:58:08" (1/1) ...
[2024-11-10 17:58:08,796 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:58:08" (1/1) ...
[2024-11-10 17:58:08,802 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:58:08" (1/1) ...
[2024-11-10 17:58:08,803 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:58:08" (1/1) ...
[2024-11-10 17:58:08,804 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:58:08" (1/1) ...
[2024-11-10 17:58:08,805 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:58:08" (1/1) ...
[2024-11-10 17:58:08,808 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-10 17:58:08,808 INFO L112 PluginConnector]: ------------------------IcfgBuilder----------------------------
[2024-11-10 17:58:08,808 INFO L270 PluginConnector]: Initializing IcfgBuilder...
[2024-11-10 17:58:08,808 INFO L274 PluginConnector]: IcfgBuilder initialized
[2024-11-10 17:58:08,809 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:58:08" (1/1) ...
[2024-11-10 17:58:08,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-10 17:58:08,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-10 17:58:08,834 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-10 17:58:08,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-10 17:58:08,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0
[2024-11-10 17:58:08,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1
[2024-11-10 17:58:08,868 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-11-10 17:58:08,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-10 17:58:08,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0
[2024-11-10 17:58:08,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1
[2024-11-10 17:58:08,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0
[2024-11-10 17:58:08,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1
[2024-11-10 17:58:08,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0
[2024-11-10 17:58:08,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1
[2024-11-10 17:58:08,868 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2024-11-10 17:58:08,868 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2024-11-10 17:58:08,868 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2024-11-10 17:58:08,869 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2024-11-10 17:58:08,869 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2024-11-10 17:58:08,869 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2024-11-10 17:58:08,869 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-11-10 17:58:08,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-10 17:58:08,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-10 17:58:08,870 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2024-11-10 17:58:09,026 INFO L256 CfgBuilder]: Building ICFG
[2024-11-10 17:58:09,027 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-10 17:58:09,410 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2024-11-10 17:58:09,410 INFO L307 CfgBuilder]: Performing block encoding
[2024-11-10 17:58:09,829 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-10 17:58:09,830 INFO L336 CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-10 17:58:09,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:58:09 BoogieIcfgContainer
[2024-11-10 17:58:09,831 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2024-11-10 17:58:09,832 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-10 17:58:09,832 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-10 17:58:09,836 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-10 17:58:09,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:58:08" (1/3) ...
[2024-11-10 17:58:09,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f707fe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:58:09, skipping insertion in model container
[2024-11-10 17:58:09,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:58:08" (2/3) ...
[2024-11-10 17:58:09,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f707fe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:58:09, skipping insertion in model container
[2024-11-10 17:58:09,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:58:09" (3/3) ...
[2024-11-10 17:58:09,839 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi006_rmo.i
[2024-11-10 17:58:09,863 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-10 17:58:09,863 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 38 error locations.
[2024-11-10 17:58:09,863 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-11-10 17:58:09,966 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-11-10 17:58:09,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 79 transitions, 170 flow
[2024-11-10 17:58:10,050 INFO L124 PetriNetUnfolderBase]: 2/76 cut-off events.
[2024-11-10 17:58:10,051 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-10 17:58:10,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 76 events. 2/76 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 276 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place.
[2024-11-10 17:58:10,056 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 79 transitions, 170 flow
[2024-11-10 17:58:10,059 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 76 transitions, 161 flow
[2024-11-10 17:58:10,067 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-10 17:58:10,073 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;@11b688f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-10 17:58:10,073 INFO L334 AbstractCegarLoop]: Starting to check reachability of 71 error locations.
[2024-11-10 17:58:10,076 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-11-10 17:58:10,076 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events.
[2024-11-10 17:58:10,076 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-10 17:58:10,077 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-10 17:58:10,077 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2024-11-10 17:58:10,077 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] ===
[2024-11-10 17:58:10,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-10 17:58:10,081 INFO L85 PathProgramCache]: Analyzing trace with hash 21679241, now seen corresponding path program 1 times
[2024-11-10 17:58:10,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-10 17:58:10,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [50092458]
[2024-11-10 17:58:10,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-10 17:58:10,091 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-10 17:58:10,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-10 17:58:10,097 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-10 17:58:10,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process
[2024-11-10 17:58:10,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 17:58:10,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-10 17:58:10,221 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-10 17:58:10,281 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-10 17:58:10,281 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-10 17:58:10,282 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-10 17:58:10,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [50092458]
[2024-11-10 17:58:10,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [50092458] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-10 17:58:10,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-10 17:58:10,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-10 17:58:10,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450709681]
[2024-11-10 17:58:10,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-10 17:58:10,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-10 17:58:10,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-10 17:58:10,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-10 17:58:10,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-10 17:58:10,322 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 79
[2024-11-10 17:58:10,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 76 transitions, 161 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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-10 17:58:10,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-10 17:58:10,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 79
[2024-11-10 17:58:10,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-10 17:58:12,812 INFO L124 PetriNetUnfolderBase]: 16111/24314 cut-off events.
[2024-11-10 17:58:12,812 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES.
[2024-11-10 17:58:12,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46957 conditions, 24314 events. 16111/24314 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 1052. Compared 167982 event pairs, 16111 based on Foata normal form. 896/19339 useless extension candidates. Maximal degree in co-relation 46946. Up to 22510 conditions per place.
[2024-11-10 17:58:12,977 INFO L140 encePairwiseOnDemand]: 49/79 looper letters, 38 selfloop transitions, 1 changer transitions 0/46 dead transitions.
[2024-11-10 17:58:12,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 46 transitions, 179 flow
[2024-11-10 17:58:12,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-10 17:58:12,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-10 17:58:12,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions.
[2024-11-10 17:58:12,987 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.41350210970464135
[2024-11-10 17:58:12,989 INFO L175 Difference]: Start difference. First operand has 84 places, 76 transitions, 161 flow. Second operand 3 states and 98 transitions.
[2024-11-10 17:58:12,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 46 transitions, 179 flow
[2024-11-10 17:58:12,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 46 transitions, 176 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-11-10 17:58:12,994 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 100 flow
[2024-11-10 17:58:12,995 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=55, PETRI_TRANSITIONS=46}
[2024-11-10 17:58:12,998 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -29 predicate places.
[2024-11-10 17:58:12,998 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 100 flow
[2024-11-10 17:58:12,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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-10 17:58:12,998 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-10 17:58:12,999 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2024-11-10 17:58:13,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0
[2024-11-10 17:58:13,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-10 17:58:13,200 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] ===
[2024-11-10 17:58:13,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-10 17:58:13,201 INFO L85 PathProgramCache]: Analyzing trace with hash 21679242, now seen corresponding path program 1 times
[2024-11-10 17:58:13,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-10 17:58:13,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1864046330]
[2024-11-10 17:58:13,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-10 17:58:13,202 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-10 17:58:13,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-10 17:58:13,203 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-10 17:58:13,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process
[2024-11-10 17:58:13,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 17:58:13,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-10 17:58:13,296 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-10 17:58:13,329 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-10 17:58:13,330 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-10 17:58:13,330 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-10 17:58:13,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1864046330]
[2024-11-10 17:58:13,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1864046330] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-10 17:58:13,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-10 17:58:13,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-10 17:58:13,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550661412]
[2024-11-10 17:58:13,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-10 17:58:13,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-10 17:58:13,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-10 17:58:13,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-10 17:58:13,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-10 17:58:13,333 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 79
[2024-11-10 17:58:13,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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-10 17:58:13,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-10 17:58:13,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 79
[2024-11-10 17:58:13,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-10 17:58:14,439 INFO L124 PetriNetUnfolderBase]: 6219/9685 cut-off events.
[2024-11-10 17:58:14,440 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-10 17:58:14,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18623 conditions, 9685 events. 6219/9685 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 59910 event pairs, 6219 based on Foata normal form. 0/9253 useless extension candidates. Maximal degree in co-relation 18617. Up to 8836 conditions per place.
[2024-11-10 17:58:14,509 INFO L140 encePairwiseOnDemand]: 71/79 looper letters, 30 selfloop transitions, 1 changer transitions 1/39 dead transitions.
[2024-11-10 17:58:14,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 150 flow
[2024-11-10 17:58:14,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-10 17:58:14,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-10 17:58:14,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions.
[2024-11-10 17:58:14,511 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2911392405063291
[2024-11-10 17:58:14,511 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 100 flow. Second operand 3 states and 69 transitions.
[2024-11-10 17:58:14,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 150 flow
[2024-11-10 17:58:14,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 39 transitions, 149 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-11-10 17:58:14,512 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 85 flow
[2024-11-10 17:58:14,512 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=49, PETRI_TRANSITIONS=38}
[2024-11-10 17:58:14,513 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -35 predicate places.
[2024-11-10 17:58:14,513 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 85 flow
[2024-11-10 17:58:14,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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-10 17:58:14,513 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-10 17:58:14,516 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-10 17:58:14,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0
[2024-11-10 17:58:14,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-10 17:58:14,717 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] ===
[2024-11-10 17:58:14,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-10 17:58:14,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1497778932, now seen corresponding path program 1 times
[2024-11-10 17:58:14,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-10 17:58:14,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [281131896]
[2024-11-10 17:58:14,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-10 17:58:14,718 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-10 17:58:14,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-10 17:58:14,721 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-10 17:58:14,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process
[2024-11-10 17:58:14,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 17:58:14,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-10 17:58:14,811 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-10 17:58:14,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-10 17:58:14,948 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-10 17:58:14,949 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-10 17:58:14,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [281131896]
[2024-11-10 17:58:14,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [281131896] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-10 17:58:14,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-10 17:58:14,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-10 17:58:14,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931715408]
[2024-11-10 17:58:14,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-10 17:58:14,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-10 17:58:14,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-10 17:58:14,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-10 17:58:14,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-10 17:58:14,951 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 79
[2024-11-10 17:58:14,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 85 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-10 17:58:14,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-10 17:58:14,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 79
[2024-11-10 17:58:14,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-10 17:58:15,803 INFO L124 PetriNetUnfolderBase]: 4449/7135 cut-off events.
[2024-11-10 17:58:15,803 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-11-10 17:58:15,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13764 conditions, 7135 events. 4449/7135 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 43739 event pairs, 520 based on Foata normal form. 210/7033 useless extension candidates. Maximal degree in co-relation 13757. Up to 4438 conditions per place.
[2024-11-10 17:58:15,846 INFO L140 encePairwiseOnDemand]: 73/79 looper letters, 58 selfloop transitions, 5 changer transitions 1/71 dead transitions.
[2024-11-10 17:58:15,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 71 transitions, 283 flow
[2024-11-10 17:58:15,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-10 17:58:15,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-10 17:58:15,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions.
[2024-11-10 17:58:15,850 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.33544303797468356
[2024-11-10 17:58:15,850 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 85 flow. Second operand 4 states and 106 transitions.
[2024-11-10 17:58:15,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 71 transitions, 283 flow
[2024-11-10 17:58:15,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 71 transitions, 282 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-11-10 17:58:15,852 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 118 flow
[2024-11-10 17:58:15,853 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=52, PETRI_TRANSITIONS=41}
[2024-11-10 17:58:15,853 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -32 predicate places.
[2024-11-10 17:58:15,854 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 118 flow
[2024-11-10 17:58:15,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-10 17:58:15,854 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-10 17:58:15,855 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-10 17:58:15,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0
[2024-11-10 17:58:16,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-10 17:58:16,056 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] ===
[2024-11-10 17:58:16,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-10 17:58:16,057 INFO L85 PathProgramCache]: Analyzing trace with hash -76727598, now seen corresponding path program 1 times
[2024-11-10 17:58:16,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-10 17:58:16,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [323023812]
[2024-11-10 17:58:16,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-10 17:58:16,060 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-10 17:58:16,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-10 17:58:16,063 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-10 17:58:16,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process
[2024-11-10 17:58:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 17:58:16,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-10 17:58:16,162 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-10 17:58:16,192 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-10 17:58:16,192 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-10 17:58:16,192 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-10 17:58:16,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [323023812]
[2024-11-10 17:58:16,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [323023812] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-10 17:58:16,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-10 17:58:16,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-10 17:58:16,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044831961]
[2024-11-10 17:58:16,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-10 17:58:16,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-10 17:58:16,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-10 17:58:16,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-10 17:58:16,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-10 17:58:16,194 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 79
[2024-11-10 17:58:16,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 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-10 17:58:16,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-10 17:58:16,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 79
[2024-11-10 17:58:16,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-10 17:58:16,707 INFO L124 PetriNetUnfolderBase]: 2248/3652 cut-off events.
[2024-11-10 17:58:16,708 INFO L125 PetriNetUnfolderBase]: For 623/623 co-relation queries the response was YES.
[2024-11-10 17:58:16,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8113 conditions, 3652 events. 2248/3652 cut-off events. For 623/623 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 19366 event pairs, 334 based on Foata normal form. 150/3678 useless extension candidates. Maximal degree in co-relation 8103. Up to 1477 conditions per place.
[2024-11-10 17:58:16,723 INFO L140 encePairwiseOnDemand]: 73/79 looper letters, 73 selfloop transitions, 8 changer transitions 1/89 dead transitions.
[2024-11-10 17:58:16,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 89 transitions, 399 flow
[2024-11-10 17:58:16,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-10 17:58:16,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-11-10 17:58:16,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions.
[2024-11-10 17:58:16,725 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3392405063291139
[2024-11-10 17:58:16,725 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 118 flow. Second operand 5 states and 134 transitions.
[2024-11-10 17:58:16,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 89 transitions, 399 flow
[2024-11-10 17:58:16,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 89 transitions, 389 flow, removed 1 selfloop flow, removed 2 redundant places.
[2024-11-10 17:58:16,729 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 158 flow
[2024-11-10 17:58:16,729 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=158, PETRI_PLACES=56, PETRI_TRANSITIONS=44}
[2024-11-10 17:58:16,730 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -28 predicate places.
[2024-11-10 17:58:16,730 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 158 flow
[2024-11-10 17:58:16,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 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-10 17:58:16,730 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-10 17:58:16,730 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-10 17:58:16,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0
[2024-11-10 17:58:16,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-10 17:58:16,934 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] ===
[2024-11-10 17:58:16,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-10 17:58:16,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1109961185, now seen corresponding path program 1 times
[2024-11-10 17:58:16,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-10 17:58:16,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2078747002]
[2024-11-10 17:58:16,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-10 17:58:16,936 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-10 17:58:16,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-10 17:58:16,940 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-10 17:58:16,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process
[2024-11-10 17:58:17,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 17:58:17,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-10 17:58:17,122 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-10 17:58:17,189 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-10 17:58:17,189 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-10 17:58:17,192 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-10 17:58:17,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2078747002]
[2024-11-10 17:58:17,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2078747002] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-10 17:58:17,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-10 17:58:17,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-10 17:58:17,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642529916]
[2024-11-10 17:58:17,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-10 17:58:17,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-10 17:58:17,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-10 17:58:17,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-10 17:58:17,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-10 17:58:17,194 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 79
[2024-11-10 17:58:17,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 158 flow. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-10 17:58:17,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-10 17:58:17,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 79
[2024-11-10 17:58:17,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-10 17:58:17,691 INFO L124 PetriNetUnfolderBase]: 1197/1883 cut-off events.
[2024-11-10 17:58:17,691 INFO L125 PetriNetUnfolderBase]: For 1102/1102 co-relation queries the response was YES.
[2024-11-10 17:58:17,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4695 conditions, 1883 events. 1197/1883 cut-off events. For 1102/1102 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 8239 event pairs, 299 based on Foata normal form. 56/1911 useless extension candidates. Maximal degree in co-relation 4683. Up to 670 conditions per place.
[2024-11-10 17:58:17,699 INFO L140 encePairwiseOnDemand]: 73/79 looper letters, 62 selfloop transitions, 11 changer transitions 1/81 dead transitions.
[2024-11-10 17:58:17,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 81 transitions, 390 flow
[2024-11-10 17:58:17,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-10 17:58:17,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-11-10 17:58:17,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 136 transitions.
[2024-11-10 17:58:17,701 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2869198312236287
[2024-11-10 17:58:17,701 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 158 flow. Second operand 6 states and 136 transitions.
[2024-11-10 17:58:17,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 81 transitions, 390 flow
[2024-11-10 17:58:17,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 81 transitions, 365 flow, removed 4 selfloop flow, removed 4 redundant places.
[2024-11-10 17:58:17,707 INFO L231 Difference]: Finished difference. Result has 59 places, 44 transitions, 172 flow
[2024-11-10 17:58:17,707 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=59, PETRI_TRANSITIONS=44}
[2024-11-10 17:58:17,708 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -25 predicate places.
[2024-11-10 17:58:17,708 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 44 transitions, 172 flow
[2024-11-10 17:58:17,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-10 17:58:17,708 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-10 17:58:17,708 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]
[2024-11-10 17:58:17,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0
[2024-11-10 17:58:17,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-10 17:58:17,909 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] ===
[2024-11-10 17:58:17,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-10 17:58:17,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1887423438, now seen corresponding path program 1 times
[2024-11-10 17:58:17,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-10 17:58:17,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1480423549]
[2024-11-10 17:58:17,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-10 17:58:17,911 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-10 17:58:17,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-10 17:58:17,913 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-10 17:58:17,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process
[2024-11-10 17:58:18,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 17:58:18,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-10 17:58:18,027 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-10 17:58:18,227 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-10 17:58:18,228 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-10 17:58:18,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-10 17:58:18,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1480423549]
[2024-11-10 17:58:18,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1480423549] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-10 17:58:18,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-10 17:58:18,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-10 17:58:18,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479739978]
[2024-11-10 17:58:18,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-10 17:58:18,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-10 17:58:18,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-10 17:58:18,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-10 17:58:18,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-10 17:58:18,233 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 79
[2024-11-10 17:58:18,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 44 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 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-10 17:58:18,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-10 17:58:18,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 79
[2024-11-10 17:58:18,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-10 17:58:18,485 INFO L124 PetriNetUnfolderBase]: 1085/1702 cut-off events.
[2024-11-10 17:58:18,485 INFO L125 PetriNetUnfolderBase]: For 1096/1096 co-relation queries the response was YES.
[2024-11-10 17:58:18,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4275 conditions, 1702 events. 1085/1702 cut-off events. For 1096/1096 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 7573 event pairs, 246 based on Foata normal form. 0/1690 useless extension candidates. Maximal degree in co-relation 4262. Up to 1485 conditions per place.
[2024-11-10 17:58:18,492 INFO L140 encePairwiseOnDemand]: 76/79 looper letters, 51 selfloop transitions, 2 changer transitions 0/60 dead transitions.
[2024-11-10 17:58:18,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 60 transitions, 338 flow
[2024-11-10 17:58:18,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-10 17:58:18,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-10 17:58:18,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions.
[2024-11-10 17:58:18,493 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2721518987341772
[2024-11-10 17:58:18,493 INFO L175 Difference]: Start difference. First operand has 59 places, 44 transitions, 172 flow. Second operand 4 states and 86 transitions.
[2024-11-10 17:58:18,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 60 transitions, 338 flow
[2024-11-10 17:58:18,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 60 transitions, 266 flow, removed 10 selfloop flow, removed 8 redundant places.
[2024-11-10 17:58:18,498 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 118 flow
[2024-11-10 17:58:18,498 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=53, PETRI_TRANSITIONS=43}
[2024-11-10 17:58:18,498 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -31 predicate places.
[2024-11-10 17:58:18,498 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 118 flow
[2024-11-10 17:58:18,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 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-10 17:58:18,499 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-10 17:58:18,499 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]
[2024-11-10 17:58:18,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0
[2024-11-10 17:58:18,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-10 17:58:18,699 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] ===
[2024-11-10 17:58:18,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-10 17:58:18,700 INFO L85 PathProgramCache]: Analyzing trace with hash 48915369, now seen corresponding path program 1 times
[2024-11-10 17:58:18,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-10 17:58:18,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [196460422]
[2024-11-10 17:58:18,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-10 17:58:18,701 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-10 17:58:18,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-10 17:58:18,706 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-10 17:58:18,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process
[2024-11-10 17:58:18,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 17:58:18,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-10 17:58:18,814 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-10 17:58:18,941 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-10 17:58:18,942 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-10 17:58:18,942 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-10 17:58:18,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [196460422]
[2024-11-10 17:58:18,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [196460422] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-10 17:58:18,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-10 17:58:18,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-10 17:58:18,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217569]
[2024-11-10 17:58:18,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-10 17:58:18,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-10 17:58:18,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-10 17:58:18,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-10 17:58:18,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-10 17:58:18,949 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 79
[2024-11-10 17:58:18,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 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-10 17:58:18,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-10 17:58:18,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 79
[2024-11-10 17:58:18,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-10 17:58:19,181 INFO L124 PetriNetUnfolderBase]: 1073/1682 cut-off events.
[2024-11-10 17:58:19,182 INFO L125 PetriNetUnfolderBase]: For 200/200 co-relation queries the response was YES.
[2024-11-10 17:58:19,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3761 conditions, 1682 events. 1073/1682 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 7476 event pairs, 234 based on Foata normal form. 0/1678 useless extension candidates. Maximal degree in co-relation 3752. Up to 1465 conditions per place.
[2024-11-10 17:58:19,188 INFO L140 encePairwiseOnDemand]: 76/79 looper letters, 50 selfloop transitions, 2 changer transitions 0/59 dead transitions.
[2024-11-10 17:58:19,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 59 transitions, 266 flow
[2024-11-10 17:58:19,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-10 17:58:19,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-11-10 17:58:19,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions.
[2024-11-10 17:58:19,189 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2689873417721519
[2024-11-10 17:58:19,190 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 118 flow. Second operand 4 states and 85 transitions.
[2024-11-10 17:58:19,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 59 transitions, 266 flow
[2024-11-10 17:58:19,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 59 transitions, 263 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-10 17:58:19,191 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 117 flow
[2024-11-10 17:58:19,191 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=53, PETRI_TRANSITIONS=42}
[2024-11-10 17:58:19,192 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -31 predicate places.
[2024-11-10 17:58:19,192 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 117 flow
[2024-11-10 17:58:19,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 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-10 17:58:19,192 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-10 17:58:19,193 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]
[2024-11-10 17:58:19,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0
[2024-11-10 17:58:19,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-10 17:58:19,394 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] ===
[2024-11-10 17:58:19,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-10 17:58:19,394 INFO L85 PathProgramCache]: Analyzing trace with hash -72857287, now seen corresponding path program 1 times
[2024-11-10 17:58:19,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-10 17:58:19,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1439881229]
[2024-11-10 17:58:19,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-10 17:58:19,395 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-10 17:58:19,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-10 17:58:19,398 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-10 17:58:19,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process
[2024-11-10 17:58:19,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 17:58:19,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-10 17:58:19,515 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-10 17:58:19,552 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-10 17:58:19,552 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-10 17:58:19,552 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-10 17:58:19,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1439881229]
[2024-11-10 17:58:19,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1439881229] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-10 17:58:19,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-10 17:58:19,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-10 17:58:19,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38299006]
[2024-11-10 17:58:19,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-10 17:58:19,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-10 17:58:19,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-10 17:58:19,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-10 17:58:19,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-10 17:58:19,555 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 79
[2024-11-10 17:58:19,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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-10 17:58:19,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-10 17:58:19,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 79
[2024-11-10 17:58:19,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-10 17:58:19,743 INFO L124 PetriNetUnfolderBase]: 1073/1679 cut-off events.
[2024-11-10 17:58:19,743 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES.
[2024-11-10 17:58:19,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3844 conditions, 1679 events. 1073/1679 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 7165 event pairs, 1005 based on Foata normal form. 8/1675 useless extension candidates. Maximal degree in co-relation 3835. Up to 1646 conditions per place.
[2024-11-10 17:58:19,750 INFO L140 encePairwiseOnDemand]: 77/79 looper letters, 33 selfloop transitions, 1 changer transitions 1/41 dead transitions.
[2024-11-10 17:58:19,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 41 transitions, 185 flow
[2024-11-10 17:58:19,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-10 17:58:19,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-11-10 17:58:19,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions.
[2024-11-10 17:58:19,751 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.24050632911392406
[2024-11-10 17:58:19,751 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 117 flow. Second operand 3 states and 57 transitions.
[2024-11-10 17:58:19,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 41 transitions, 185 flow
[2024-11-10 17:58:19,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 41 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-11-10 17:58:19,753 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 112 flow
[2024-11-10 17:58:19,753 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=52, PETRI_TRANSITIONS=40}
[2024-11-10 17:58:19,757 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -32 predicate places.
[2024-11-10 17:58:19,757 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 112 flow
[2024-11-10 17:58:19,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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-10 17:58:19,758 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-10 17:58:19,758 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]
[2024-11-10 17:58:19,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0
[2024-11-10 17:58:19,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-10 17:58:19,959 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] ===
[2024-11-10 17:58:19,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-10 17:58:19,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1264277212, now seen corresponding path program 1 times
[2024-11-10 17:58:19,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-10 17:58:19,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [678371267]
[2024-11-10 17:58:19,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-10 17:58:19,960 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-10 17:58:19,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-10 17:58:19,963 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-10 17:58:19,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process
[2024-11-10 17:58:20,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-10 17:58:20,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-10 17:58:20,083 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-10 17:58:20,122 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-10 17:58:20,122 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-10 17:58:20,123 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-10 17:58:20,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [678371267]
[2024-11-10 17:58:20,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [678371267] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-10 17:58:20,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-10 17:58:20,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-10 17:58:20,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036902518]
[2024-11-10 17:58:20,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-10 17:58:20,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-10 17:58:20,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-10 17:58:20,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-10 17:58:20,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-10 17:58:20,127 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 79
[2024-11-10 17:58:20,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-10 17:58:20,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-10 17:58:20,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 79
[2024-11-10 17:58:20,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-10 17:58:20,494 INFO L124 PetriNetUnfolderBase]: 1649/2585 cut-off events.
[2024-11-10 17:58:20,494 INFO L125 PetriNetUnfolderBase]: For 174/174 co-relation queries the response was YES.
[2024-11-10 17:58:20,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5862 conditions, 2585 events. 1649/2585 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 12667 event pairs, 729 based on Foata normal form. 8/2578 useless extension candidates. Maximal degree in co-relation 5853. Up to 1431 conditions per place.
[2024-11-10 17:58:20,502 INFO L140 encePairwiseOnDemand]: 74/79 looper letters, 46 selfloop transitions, 2 changer transitions 21/75 dead transitions.
[2024-11-10 17:58:20,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 75 transitions, 343 flow
[2024-11-10 17:58:20,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-10 17:58:20,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2024-11-10 17:58:20,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions.
[2024-11-10 17:58:20,503 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.27341772151898736
[2024-11-10 17:58:20,503 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 112 flow. Second operand 5 states and 108 transitions.
[2024-11-10 17:58:20,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 75 transitions, 343 flow
[2024-11-10 17:58:20,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 75 transitions, 342 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-11-10 17:58:20,505 INFO L231 Difference]: Finished difference. Result has 57 places, 40 transitions, 123 flow
[2024-11-10 17:58:20,505 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=57, PETRI_TRANSITIONS=40}
[2024-11-10 17:58:20,506 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -27 predicate places.
[2024-11-10 17:58:20,506 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 40 transitions, 123 flow
[2024-11-10 17:58:20,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-10 17:58:20,506 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-10 17:58:20,506 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]
[2024-11-10 17:58:20,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0
[2024-11-10 17:58:20,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-10 17:58:20,710 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] ===
[2024-11-10 17:58:20,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-10 17:58:20,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1550714556, now seen corresponding path program 2 times
[2024-11-10 17:58:20,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-10 17:58:20,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1041098960]
[2024-11-10 17:58:20,711 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-10 17:58:20,711 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-10 17:58:20,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-10 17:58:20,714 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-10 17:58:20,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process
[2024-11-10 17:58:20,836 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-11-10 17:58:20,836 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-10 17:58:20,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 10 conjuncts are in the unsatisfiable core
[2024-11-10 17:58:20,841 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-10 17:58:20,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-11-10 17:58:21,045 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-10 17:58:21,045 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-10 17:58:21,045 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-10 17:58:21,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1041098960]
[2024-11-10 17:58:21,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1041098960] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-10 17:58:21,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-10 17:58:21,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-10 17:58:21,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727418646]
[2024-11-10 17:58:21,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-10 17:58:21,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-10 17:58:21,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-10 17:58:21,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-10 17:58:21,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-11-10 17:58:21,055 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 79
[2024-11-10 17:58:21,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 40 transitions, 123 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 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-10 17:58:21,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-10 17:58:21,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 79
[2024-11-10 17:58:21,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-10 17:58:21,483 INFO L124 PetriNetUnfolderBase]: 1142/1827 cut-off events.
[2024-11-10 17:58:21,484 INFO L125 PetriNetUnfolderBase]: For 275/275 co-relation queries the response was YES.
[2024-11-10 17:58:21,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4208 conditions, 1827 events. 1142/1827 cut-off events. For 275/275 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 7761 event pairs, 642 based on Foata normal form. 8/1830 useless extension candidates. Maximal degree in co-relation 4196. Up to 1155 conditions per place.
[2024-11-10 17:58:21,490 INFO L140 encePairwiseOnDemand]: 71/79 looper letters, 44 selfloop transitions, 4 changer transitions 37/91 dead transitions.
[2024-11-10 17:58:21,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 91 transitions, 442 flow
[2024-11-10 17:58:21,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-10 17:58:21,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-11-10 17:58:21,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions.
[2024-11-10 17:58:21,494 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.23734177215189872
[2024-11-10 17:58:21,494 INFO L175 Difference]: Start difference. First operand has 57 places, 40 transitions, 123 flow. Second operand 8 states and 150 transitions.
[2024-11-10 17:58:21,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 91 transitions, 442 flow
[2024-11-10 17:58:21,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 91 transitions, 424 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-11-10 17:58:21,496 INFO L231 Difference]: Finished difference. Result has 63 places, 42 transitions, 144 flow
[2024-11-10 17:58:21,496 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=144, PETRI_PLACES=63, PETRI_TRANSITIONS=42}
[2024-11-10 17:58:21,497 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -21 predicate places.
[2024-11-10 17:58:21,497 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 42 transitions, 144 flow
[2024-11-10 17:58:21,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 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-10 17:58:21,497 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-10 17:58:21,497 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]
[2024-11-10 17:58:21,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0
[2024-11-10 17:58:21,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-10 17:58:21,698 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] ===
[2024-11-10 17:58:21,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-10 17:58:21,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1021686494, now seen corresponding path program 3 times
[2024-11-10 17:58:21,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-10 17:58:21,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [724082112]
[2024-11-10 17:58:21,698 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-10 17:58:21,698 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-10 17:58:21,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-10 17:58:21,700 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-10 17:58:21,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process
[2024-11-10 17:58:21,818 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2024-11-10 17:58:21,818 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-10 17:58:21,821 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 15 conjuncts are in the unsatisfiable core
[2024-11-10 17:58:21,827 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-10 17:58:21,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-11-10 17:58:21,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11
[2024-11-10 17:58:22,113 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-10 17:58:22,113 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-10 17:58:22,113 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2024-11-10 17:58:22,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [724082112]
[2024-11-10 17:58:22,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [724082112] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-10 17:58:22,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-10 17:58:22,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-10 17:58:22,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451063706]
[2024-11-10 17:58:22,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-10 17:58:22,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-10 17:58:22,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2024-11-10 17:58:22,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-10 17:58:22,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2024-11-10 17:58:22,139 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 79
[2024-11-10 17:58:22,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 42 transitions, 144 flow. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 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-10 17:58:22,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-11-10 17:58:22,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 79
[2024-11-10 17:58:22,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-11-10 17:58:22,608 INFO L124 PetriNetUnfolderBase]: 1407/2250 cut-off events.
[2024-11-10 17:58:22,608 INFO L125 PetriNetUnfolderBase]: For 669/669 co-relation queries the response was YES.
[2024-11-10 17:58:22,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5443 conditions, 2250 events. 1407/2250 cut-off events. For 669/669 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 10257 event pairs, 513 based on Foata normal form. 8/2253 useless extension candidates. Maximal degree in co-relation 5428. Up to 1096 conditions per place.
[2024-11-10 17:58:22,615 INFO L140 encePairwiseOnDemand]: 71/79 looper letters, 50 selfloop transitions, 5 changer transitions 33/94 dead transitions.
[2024-11-10 17:58:22,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 94 transitions, 474 flow
[2024-11-10 17:58:22,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-10 17:58:22,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-11-10 17:58:22,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions.
[2024-11-10 17:58:22,617 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.23734177215189872
[2024-11-10 17:58:22,617 INFO L175 Difference]: Start difference. First operand has 63 places, 42 transitions, 144 flow. Second operand 8 states and 150 transitions.
[2024-11-10 17:58:22,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 94 transitions, 474 flow
[2024-11-10 17:58:22,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 94 transitions, 457 flow, removed 6 selfloop flow, removed 6 redundant places.
[2024-11-10 17:58:22,619 INFO L231 Difference]: Finished difference. Result has 65 places, 44 transitions, 167 flow
[2024-11-10 17:58:22,619 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=167, PETRI_PLACES=65, PETRI_TRANSITIONS=44}
[2024-11-10 17:58:22,620 INFO L277 CegarLoopForPetriNet]: 84 programPoint places, -19 predicate places.
[2024-11-10 17:58:22,620 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 44 transitions, 167 flow
[2024-11-10 17:58:22,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 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-10 17:58:22,620 INFO L196 CegarLoopForPetriNet]: Found error trace
[2024-11-10 17:58:22,620 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]
[2024-11-10 17:58:22,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0
[2024-11-10 17:58:22,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-10 17:58:22,821 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] ===
[2024-11-10 17:58:22,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-10 17:58:22,822 INFO L85 PathProgramCache]: Analyzing trace with hash 612839276, now seen corresponding path program 4 times
[2024-11-10 17:58:22,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2024-11-10 17:58:22,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [979983681]
[2024-11-10 17:58:22,822 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-11-10 17:58:22,822 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-10 17:58:22,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2024-11-10 17:58:22,825 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2024-11-10 17:58:22,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process
[2024-11-10 17:58:22,938 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-11-10 17:58:22,938 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat
[2024-11-10 17:58:22,938 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-10 17:58:22,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-10 17:58:23,057 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace
[2024-11-10 17:58:23,057 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-10 17:58:23,058 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (70 of 71 remaining)
[2024-11-10 17:58:23,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 71 remaining)
[2024-11-10 17:58:23,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 71 remaining)
[2024-11-10 17:58:23,060 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 71 remaining)
[2024-11-10 17:58:23,060 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 71 remaining)
[2024-11-10 17:58:23,060 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 71 remaining)
[2024-11-10 17:58:23,060 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 71 remaining)
[2024-11-10 17:58:23,060 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 71 remaining)
[2024-11-10 17:58:23,060 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 71 remaining)
[2024-11-10 17:58:23,060 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 71 remaining)
[2024-11-10 17:58:23,060 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 71 remaining)
[2024-11-10 17:58:23,060 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 71 remaining)
[2024-11-10 17:58:23,060 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 71 remaining)
[2024-11-10 17:58:23,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 71 remaining)
[2024-11-10 17:58:23,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 71 remaining)
[2024-11-10 17:58:23,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 71 remaining)
[2024-11-10 17:58:23,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 71 remaining)
[2024-11-10 17:58:23,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 71 remaining)
[2024-11-10 17:58:23,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 71 remaining)
[2024-11-10 17:58:23,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 71 remaining)
[2024-11-10 17:58:23,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 71 remaining)
[2024-11-10 17:58:23,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 71 remaining)
[2024-11-10 17:58:23,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 71 remaining)
[2024-11-10 17:58:23,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 71 remaining)
[2024-11-10 17:58:23,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 71 remaining)
[2024-11-10 17:58:23,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 71 remaining)
[2024-11-10 17:58:23,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 71 remaining)
[2024-11-10 17:58:23,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 71 remaining)
[2024-11-10 17:58:23,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 71 remaining)
[2024-11-10 17:58:23,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 71 remaining)
[2024-11-10 17:58:23,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 71 remaining)
[2024-11-10 17:58:23,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 71 remaining)
[2024-11-10 17:58:23,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 71 remaining)
[2024-11-10 17:58:23,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 71 remaining)
[2024-11-10 17:58:23,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 71 remaining)
[2024-11-10 17:58:23,063 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 71 remaining)
[2024-11-10 17:58:23,063 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 71 remaining)
[2024-11-10 17:58:23,063 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (33 of 71 remaining)
[2024-11-10 17:58:23,063 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 71 remaining)
[2024-11-10 17:58:23,063 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 71 remaining)
[2024-11-10 17:58:23,063 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 71 remaining)
[2024-11-10 17:58:23,063 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 71 remaining)
[2024-11-10 17:58:23,063 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 71 remaining)
[2024-11-10 17:58:23,063 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 71 remaining)
[2024-11-10 17:58:23,063 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 71 remaining)
[2024-11-10 17:58:23,064 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 71 remaining)
[2024-11-10 17:58:23,064 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 71 remaining)
[2024-11-10 17:58:23,064 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 71 remaining)
[2024-11-10 17:58:23,064 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 71 remaining)
[2024-11-10 17:58:23,064 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 71 remaining)
[2024-11-10 17:58:23,064 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 71 remaining)
[2024-11-10 17:58:23,064 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 71 remaining)
[2024-11-10 17:58:23,064 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 71 remaining)
[2024-11-10 17:58:23,064 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 71 remaining)
[2024-11-10 17:58:23,064 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 71 remaining)
[2024-11-10 17:58:23,064 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 71 remaining)
[2024-11-10 17:58:23,065 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 71 remaining)
[2024-11-10 17:58:23,065 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 71 remaining)
[2024-11-10 17:58:23,065 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 71 remaining)
[2024-11-10 17:58:23,065 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 71 remaining)
[2024-11-10 17:58:23,065 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 71 remaining)
[2024-11-10 17:58:23,065 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 71 remaining)
[2024-11-10 17:58:23,065 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 71 remaining)
[2024-11-10 17:58:23,065 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 71 remaining)
[2024-11-10 17:58:23,065 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 71 remaining)
[2024-11-10 17:58:23,065 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 71 remaining)
[2024-11-10 17:58:23,065 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 71 remaining)
[2024-11-10 17:58:23,065 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 71 remaining)
[2024-11-10 17:58:23,066 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 71 remaining)
[2024-11-10 17:58:23,066 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 71 remaining)
[2024-11-10 17:58:23,066 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 71 remaining)
[2024-11-10 17:58:23,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0
[2024-11-10 17:58:23,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2024-11-10 17:58:23,270 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-10 17:58:23,347 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-11-10 17:58:23,348 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-10 17:58:23,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 05:58:23 BasicIcfg
[2024-11-10 17:58:23,352 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-10 17:58:23,356 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-10 17:58:23,356 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-10 17:58:23,357 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-10 17:58:23,357 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:58:09" (3/4) ...
[2024-11-10 17:58:23,358 INFO L146 WitnessPrinter]: No result that supports witness generation found
[2024-11-10 17:58:23,359 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-10 17:58:23,360 INFO L158 Benchmark]: Toolchain (without parser) took 15148.28ms. Allocated memory was 67.1MB in the beginning and 3.0GB in the end (delta: 3.0GB). Free memory was 45.7MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 450.9MB. Max. memory is 16.1GB.
[2024-11-10 17:58:23,360 INFO L158 Benchmark]: CDTParser took 0.79ms. Allocated memory is still 50.3MB. Free memory is still 26.4MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-10 17:58:23,360 INFO L158 Benchmark]: CACSL2BoogieTranslator took 493.92ms. Allocated memory is still 67.1MB. Free memory was 45.4MB in the beginning and 36.3MB in the end (delta: 9.2MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB.
[2024-11-10 17:58:23,360 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.30ms. Allocated memory is still 67.1MB. Free memory was 36.3MB in the beginning and 33.7MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-11-10 17:58:23,360 INFO L158 Benchmark]: Boogie Preprocessor took 43.52ms. Allocated memory is still 67.1MB. Free memory was 33.7MB in the beginning and 29.7MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-11-10 17:58:23,361 INFO L158 Benchmark]: IcfgBuilder took 1022.44ms. Allocated memory was 67.1MB in the beginning and 115.3MB in the end (delta: 48.2MB). Free memory was 29.7MB in the beginning and 47.4MB in the end (delta: -17.7MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB.
[2024-11-10 17:58:23,361 INFO L158 Benchmark]: TraceAbstraction took 13520.00ms. Allocated memory was 115.3MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 46.7MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 403.7MB. Max. memory is 16.1GB.
[2024-11-10 17:58:23,361 INFO L158 Benchmark]: Witness Printer took 2.97ms. Allocated memory is still 3.0GB. Free memory is still 2.6GB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-10 17:58:23,362 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.79ms. Allocated memory is still 50.3MB. Free memory is still 26.4MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 493.92ms. Allocated memory is still 67.1MB. Free memory was 45.4MB in the beginning and 36.3MB in the end (delta: 9.2MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 57.30ms. Allocated memory is still 67.1MB. Free memory was 36.3MB in the beginning and 33.7MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 43.52ms. Allocated memory is still 67.1MB. Free memory was 33.7MB in the beginning and 29.7MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
* IcfgBuilder took 1022.44ms. Allocated memory was 67.1MB in the beginning and 115.3MB in the end (delta: 48.2MB). Free memory was 29.7MB in the beginning and 47.4MB in the end (delta: -17.7MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB.
* TraceAbstraction took 13520.00ms. Allocated memory was 115.3MB in the beginning and 3.0GB in the end (delta: 2.9GB). Free memory was 46.7MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 403.7MB. Max. memory is 16.1GB.
* Witness Printer took 2.97ms. Allocated memory is still 3.0GB. Free memory is still 2.6GB. There was no memory consumed. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: overapproximation of memtrack at line 18.
Possible FailurePath:
[L710] 0 int __unbuffered_cnt = 0;
[L712] 0 int __unbuffered_p0_EAX = 0;
[L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed;
[L714] 0 int __unbuffered_p0_EAX$mem_tmp;
[L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0;
[L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1;
[L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2;
[L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3;
[L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0;
[L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1;
[L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2;
[L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3;
[L723] 0 _Bool __unbuffered_p0_EAX$read_delayed;
[L724] 0 int *__unbuffered_p0_EAX$read_delayed_var;
[L725] 0 int __unbuffered_p0_EAX$w_buff0;
[L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used;
[L727] 0 int __unbuffered_p0_EAX$w_buff1;
[L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used;
[L730] 0 int __unbuffered_p1_EAX = 0;
[L732] 0 int __unbuffered_p1_EBX = 0;
[L733] 0 _Bool main$tmp_guard0;
[L734] 0 _Bool main$tmp_guard1;
[L736] 0 int x = 0;
[L736] 0 int x = 0;
[L737] 0 _Bool x$flush_delayed;
[L738] 0 int x$mem_tmp;
[L739] 0 _Bool x$r_buff0_thd0;
[L740] 0 _Bool x$r_buff0_thd1;
[L741] 0 _Bool x$r_buff0_thd2;
[L742] 0 _Bool x$r_buff0_thd3;
[L743] 0 _Bool x$r_buff1_thd0;
[L744] 0 _Bool x$r_buff1_thd1;
[L745] 0 _Bool x$r_buff1_thd2;
[L746] 0 _Bool x$r_buff1_thd3;
[L747] 0 _Bool x$read_delayed;
[L748] 0 int *x$read_delayed_var;
[L749] 0 int x$w_buff0;
[L750] 0 _Bool x$w_buff0_used;
[L751] 0 int x$w_buff1;
[L752] 0 _Bool x$w_buff1_used;
[L754] 0 int y = 0;
[L755] 0 _Bool weak$$choice0;
[L756] 0 _Bool weak$$choice1;
[L757] 0 _Bool weak$$choice2;
[L847] 0 pthread_t t1693;
[L848] FCALL, FORK 0 pthread_create(&t1693, ((void *)0), P0, ((void *)0))
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1693=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0]
[L761] 1 weak$$choice0 = __VERIFIER_nondet_bool()
[L762] 1 weak$$choice2 = __VERIFIER_nondet_bool()
[L763] 1 x$flush_delayed = weak$$choice2
[L764] EXPR 1 \read(x)
[L764] 1 x$mem_tmp = x
[L765] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L765] EXPR 1 \read(x)
[L765] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L765] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L766] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))
[L767] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))
[L768] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))
[L769] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L770] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))
[L771] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1
[L773] 1 __unbuffered_p0_EAX$read_delayed_var = &x
[L774] EXPR 1 \read(x)
[L774] 1 __unbuffered_p0_EAX = x
[L775] EXPR 1 x$flush_delayed ? x$mem_tmp : x
[L775] EXPR 1 \read(x)
[L775] EXPR 1 x$flush_delayed ? x$mem_tmp : x
[L775] 1 x = x$flush_delayed ? x$mem_tmp : x
[L776] 1 x$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0]
[L849] 0 pthread_t t1694;
[L850] FCALL, FORK 0 pthread_create(&t1694, ((void *)0), P1, ((void *)0))
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1693=0, t1694=1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0]
[L851] 0 pthread_t t1695;
[L779] 1 y = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1]
[L852] FCALL, FORK 0 pthread_create(&t1695, ((void *)0), P2, ((void *)0))
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1693=0, t1694=1, t1695=2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1]
[L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1]
[L791] 2 y = 2
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2]
[L794] 2 __unbuffered_p1_EAX = y
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2]
[L797] 2 weak$$choice0 = __VERIFIER_nondet_bool()
[L798] 2 weak$$choice2 = __VERIFIER_nondet_bool()
[L799] 2 x$flush_delayed = weak$$choice2
[L800] EXPR 2 \read(x)
[L800] 2 x$mem_tmp = x
[L801] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)
[L801] EXPR 2 \read(x)
[L801] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)
[L801] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)
[L802] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))
[L803] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))
[L804] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))
[L805] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L806] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))
[L807] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L808] EXPR 2 \read(x)
[L808] 2 __unbuffered_p1_EBX = x
[L809] EXPR 2 x$flush_delayed ? x$mem_tmp : x
[L809] EXPR 2 \read(x)
[L809] EXPR 2 x$flush_delayed ? x$mem_tmp : x
[L809] 2 x = x$flush_delayed ? x$mem_tmp : x
[L810] 2 x$flush_delayed = (_Bool)0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2]
[L815] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2]
[L822] 3 x = 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2]
[L825] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L825] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x
[L825] EXPR 3 \read(x)
[L825] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x
[L825] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L825] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L826] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L827] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L828] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L829] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2]
[L832] 3 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2]
[L854] 0 main$tmp_guard0 = __unbuffered_cnt == 3
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1693=0, t1694=1, t1695=2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2]
[L856] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L4] COND FALSE 0 !(!cond)
[L856] RET 0 assume_abort_if_not(main$tmp_guard0)
[L858] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L858] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x
[L858] EXPR 0 \read(x)
[L858] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x
[L858] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L858] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L859] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L860] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L861] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L862] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1693=0, t1694=1, t1695=2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2]
[L865] 0 weak$$choice1 = __VERIFIER_nondet_bool()
[L866] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX
[L866] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX
[L866] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var)
[L866] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX
[L866] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX
[L866] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX
[L867] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0)
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1693=0, t1694=1, t1695=2, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2]
[L869] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L19] COND TRUE 0 !expression
[L19] CALL 0 reach_error()
[L18] COND FALSE 0 !(0)
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2]
[L18] 0 __assert_fail ("0", "rfi006_rmo.c", 9, __extension__ __PRETTY_FUNCTION__)
VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2]
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: 845]: Unable to prove that all allocated memory was freed
Unable to prove that all allocated memory was freed
Reason: Not analyzed.
- UnprovableResult [Line: 852]: 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: 850]: 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: 848]: 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, 132 locations, 71 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: 13.3s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 525 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 512 mSDsluCounter, 52 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 46 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1410 IncrementalHoareTripleChecker+Invalid, 1450 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 6 mSDtfsCounter, 1410 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 234 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=172occurred in iteration=5, InterpolantAutomatonStates: 53, 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.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 256 NumberOfCodeBlocks, 256 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 215 ConstructedInterpolants, 0 QuantifiedInterpolants, 1495 SizeOfPredicates, 23 NumberOfNonLiveVariables, 1654 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-10 17:58:23,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Writing output log to file Ultimate.log
Result:
UNKNOWN: Overapproximated counterexample