./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix010.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit


--------------------------------------------------------------------------------


Checking for memory safety (deref-memtrack)
Using default analysis
Version b8dbc81d
Calling Ultimate with: /usr/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 ../../../trunk/examples/svcomp/pthread-wmm/mix010.opt.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.graphml --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 371e0ad4620d67bc913500e97f289ec14c56f7c02bd7df3fa28779e14d33459a --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER
--- Real Ultimate output ---
This is Ultimate 0.2.3-?-b8dbc81
[2023-08-29 20:16:10,077 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-08-29 20:16:10,078 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-08-29 20:16:10,103 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-08-29 20:16:10,105 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-08-29 20:16:10,108 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-08-29 20:16:10,111 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-08-29 20:16:10,114 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-08-29 20:16:10,116 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-08-29 20:16:10,120 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-08-29 20:16:10,121 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-08-29 20:16:10,123 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-08-29 20:16:10,124 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-08-29 20:16:10,125 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-08-29 20:16:10,128 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-08-29 20:16:10,131 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-08-29 20:16:10,132 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-08-29 20:16:10,133 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-08-29 20:16:10,135 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-08-29 20:16:10,138 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-08-29 20:16:10,144 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-08-29 20:16:10,146 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-08-29 20:16:10,147 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-08-29 20:16:10,148 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-08-29 20:16:10,152 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-08-29 20:16:10,156 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-08-29 20:16:10,156 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-08-29 20:16:10,157 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-08-29 20:16:10,158 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-08-29 20:16:10,159 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-08-29 20:16:10,160 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-08-29 20:16:10,162 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-08-29 20:16:10,163 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-08-29 20:16:10,164 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-08-29 20:16:10,165 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-08-29 20:16:10,166 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-08-29 20:16:10,166 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-08-29 20:16:10,167 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-08-29 20:16:10,167 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-08-29 20:16:10,168 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-08-29 20:16:10,168 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-08-29 20:16:10,170 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf
[2023-08-29 20:16:10,206 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-08-29 20:16:10,207 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-08-29 20:16:10,208 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-08-29 20:16:10,208 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-08-29 20:16:10,209 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-08-29 20:16:10,209 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-08-29 20:16:10,209 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-08-29 20:16:10,210 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-08-29 20:16:10,210 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-08-29 20:16:10,210 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-08-29 20:16:10,211 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-08-29 20:16:10,211 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-08-29 20:16:10,211 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-08-29 20:16:10,211 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-08-29 20:16:10,212 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-08-29 20:16:10,212 INFO  L138        SettingsManager]:  * Check for the main procedure if all allocated memory was freed=true
[2023-08-29 20:16:10,212 INFO  L138        SettingsManager]:  * Bitprecise bitfields=true
[2023-08-29 20:16:10,212 INFO  L138        SettingsManager]:  * SV-COMP memtrack compatibility mode=true
[2023-08-29 20:16:10,212 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-08-29 20:16:10,213 INFO  L138        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2023-08-29 20:16:10,213 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-08-29 20:16:10,213 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-08-29 20:16:10,213 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-08-29 20:16:10,213 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-08-29 20:16:10,213 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-08-29 20:16:10,214 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-08-29 20:16:10,214 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-08-29 20:16:10,214 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-08-29 20:16:10,214 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-08-29 20:16:10,215 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-08-29 20:16:10,215 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-08-29 20:16:10,215 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-08-29 20:16:10,215 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-08-29 20:16:10,215 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-08-29 20:16:10,216 INFO  L138        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.graphml
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 -> 371e0ad4620d67bc913500e97f289ec14c56f7c02bd7df3fa28779e14d33459a
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER
[2023-08-29 20:16:10,509 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-08-29 20:16:10,526 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-08-29 20:16:10,528 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-08-29 20:16:10,530 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-08-29 20:16:10,530 INFO  L275        PluginConnector]: CDTParser initialized
[2023-08-29 20:16:10,531 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix010.opt.i
[2023-08-29 20:16:11,790 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-08-29 20:16:12,085 INFO  L351              CDTParser]: Found 1 translation units.
[2023-08-29 20:16:12,085 INFO  L172              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix010.opt.i
[2023-08-29 20:16:12,103 INFO  L394              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c92bc4fdd/ad879cc91d034673829d5ca8c2410e3f/FLAG8d9ec9e9c
[2023-08-29 20:16:12,118 INFO  L402              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c92bc4fdd/ad879cc91d034673829d5ca8c2410e3f
[2023-08-29 20:16:12,120 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-08-29 20:16:12,121 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-08-29 20:16:12,122 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-08-29 20:16:12,123 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-08-29 20:16:12,127 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-08-29 20:16:12,127 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:16:12" (1/1) ...
[2023-08-29 20:16:12,128 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66194d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:12, skipping insertion in model container
[2023-08-29 20:16:12,128 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:16:12" (1/1) ...
[2023-08-29 20:16:12,134 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-08-29 20:16:12,190 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-08-29 20:16:12,349 WARN  L247   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix010.opt.i[944,957]
[2023-08-29 20:16:12,572 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-08-29 20:16:12,583 INFO  L203         MainTranslator]: Completed pre-run
[2023-08-29 20:16:12,594 WARN  L247   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix010.opt.i[944,957]
[2023-08-29 20:16:12,663 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-08-29 20:16:12,706 WARN  L667               CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler.
[2023-08-29 20:16:12,707 WARN  L667               CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler.
[2023-08-29 20:16:12,712 INFO  L208         MainTranslator]: Completed translation
[2023-08-29 20:16:12,713 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:12 WrapperNode
[2023-08-29 20:16:12,713 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-08-29 20:16:12,714 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-08-29 20:16:12,714 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-08-29 20:16:12,714 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-08-29 20:16:12,720 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:12" (1/1) ...
[2023-08-29 20:16:12,743 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:12" (1/1) ...
[2023-08-29 20:16:12,765 INFO  L138                Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 152
[2023-08-29 20:16:12,766 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-08-29 20:16:12,766 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-08-29 20:16:12,766 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-08-29 20:16:12,767 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-08-29 20:16:12,774 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:12" (1/1) ...
[2023-08-29 20:16:12,774 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:12" (1/1) ...
[2023-08-29 20:16:12,778 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:12" (1/1) ...
[2023-08-29 20:16:12,778 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:12" (1/1) ...
[2023-08-29 20:16:12,785 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:12" (1/1) ...
[2023-08-29 20:16:12,787 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:12" (1/1) ...
[2023-08-29 20:16:12,789 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:12" (1/1) ...
[2023-08-29 20:16:12,791 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:12" (1/1) ...
[2023-08-29 20:16:12,794 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-08-29 20:16:12,795 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-08-29 20:16:12,795 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-08-29 20:16:12,795 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-08-29 20:16:12,796 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:12" (1/1) ...
[2023-08-29 20:16:12,801 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-08-29 20:16:12,813 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-08-29 20:16:12,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:2000 (exit command is (exit), workingDir is null)
[2023-08-29 20:16:12,859 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-08-29 20:16:12,871 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-08-29 20:16:12,871 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2023-08-29 20:16:12,872 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-08-29 20:16:12,872 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-08-29 20:16:12,872 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-08-29 20:16:12,872 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2023-08-29 20:16:12,872 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2023-08-29 20:16:12,872 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2023-08-29 20:16:12,872 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2023-08-29 20:16:12,873 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2023-08-29 20:16:12,873 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2023-08-29 20:16:12,873 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2023-08-29 20:16:12,873 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2023-08-29 20:16:12,873 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-08-29 20:16:12,873 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-08-29 20:16:12,875 WARN  L210             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2023-08-29 20:16:13,033 INFO  L236             CfgBuilder]: Building ICFG
[2023-08-29 20:16:13,035 INFO  L262             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-08-29 20:16:13,473 INFO  L277             CfgBuilder]: Performing block encoding
[2023-08-29 20:16:13,568 INFO  L297             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-08-29 20:16:13,569 INFO  L302             CfgBuilder]: Removed 0 assume(true) statements.
[2023-08-29 20:16:13,571 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:16:13 BoogieIcfgContainer
[2023-08-29 20:16:13,571 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-08-29 20:16:13,573 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-08-29 20:16:13,573 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-08-29 20:16:13,576 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-08-29 20:16:13,576 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:16:12" (1/3) ...
[2023-08-29 20:16:13,577 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58bf961 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:16:13, skipping insertion in model container
[2023-08-29 20:16:13,577 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:12" (2/3) ...
[2023-08-29 20:16:13,577 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58bf961 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:16:13, skipping insertion in model container
[2023-08-29 20:16:13,578 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:16:13" (3/3) ...
[2023-08-29 20:16:13,579 INFO  L112   eAbstractionObserver]: Analyzing ICFG mix010.opt.i
[2023-08-29 20:16:13,592 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-08-29 20:16:13,592 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations.
[2023-08-29 20:16:13,593 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-08-29 20:16:13,643 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-08-29 20:16:13,673 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 131 places, 123 transitions, 261 flow
[2023-08-29 20:16:13,711 INFO  L130       PetriNetUnfolder]: 2/120 cut-off events.
[2023-08-29 20:16:13,712 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-08-29 20:16:13,717 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 130 conditions, 120 events. 2/120 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 82 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. 
[2023-08-29 20:16:13,717 INFO  L82        GeneralOperation]: Start removeDead. Operand has 131 places, 123 transitions, 261 flow
[2023-08-29 20:16:13,721 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 128 places, 120 transitions, 249 flow
[2023-08-29 20:16:13,724 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-08-29 20:16:13,732 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 120 transitions, 249 flow
[2023-08-29 20:16:13,734 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 120 transitions, 249 flow
[2023-08-29 20:16:13,735 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 128 places, 120 transitions, 249 flow
[2023-08-29 20:16:13,755 INFO  L130       PetriNetUnfolder]: 2/120 cut-off events.
[2023-08-29 20:16:13,756 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-08-29 20:16:13,757 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 130 conditions, 120 events. 2/120 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 82 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. 
[2023-08-29 20:16:13,758 INFO  L119        LiptonReduction]: Number of co-enabled transitions 2180
[2023-08-29 20:16:17,885 INFO  L134        LiptonReduction]: Checked pairs total: 5501
[2023-08-29 20:16:17,885 INFO  L136        LiptonReduction]: Total number of compositions: 119
[2023-08-29 20:16:17,896 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-08-29 20:16:17,900 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@21ff0684, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-08-29 20:16:17,901 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 13 error locations.
[2023-08-29 20:16:17,902 INFO  L130       PetriNetUnfolder]: 0/0 cut-off events.
[2023-08-29 20:16:17,902 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-08-29 20:16:17,902 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-29 20:16:17,903 INFO  L208   CegarLoopForPetriNet]: trace histogram [1]
[2023-08-29 20:16:17,903 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-29 20:16:17,906 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-29 20:16:17,906 INFO  L85        PathProgramCache]: Analyzing trace with hash 551, now seen corresponding path program 1 times
[2023-08-29 20:16:17,912 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-29 20:16:17,913 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421892611]
[2023-08-29 20:16:17,913 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-29 20:16:17,914 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-29 20:16:17,972 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-29 20:16:17,994 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-29 20:16:17,997 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-29 20:16:17,998 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421892611]
[2023-08-29 20:16:17,998 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421892611] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-29 20:16:17,998 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-29 20:16:17,999 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-08-29 20:16:18,000 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313472828]
[2023-08-29 20:16:18,000 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-29 20:16:18,006 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-08-29 20:16:18,019 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-29 20:16:18,037 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-08-29 20:16:18,037 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-08-29 20:16:18,039 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 111 out of 242
[2023-08-29 20:16:18,040 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 69 flow. Second operand  has 2 states, 2 states have (on average 111.5) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:18,040 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-29 20:16:18,040 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 242
[2023-08-29 20:16:18,041 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-29 20:16:18,332 INFO  L130       PetriNetUnfolder]: 939/1427 cut-off events.
[2023-08-29 20:16:18,332 INFO  L131       PetriNetUnfolder]: For 9/9 co-relation queries the response was YES.
[2023-08-29 20:16:18,338 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2866 conditions, 1427 events. 939/1427 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 6747 event pairs, 939 based on Foata normal form. 0/1192 useless extension candidates. Maximal degree in co-relation 2855. Up to 1403 conditions per place. 
[2023-08-29 20:16:18,346 INFO  L137   encePairwiseOnDemand]: 236/242 looper letters, 21 selfloop transitions, 0 changer transitions 0/24 dead transitions.
[2023-08-29 20:16:18,347 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 24 transitions, 99 flow
[2023-08-29 20:16:18,348 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-08-29 20:16:18,350 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-08-29 20:16:18,359 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 249 transitions.
[2023-08-29 20:16:18,362 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5144628099173554
[2023-08-29 20:16:18,364 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 249 transitions.
[2023-08-29 20:16:18,364 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 249 transitions.
[2023-08-29 20:16:18,366 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-29 20:16:18,368 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 249 transitions.
[2023-08-29 20:16:18,373 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 124.5) internal successors, (249), 2 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:18,377 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:18,378 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:18,379 INFO  L175             Difference]: Start difference. First operand has 40 places, 30 transitions, 69 flow. Second operand 2 states and 249 transitions.
[2023-08-29 20:16:18,380 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 24 transitions, 99 flow
[2023-08-29 20:16:18,382 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 24 transitions, 96 flow, removed 0 selfloop flow, removed 3 redundant places.
[2023-08-29 20:16:18,383 INFO  L231             Difference]: Finished difference. Result has 32 places, 24 transitions, 54 flow
[2023-08-29 20:16:18,385 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=24}
[2023-08-29 20:16:18,388 INFO  L281   CegarLoopForPetriNet]: 40 programPoint places, -8 predicate places.
[2023-08-29 20:16:18,388 INFO  L495      AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 54 flow
[2023-08-29 20:16:18,389 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 111.5) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:18,389 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-29 20:16:18,390 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-08-29 20:16:18,391 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-08-29 20:16:18,391 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-29 20:16:18,395 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-29 20:16:18,395 INFO  L85        PathProgramCache]: Analyzing trace with hash 1781286597, now seen corresponding path program 1 times
[2023-08-29 20:16:18,395 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-29 20:16:18,396 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509549510]
[2023-08-29 20:16:18,396 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-29 20:16:18,396 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-29 20:16:18,481 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-29 20:16:18,768 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-29 20:16:18,768 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-29 20:16:18,769 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509549510]
[2023-08-29 20:16:18,772 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509549510] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-29 20:16:18,773 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-29 20:16:18,773 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-08-29 20:16:18,773 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971895803]
[2023-08-29 20:16:18,773 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-29 20:16:18,774 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-08-29 20:16:18,775 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-29 20:16:18,776 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-08-29 20:16:18,776 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-08-29 20:16:18,782 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 110 out of 242
[2023-08-29 20:16:18,783 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 54 flow. Second operand  has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:18,783 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-29 20:16:18,783 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 242
[2023-08-29 20:16:18,783 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-29 20:16:18,983 INFO  L130       PetriNetUnfolder]: 777/1247 cut-off events.
[2023-08-29 20:16:18,984 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-08-29 20:16:18,985 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2450 conditions, 1247 events. 777/1247 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6258 event pairs, 129 based on Foata normal form. 0/1123 useless extension candidates. Maximal degree in co-relation 2447. Up to 937 conditions per place. 
[2023-08-29 20:16:18,991 INFO  L137   encePairwiseOnDemand]: 239/242 looper letters, 26 selfloop transitions, 2 changer transitions 2/33 dead transitions.
[2023-08-29 20:16:18,991 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 33 transitions, 132 flow
[2023-08-29 20:16:18,991 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-08-29 20:16:18,991 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-08-29 20:16:18,995 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions.
[2023-08-29 20:16:18,996 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4972451790633609
[2023-08-29 20:16:18,996 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 361 transitions.
[2023-08-29 20:16:18,996 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 361 transitions.
[2023-08-29 20:16:18,996 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-29 20:16:18,996 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 361 transitions.
[2023-08-29 20:16:18,998 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:19,001 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:19,002 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:19,002 INFO  L175             Difference]: Start difference. First operand has 32 places, 24 transitions, 54 flow. Second operand 3 states and 361 transitions.
[2023-08-29 20:16:19,002 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 33 transitions, 132 flow
[2023-08-29 20:16:19,002 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 132 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-08-29 20:16:19,003 INFO  L231             Difference]: Finished difference. Result has 33 places, 22 transitions, 54 flow
[2023-08-29 20:16:19,004 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=33, PETRI_TRANSITIONS=22}
[2023-08-29 20:16:19,004 INFO  L281   CegarLoopForPetriNet]: 40 programPoint places, -7 predicate places.
[2023-08-29 20:16:19,004 INFO  L495      AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 54 flow
[2023-08-29 20:16:19,005 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:19,005 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-29 20:16:19,005 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-29 20:16:19,005 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-08-29 20:16:19,006 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-29 20:16:19,008 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-29 20:16:19,008 INFO  L85        PathProgramCache]: Analyzing trace with hash -1875462369, now seen corresponding path program 1 times
[2023-08-29 20:16:19,008 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-29 20:16:19,009 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685314656]
[2023-08-29 20:16:19,009 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-29 20:16:19,010 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-29 20:16:19,045 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-29 20:16:19,252 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-29 20:16:19,252 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-29 20:16:19,252 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685314656]
[2023-08-29 20:16:19,253 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685314656] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-29 20:16:19,253 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-29 20:16:19,253 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-08-29 20:16:19,253 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806558842]
[2023-08-29 20:16:19,253 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-29 20:16:19,254 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-08-29 20:16:19,254 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-29 20:16:19,254 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-08-29 20:16:19,255 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-08-29 20:16:19,269 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 103 out of 242
[2023-08-29 20:16:19,270 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 54 flow. Second operand  has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:19,270 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-29 20:16:19,270 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 242
[2023-08-29 20:16:19,270 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-29 20:16:19,541 INFO  L130       PetriNetUnfolder]: 1505/2258 cut-off events.
[2023-08-29 20:16:19,542 INFO  L131       PetriNetUnfolder]: For 108/108 co-relation queries the response was YES.
[2023-08-29 20:16:19,544 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4683 conditions, 2258 events. 1505/2258 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 9981 event pairs, 583 based on Foata normal form. 0/2146 useless extension candidates. Maximal degree in co-relation 4679. Up to 1895 conditions per place. 
[2023-08-29 20:16:19,553 INFO  L137   encePairwiseOnDemand]: 234/242 looper letters, 34 selfloop transitions, 7 changer transitions 0/41 dead transitions.
[2023-08-29 20:16:19,553 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 41 transitions, 180 flow
[2023-08-29 20:16:19,554 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-08-29 20:16:19,554 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-08-29 20:16:19,555 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions.
[2023-08-29 20:16:19,555 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4834710743801653
[2023-08-29 20:16:19,555 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 351 transitions.
[2023-08-29 20:16:19,555 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 351 transitions.
[2023-08-29 20:16:19,556 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-29 20:16:19,556 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 351 transitions.
[2023-08-29 20:16:19,557 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:19,558 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:19,559 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:19,559 INFO  L175             Difference]: Start difference. First operand has 33 places, 22 transitions, 54 flow. Second operand 3 states and 351 transitions.
[2023-08-29 20:16:19,559 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 41 transitions, 180 flow
[2023-08-29 20:16:19,560 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 41 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-08-29 20:16:19,561 INFO  L231             Difference]: Finished difference. Result has 34 places, 28 transitions, 104 flow
[2023-08-29 20:16:19,561 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=34, PETRI_TRANSITIONS=28}
[2023-08-29 20:16:19,562 INFO  L281   CegarLoopForPetriNet]: 40 programPoint places, -6 predicate places.
[2023-08-29 20:16:19,562 INFO  L495      AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 104 flow
[2023-08-29 20:16:19,563 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:19,563 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-29 20:16:19,563 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-29 20:16:19,563 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-08-29 20:16:19,563 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-29 20:16:19,564 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-29 20:16:19,564 INFO  L85        PathProgramCache]: Analyzing trace with hash -1875462359, now seen corresponding path program 1 times
[2023-08-29 20:16:19,564 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-29 20:16:19,564 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380394380]
[2023-08-29 20:16:19,564 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-29 20:16:19,565 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-29 20:16:19,592 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-29 20:16:19,882 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-29 20:16:19,882 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-29 20:16:19,883 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380394380]
[2023-08-29 20:16:19,883 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380394380] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-29 20:16:19,883 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-29 20:16:19,883 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-08-29 20:16:19,883 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434177771]
[2023-08-29 20:16:19,884 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-29 20:16:19,884 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-08-29 20:16:19,884 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-29 20:16:19,885 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-08-29 20:16:19,885 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2023-08-29 20:16:20,039 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 242
[2023-08-29 20:16:20,040 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 104 flow. Second operand  has 5 states, 5 states have (on average 99.8) internal successors, (499), 5 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:20,040 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-29 20:16:20,040 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 242
[2023-08-29 20:16:20,041 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-29 20:16:20,296 INFO  L130       PetriNetUnfolder]: 950/1545 cut-off events.
[2023-08-29 20:16:20,297 INFO  L131       PetriNetUnfolder]: For 465/523 co-relation queries the response was YES.
[2023-08-29 20:16:20,300 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3640 conditions, 1545 events. 950/1545 cut-off events. For 465/523 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7364 event pairs, 210 based on Foata normal form. 75/1605 useless extension candidates. Maximal degree in co-relation 3635. Up to 1011 conditions per place. 
[2023-08-29 20:16:20,307 INFO  L137   encePairwiseOnDemand]: 236/242 looper letters, 30 selfloop transitions, 5 changer transitions 0/41 dead transitions.
[2023-08-29 20:16:20,307 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 41 transitions, 202 flow
[2023-08-29 20:16:20,308 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2023-08-29 20:16:20,308 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-08-29 20:16:20,309 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 525 transitions.
[2023-08-29 20:16:20,309 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43388429752066116
[2023-08-29 20:16:20,310 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 525 transitions.
[2023-08-29 20:16:20,310 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 525 transitions.
[2023-08-29 20:16:20,310 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-29 20:16:20,310 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 525 transitions.
[2023-08-29 20:16:20,311 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 6 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:20,313 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:20,314 INFO  L81            ComplementDD]: Finished complementDD. Result  has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:20,314 INFO  L175             Difference]: Start difference. First operand has 34 places, 28 transitions, 104 flow. Second operand 5 states and 525 transitions.
[2023-08-29 20:16:20,314 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 41 transitions, 202 flow
[2023-08-29 20:16:20,319 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 41 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-08-29 20:16:20,319 INFO  L231             Difference]: Finished difference. Result has 37 places, 27 transitions, 103 flow
[2023-08-29 20:16:20,320 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=103, PETRI_PLACES=37, PETRI_TRANSITIONS=27}
[2023-08-29 20:16:20,320 INFO  L281   CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places.
[2023-08-29 20:16:20,321 INFO  L495      AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 103 flow
[2023-08-29 20:16:20,321 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 99.8) internal successors, (499), 5 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:20,321 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-29 20:16:20,321 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-29 20:16:20,321 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-08-29 20:16:20,322 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-29 20:16:20,322 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-29 20:16:20,322 INFO  L85        PathProgramCache]: Analyzing trace with hash 1516531085, now seen corresponding path program 1 times
[2023-08-29 20:16:20,322 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-29 20:16:20,323 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489711454]
[2023-08-29 20:16:20,323 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-29 20:16:20,323 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-29 20:16:20,349 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-29 20:16:20,551 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-29 20:16:20,552 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-29 20:16:20,552 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489711454]
[2023-08-29 20:16:20,552 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489711454] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-29 20:16:20,552 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-29 20:16:20,553 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-08-29 20:16:20,553 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360014946]
[2023-08-29 20:16:20,553 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-29 20:16:20,553 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-08-29 20:16:20,553 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-29 20:16:20,554 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-08-29 20:16:20,554 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2023-08-29 20:16:20,567 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 103 out of 242
[2023-08-29 20:16:20,568 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 103 flow. Second operand  has 4 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:20,568 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-29 20:16:20,568 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 242
[2023-08-29 20:16:20,568 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-29 20:16:20,808 INFO  L130       PetriNetUnfolder]: 1191/1804 cut-off events.
[2023-08-29 20:16:20,808 INFO  L131       PetriNetUnfolder]: For 484/484 co-relation queries the response was YES.
[2023-08-29 20:16:20,812 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4624 conditions, 1804 events. 1191/1804 cut-off events. For 484/484 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 7751 event pairs, 433 based on Foata normal form. 0/1756 useless extension candidates. Maximal degree in co-relation 4618. Up to 1095 conditions per place. 
[2023-08-29 20:16:20,819 INFO  L137   encePairwiseOnDemand]: 235/242 looper letters, 40 selfloop transitions, 7 changer transitions 0/47 dead transitions.
[2023-08-29 20:16:20,820 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 47 transitions, 259 flow
[2023-08-29 20:16:20,820 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-08-29 20:16:20,820 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-08-29 20:16:20,821 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 456 transitions.
[2023-08-29 20:16:20,822 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47107438016528924
[2023-08-29 20:16:20,822 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 456 transitions.
[2023-08-29 20:16:20,822 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 456 transitions.
[2023-08-29 20:16:20,822 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-29 20:16:20,822 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 456 transitions.
[2023-08-29 20:16:20,823 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:20,825 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:20,826 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:20,826 INFO  L175             Difference]: Start difference. First operand has 37 places, 27 transitions, 103 flow. Second operand 4 states and 456 transitions.
[2023-08-29 20:16:20,826 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 47 transitions, 259 flow
[2023-08-29 20:16:20,827 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 47 transitions, 245 flow, removed 0 selfloop flow, removed 4 redundant places.
[2023-08-29 20:16:20,829 INFO  L231             Difference]: Finished difference. Result has 39 places, 30 transitions, 143 flow
[2023-08-29 20:16:20,829 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=143, PETRI_PLACES=39, PETRI_TRANSITIONS=30}
[2023-08-29 20:16:20,831 INFO  L281   CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places.
[2023-08-29 20:16:20,831 INFO  L495      AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 143 flow
[2023-08-29 20:16:20,831 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:20,831 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-29 20:16:20,832 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-29 20:16:20,832 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-08-29 20:16:20,832 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-29 20:16:20,832 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-29 20:16:20,833 INFO  L85        PathProgramCache]: Analyzing trace with hash 1516425075, now seen corresponding path program 1 times
[2023-08-29 20:16:20,833 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-29 20:16:20,833 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704379405]
[2023-08-29 20:16:20,833 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-29 20:16:20,833 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-29 20:16:20,873 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-29 20:16:21,226 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-29 20:16:21,226 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-29 20:16:21,226 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704379405]
[2023-08-29 20:16:21,226 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704379405] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-29 20:16:21,226 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-29 20:16:21,226 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-08-29 20:16:21,227 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317664337]
[2023-08-29 20:16:21,227 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-29 20:16:21,227 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-08-29 20:16:21,227 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-29 20:16:21,228 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-08-29 20:16:21,228 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2023-08-29 20:16:21,351 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 97 out of 242
[2023-08-29 20:16:21,352 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 143 flow. Second operand  has 5 states, 5 states have (on average 99.2) internal successors, (496), 5 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:21,352 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-29 20:16:21,352 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 242
[2023-08-29 20:16:21,352 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-29 20:16:21,602 INFO  L130       PetriNetUnfolder]: 890/1420 cut-off events.
[2023-08-29 20:16:21,602 INFO  L131       PetriNetUnfolder]: For 1332/1336 co-relation queries the response was YES.
[2023-08-29 20:16:21,605 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3820 conditions, 1420 events. 890/1420 cut-off events. For 1332/1336 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6376 event pairs, 218 based on Foata normal form. 32/1432 useless extension candidates. Maximal degree in co-relation 3812. Up to 963 conditions per place. 
[2023-08-29 20:16:21,611 INFO  L137   encePairwiseOnDemand]: 237/242 looper letters, 33 selfloop transitions, 7 changer transitions 0/45 dead transitions.
[2023-08-29 20:16:21,612 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 45 transitions, 261 flow
[2023-08-29 20:16:21,612 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2023-08-29 20:16:21,612 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-08-29 20:16:21,613 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 522 transitions.
[2023-08-29 20:16:21,614 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.43140495867768597
[2023-08-29 20:16:21,614 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 522 transitions.
[2023-08-29 20:16:21,614 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 522 transitions.
[2023-08-29 20:16:21,614 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-29 20:16:21,614 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 522 transitions.
[2023-08-29 20:16:21,615 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 6 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:21,617 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:21,618 INFO  L81            ComplementDD]: Finished complementDD. Result  has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:21,618 INFO  L175             Difference]: Start difference. First operand has 39 places, 30 transitions, 143 flow. Second operand 5 states and 522 transitions.
[2023-08-29 20:16:21,618 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 45 transitions, 261 flow
[2023-08-29 20:16:21,622 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 247 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-08-29 20:16:21,623 INFO  L231             Difference]: Finished difference. Result has 42 places, 31 transitions, 154 flow
[2023-08-29 20:16:21,623 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=154, PETRI_PLACES=42, PETRI_TRANSITIONS=31}
[2023-08-29 20:16:21,624 INFO  L281   CegarLoopForPetriNet]: 40 programPoint places, 2 predicate places.
[2023-08-29 20:16:21,624 INFO  L495      AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 154 flow
[2023-08-29 20:16:21,624 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 99.2) internal successors, (496), 5 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:21,624 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-29 20:16:21,624 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-29 20:16:21,625 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-08-29 20:16:21,625 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-29 20:16:21,625 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-29 20:16:21,625 INFO  L85        PathProgramCache]: Analyzing trace with hash -1404019159, now seen corresponding path program 1 times
[2023-08-29 20:16:21,625 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-29 20:16:21,625 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484498311]
[2023-08-29 20:16:21,626 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-29 20:16:21,626 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-29 20:16:21,657 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-29 20:16:21,864 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-29 20:16:21,864 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-29 20:16:21,864 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484498311]
[2023-08-29 20:16:21,864 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484498311] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-29 20:16:21,865 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-29 20:16:21,865 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-08-29 20:16:21,865 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648294362]
[2023-08-29 20:16:21,865 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-29 20:16:21,866 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-08-29 20:16:21,866 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-29 20:16:21,866 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-08-29 20:16:21,867 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-08-29 20:16:21,875 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 106 out of 242
[2023-08-29 20:16:21,876 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 154 flow. Second operand  has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:21,876 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-29 20:16:21,876 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 242
[2023-08-29 20:16:21,877 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-29 20:16:22,074 INFO  L130       PetriNetUnfolder]: 593/1032 cut-off events.
[2023-08-29 20:16:22,074 INFO  L131       PetriNetUnfolder]: For 565/595 co-relation queries the response was YES.
[2023-08-29 20:16:22,077 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2650 conditions, 1032 events. 593/1032 cut-off events. For 565/595 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5095 event pairs, 113 based on Foata normal form. 96/1093 useless extension candidates. Maximal degree in co-relation 2640. Up to 612 conditions per place. 
[2023-08-29 20:16:22,082 INFO  L137   encePairwiseOnDemand]: 236/242 looper letters, 48 selfloop transitions, 8 changer transitions 0/65 dead transitions.
[2023-08-29 20:16:22,082 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 65 transitions, 366 flow
[2023-08-29 20:16:22,083 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2023-08-29 20:16:22,083 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-08-29 20:16:22,084 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 583 transitions.
[2023-08-29 20:16:22,085 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4818181818181818
[2023-08-29 20:16:22,085 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 583 transitions.
[2023-08-29 20:16:22,085 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 583 transitions.
[2023-08-29 20:16:22,085 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-29 20:16:22,085 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 583 transitions.
[2023-08-29 20:16:22,087 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 6 states, 5 states have (on average 116.6) internal successors, (583), 5 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:22,088 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:22,089 INFO  L81            ComplementDD]: Finished complementDD. Result  has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:22,089 INFO  L175             Difference]: Start difference. First operand has 42 places, 31 transitions, 154 flow. Second operand 5 states and 583 transitions.
[2023-08-29 20:16:22,089 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 65 transitions, 366 flow
[2023-08-29 20:16:22,092 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 65 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-08-29 20:16:22,094 INFO  L231             Difference]: Finished difference. Result has 47 places, 38 transitions, 207 flow
[2023-08-29 20:16:22,094 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=207, PETRI_PLACES=47, PETRI_TRANSITIONS=38}
[2023-08-29 20:16:22,094 INFO  L281   CegarLoopForPetriNet]: 40 programPoint places, 7 predicate places.
[2023-08-29 20:16:22,095 INFO  L495      AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 207 flow
[2023-08-29 20:16:22,095 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:22,095 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-29 20:16:22,095 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-29 20:16:22,096 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-08-29 20:16:22,096 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-29 20:16:22,096 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-29 20:16:22,096 INFO  L85        PathProgramCache]: Analyzing trace with hash 1159627237, now seen corresponding path program 1 times
[2023-08-29 20:16:22,097 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-29 20:16:22,097 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409408109]
[2023-08-29 20:16:22,097 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-29 20:16:22,097 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-29 20:16:22,124 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-29 20:16:22,348 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-29 20:16:22,348 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-29 20:16:22,348 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409408109]
[2023-08-29 20:16:22,349 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409408109] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-29 20:16:22,349 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-29 20:16:22,349 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-08-29 20:16:22,349 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711407070]
[2023-08-29 20:16:22,349 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-29 20:16:22,350 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-08-29 20:16:22,350 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-29 20:16:22,351 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-08-29 20:16:22,351 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2023-08-29 20:16:22,363 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 101 out of 242
[2023-08-29 20:16:22,364 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 207 flow. Second operand  has 5 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:22,364 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-29 20:16:22,365 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 242
[2023-08-29 20:16:22,365 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-29 20:16:22,695 INFO  L130       PetriNetUnfolder]: 1076/1793 cut-off events.
[2023-08-29 20:16:22,696 INFO  L131       PetriNetUnfolder]: For 2120/2120 co-relation queries the response was YES.
[2023-08-29 20:16:22,700 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6235 conditions, 1793 events. 1076/1793 cut-off events. For 2120/2120 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 8848 event pairs, 269 based on Foata normal form. 18/1811 useless extension candidates. Maximal degree in co-relation 6222. Up to 942 conditions per place. 
[2023-08-29 20:16:22,708 INFO  L137   encePairwiseOnDemand]: 233/242 looper letters, 72 selfloop transitions, 14 changer transitions 13/99 dead transitions.
[2023-08-29 20:16:22,708 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 99 transitions, 702 flow
[2023-08-29 20:16:22,709 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-08-29 20:16:22,709 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-08-29 20:16:22,710 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 679 transitions.
[2023-08-29 20:16:22,711 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46763085399449034
[2023-08-29 20:16:22,711 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 679 transitions.
[2023-08-29 20:16:22,711 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 679 transitions.
[2023-08-29 20:16:22,712 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-29 20:16:22,712 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 679 transitions.
[2023-08-29 20:16:22,713 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 113.16666666666667) internal successors, (679), 6 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:22,715 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:22,716 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:22,716 INFO  L175             Difference]: Start difference. First operand has 47 places, 38 transitions, 207 flow. Second operand 6 states and 679 transitions.
[2023-08-29 20:16:22,716 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 99 transitions, 702 flow
[2023-08-29 20:16:22,723 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 99 transitions, 693 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-08-29 20:16:22,725 INFO  L231             Difference]: Finished difference. Result has 54 places, 41 transitions, 277 flow
[2023-08-29 20:16:22,726 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=277, PETRI_PLACES=54, PETRI_TRANSITIONS=41}
[2023-08-29 20:16:22,727 INFO  L281   CegarLoopForPetriNet]: 40 programPoint places, 14 predicate places.
[2023-08-29 20:16:22,727 INFO  L495      AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 277 flow
[2023-08-29 20:16:22,728 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:22,728 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-29 20:16:22,728 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-29 20:16:22,728 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-08-29 20:16:22,728 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-29 20:16:22,729 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-29 20:16:22,729 INFO  L85        PathProgramCache]: Analyzing trace with hash -5384752, now seen corresponding path program 1 times
[2023-08-29 20:16:22,729 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-29 20:16:22,729 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110181449]
[2023-08-29 20:16:22,729 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-29 20:16:22,730 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-29 20:16:22,779 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-29 20:16:23,001 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-29 20:16:23,001 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-29 20:16:23,001 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110181449]
[2023-08-29 20:16:23,002 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110181449] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-29 20:16:23,002 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-29 20:16:23,002 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-08-29 20:16:23,002 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313003594]
[2023-08-29 20:16:23,002 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-29 20:16:23,003 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-08-29 20:16:23,003 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-29 20:16:23,003 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-08-29 20:16:23,004 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2023-08-29 20:16:23,023 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 106 out of 242
[2023-08-29 20:16:23,024 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 277 flow. Second operand  has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:23,024 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-29 20:16:23,024 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 242
[2023-08-29 20:16:23,024 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-29 20:16:23,229 INFO  L130       PetriNetUnfolder]: 393/769 cut-off events.
[2023-08-29 20:16:23,229 INFO  L131       PetriNetUnfolder]: For 946/964 co-relation queries the response was YES.
[2023-08-29 20:16:23,232 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2549 conditions, 769 events. 393/769 cut-off events. For 946/964 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3914 event pairs, 65 based on Foata normal form. 85/834 useless extension candidates. Maximal degree in co-relation 2533. Up to 285 conditions per place. 
[2023-08-29 20:16:23,235 INFO  L137   encePairwiseOnDemand]: 236/242 looper letters, 52 selfloop transitions, 11 changer transitions 7/82 dead transitions.
[2023-08-29 20:16:23,235 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 82 transitions, 587 flow
[2023-08-29 20:16:23,236 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-08-29 20:16:23,236 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-08-29 20:16:23,238 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 700 transitions.
[2023-08-29 20:16:23,238 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4820936639118457
[2023-08-29 20:16:23,238 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 700 transitions.
[2023-08-29 20:16:23,238 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 700 transitions.
[2023-08-29 20:16:23,239 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-29 20:16:23,239 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 700 transitions.
[2023-08-29 20:16:23,240 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 116.66666666666667) internal successors, (700), 6 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:23,242 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:23,243 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:23,243 INFO  L175             Difference]: Start difference. First operand has 54 places, 41 transitions, 277 flow. Second operand 6 states and 700 transitions.
[2023-08-29 20:16:23,243 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 82 transitions, 587 flow
[2023-08-29 20:16:23,248 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 82 transitions, 569 flow, removed 2 selfloop flow, removed 2 redundant places.
[2023-08-29 20:16:23,249 INFO  L231             Difference]: Finished difference. Result has 58 places, 48 transitions, 347 flow
[2023-08-29 20:16:23,250 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=347, PETRI_PLACES=58, PETRI_TRANSITIONS=48}
[2023-08-29 20:16:23,250 INFO  L281   CegarLoopForPetriNet]: 40 programPoint places, 18 predicate places.
[2023-08-29 20:16:23,250 INFO  L495      AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 347 flow
[2023-08-29 20:16:23,251 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:23,251 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-29 20:16:23,251 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-29 20:16:23,251 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-08-29 20:16:23,251 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-29 20:16:23,252 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-29 20:16:23,252 INFO  L85        PathProgramCache]: Analyzing trace with hash -1515777754, now seen corresponding path program 1 times
[2023-08-29 20:16:23,252 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-29 20:16:23,252 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321491334]
[2023-08-29 20:16:23,252 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-29 20:16:23,253 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-29 20:16:23,287 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-29 20:16:23,520 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-29 20:16:23,521 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-29 20:16:23,521 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321491334]
[2023-08-29 20:16:23,521 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321491334] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-29 20:16:23,521 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-29 20:16:23,521 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-08-29 20:16:23,521 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363080033]
[2023-08-29 20:16:23,521 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-29 20:16:23,522 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-08-29 20:16:23,522 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-29 20:16:23,522 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-08-29 20:16:23,523 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2023-08-29 20:16:23,534 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 106 out of 242
[2023-08-29 20:16:23,535 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 347 flow. Second operand  has 6 states, 6 states have (on average 108.66666666666667) internal successors, (652), 6 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:23,535 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-29 20:16:23,535 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 242
[2023-08-29 20:16:23,535 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-29 20:16:23,736 INFO  L130       PetriNetUnfolder]: 347/669 cut-off events.
[2023-08-29 20:16:23,736 INFO  L131       PetriNetUnfolder]: For 1074/1092 co-relation queries the response was YES.
[2023-08-29 20:16:23,739 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2521 conditions, 669 events. 347/669 cut-off events. For 1074/1092 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3320 event pairs, 57 based on Foata normal form. 24/676 useless extension candidates. Maximal degree in co-relation 2502. Up to 258 conditions per place. 
[2023-08-29 20:16:23,742 INFO  L137   encePairwiseOnDemand]: 236/242 looper letters, 47 selfloop transitions, 15 changer transitions 7/78 dead transitions.
[2023-08-29 20:16:23,742 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 78 transitions, 581 flow
[2023-08-29 20:16:23,743 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2023-08-29 20:16:23,743 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-08-29 20:16:23,745 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 913 transitions.
[2023-08-29 20:16:23,745 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4715909090909091
[2023-08-29 20:16:23,745 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 913 transitions.
[2023-08-29 20:16:23,745 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 913 transitions.
[2023-08-29 20:16:23,746 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-29 20:16:23,746 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 913 transitions.
[2023-08-29 20:16:23,748 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 114.125) internal successors, (913), 8 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:23,751 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 242.0) internal successors, (2178), 9 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:23,751 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 242.0) internal successors, (2178), 9 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:23,751 INFO  L175             Difference]: Start difference. First operand has 58 places, 48 transitions, 347 flow. Second operand 8 states and 913 transitions.
[2023-08-29 20:16:23,751 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 78 transitions, 581 flow
[2023-08-29 20:16:23,762 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 78 transitions, 507 flow, removed 19 selfloop flow, removed 6 redundant places.
[2023-08-29 20:16:23,764 INFO  L231             Difference]: Finished difference. Result has 62 places, 44 transitions, 287 flow
[2023-08-29 20:16:23,764 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=287, PETRI_PLACES=62, PETRI_TRANSITIONS=44}
[2023-08-29 20:16:23,764 INFO  L281   CegarLoopForPetriNet]: 40 programPoint places, 22 predicate places.
[2023-08-29 20:16:23,765 INFO  L495      AbstractCegarLoop]: Abstraction has has 62 places, 44 transitions, 287 flow
[2023-08-29 20:16:23,765 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 108.66666666666667) internal successors, (652), 6 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:23,765 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-29 20:16:23,765 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-29 20:16:23,766 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-08-29 20:16:23,766 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-29 20:16:23,766 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-29 20:16:23,766 INFO  L85        PathProgramCache]: Analyzing trace with hash 1815773015, now seen corresponding path program 1 times
[2023-08-29 20:16:23,766 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-29 20:16:23,767 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214874279]
[2023-08-29 20:16:23,767 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-29 20:16:23,767 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-29 20:16:23,800 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-29 20:16:24,058 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-29 20:16:24,058 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-29 20:16:24,058 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214874279]
[2023-08-29 20:16:24,058 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214874279] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-29 20:16:24,058 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-29 20:16:24,059 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-08-29 20:16:24,059 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490088793]
[2023-08-29 20:16:24,059 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-29 20:16:24,059 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-08-29 20:16:24,060 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-29 20:16:24,060 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-08-29 20:16:24,060 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-08-29 20:16:24,074 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 101 out of 242
[2023-08-29 20:16:24,075 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 44 transitions, 287 flow. Second operand  has 4 states, 4 states have (on average 106.25) internal successors, (425), 4 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:24,075 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-29 20:16:24,075 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 242
[2023-08-29 20:16:24,075 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-29 20:16:24,284 INFO  L130       PetriNetUnfolder]: 595/1079 cut-off events.
[2023-08-29 20:16:24,284 INFO  L131       PetriNetUnfolder]: For 2601/2601 co-relation queries the response was YES.
[2023-08-29 20:16:24,287 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4206 conditions, 1079 events. 595/1079 cut-off events. For 2601/2601 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5352 event pairs, 115 based on Foata normal form. 1/1080 useless extension candidates. Maximal degree in co-relation 4188. Up to 732 conditions per place. 
[2023-08-29 20:16:24,292 INFO  L137   encePairwiseOnDemand]: 233/242 looper letters, 67 selfloop transitions, 20 changer transitions 14/101 dead transitions.
[2023-08-29 20:16:24,292 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 101 transitions, 850 flow
[2023-08-29 20:16:24,293 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2023-08-29 20:16:24,293 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-08-29 20:16:24,294 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 566 transitions.
[2023-08-29 20:16:24,294 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4677685950413223
[2023-08-29 20:16:24,294 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 566 transitions.
[2023-08-29 20:16:24,295 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 566 transitions.
[2023-08-29 20:16:24,295 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-29 20:16:24,295 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 566 transitions.
[2023-08-29 20:16:24,296 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 6 states, 5 states have (on average 113.2) internal successors, (566), 5 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:24,298 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:24,298 INFO  L81            ComplementDD]: Finished complementDD. Result  has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:24,299 INFO  L175             Difference]: Start difference. First operand has 62 places, 44 transitions, 287 flow. Second operand 5 states and 566 transitions.
[2023-08-29 20:16:24,299 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 101 transitions, 850 flow
[2023-08-29 20:16:24,310 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 101 transitions, 727 flow, removed 30 selfloop flow, removed 8 redundant places.
[2023-08-29 20:16:24,312 INFO  L231             Difference]: Finished difference. Result has 59 places, 51 transitions, 352 flow
[2023-08-29 20:16:24,312 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=352, PETRI_PLACES=59, PETRI_TRANSITIONS=51}
[2023-08-29 20:16:24,312 INFO  L281   CegarLoopForPetriNet]: 40 programPoint places, 19 predicate places.
[2023-08-29 20:16:24,313 INFO  L495      AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 352 flow
[2023-08-29 20:16:24,313 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 106.25) internal successors, (425), 4 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:24,313 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-29 20:16:24,313 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-29 20:16:24,313 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-08-29 20:16:24,314 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-29 20:16:24,314 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-29 20:16:24,314 INFO  L85        PathProgramCache]: Analyzing trace with hash 1311954985, now seen corresponding path program 1 times
[2023-08-29 20:16:24,314 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-29 20:16:24,314 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119282184]
[2023-08-29 20:16:24,314 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-29 20:16:24,315 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-29 20:16:24,354 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-29 20:16:26,361 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-29 20:16:26,362 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-29 20:16:26,362 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119282184]
[2023-08-29 20:16:26,362 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119282184] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-29 20:16:26,362 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-29 20:16:26,362 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2023-08-29 20:16:26,363 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957578397]
[2023-08-29 20:16:26,363 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-29 20:16:26,363 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2023-08-29 20:16:26,364 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-29 20:16:26,364 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2023-08-29 20:16:26,364 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2023-08-29 20:16:26,631 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 91 out of 242
[2023-08-29 20:16:26,632 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 352 flow. Second operand  has 10 states, 10 states have (on average 92.8) internal successors, (928), 10 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:26,632 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-29 20:16:26,632 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 242
[2023-08-29 20:16:26,632 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-29 20:16:26,942 INFO  L130       PetriNetUnfolder]: 408/872 cut-off events.
[2023-08-29 20:16:26,942 INFO  L131       PetriNetUnfolder]: For 1424/1450 co-relation queries the response was YES.
[2023-08-29 20:16:26,944 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3144 conditions, 872 events. 408/872 cut-off events. For 1424/1450 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5069 event pairs, 69 based on Foata normal form. 15/872 useless extension candidates. Maximal degree in co-relation 3128. Up to 242 conditions per place. 
[2023-08-29 20:16:26,953 INFO  L137   encePairwiseOnDemand]: 234/242 looper letters, 60 selfloop transitions, 10 changer transitions 29/112 dead transitions.
[2023-08-29 20:16:26,954 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 112 transitions, 858 flow
[2023-08-29 20:16:26,954 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2023-08-29 20:16:26,954 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2023-08-29 20:16:26,956 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 881 transitions.
[2023-08-29 20:16:26,957 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.40449954086317724
[2023-08-29 20:16:26,957 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 881 transitions.
[2023-08-29 20:16:26,957 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 881 transitions.
[2023-08-29 20:16:26,958 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-29 20:16:26,958 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 881 transitions.
[2023-08-29 20:16:26,960 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 97.88888888888889) internal successors, (881), 9 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:26,963 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 242.0) internal successors, (2420), 10 states have internal predecessors, (2420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:26,964 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 242.0) internal successors, (2420), 10 states have internal predecessors, (2420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:26,964 INFO  L175             Difference]: Start difference. First operand has 59 places, 51 transitions, 352 flow. Second operand 9 states and 881 transitions.
[2023-08-29 20:16:26,964 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 112 transitions, 858 flow
[2023-08-29 20:16:26,969 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 112 transitions, 846 flow, removed 6 selfloop flow, removed 2 redundant places.
[2023-08-29 20:16:26,970 INFO  L231             Difference]: Finished difference. Result has 68 places, 51 transitions, 377 flow
[2023-08-29 20:16:26,970 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=377, PETRI_PLACES=68, PETRI_TRANSITIONS=51}
[2023-08-29 20:16:26,971 INFO  L281   CegarLoopForPetriNet]: 40 programPoint places, 28 predicate places.
[2023-08-29 20:16:26,971 INFO  L495      AbstractCegarLoop]: Abstraction has has 68 places, 51 transitions, 377 flow
[2023-08-29 20:16:26,972 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 92.8) internal successors, (928), 10 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:26,972 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-29 20:16:26,972 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-29 20:16:26,972 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2023-08-29 20:16:26,972 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-29 20:16:26,973 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-29 20:16:26,973 INFO  L85        PathProgramCache]: Analyzing trace with hash 89859977, now seen corresponding path program 2 times
[2023-08-29 20:16:26,973 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-29 20:16:26,973 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259083015]
[2023-08-29 20:16:26,973 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-29 20:16:26,973 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-29 20:16:27,011 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-29 20:16:27,419 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-29 20:16:27,419 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-29 20:16:27,420 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259083015]
[2023-08-29 20:16:27,420 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259083015] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-29 20:16:27,420 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-29 20:16:27,420 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-08-29 20:16:27,420 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301195381]
[2023-08-29 20:16:27,420 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-29 20:16:27,421 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-08-29 20:16:27,421 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-29 20:16:27,422 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-08-29 20:16:27,422 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2023-08-29 20:16:27,558 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 92 out of 242
[2023-08-29 20:16:27,559 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 51 transitions, 377 flow. Second operand  has 7 states, 7 states have (on average 94.71428571428571) internal successors, (663), 7 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:27,559 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-29 20:16:27,559 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 242
[2023-08-29 20:16:27,559 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-29 20:16:27,889 INFO  L130       PetriNetUnfolder]: 574/1209 cut-off events.
[2023-08-29 20:16:27,889 INFO  L131       PetriNetUnfolder]: For 3530/3584 co-relation queries the response was YES.
[2023-08-29 20:16:27,894 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5127 conditions, 1209 events. 574/1209 cut-off events. For 3530/3584 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 7472 event pairs, 164 based on Foata normal form. 21/1211 useless extension candidates. Maximal degree in co-relation 5106. Up to 430 conditions per place. 
[2023-08-29 20:16:27,896 INFO  L137   encePairwiseOnDemand]: 236/242 looper letters, 53 selfloop transitions, 6 changer transitions 44/108 dead transitions.
[2023-08-29 20:16:27,897 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 108 transitions, 914 flow
[2023-08-29 20:16:27,897 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-08-29 20:16:27,897 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-08-29 20:16:27,900 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 701 transitions.
[2023-08-29 20:16:27,900 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4138134592680047
[2023-08-29 20:16:27,900 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 701 transitions.
[2023-08-29 20:16:27,901 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 701 transitions.
[2023-08-29 20:16:27,901 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-29 20:16:27,901 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 701 transitions.
[2023-08-29 20:16:27,903 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 100.14285714285714) internal successors, (701), 7 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:27,905 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:27,905 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:27,905 INFO  L175             Difference]: Start difference. First operand has 68 places, 51 transitions, 377 flow. Second operand 7 states and 701 transitions.
[2023-08-29 20:16:27,906 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 108 transitions, 914 flow
[2023-08-29 20:16:27,917 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 108 transitions, 905 flow, removed 1 selfloop flow, removed 3 redundant places.
[2023-08-29 20:16:27,920 INFO  L231             Difference]: Finished difference. Result has 69 places, 39 transitions, 278 flow
[2023-08-29 20:16:27,921 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=278, PETRI_PLACES=69, PETRI_TRANSITIONS=39}
[2023-08-29 20:16:27,922 INFO  L281   CegarLoopForPetriNet]: 40 programPoint places, 29 predicate places.
[2023-08-29 20:16:27,922 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 39 transitions, 278 flow
[2023-08-29 20:16:27,922 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 94.71428571428571) internal successors, (663), 7 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:27,922 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-29 20:16:27,923 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-29 20:16:27,923 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-08-29 20:16:27,923 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-29 20:16:27,923 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-29 20:16:27,923 INFO  L85        PathProgramCache]: Analyzing trace with hash 900269141, now seen corresponding path program 2 times
[2023-08-29 20:16:27,923 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-29 20:16:27,924 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301908507]
[2023-08-29 20:16:27,924 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-29 20:16:27,924 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-29 20:16:27,972 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-29 20:16:28,132 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-29 20:16:28,132 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-29 20:16:28,133 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301908507]
[2023-08-29 20:16:28,133 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301908507] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-29 20:16:28,133 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-29 20:16:28,133 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-08-29 20:16:28,133 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886500647]
[2023-08-29 20:16:28,133 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-29 20:16:28,133 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-08-29 20:16:28,134 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-29 20:16:28,134 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-08-29 20:16:28,134 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-08-29 20:16:28,140 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 107 out of 242
[2023-08-29 20:16:28,140 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 39 transitions, 278 flow. Second operand  has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:28,140 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-29 20:16:28,140 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 242
[2023-08-29 20:16:28,140 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-29 20:16:28,257 INFO  L130       PetriNetUnfolder]: 216/487 cut-off events.
[2023-08-29 20:16:28,257 INFO  L131       PetriNetUnfolder]: For 1266/1282 co-relation queries the response was YES.
[2023-08-29 20:16:28,259 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2074 conditions, 487 events. 216/487 cut-off events. For 1266/1282 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2457 event pairs, 68 based on Foata normal form. 7/487 useless extension candidates. Maximal degree in co-relation 2053. Up to 223 conditions per place. 
[2023-08-29 20:16:28,260 INFO  L137   encePairwiseOnDemand]: 239/242 looper letters, 26 selfloop transitions, 1 changer transitions 36/65 dead transitions.
[2023-08-29 20:16:28,260 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 65 transitions, 557 flow
[2023-08-29 20:16:28,260 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-08-29 20:16:28,261 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-08-29 20:16:28,262 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 468 transitions.
[2023-08-29 20:16:28,262 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4834710743801653
[2023-08-29 20:16:28,262 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 468 transitions.
[2023-08-29 20:16:28,262 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 468 transitions.
[2023-08-29 20:16:28,262 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-29 20:16:28,262 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 468 transitions.
[2023-08-29 20:16:28,263 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:28,265 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:28,265 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:28,266 INFO  L175             Difference]: Start difference. First operand has 69 places, 39 transitions, 278 flow. Second operand 4 states and 468 transitions.
[2023-08-29 20:16:28,266 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 65 transitions, 557 flow
[2023-08-29 20:16:28,269 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 65 transitions, 515 flow, removed 1 selfloop flow, removed 9 redundant places.
[2023-08-29 20:16:28,270 INFO  L231             Difference]: Finished difference. Result has 61 places, 27 transitions, 159 flow
[2023-08-29 20:16:28,271 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=57, 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=4, PETRI_FLOW=159, PETRI_PLACES=61, PETRI_TRANSITIONS=27}
[2023-08-29 20:16:28,271 INFO  L281   CegarLoopForPetriNet]: 40 programPoint places, 21 predicate places.
[2023-08-29 20:16:28,271 INFO  L495      AbstractCegarLoop]: Abstraction has has 61 places, 27 transitions, 159 flow
[2023-08-29 20:16:28,272 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:28,272 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-29 20:16:28,272 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-29 20:16:28,272 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2023-08-29 20:16:28,272 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-29 20:16:28,273 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-29 20:16:28,273 INFO  L85        PathProgramCache]: Analyzing trace with hash 1102729653, now seen corresponding path program 3 times
[2023-08-29 20:16:28,273 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-29 20:16:28,273 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664803003]
[2023-08-29 20:16:28,273 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-29 20:16:28,273 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-29 20:16:28,307 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-29 20:16:29,272 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-29 20:16:29,272 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-29 20:16:29,272 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664803003]
[2023-08-29 20:16:29,272 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664803003] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-29 20:16:29,273 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-29 20:16:29,273 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-08-29 20:16:29,273 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194837814]
[2023-08-29 20:16:29,273 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-29 20:16:29,273 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-08-29 20:16:29,274 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-29 20:16:29,274 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-08-29 20:16:29,274 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2023-08-29 20:16:29,372 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 105 out of 242
[2023-08-29 20:16:29,373 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 27 transitions, 159 flow. Second operand  has 7 states, 7 states have (on average 107.57142857142857) internal successors, (753), 7 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:29,373 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-29 20:16:29,373 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 242
[2023-08-29 20:16:29,373 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-29 20:16:29,648 INFO  L130       PetriNetUnfolder]: 66/165 cut-off events.
[2023-08-29 20:16:29,648 INFO  L131       PetriNetUnfolder]: For 492/504 co-relation queries the response was YES.
[2023-08-29 20:16:29,649 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 685 conditions, 165 events. 66/165 cut-off events. For 492/504 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 636 event pairs, 14 based on Foata normal form. 1/163 useless extension candidates. Maximal degree in co-relation 666. Up to 68 conditions per place. 
[2023-08-29 20:16:29,649 INFO  L137   encePairwiseOnDemand]: 235/242 looper letters, 23 selfloop transitions, 5 changer transitions 15/46 dead transitions.
[2023-08-29 20:16:29,650 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 46 transitions, 358 flow
[2023-08-29 20:16:29,650 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2023-08-29 20:16:29,650 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-08-29 20:16:29,652 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 870 transitions.
[2023-08-29 20:16:29,652 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4493801652892562
[2023-08-29 20:16:29,652 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 870 transitions.
[2023-08-29 20:16:29,653 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 870 transitions.
[2023-08-29 20:16:29,653 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-29 20:16:29,653 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 870 transitions.
[2023-08-29 20:16:29,655 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 108.75) internal successors, (870), 8 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:29,658 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 242.0) internal successors, (2178), 9 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:29,659 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 242.0) internal successors, (2178), 9 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:29,659 INFO  L175             Difference]: Start difference. First operand has 61 places, 27 transitions, 159 flow. Second operand 8 states and 870 transitions.
[2023-08-29 20:16:29,659 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 46 transitions, 358 flow
[2023-08-29 20:16:29,660 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 46 transitions, 313 flow, removed 12 selfloop flow, removed 12 redundant places.
[2023-08-29 20:16:29,661 INFO  L231             Difference]: Finished difference. Result has 54 places, 27 transitions, 140 flow
[2023-08-29 20:16:29,662 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=140, PETRI_PLACES=54, PETRI_TRANSITIONS=27}
[2023-08-29 20:16:29,662 INFO  L281   CegarLoopForPetriNet]: 40 programPoint places, 14 predicate places.
[2023-08-29 20:16:29,662 INFO  L495      AbstractCegarLoop]: Abstraction has has 54 places, 27 transitions, 140 flow
[2023-08-29 20:16:29,663 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 107.57142857142857) internal successors, (753), 7 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:29,663 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-29 20:16:29,663 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-29 20:16:29,663 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2023-08-29 20:16:29,664 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-29 20:16:29,664 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-29 20:16:29,664 INFO  L85        PathProgramCache]: Analyzing trace with hash -1994688609, now seen corresponding path program 4 times
[2023-08-29 20:16:29,664 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-29 20:16:29,664 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33655178]
[2023-08-29 20:16:29,664 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-29 20:16:29,665 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-29 20:16:29,718 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-08-29 20:16:29,718 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-08-29 20:16:29,762 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-08-29 20:16:29,798 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-08-29 20:16:29,800 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-08-29 20:16:29,801 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining)
[2023-08-29 20:16:29,803 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining)
[2023-08-29 20:16:29,803 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining)
[2023-08-29 20:16:29,803 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining)
[2023-08-29 20:16:29,803 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining)
[2023-08-29 20:16:29,804 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining)
[2023-08-29 20:16:29,804 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining)
[2023-08-29 20:16:29,804 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining)
[2023-08-29 20:16:29,805 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining)
[2023-08-29 20:16:29,805 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining)
[2023-08-29 20:16:29,805 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining)
[2023-08-29 20:16:29,805 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining)
[2023-08-29 20:16:29,805 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining)
[2023-08-29 20:16:29,805 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2023-08-29 20:16:29,806 INFO  L445         BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-29 20:16:29,810 INFO  L228   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2023-08-29 20:16:29,810 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2023-08-29 20:16:29,884 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:16:29 BasicIcfg
[2023-08-29 20:16:29,888 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-08-29 20:16:29,889 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2023-08-29 20:16:29,889 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2023-08-29 20:16:29,889 INFO  L275        PluginConnector]: Witness Printer initialized
[2023-08-29 20:16:29,890 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:16:13" (3/4) ...
[2023-08-29 20:16:29,892 INFO  L140         WitnessPrinter]: No result that supports witness generation found
[2023-08-29 20:16:29,892 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2023-08-29 20:16:29,893 INFO  L158              Benchmark]: Toolchain (without parser) took 17771.16ms. Allocated memory was 88.1MB in the beginning and 323.0MB in the end (delta: 234.9MB). Free memory was 65.1MB in the beginning and 208.8MB in the end (delta: -143.8MB). Peak memory consumption was 90.5MB. Max. memory is 16.1GB.
[2023-08-29 20:16:29,893 INFO  L158              Benchmark]: CDTParser took 0.20ms. Allocated memory is still 67.1MB. Free memory was 45.7MB in the beginning and 45.7MB in the end (delta: 54.0kB). There was no memory consumed. Max. memory is 16.1GB.
[2023-08-29 20:16:29,893 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 590.71ms. Allocated memory is still 88.1MB. Free memory was 64.9MB in the beginning and 62.7MB in the end (delta: 2.2MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB.
[2023-08-29 20:16:29,894 INFO  L158              Benchmark]: Boogie Procedure Inliner took 51.87ms. Allocated memory is still 88.1MB. Free memory was 62.7MB in the beginning and 60.0MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2023-08-29 20:16:29,894 INFO  L158              Benchmark]: Boogie Preprocessor took 27.99ms. Allocated memory is still 88.1MB. Free memory was 60.0MB in the beginning and 57.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-08-29 20:16:29,894 INFO  L158              Benchmark]: RCFGBuilder took 776.36ms. Allocated memory is still 88.1MB. Free memory was 57.9MB in the beginning and 45.1MB in the end (delta: 12.8MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB.
[2023-08-29 20:16:29,894 INFO  L158              Benchmark]: TraceAbstraction took 16315.39ms. Allocated memory was 88.1MB in the beginning and 323.0MB in the end (delta: 234.9MB). Free memory was 44.7MB in the beginning and 208.8MB in the end (delta: -164.2MB). Peak memory consumption was 69.4MB. Max. memory is 16.1GB.
[2023-08-29 20:16:29,895 INFO  L158              Benchmark]: Witness Printer took 3.09ms. Allocated memory is still 323.0MB. Free memory is still 208.8MB. There was no memory consumed. Max. memory is 16.1GB.
[2023-08-29 20:16:29,896 INFO  L339   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.20ms. Allocated memory is still 67.1MB. Free memory was 45.7MB in the beginning and 45.7MB in the end (delta: 54.0kB). There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 590.71ms. Allocated memory is still 88.1MB. Free memory was 64.9MB in the beginning and 62.7MB in the end (delta: 2.2MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 51.87ms. Allocated memory is still 88.1MB. Free memory was 62.7MB in the beginning and 60.0MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 27.99ms. Allocated memory is still 88.1MB. Free memory was 60.0MB in the beginning and 57.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * RCFGBuilder took 776.36ms. Allocated memory is still 88.1MB. Free memory was 57.9MB in the beginning and 45.1MB in the end (delta: 12.8MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB.
 * TraceAbstraction took 16315.39ms. Allocated memory was 88.1MB in the beginning and 323.0MB in the end (delta: 234.9MB). Free memory was 44.7MB in the beginning and 208.8MB in the end (delta: -164.2MB). Peak memory consumption was 69.4MB. Max. memory is 16.1GB.
 * Witness Printer took 3.09ms. Allocated memory is still 323.0MB. Free memory is still 208.8MB. There was no memory consumed. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 4.2s, 128 PlacesBefore, 40 PlacesAfterwards, 120 TransitionsBefore, 30 TransitionsAfterwards, 2180 CoEnabledTransitionPairs, 7 FixpointIterations, 49 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 119 TotalNumberOfCompositions, 5501 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2389, independent: 2210, independent conditional: 0, independent unconditional: 2210, dependent: 179, dependent conditional: 0, dependent unconditional: 179, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1209, independent: 1170, independent conditional: 0, independent unconditional: 1170, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2389, independent: 1040, independent conditional: 0, independent unconditional: 1040, dependent: 140, dependent conditional: 0, dependent unconditional: 140, unknown: 1209, unknown conditional: 0, unknown unconditional: 1209] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 82, Positive conditional cache size: 0, Positive unconditional cache size: 82, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed
    Unable to prove that all allocated memory was freed
 Reason: overapproximation of memtrack at line 18. 
Possible FailurePath: 
[L709]               0  int __unbuffered_cnt = 0;
[L711]               0  int __unbuffered_p0_EAX = 0;
[L713]               0  int __unbuffered_p1_EAX = 0;
[L715]               0  int __unbuffered_p1_EBX = 0;
[L717]               0  int __unbuffered_p2_EAX = 0;
[L719]               0  int __unbuffered_p2_EBX = 0;
[L721]               0  int a = 0;
[L722]               0  _Bool main$tmp_guard0;
[L723]               0  _Bool main$tmp_guard1;
[L725]               0  int x = 0;
[L727]               0  int y = 0;
[L729]               0  int z = 0;
[L730]               0  _Bool z$flush_delayed;
[L731]               0  int z$mem_tmp;
[L732]               0  _Bool z$r_buff0_thd0;
[L733]               0  _Bool z$r_buff0_thd1;
[L734]               0  _Bool z$r_buff0_thd2;
[L735]               0  _Bool z$r_buff0_thd3;
[L736]               0  _Bool z$r_buff1_thd0;
[L737]               0  _Bool z$r_buff1_thd1;
[L738]               0  _Bool z$r_buff1_thd2;
[L739]               0  _Bool z$r_buff1_thd3;
[L740]               0  _Bool z$read_delayed;
[L741]               0  int *z$read_delayed_var;
[L742]               0  int z$w_buff0;
[L743]               0  _Bool z$w_buff0_used;
[L744]               0  int z$w_buff1;
[L745]               0  _Bool z$w_buff1_used;
[L746]               0  _Bool weak$$choice0;
[L747]               0  _Bool weak$$choice2;
[L853]               0  pthread_t t260;
[L854]  FCALL, FORK  0  pthread_create(&t260, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t260, ((void *)0), P0, ((void *)0))=-2, t260={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L855]               0  pthread_t t261;
[L856]  FCALL, FORK  0  pthread_create(&t261, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t261, ((void *)0), P1, ((void *)0))=-1, t260={5:0}, t261={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L857]               0  pthread_t t262;
[L858]  FCALL, FORK  0  pthread_create(&t262, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t262, ((void *)0), P2, ((void *)0))=0, t260={5:0}, t261={6:0}, t262={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L800]               3  z$w_buff1 = z$w_buff0
[L801]               3  z$w_buff0 = 1
[L802]               3  z$w_buff1_used = z$w_buff0_used
[L803]               3  z$w_buff0_used = (_Bool)1
[L804]  CALL         3  __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used))
[L18]   COND FALSE   3  !(!expression)
[L804]  RET          3  __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used))
[L805]               3  z$r_buff1_thd0 = z$r_buff0_thd0
[L806]               3  z$r_buff1_thd1 = z$r_buff0_thd1
[L807]               3  z$r_buff1_thd2 = z$r_buff0_thd2
[L808]               3  z$r_buff1_thd3 = z$r_buff0_thd3
[L809]               3  z$r_buff0_thd3 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L812]               3  weak$$choice0 = __VERIFIER_nondet_bool()
[L813]               3  weak$$choice2 = __VERIFIER_nondet_bool()
[L814]               3  z$flush_delayed = weak$$choice2
[L815]               3  z$mem_tmp = z
[L816]               3  z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)
[L817]               3  z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))
[L818]               3  z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))
[L819]               3  z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))
[L820]               3  z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L821]               3  z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))
[L822]               3  z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L823]               3  __unbuffered_p2_EAX = z
[L824]               3  z = z$flush_delayed ? z$mem_tmp : z
[L825]               3  z$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L828]               3  __unbuffered_p2_EBX = a
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L751]               1  a = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L754]               1  __unbuffered_p0_EAX = x
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L766]               2  x = 1
[L769]               2  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L772]               2  __unbuffered_p1_EAX = y
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L775]               2  weak$$choice0 = __VERIFIER_nondet_bool()
[L776]               2  weak$$choice2 = __VERIFIER_nondet_bool()
[L777]               2  z$flush_delayed = weak$$choice2
[L778]               2  z$mem_tmp = z
[L779]               2  z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)
[L780]               2  z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))
[L781]               2  z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))
[L782]               2  z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))
[L783]               2  z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L784]               2  z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))
[L785]               2  z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L786]               2  __unbuffered_p1_EBX = z
[L787]               2  z = z$flush_delayed ? z$mem_tmp : z
[L788]               2  z$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L831]               3  z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L832]               3  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L833]               3  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L834]               3  z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L835]               3  z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L838]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L840]               3  return 0;
[L759]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L761]               1  return 0;
[L793]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L795]               2  return 0;
[L860]               0  main$tmp_guard0 = __unbuffered_cnt == 3
[L862]  CALL         0  assume_abort_if_not(main$tmp_guard0)
[L3]    COND FALSE   0  !(!cond)
[L862]  RET          0  assume_abort_if_not(main$tmp_guard0)
[L864]               0  z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L865]               0  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L866]               0  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L867]               0  z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L868]               0  z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t260={5:0}, t261={6:0}, t262={3:0}, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L871]               0  main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0)
[L873]  CALL         0  __VERIFIER_assert(main$tmp_guard1)
[L18]   COND TRUE    0  !expression
[L18]                0  reach_error()
        VAL             [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]

  - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed
    Unable to prove that all allocated memory was freed
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: 851]: Unable to prove that all allocated memory was freed
    Unable to prove that all allocated memory was freed
 Reason: Not analyzed. 
  - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 7 procedures, 151 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 16.1s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 931 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 677 mSDsluCounter, 332 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 248 mSDsCounter, 110 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2666 IncrementalHoareTripleChecker+Invalid, 2776 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 110 mSolverCounterUnsat, 84 mSDtfsCounter, 2666 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=377occurred in iteration=12, InterpolantAutomatonStates: 80, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 236 NumberOfCodeBlocks, 236 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 200 ConstructedInterpolants, 0 QuantifiedInterpolants, 2824 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
[2023-08-29 20:16:29,926 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Using bit-precise analysis
Retrying with bit-precise analysis

### Bit-precise run ###
Calling Ultimate with: /usr/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 ../../../trunk/examples/svcomp/pthread-wmm/mix010.opt.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.graphml --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 371e0ad4620d67bc913500e97f289ec14c56f7c02bd7df3fa28779e14d33459a --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER
--- Real Ultimate output ---
This is Ultimate 0.2.3-?-b8dbc81
[2023-08-29 20:16:31,807 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-08-29 20:16:31,809 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-08-29 20:16:31,834 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-08-29 20:16:31,834 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-08-29 20:16:31,835 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-08-29 20:16:31,837 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-08-29 20:16:31,838 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-08-29 20:16:31,839 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-08-29 20:16:31,840 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-08-29 20:16:31,841 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-08-29 20:16:31,842 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-08-29 20:16:31,842 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-08-29 20:16:31,843 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-08-29 20:16:31,844 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-08-29 20:16:31,845 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-08-29 20:16:31,846 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-08-29 20:16:31,846 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-08-29 20:16:31,848 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-08-29 20:16:31,849 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-08-29 20:16:31,850 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-08-29 20:16:31,851 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-08-29 20:16:31,852 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-08-29 20:16:31,853 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-08-29 20:16:31,856 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-08-29 20:16:31,856 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-08-29 20:16:31,857 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-08-29 20:16:31,857 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-08-29 20:16:31,858 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-08-29 20:16:31,858 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-08-29 20:16:31,859 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-08-29 20:16:31,859 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-08-29 20:16:31,860 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-08-29 20:16:31,861 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-08-29 20:16:31,862 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-08-29 20:16:31,862 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-08-29 20:16:31,862 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-08-29 20:16:31,863 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-08-29 20:16:31,863 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-08-29 20:16:31,864 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-08-29 20:16:31,864 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-08-29 20:16:31,870 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf
[2023-08-29 20:16:31,891 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-08-29 20:16:31,891 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-08-29 20:16:31,891 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-08-29 20:16:31,891 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-08-29 20:16:31,892 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-08-29 20:16:31,893 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-08-29 20:16:31,894 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-08-29 20:16:31,894 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-08-29 20:16:31,894 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-08-29 20:16:31,894 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-08-29 20:16:31,895 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-08-29 20:16:31,895 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-08-29 20:16:31,895 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-08-29 20:16:31,896 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-08-29 20:16:31,896 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-08-29 20:16:31,896 INFO  L138        SettingsManager]:  * Check for the main procedure if all allocated memory was freed=true
[2023-08-29 20:16:31,896 INFO  L138        SettingsManager]:  * Bitprecise bitfields=true
[2023-08-29 20:16:31,896 INFO  L138        SettingsManager]:  * SV-COMP memtrack compatibility mode=true
[2023-08-29 20:16:31,896 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-08-29 20:16:31,896 INFO  L138        SettingsManager]:  * Adapt memory model on pointer casts if necessary=true
[2023-08-29 20:16:31,897 INFO  L138        SettingsManager]:  * Use bitvectors instead of ints=true
[2023-08-29 20:16:31,897 INFO  L138        SettingsManager]:  * Memory model=HoenickeLindenmann_4ByteResolution
[2023-08-29 20:16:31,897 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-08-29 20:16:31,897 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-08-29 20:16:31,897 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-08-29 20:16:31,897 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-08-29 20:16:31,898 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-08-29 20:16:31,898 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-08-29 20:16:31,898 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-08-29 20:16:31,898 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-08-29 20:16:31,898 INFO  L138        SettingsManager]:  * Trace refinement strategy=WOLF
[2023-08-29 20:16:31,898 INFO  L138        SettingsManager]:  * Command for external solver=cvc4 --incremental --print-success --lang smt
[2023-08-29 20:16:31,899 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-08-29 20:16:31,899 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-08-29 20:16:31,899 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-08-29 20:16:31,899 INFO  L138        SettingsManager]:  * Logic for external solver=AUFBV
[2023-08-29 20:16:31,899 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-08-29 20:16:31,899 INFO  L138        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.graphml
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 -> 371e0ad4620d67bc913500e97f289ec14c56f7c02bd7df3fa28779e14d33459a
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER
[2023-08-29 20:16:32,205 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-08-29 20:16:32,224 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-08-29 20:16:32,227 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-08-29 20:16:32,228 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-08-29 20:16:32,229 INFO  L275        PluginConnector]: CDTParser initialized
[2023-08-29 20:16:32,230 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix010.opt.i
[2023-08-29 20:16:33,277 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-08-29 20:16:33,552 INFO  L351              CDTParser]: Found 1 translation units.
[2023-08-29 20:16:33,555 INFO  L172              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix010.opt.i
[2023-08-29 20:16:33,571 INFO  L394              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7979bc8b1/759d0f12fe7e4b3b94b082a05978a18e/FLAGa408f721b
[2023-08-29 20:16:33,586 INFO  L402              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7979bc8b1/759d0f12fe7e4b3b94b082a05978a18e
[2023-08-29 20:16:33,589 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-08-29 20:16:33,590 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-08-29 20:16:33,590 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-08-29 20:16:33,591 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-08-29 20:16:33,593 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-08-29 20:16:33,593 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:16:33" (1/1) ...
[2023-08-29 20:16:33,594 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34adbf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:33, skipping insertion in model container
[2023-08-29 20:16:33,594 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:16:33" (1/1) ...
[2023-08-29 20:16:33,600 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-08-29 20:16:33,653 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-08-29 20:16:33,775 WARN  L247   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix010.opt.i[944,957]
[2023-08-29 20:16:34,004 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-08-29 20:16:34,023 INFO  L203         MainTranslator]: Completed pre-run
[2023-08-29 20:16:34,033 WARN  L247   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix010.opt.i[944,957]
[2023-08-29 20:16:34,101 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-08-29 20:16:34,141 WARN  L667               CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler.
[2023-08-29 20:16:34,141 WARN  L667               CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler.
[2023-08-29 20:16:34,146 INFO  L208         MainTranslator]: Completed translation
[2023-08-29 20:16:34,147 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:34 WrapperNode
[2023-08-29 20:16:34,147 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-08-29 20:16:34,148 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-08-29 20:16:34,148 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-08-29 20:16:34,148 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-08-29 20:16:34,154 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:34" (1/1) ...
[2023-08-29 20:16:34,189 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:34" (1/1) ...
[2023-08-29 20:16:34,229 INFO  L138                Inliner]: procedures = 179, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 153
[2023-08-29 20:16:34,230 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-08-29 20:16:34,230 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-08-29 20:16:34,230 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-08-29 20:16:34,231 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-08-29 20:16:34,239 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:34" (1/1) ...
[2023-08-29 20:16:34,239 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:34" (1/1) ...
[2023-08-29 20:16:34,248 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:34" (1/1) ...
[2023-08-29 20:16:34,248 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:34" (1/1) ...
[2023-08-29 20:16:34,258 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:34" (1/1) ...
[2023-08-29 20:16:34,273 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:34" (1/1) ...
[2023-08-29 20:16:34,275 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:34" (1/1) ...
[2023-08-29 20:16:34,276 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:34" (1/1) ...
[2023-08-29 20:16:34,284 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-08-29 20:16:34,284 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-08-29 20:16:34,284 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-08-29 20:16:34,285 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-08-29 20:16:34,285 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:34" (1/1) ...
[2023-08-29 20:16:34,290 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-08-29 20:16:34,300 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-08-29 20:16:34,314 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-08-29 20:16:34,325 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-08-29 20:16:34,354 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2023-08-29 20:16:34,354 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-08-29 20:16:34,354 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-08-29 20:16:34,355 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-08-29 20:16:34,355 INFO  L130     BoogieDeclarations]: Found specification of procedure write~intINTTYPE4
[2023-08-29 20:16:34,355 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1
[2023-08-29 20:16:34,355 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2023-08-29 20:16:34,355 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2023-08-29 20:16:34,355 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2023-08-29 20:16:34,355 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2023-08-29 20:16:34,355 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2023-08-29 20:16:34,355 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2023-08-29 20:16:34,355 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2023-08-29 20:16:34,356 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-08-29 20:16:34,356 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-08-29 20:16:34,357 WARN  L210             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2023-08-29 20:16:34,569 INFO  L236             CfgBuilder]: Building ICFG
[2023-08-29 20:16:34,570 INFO  L262             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-08-29 20:16:34,872 INFO  L277             CfgBuilder]: Performing block encoding
[2023-08-29 20:16:35,034 INFO  L297             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-08-29 20:16:35,034 INFO  L302             CfgBuilder]: Removed 0 assume(true) statements.
[2023-08-29 20:16:35,037 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:16:35 BoogieIcfgContainer
[2023-08-29 20:16:35,037 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-08-29 20:16:35,039 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-08-29 20:16:35,039 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-08-29 20:16:35,042 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-08-29 20:16:35,042 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:16:33" (1/3) ...
[2023-08-29 20:16:35,043 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30b99e48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:16:35, skipping insertion in model container
[2023-08-29 20:16:35,043 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:16:34" (2/3) ...
[2023-08-29 20:16:35,043 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30b99e48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:16:35, skipping insertion in model container
[2023-08-29 20:16:35,043 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:16:35" (3/3) ...
[2023-08-29 20:16:35,044 INFO  L112   eAbstractionObserver]: Analyzing ICFG mix010.opt.i
[2023-08-29 20:16:35,061 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-08-29 20:16:35,062 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations.
[2023-08-29 20:16:35,062 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-08-29 20:16:35,131 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-08-29 20:16:35,170 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 263 flow
[2023-08-29 20:16:35,224 INFO  L130       PetriNetUnfolder]: 2/121 cut-off events.
[2023-08-29 20:16:35,225 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-08-29 20:16:35,231 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 131 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 82 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. 
[2023-08-29 20:16:35,231 INFO  L82        GeneralOperation]: Start removeDead. Operand has 132 places, 124 transitions, 263 flow
[2023-08-29 20:16:35,238 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 129 places, 121 transitions, 251 flow
[2023-08-29 20:16:35,241 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-08-29 20:16:35,255 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 121 transitions, 251 flow
[2023-08-29 20:16:35,259 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 121 transitions, 251 flow
[2023-08-29 20:16:35,260 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 129 places, 121 transitions, 251 flow
[2023-08-29 20:16:35,293 INFO  L130       PetriNetUnfolder]: 2/121 cut-off events.
[2023-08-29 20:16:35,297 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-08-29 20:16:35,298 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 131 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 82 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. 
[2023-08-29 20:16:35,300 INFO  L119        LiptonReduction]: Number of co-enabled transitions 2180
[2023-08-29 20:16:41,517 INFO  L134        LiptonReduction]: Checked pairs total: 5605
[2023-08-29 20:16:41,518 INFO  L136        LiptonReduction]: Total number of compositions: 121
[2023-08-29 20:16:41,530 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-08-29 20:16:41,535 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3b740c3c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-08-29 20:16:41,535 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 13 error locations.
[2023-08-29 20:16:41,537 INFO  L130       PetriNetUnfolder]: 0/0 cut-off events.
[2023-08-29 20:16:41,537 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-08-29 20:16:41,537 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-29 20:16:41,538 INFO  L208   CegarLoopForPetriNet]: trace histogram [1]
[2023-08-29 20:16:41,538 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-29 20:16:41,542 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-29 20:16:41,542 INFO  L85        PathProgramCache]: Analyzing trace with hash 556, now seen corresponding path program 1 times
[2023-08-29 20:16:41,552 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-08-29 20:16:41,552 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [732013563]
[2023-08-29 20:16:41,552 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-29 20:16:41,553 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-29 20:16:41,553 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-08-29 20:16:41,561 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)
[2023-08-29 20:16:41,563 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
[2023-08-29 20:16:41,632 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-29 20:16:41,634 INFO  L263         TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core
[2023-08-29 20:16:41,637 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-08-29 20:16:41,640 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-29 20:16:41,641 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-08-29 20:16:41,641 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-08-29 20:16:41,641 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [732013563]
[2023-08-29 20:16:41,642 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [732013563] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-29 20:16:41,642 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-29 20:16:41,642 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-08-29 20:16:41,643 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768828174]
[2023-08-29 20:16:41,644 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-29 20:16:41,650 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-08-29 20:16:41,654 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-08-29 20:16:41,671 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-08-29 20:16:41,672 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-08-29 20:16:41,674 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 112 out of 245
[2023-08-29 20:16:41,676 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 73 flow. Second operand  has 2 states, 2 states have (on average 112.5) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:41,677 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-29 20:16:41,677 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 245
[2023-08-29 20:16:41,678 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-29 20:16:42,054 INFO  L130       PetriNetUnfolder]: 1101/1661 cut-off events.
[2023-08-29 20:16:42,055 INFO  L131       PetriNetUnfolder]: For 9/9 co-relation queries the response was YES.
[2023-08-29 20:16:42,060 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3334 conditions, 1661 events. 1101/1661 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 7914 event pairs, 1101 based on Foata normal form. 0/1414 useless extension candidates. Maximal degree in co-relation 3323. Up to 1637 conditions per place. 
[2023-08-29 20:16:42,069 INFO  L137   encePairwiseOnDemand]: 238/245 looper letters, 22 selfloop transitions, 0 changer transitions 0/25 dead transitions.
[2023-08-29 20:16:42,070 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 103 flow
[2023-08-29 20:16:42,071 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-08-29 20:16:42,073 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-08-29 20:16:42,082 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 253 transitions.
[2023-08-29 20:16:42,086 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5163265306122449
[2023-08-29 20:16:42,086 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 253 transitions.
[2023-08-29 20:16:42,086 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 253 transitions.
[2023-08-29 20:16:42,087 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-29 20:16:42,089 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 253 transitions.
[2023-08-29 20:16:42,094 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:42,099 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:42,099 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:42,101 INFO  L175             Difference]: Start difference. First operand has 41 places, 32 transitions, 73 flow. Second operand 2 states and 253 transitions.
[2023-08-29 20:16:42,102 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 103 flow
[2023-08-29 20:16:42,104 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 100 flow, removed 0 selfloop flow, removed 3 redundant places.
[2023-08-29 20:16:42,107 INFO  L231             Difference]: Finished difference. Result has 33 places, 25 transitions, 56 flow
[2023-08-29 20:16:42,109 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=25}
[2023-08-29 20:16:42,113 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, -8 predicate places.
[2023-08-29 20:16:42,114 INFO  L495      AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 56 flow
[2023-08-29 20:16:42,114 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 112.5) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:42,114 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-29 20:16:42,114 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-08-29 20:16:42,132 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 (2)] Forceful destruction successful, exit code 0
[2023-08-29 20:16:42,326 WARN  L477      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
[2023-08-29 20:16:42,326 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-29 20:16:42,327 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-29 20:16:42,328 INFO  L85        PathProgramCache]: Analyzing trace with hash 1982081096, now seen corresponding path program 1 times
[2023-08-29 20:16:42,328 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-08-29 20:16:42,329 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [249905514]
[2023-08-29 20:16:42,329 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-29 20:16:42,329 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-29 20:16:42,330 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-08-29 20:16:42,331 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)
[2023-08-29 20:16:42,342 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
[2023-08-29 20:16:42,429 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-29 20:16:42,433 INFO  L263         TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjunts are in the unsatisfiable core
[2023-08-29 20:16:42,434 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-08-29 20:16:42,463 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-29 20:16:42,463 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-08-29 20:16:42,464 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-08-29 20:16:42,464 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [249905514]
[2023-08-29 20:16:42,464 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [249905514] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-29 20:16:42,464 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-29 20:16:42,464 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-08-29 20:16:42,464 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454373074]
[2023-08-29 20:16:42,465 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-29 20:16:42,465 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-08-29 20:16:42,466 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-08-29 20:16:42,466 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-08-29 20:16:42,466 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-08-29 20:16:42,469 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 111 out of 245
[2023-08-29 20:16:42,470 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 56 flow. Second operand  has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:42,470 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-29 20:16:42,470 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 245
[2023-08-29 20:16:42,470 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-29 20:16:42,690 INFO  L130       PetriNetUnfolder]: 910/1452 cut-off events.
[2023-08-29 20:16:42,690 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-08-29 20:16:42,692 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2848 conditions, 1452 events. 910/1452 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 7468 event pairs, 146 based on Foata normal form. 0/1328 useless extension candidates. Maximal degree in co-relation 2845. Up to 1101 conditions per place. 
[2023-08-29 20:16:42,696 INFO  L137   encePairwiseOnDemand]: 242/245 looper letters, 28 selfloop transitions, 2 changer transitions 2/35 dead transitions.
[2023-08-29 20:16:42,696 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 140 flow
[2023-08-29 20:16:42,697 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-08-29 20:16:42,697 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-08-29 20:16:42,699 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions.
[2023-08-29 20:16:42,699 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49795918367346936
[2023-08-29 20:16:42,699 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 366 transitions.
[2023-08-29 20:16:42,699 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 366 transitions.
[2023-08-29 20:16:42,699 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-29 20:16:42,699 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 366 transitions.
[2023-08-29 20:16:42,701 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:42,702 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:42,703 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:42,703 INFO  L175             Difference]: Start difference. First operand has 33 places, 25 transitions, 56 flow. Second operand 3 states and 366 transitions.
[2023-08-29 20:16:42,703 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 140 flow
[2023-08-29 20:16:42,703 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 35 transitions, 140 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-08-29 20:16:42,704 INFO  L231             Difference]: Finished difference. Result has 34 places, 23 transitions, 56 flow
[2023-08-29 20:16:42,704 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=34, PETRI_TRANSITIONS=23}
[2023-08-29 20:16:42,705 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places.
[2023-08-29 20:16:42,705 INFO  L495      AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 56 flow
[2023-08-29 20:16:42,705 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:42,705 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-29 20:16:42,706 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-29 20:16:42,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 (3)] Forceful destruction successful, exit code 0
[2023-08-29 20:16:42,914 WARN  L477      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
[2023-08-29 20:16:42,915 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-29 20:16:42,915 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-29 20:16:42,915 INFO  L85        PathProgramCache]: Analyzing trace with hash 2109494119, now seen corresponding path program 1 times
[2023-08-29 20:16:42,916 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-08-29 20:16:42,916 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1336667963]
[2023-08-29 20:16:42,916 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-29 20:16:42,916 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-29 20:16:42,917 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-08-29 20:16:42,922 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)
[2023-08-29 20:16:42,924 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
[2023-08-29 20:16:42,998 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-29 20:16:43,001 INFO  L263         TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjunts are in the unsatisfiable core
[2023-08-29 20:16:43,002 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-08-29 20:16:43,037 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-29 20:16:43,038 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-08-29 20:16:43,038 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-08-29 20:16:43,038 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1336667963]
[2023-08-29 20:16:43,038 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1336667963] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-29 20:16:43,038 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-29 20:16:43,038 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-08-29 20:16:43,038 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490392980]
[2023-08-29 20:16:43,039 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-29 20:16:43,039 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-08-29 20:16:43,039 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-08-29 20:16:43,039 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-08-29 20:16:43,040 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-08-29 20:16:43,070 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 107 out of 245
[2023-08-29 20:16:43,071 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 56 flow. Second operand  has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:43,071 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-29 20:16:43,071 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 245
[2023-08-29 20:16:43,071 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-29 20:16:43,294 INFO  L130       PetriNetUnfolder]: 514/856 cut-off events.
[2023-08-29 20:16:43,295 INFO  L131       PetriNetUnfolder]: For 48/48 co-relation queries the response was YES.
[2023-08-29 20:16:43,295 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1792 conditions, 856 events. 514/856 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3988 event pairs, 96 based on Foata normal form. 60/877 useless extension candidates. Maximal degree in co-relation 1788. Up to 609 conditions per place. 
[2023-08-29 20:16:43,298 INFO  L137   encePairwiseOnDemand]: 239/245 looper letters, 29 selfloop transitions, 4 changer transitions 19/55 dead transitions.
[2023-08-29 20:16:43,298 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 55 transitions, 234 flow
[2023-08-29 20:16:43,299 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2023-08-29 20:16:43,299 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-08-29 20:16:43,300 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions.
[2023-08-29 20:16:43,301 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48081632653061224
[2023-08-29 20:16:43,301 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 589 transitions.
[2023-08-29 20:16:43,301 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 589 transitions.
[2023-08-29 20:16:43,302 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-29 20:16:43,302 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 589 transitions.
[2023-08-29 20:16:43,303 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 6 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:43,305 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:43,306 INFO  L81            ComplementDD]: Finished complementDD. Result  has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:43,306 INFO  L175             Difference]: Start difference. First operand has 34 places, 23 transitions, 56 flow. Second operand 5 states and 589 transitions.
[2023-08-29 20:16:43,306 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 55 transitions, 234 flow
[2023-08-29 20:16:43,308 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 55 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-08-29 20:16:43,308 INFO  L231             Difference]: Finished difference. Result has 38 places, 26 transitions, 88 flow
[2023-08-29 20:16:43,309 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=88, PETRI_PLACES=38, PETRI_TRANSITIONS=26}
[2023-08-29 20:16:43,309 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places.
[2023-08-29 20:16:43,309 INFO  L495      AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 88 flow
[2023-08-29 20:16:43,310 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:43,310 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-29 20:16:43,310 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-29 20:16:43,322 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 (4)] Forceful destruction successful, exit code 0
[2023-08-29 20:16:43,519 WARN  L477      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
[2023-08-29 20:16:43,520 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-29 20:16:43,520 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-29 20:16:43,520 INFO  L85        PathProgramCache]: Analyzing trace with hash 1129331166, now seen corresponding path program 1 times
[2023-08-29 20:16:43,521 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-08-29 20:16:43,521 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [46345343]
[2023-08-29 20:16:43,521 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-29 20:16:43,521 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-29 20:16:43,522 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-08-29 20:16:43,523 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)
[2023-08-29 20:16:43,526 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
[2023-08-29 20:16:43,612 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-29 20:16:43,619 INFO  L263         TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 6 conjunts are in the unsatisfiable core
[2023-08-29 20:16:43,623 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-08-29 20:16:43,668 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-29 20:16:43,668 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-08-29 20:16:43,668 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-08-29 20:16:43,668 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [46345343]
[2023-08-29 20:16:43,668 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [46345343] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-29 20:16:43,668 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-29 20:16:43,669 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-08-29 20:16:43,669 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734266752]
[2023-08-29 20:16:43,669 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-29 20:16:43,670 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-08-29 20:16:43,670 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-08-29 20:16:43,671 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-08-29 20:16:43,671 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2023-08-29 20:16:43,696 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 107 out of 245
[2023-08-29 20:16:43,697 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 88 flow. Second operand  has 5 states, 5 states have (on average 109.2) internal successors, (546), 5 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:43,697 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-29 20:16:43,697 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 245
[2023-08-29 20:16:43,697 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-29 20:16:43,905 INFO  L130       PetriNetUnfolder]: 208/396 cut-off events.
[2023-08-29 20:16:43,906 INFO  L131       PetriNetUnfolder]: For 147/147 co-relation queries the response was YES.
[2023-08-29 20:16:43,906 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1075 conditions, 396 events. 208/396 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1616 event pairs, 44 based on Foata normal form. 36/419 useless extension candidates. Maximal degree in co-relation 1068. Up to 136 conditions per place. 
[2023-08-29 20:16:43,908 INFO  L137   encePairwiseOnDemand]: 239/245 looper letters, 37 selfloop transitions, 7 changer transitions 19/66 dead transitions.
[2023-08-29 20:16:43,908 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 66 transitions, 338 flow
[2023-08-29 20:16:43,908 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-08-29 20:16:43,909 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-08-29 20:16:43,910 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 707 transitions.
[2023-08-29 20:16:43,910 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48095238095238096
[2023-08-29 20:16:43,911 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 707 transitions.
[2023-08-29 20:16:43,911 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 707 transitions.
[2023-08-29 20:16:43,911 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-29 20:16:43,911 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 707 transitions.
[2023-08-29 20:16:43,913 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 117.83333333333333) internal successors, (707), 6 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:43,915 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:43,916 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:43,916 INFO  L175             Difference]: Start difference. First operand has 38 places, 26 transitions, 88 flow. Second operand 6 states and 707 transitions.
[2023-08-29 20:16:43,916 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 66 transitions, 338 flow
[2023-08-29 20:16:43,918 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 66 transitions, 332 flow, removed 1 selfloop flow, removed 2 redundant places.
[2023-08-29 20:16:43,919 INFO  L231             Difference]: Finished difference. Result has 42 places, 29 transitions, 138 flow
[2023-08-29 20:16:43,919 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=138, PETRI_PLACES=42, PETRI_TRANSITIONS=29}
[2023-08-29 20:16:43,920 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places.
[2023-08-29 20:16:43,920 INFO  L495      AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 138 flow
[2023-08-29 20:16:43,921 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 109.2) internal successors, (546), 5 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:43,921 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-29 20:16:43,921 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-29 20:16:43,935 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 (5)] Forceful destruction successful, exit code 0
[2023-08-29 20:16:44,130 WARN  L477      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
[2023-08-29 20:16:44,131 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-29 20:16:44,131 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-29 20:16:44,131 INFO  L85        PathProgramCache]: Analyzing trace with hash -1754796633, now seen corresponding path program 1 times
[2023-08-29 20:16:44,132 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-08-29 20:16:44,132 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1201197893]
[2023-08-29 20:16:44,132 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-29 20:16:44,132 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-29 20:16:44,132 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-08-29 20:16:44,133 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)
[2023-08-29 20:16:44,136 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
[2023-08-29 20:16:44,218 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-29 20:16:44,222 INFO  L263         TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 7 conjunts are in the unsatisfiable core
[2023-08-29 20:16:44,223 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-08-29 20:16:44,263 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-29 20:16:44,264 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-08-29 20:16:44,264 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-08-29 20:16:44,264 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1201197893]
[2023-08-29 20:16:44,264 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1201197893] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-29 20:16:44,264 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-29 20:16:44,264 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-08-29 20:16:44,264 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661217965]
[2023-08-29 20:16:44,265 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-29 20:16:44,265 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-08-29 20:16:44,265 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-08-29 20:16:44,265 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-08-29 20:16:44,265 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2023-08-29 20:16:44,284 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 107 out of 245
[2023-08-29 20:16:44,285 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 138 flow. Second operand  has 6 states, 6 states have (on average 109.33333333333333) internal successors, (656), 6 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:44,285 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-29 20:16:44,285 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 245
[2023-08-29 20:16:44,285 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-29 20:16:44,502 INFO  L130       PetriNetUnfolder]: 120/237 cut-off events.
[2023-08-29 20:16:44,502 INFO  L131       PetriNetUnfolder]: For 263/263 co-relation queries the response was YES.
[2023-08-29 20:16:44,503 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 717 conditions, 237 events. 120/237 cut-off events. For 263/263 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 839 event pairs, 39 based on Foata normal form. 10/243 useless extension candidates. Maximal degree in co-relation 708. Up to 90 conditions per place. 
[2023-08-29 20:16:44,504 INFO  L137   encePairwiseOnDemand]: 239/245 looper letters, 34 selfloop transitions, 10 changer transitions 10/57 dead transitions.
[2023-08-29 20:16:44,504 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 57 transitions, 336 flow
[2023-08-29 20:16:44,505 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-08-29 20:16:44,506 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-08-29 20:16:44,507 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 805 transitions.
[2023-08-29 20:16:44,508 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46938775510204084
[2023-08-29 20:16:44,508 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 805 transitions.
[2023-08-29 20:16:44,508 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 805 transitions.
[2023-08-29 20:16:44,508 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-29 20:16:44,509 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 805 transitions.
[2023-08-29 20:16:44,510 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 115.0) internal successors, (805), 7 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:44,513 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:44,514 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:44,514 INFO  L175             Difference]: Start difference. First operand has 42 places, 29 transitions, 138 flow. Second operand 7 states and 805 transitions.
[2023-08-29 20:16:44,514 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 57 transitions, 336 flow
[2023-08-29 20:16:44,517 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 57 transitions, 300 flow, removed 14 selfloop flow, removed 4 redundant places.
[2023-08-29 20:16:44,518 INFO  L231             Difference]: Finished difference. Result has 45 places, 29 transitions, 140 flow
[2023-08-29 20:16:44,518 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=140, PETRI_PLACES=45, PETRI_TRANSITIONS=29}
[2023-08-29 20:16:44,519 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places.
[2023-08-29 20:16:44,519 INFO  L495      AbstractCegarLoop]: Abstraction has has 45 places, 29 transitions, 140 flow
[2023-08-29 20:16:44,520 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 109.33333333333333) internal successors, (656), 6 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:44,520 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-29 20:16:44,520 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-29 20:16:44,535 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
[2023-08-29 20:16:44,729 WARN  L477      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
[2023-08-29 20:16:44,730 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-29 20:16:44,730 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-29 20:16:44,730 INFO  L85        PathProgramCache]: Analyzing trace with hash -1141838380, now seen corresponding path program 1 times
[2023-08-29 20:16:44,730 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-08-29 20:16:44,731 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [880338277]
[2023-08-29 20:16:44,731 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-29 20:16:44,731 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-29 20:16:44,731 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-08-29 20:16:44,732 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)
[2023-08-29 20:16:44,734 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
[2023-08-29 20:16:44,837 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-29 20:16:44,841 INFO  L263         TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core
[2023-08-29 20:16:44,843 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-08-29 20:16:44,884 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-29 20:16:44,885 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-08-29 20:16:44,885 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-08-29 20:16:44,885 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [880338277]
[2023-08-29 20:16:44,885 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [880338277] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-29 20:16:44,886 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-29 20:16:44,886 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-08-29 20:16:44,886 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414324094]
[2023-08-29 20:16:44,886 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-29 20:16:44,887 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-08-29 20:16:44,887 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-08-29 20:16:44,887 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-08-29 20:16:44,887 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-08-29 20:16:44,896 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 108 out of 245
[2023-08-29 20:16:44,897 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 29 transitions, 140 flow. Second operand  has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:44,897 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-29 20:16:44,897 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 245
[2023-08-29 20:16:44,897 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-29 20:16:45,027 INFO  L130       PetriNetUnfolder]: 151/307 cut-off events.
[2023-08-29 20:16:45,028 INFO  L131       PetriNetUnfolder]: For 408/408 co-relation queries the response was YES.
[2023-08-29 20:16:45,028 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 914 conditions, 307 events. 151/307 cut-off events. For 408/408 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1254 event pairs, 28 based on Foata normal form. 0/305 useless extension candidates. Maximal degree in co-relation 904. Up to 173 conditions per place. 
[2023-08-29 20:16:45,030 INFO  L137   encePairwiseOnDemand]: 242/245 looper letters, 55 selfloop transitions, 2 changer transitions 0/59 dead transitions.
[2023-08-29 20:16:45,030 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 59 transitions, 412 flow
[2023-08-29 20:16:45,031 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-08-29 20:16:45,031 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-08-29 20:16:45,032 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 476 transitions.
[2023-08-29 20:16:45,032 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4857142857142857
[2023-08-29 20:16:45,033 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 476 transitions.
[2023-08-29 20:16:45,033 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 476 transitions.
[2023-08-29 20:16:45,033 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-29 20:16:45,033 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 476 transitions.
[2023-08-29 20:16:45,034 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:45,036 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 245.0) internal successors, (1225), 5 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:45,037 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 245.0) internal successors, (1225), 5 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:45,037 INFO  L175             Difference]: Start difference. First operand has 45 places, 29 transitions, 140 flow. Second operand 4 states and 476 transitions.
[2023-08-29 20:16:45,037 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 59 transitions, 412 flow
[2023-08-29 20:16:45,039 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 59 transitions, 332 flow, removed 24 selfloop flow, removed 6 redundant places.
[2023-08-29 20:16:45,040 INFO  L231             Difference]: Finished difference. Result has 42 places, 30 transitions, 115 flow
[2023-08-29 20:16:45,041 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=115, PETRI_PLACES=42, PETRI_TRANSITIONS=30}
[2023-08-29 20:16:45,041 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places.
[2023-08-29 20:16:45,041 INFO  L495      AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 115 flow
[2023-08-29 20:16:45,042 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:45,042 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-29 20:16:45,042 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-29 20:16:45,055 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 (7)] Forceful destruction successful, exit code 0
[2023-08-29 20:16:45,255 WARN  L477      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
[2023-08-29 20:16:45,255 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-29 20:16:45,256 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-29 20:16:45,256 INFO  L85        PathProgramCache]: Analyzing trace with hash 263523822, now seen corresponding path program 2 times
[2023-08-29 20:16:45,256 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-08-29 20:16:45,256 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1875860825]
[2023-08-29 20:16:45,256 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-08-29 20:16:45,257 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-29 20:16:45,257 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-08-29 20:16:45,258 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)
[2023-08-29 20:16:45,259 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
[2023-08-29 20:16:45,351 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2023-08-29 20:16:45,351 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-08-29 20:16:45,356 INFO  L263         TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core
[2023-08-29 20:16:45,357 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-08-29 20:16:45,394 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-29 20:16:45,394 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-08-29 20:16:45,394 INFO  L136   FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-08-29 20:16:45,394 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1875860825]
[2023-08-29 20:16:45,394 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleMathsat [1875860825] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-29 20:16:45,395 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-29 20:16:45,395 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-08-29 20:16:45,395 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681934940]
[2023-08-29 20:16:45,395 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-29 20:16:45,396 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-08-29 20:16:45,396 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-08-29 20:16:45,397 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-08-29 20:16:45,397 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-08-29 20:16:45,407 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 108 out of 245
[2023-08-29 20:16:45,408 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 115 flow. Second operand  has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:45,408 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-29 20:16:45,409 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 245
[2023-08-29 20:16:45,409 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-29 20:16:45,573 INFO  L130       PetriNetUnfolder]: 260/521 cut-off events.
[2023-08-29 20:16:45,573 INFO  L131       PetriNetUnfolder]: For 368/368 co-relation queries the response was YES.
[2023-08-29 20:16:45,574 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1459 conditions, 521 events. 260/521 cut-off events. For 368/368 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2419 event pairs, 47 based on Foata normal form. 1/520 useless extension candidates. Maximal degree in co-relation 1450. Up to 264 conditions per place. 
[2023-08-29 20:16:45,576 INFO  L137   encePairwiseOnDemand]: 242/245 looper letters, 55 selfloop transitions, 2 changer transitions 0/60 dead transitions.
[2023-08-29 20:16:45,576 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 60 transitions, 348 flow
[2023-08-29 20:16:45,577 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-08-29 20:16:45,577 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-08-29 20:16:45,578 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 476 transitions.
[2023-08-29 20:16:45,578 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4857142857142857
[2023-08-29 20:16:45,578 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 476 transitions.
[2023-08-29 20:16:45,578 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 476 transitions.
[2023-08-29 20:16:45,579 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-29 20:16:45,579 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 476 transitions.
[2023-08-29 20:16:45,580 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:45,582 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 245.0) internal successors, (1225), 5 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:45,582 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 245.0) internal successors, (1225), 5 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:45,582 INFO  L175             Difference]: Start difference. First operand has 42 places, 30 transitions, 115 flow. Second operand 4 states and 476 transitions.
[2023-08-29 20:16:45,582 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 60 transitions, 348 flow
[2023-08-29 20:16:45,585 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 60 transitions, 346 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-08-29 20:16:45,586 INFO  L231             Difference]: Finished difference. Result has 46 places, 31 transitions, 127 flow
[2023-08-29 20:16:45,586 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=127, PETRI_PLACES=46, PETRI_TRANSITIONS=31}
[2023-08-29 20:16:45,587 INFO  L281   CegarLoopForPetriNet]: 41 programPoint places, 5 predicate places.
[2023-08-29 20:16:45,587 INFO  L495      AbstractCegarLoop]: Abstraction has has 46 places, 31 transitions, 127 flow
[2023-08-29 20:16:45,587 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-29 20:16:45,587 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-08-29 20:16:45,588 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-29 20:16:45,599 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
[2023-08-29 20:16:45,798 WARN  L477      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
[2023-08-29 20:16:45,798 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-29 20:16:45,799 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-08-29 20:16:45,799 INFO  L85        PathProgramCache]: Analyzing trace with hash -1686310130, now seen corresponding path program 3 times
[2023-08-29 20:16:45,799 INFO  L118   FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-08-29 20:16:45,799 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [711479998]
[2023-08-29 20:16:45,799 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2023-08-29 20:16:45,799 INFO  L173          SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-29 20:16:45,800 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-08-29 20:16:45,800 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)
[2023-08-29 20:16:45,801 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
[2023-08-29 20:16:45,920 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2023-08-29 20:16:45,921 INFO  L229   tOrderPrioritization]: Conjunction of SSA is sat
[2023-08-29 20:16:45,921 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-08-29 20:16:45,992 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-08-29 20:16:46,050 INFO  L130   FreeRefinementEngine]: Strategy WOLF found a feasible trace
[2023-08-29 20:16:46,051 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-08-29 20:16:46,052 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining)
[2023-08-29 20:16:46,053 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining)
[2023-08-29 20:16:46,054 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining)
[2023-08-29 20:16:46,054 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining)
[2023-08-29 20:16:46,054 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining)
[2023-08-29 20:16:46,054 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining)
[2023-08-29 20:16:46,054 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining)
[2023-08-29 20:16:46,054 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining)
[2023-08-29 20:16:46,055 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining)
[2023-08-29 20:16:46,055 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining)
[2023-08-29 20:16:46,055 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining)
[2023-08-29 20:16:46,055 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining)
[2023-08-29 20:16:46,055 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining)
[2023-08-29 20:16:46,069 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
[2023-08-29 20:16:46,266 WARN  L477      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
[2023-08-29 20:16:46,267 INFO  L445         BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1]
[2023-08-29 20:16:46,271 INFO  L228   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2023-08-29 20:16:46,271 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2023-08-29 20:16:46,354 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:16:46 BasicIcfg
[2023-08-29 20:16:46,358 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-08-29 20:16:46,359 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2023-08-29 20:16:46,359 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2023-08-29 20:16:46,359 INFO  L275        PluginConnector]: Witness Printer initialized
[2023-08-29 20:16:46,359 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:16:35" (3/4) ...
[2023-08-29 20:16:46,362 INFO  L140         WitnessPrinter]: No result that supports witness generation found
[2023-08-29 20:16:46,362 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2023-08-29 20:16:46,362 INFO  L158              Benchmark]: Toolchain (without parser) took 12772.55ms. Allocated memory was 77.6MB in the beginning and 136.3MB in the end (delta: 58.7MB). Free memory was 52.9MB in the beginning and 72.7MB in the end (delta: -19.7MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB.
[2023-08-29 20:16:46,363 INFO  L158              Benchmark]: CDTParser took 0.16ms. Allocated memory is still 58.7MB. Free memory is still 36.2MB. There was no memory consumed. Max. memory is 16.1GB.
[2023-08-29 20:16:46,363 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 556.91ms. Allocated memory is still 77.6MB. Free memory was 52.7MB in the beginning and 48.5MB in the end (delta: 4.2MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB.
[2023-08-29 20:16:46,364 INFO  L158              Benchmark]: Boogie Procedure Inliner took 81.60ms. Allocated memory is still 77.6MB. Free memory was 48.5MB in the beginning and 46.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-08-29 20:16:46,364 INFO  L158              Benchmark]: Boogie Preprocessor took 53.43ms. Allocated memory is still 77.6MB. Free memory was 46.0MB in the beginning and 43.6MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2023-08-29 20:16:46,365 INFO  L158              Benchmark]: RCFGBuilder took 753.00ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 43.6MB in the beginning and 66.3MB in the end (delta: -22.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB.
[2023-08-29 20:16:46,366 INFO  L158              Benchmark]: TraceAbstraction took 11318.95ms. Allocated memory was 94.4MB in the beginning and 136.3MB in the end (delta: 41.9MB). Free memory was 65.7MB in the beginning and 73.7MB in the end (delta: -8.0MB). Peak memory consumption was 34.1MB. Max. memory is 16.1GB.
[2023-08-29 20:16:46,368 INFO  L158              Benchmark]: Witness Printer took 3.17ms. Allocated memory is still 136.3MB. Free memory was 73.7MB in the beginning and 72.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB.
[2023-08-29 20:16:46,371 INFO  L339   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 58.7MB. Free memory is still 36.2MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 556.91ms. Allocated memory is still 77.6MB. Free memory was 52.7MB in the beginning and 48.5MB in the end (delta: 4.2MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 81.60ms. Allocated memory is still 77.6MB. Free memory was 48.5MB in the beginning and 46.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 53.43ms. Allocated memory is still 77.6MB. Free memory was 46.0MB in the beginning and 43.6MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
 * RCFGBuilder took 753.00ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 43.6MB in the beginning and 66.3MB in the end (delta: -22.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB.
 * TraceAbstraction took 11318.95ms. Allocated memory was 94.4MB in the beginning and 136.3MB in the end (delta: 41.9MB). Free memory was 65.7MB in the beginning and 73.7MB in the end (delta: -8.0MB). Peak memory consumption was 34.1MB. Max. memory is 16.1GB.
 * Witness Printer took 3.17ms. Allocated memory is still 136.3MB. Free memory was 73.7MB in the beginning and 72.7MB 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:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 6.3s, 129 PlacesBefore, 41 PlacesAfterwards, 121 TransitionsBefore, 32 TransitionsAfterwards, 2180 CoEnabledTransitionPairs, 7 FixpointIterations, 54 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 121 TotalNumberOfCompositions, 5605 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2517, independent: 2336, independent conditional: 0, independent unconditional: 2336, dependent: 181, dependent conditional: 0, dependent unconditional: 181, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1200, independent: 1167, independent conditional: 0, independent unconditional: 1167, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2517, independent: 1169, independent conditional: 0, independent unconditional: 1169, dependent: 148, dependent conditional: 0, dependent unconditional: 148, unknown: 1200, unknown conditional: 0, unknown unconditional: 1200] , Statistics on independence cache: Total cache size (in pairs): 114, Positive cache size: 98, Positive conditional cache size: 0, Positive unconditional cache size: 98, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed
    Unable to prove that all allocated memory was freed
 Reason: overapproximation of memtrack at line 18. 
Possible FailurePath: 
[L709]               0  int __unbuffered_cnt = 0;
[L711]               0  int __unbuffered_p0_EAX = 0;
[L713]               0  int __unbuffered_p1_EAX = 0;
[L715]               0  int __unbuffered_p1_EBX = 0;
[L717]               0  int __unbuffered_p2_EAX = 0;
[L719]               0  int __unbuffered_p2_EBX = 0;
[L721]               0  int a = 0;
[L722]               0  _Bool main$tmp_guard0;
[L723]               0  _Bool main$tmp_guard1;
[L725]               0  int x = 0;
[L727]               0  int y = 0;
[L729]               0  int z = 0;
[L730]               0  _Bool z$flush_delayed;
[L731]               0  int z$mem_tmp;
[L732]               0  _Bool z$r_buff0_thd0;
[L733]               0  _Bool z$r_buff0_thd1;
[L734]               0  _Bool z$r_buff0_thd2;
[L735]               0  _Bool z$r_buff0_thd3;
[L736]               0  _Bool z$r_buff1_thd0;
[L737]               0  _Bool z$r_buff1_thd1;
[L738]               0  _Bool z$r_buff1_thd2;
[L739]               0  _Bool z$r_buff1_thd3;
[L740]               0  _Bool z$read_delayed;
[L741]               0  int *z$read_delayed_var;
[L742]               0  int z$w_buff0;
[L743]               0  _Bool z$w_buff0_used;
[L744]               0  int z$w_buff1;
[L745]               0  _Bool z$w_buff1_used;
[L746]               0  _Bool weak$$choice0;
[L747]               0  _Bool weak$$choice2;
[L853]               0  pthread_t t260;
[L854]  FCALL, FORK  0  pthread_create(&t260, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t260, ((void *)0), P0, ((void *)0))=0, t260={-6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L855]               0  pthread_t t261;
[L856]  FCALL, FORK  0  pthread_create(&t261, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t261, ((void *)0), P1, ((void *)0))=1, t260={-6:0}, t261={-10:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L857]               0  pthread_t t262;
[L858]  FCALL, FORK  0  pthread_create(&t262, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t262, ((void *)0), P2, ((void *)0))=2, t260={-6:0}, t261={-10:0}, t262={-2:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L800]               3  z$w_buff1 = z$w_buff0
[L801]               3  z$w_buff0 = 1
[L802]               3  z$w_buff1_used = z$w_buff0_used
[L803]               3  z$w_buff0_used = (_Bool)1
[L804]  CALL         3  __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used))
[L18]   COND FALSE   3  !(!expression)
[L804]  RET          3  __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used))
[L805]               3  z$r_buff1_thd0 = z$r_buff0_thd0
[L806]               3  z$r_buff1_thd1 = z$r_buff0_thd1
[L807]               3  z$r_buff1_thd2 = z$r_buff0_thd2
[L808]               3  z$r_buff1_thd3 = z$r_buff0_thd3
[L809]               3  z$r_buff0_thd3 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L812]               3  weak$$choice0 = __VERIFIER_nondet_bool()
[L813]               3  weak$$choice2 = __VERIFIER_nondet_bool()
[L814]               3  z$flush_delayed = weak$$choice2
[L815]               3  z$mem_tmp = z
[L816]               3  z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)
[L817]               3  z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))
[L818]               3  z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))
[L819]               3  z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))
[L820]               3  z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L821]               3  z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))
[L822]               3  z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L823]               3  __unbuffered_p2_EAX = z
[L824]               3  z = z$flush_delayed ? z$mem_tmp : z
[L825]               3  z$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L828]               3  __unbuffered_p2_EBX = a
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L751]               1  a = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L754]               1  __unbuffered_p0_EAX = x
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L759]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L761]               1  return 0;
[L766]               2  x = 1
[L769]               2  y = 1
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L772]               2  __unbuffered_p1_EAX = y
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L775]               2  weak$$choice0 = __VERIFIER_nondet_bool()
[L776]               2  weak$$choice2 = __VERIFIER_nondet_bool()
[L777]               2  z$flush_delayed = weak$$choice2
[L778]               2  z$mem_tmp = z
[L779]               2  z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)
[L780]               2  z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))
[L781]               2  z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))
[L782]               2  z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))
[L783]               2  z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L784]               2  z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))
[L785]               2  z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L786]               2  __unbuffered_p1_EBX = z
[L787]               2  z = z$flush_delayed ? z$mem_tmp : z
[L788]               2  z$flush_delayed = (_Bool)0
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L831]               3  z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L832]               3  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L833]               3  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L834]               3  z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L835]               3  z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L793]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L795]               2  return 0;
[L838]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L840]               3  return 0;
[L860]               0  main$tmp_guard0 = __unbuffered_cnt == 3
[L862]  CALL         0  assume_abort_if_not(main$tmp_guard0)
[L3]    COND FALSE   0  !(!cond)
[L862]  RET          0  assume_abort_if_not(main$tmp_guard0)
[L864]               0  z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L865]               0  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L866]               0  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L867]               0  z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L868]               0  z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
        VAL             [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t260={-6:0}, t261={-10:0}, t262={-2:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L871]               0  main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0)
[L873]  CALL         0  __VERIFIER_assert(main$tmp_guard1)
[L18]   COND TRUE    0  !expression
[L18]                0  reach_error()
        VAL             [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]

  - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed
    Unable to prove that all allocated memory was freed
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
    Unable to prove that pointer dereference always succeeds
 Reason: Not analyzed. 
  - UnprovableResult [Line: 851]: Unable to prove that all allocated memory was freed
    Unable to prove that all allocated memory was freed
 Reason: Not analyzed. 
  - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 7 procedures, 152 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.1s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 206 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 164 mSDsluCounter, 58 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 31 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 735 IncrementalHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 27 mSDtfsCounter, 735 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=140occurred in iteration=5, InterpolantAutomatonStates: 31, 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, 0.3s InterpolantComputationTime, 108 NumberOfCodeBlocks, 108 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 80 ConstructedInterpolants, 0 QuantifiedInterpolants, 220 SizeOfPredicates, 8 NumberOfNonLiveVariables, 801 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2023-08-29 20:16:46,395 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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