./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix001.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/mix001.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 21c0308f80ae5e3a4b410ebaece3730b9f788bd0cc89fb6ef65f8dd9f7120f36 --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:11:21,364 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2023-08-29 20:11:21,366 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2023-08-29 20:11:21,412 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-08-29 20:11:21,414 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-08-29 20:11:21,417 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-08-29 20:11:21,419 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-08-29 20:11:21,422 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2023-08-29 20:11:21,424 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-08-29 20:11:21,428 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-08-29 20:11:21,430 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2023-08-29 20:11:21,432 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-08-29 20:11:21,432 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-08-29 20:11:21,434 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-08-29 20:11:21,435 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-08-29 20:11:21,438 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-08-29 20:11:21,441 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-08-29 20:11:21,442 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-08-29 20:11:21,444 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-08-29 20:11:21,447 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2023-08-29 20:11:21,454 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-08-29 20:11:21,455 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-08-29 20:11:21,456 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2023-08-29 20:11:21,457 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-08-29 20:11:21,465 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-08-29 20:11:21,465 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-08-29 20:11:21,465 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-08-29 20:11:21,467 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-08-29 20:11:21,468 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-08-29 20:11:21,469 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-08-29 20:11:21,469 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-08-29 20:11:21,475 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-08-29 20:11:21,476 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-08-29 20:11:21,478 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2023-08-29 20:11:21,479 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-08-29 20:11:21,479 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2023-08-29 20:11:21,480 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-08-29 20:11:21,480 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-08-29 20:11:21,481 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2023-08-29 20:11:21,481 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2023-08-29 20:11:21,482 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2023-08-29 20:11:21,483 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:11:21,516 INFO L113 SettingsManager]: Loading preferences was successful
[2023-08-29 20:11:21,516 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2023-08-29 20:11:21,517 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-08-29 20:11:21,517 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-08-29 20:11:21,518 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-08-29 20:11:21,519 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-08-29 20:11:21,519 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-08-29 20:11:21,519 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2023-08-29 20:11:21,520 INFO L138 SettingsManager]: * Use SBE=true
[2023-08-29 20:11:21,520 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-08-29 20:11:21,521 INFO L138 SettingsManager]: * sizeof long=4
[2023-08-29 20:11:21,521 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2023-08-29 20:11:21,521 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2023-08-29 20:11:21,521 INFO L138 SettingsManager]: * sizeof POINTER=4
[2023-08-29 20:11:21,522 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2023-08-29 20:11:21,522 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2023-08-29 20:11:21,522 INFO L138 SettingsManager]: * Bitprecise bitfields=true
[2023-08-29 20:11:21,522 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2023-08-29 20:11:21,522 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-08-29 20:11:21,523 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2023-08-29 20:11:21,523 INFO L138 SettingsManager]: * sizeof long double=12
[2023-08-29 20:11:21,523 INFO L138 SettingsManager]: * Use constant arrays=true
[2023-08-29 20:11:21,523 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-08-29 20:11:21,524 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2023-08-29 20:11:21,524 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2023-08-29 20:11:21,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-08-29 20:11:21,524 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-08-29 20:11:21,525 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2023-08-29 20:11:21,525 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2023-08-29 20:11:21,525 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-08-29 20:11:21,525 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2023-08-29 20:11:21,525 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2023-08-29 20:11:21,526 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2023-08-29 20:11:21,526 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-08-29 20:11:21,526 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 -> 21c0308f80ae5e3a4b410ebaece3730b9f788bd0cc89fb6ef65f8dd9f7120f36
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:11:21,841 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2023-08-29 20:11:21,864 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-08-29 20:11:21,867 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-08-29 20:11:21,868 INFO L271 PluginConnector]: Initializing CDTParser...
[2023-08-29 20:11:21,868 INFO L275 PluginConnector]: CDTParser initialized
[2023-08-29 20:11:21,869 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix001.opt.i
[2023-08-29 20:11:23,085 INFO L500 CDTParser]: Created temporary CDT project at NULL
[2023-08-29 20:11:23,360 INFO L351 CDTParser]: Found 1 translation units.
[2023-08-29 20:11:23,364 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix001.opt.i
[2023-08-29 20:11:23,378 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa05546c5/0f9ab19e262442b5927f24e5639f2091/FLAG6ccc6426a
[2023-08-29 20:11:23,394 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa05546c5/0f9ab19e262442b5927f24e5639f2091
[2023-08-29 20:11:23,396 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-08-29 20:11:23,397 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements.
[2023-08-29 20:11:23,398 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-08-29 20:11:23,399 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-08-29 20:11:23,401 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2023-08-29 20:11:23,402 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:11:23" (1/1) ...
[2023-08-29 20:11:23,403 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75b0e22c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:11:23, skipping insertion in model container
[2023-08-29 20:11:23,403 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:11:23" (1/1) ...
[2023-08-29 20:11:23,409 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2023-08-29 20:11:23,453 INFO L178 MainTranslator]: Built tables and reachable declarations
[2023-08-29 20:11:23,575 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/mix001.opt.i[944,957]
[2023-08-29 20:11:23,808 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-08-29 20:11:23,820 INFO L203 MainTranslator]: Completed pre-run
[2023-08-29 20:11:23,831 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/mix001.opt.i[944,957]
[2023-08-29 20:11:23,884 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-08-29 20:11:23,918 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler.
[2023-08-29 20:11:23,918 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler.
[2023-08-29 20:11:23,923 INFO L208 MainTranslator]: Completed translation
[2023-08-29 20:11:23,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:11:23 WrapperNode
[2023-08-29 20:11:23,924 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-08-29 20:11:23,925 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-08-29 20:11:23,925 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-08-29 20:11:23,925 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2023-08-29 20:11:23,931 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:11:23" (1/1) ...
[2023-08-29 20:11:23,944 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:11:23" (1/1) ...
[2023-08-29 20:11:23,979 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 152
[2023-08-29 20:11:23,984 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-08-29 20:11:23,985 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-08-29 20:11:23,986 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2023-08-29 20:11:23,986 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2023-08-29 20:11:23,994 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:11:23" (1/1) ...
[2023-08-29 20:11:23,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:11:23" (1/1) ...
[2023-08-29 20:11:24,006 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:11:23" (1/1) ...
[2023-08-29 20:11:24,006 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:11:23" (1/1) ...
[2023-08-29 20:11:24,012 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:11:23" (1/1) ...
[2023-08-29 20:11:24,014 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:11:23" (1/1) ...
[2023-08-29 20:11:24,016 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:11:23" (1/1) ...
[2023-08-29 20:11:24,034 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:11:23" (1/1) ...
[2023-08-29 20:11:24,037 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-08-29 20:11:24,038 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-08-29 20:11:24,038 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2023-08-29 20:11:24,038 INFO L275 PluginConnector]: RCFGBuilder initialized
[2023-08-29 20:11:24,038 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:11:23" (1/1) ...
[2023-08-29 20:11:24,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-08-29 20:11:24,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-08-29 20:11:24,074 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:11:24,096 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:11:24,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2023-08-29 20:11:24,108 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2023-08-29 20:11:24,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-08-29 20:11:24,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-08-29 20:11:24,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-08-29 20:11:24,109 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2023-08-29 20:11:24,109 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2023-08-29 20:11:24,109 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2023-08-29 20:11:24,109 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2023-08-29 20:11:24,109 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2023-08-29 20:11:24,109 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2023-08-29 20:11:24,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2023-08-29 20:11:24,110 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2023-08-29 20:11:24,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-08-29 20:11:24,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-08-29 20:11:24,111 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:11:24,245 INFO L236 CfgBuilder]: Building ICFG
[2023-08-29 20:11:24,246 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation
[2023-08-29 20:11:24,608 INFO L277 CfgBuilder]: Performing block encoding
[2023-08-29 20:11:24,734 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-08-29 20:11:24,735 INFO L302 CfgBuilder]: Removed 0 assume(true) statements.
[2023-08-29 20:11:24,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:11:24 BoogieIcfgContainer
[2023-08-29 20:11:24,737 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-08-29 20:11:24,739 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-08-29 20:11:24,739 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2023-08-29 20:11:24,741 INFO L275 PluginConnector]: TraceAbstraction initialized
[2023-08-29 20:11:24,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:11:23" (1/3) ...
[2023-08-29 20:11:24,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76707960 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:11:24, skipping insertion in model container
[2023-08-29 20:11:24,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:11:23" (2/3) ...
[2023-08-29 20:11:24,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76707960 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:11:24, skipping insertion in model container
[2023-08-29 20:11:24,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:11:24" (3/3) ...
[2023-08-29 20:11:24,744 INFO L112 eAbstractionObserver]: Analyzing ICFG mix001.opt.i
[2023-08-29 20:11:24,758 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-08-29 20:11:24,758 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations.
[2023-08-29 20:11:24,758 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-08-29 20:11:24,834 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-08-29 20:11:24,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 123 transitions, 261 flow
[2023-08-29 20:11:24,936 INFO L130 PetriNetUnfolder]: 2/120 cut-off events.
[2023-08-29 20:11:24,937 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-08-29 20:11:24,943 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 83 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:11:24,943 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 123 transitions, 261 flow
[2023-08-29 20:11:24,951 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 120 transitions, 249 flow
[2023-08-29 20:11:24,954 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-08-29 20:11:24,966 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 120 transitions, 249 flow
[2023-08-29 20:11:24,968 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 120 transitions, 249 flow
[2023-08-29 20:11:24,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 120 transitions, 249 flow
[2023-08-29 20:11:24,991 INFO L130 PetriNetUnfolder]: 2/120 cut-off events.
[2023-08-29 20:11:24,991 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-08-29 20:11:24,992 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 83 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:11:24,993 INFO L119 LiptonReduction]: Number of co-enabled transitions 2200
[2023-08-29 20:11:29,007 INFO L134 LiptonReduction]: Checked pairs total: 6520
[2023-08-29 20:11:29,007 INFO L136 LiptonReduction]: Total number of compositions: 119
[2023-08-29 20:11:29,019 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-08-29 20:11:29,024 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;@4fe9ae72, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-08-29 20:11:29,024 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations.
[2023-08-29 20:11:29,025 INFO L130 PetriNetUnfolder]: 0/0 cut-off events.
[2023-08-29 20:11:29,026 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-08-29 20:11:29,026 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-29 20:11:29,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1]
[2023-08-29 20:11:29,027 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-29 20:11:29,030 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-29 20:11:29,031 INFO L85 PathProgramCache]: Analyzing trace with hash 552, now seen corresponding path program 1 times
[2023-08-29 20:11:29,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-29 20:11:29,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337456145]
[2023-08-29 20:11:29,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-29 20:11:29,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-29 20:11:29,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-29 20:11:29,133 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:11:29,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-29 20:11:29,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337456145]
[2023-08-29 20:11:29,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337456145] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-29 20:11:29,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-29 20:11:29,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-08-29 20:11:29,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378382144]
[2023-08-29 20:11:29,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-29 20:11:29,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-08-29 20:11:29,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-29 20:11:29,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-08-29 20:11:29,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-08-29 20:11:29,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 242
[2023-08-29 20:11:29,202 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 75 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:11:29,203 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-29 20:11:29,203 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 242
[2023-08-29 20:11:29,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-29 20:11:29,565 INFO L130 PetriNetUnfolder]: 1101/1677 cut-off events.
[2023-08-29 20:11:29,565 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES.
[2023-08-29 20:11:29,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3350 conditions, 1677 events. 1101/1677 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 8556 event pairs, 1101 based on Foata normal form. 0/1420 useless extension candidates. Maximal degree in co-relation 3339. Up to 1637 conditions per place.
[2023-08-29 20:11:29,577 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 22 selfloop transitions, 0 changer transitions 0/26 dead transitions.
[2023-08-29 20:11:29,577 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 105 flow
[2023-08-29 20:11:29,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2023-08-29 20:11:29,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-08-29 20:11:29,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 251 transitions.
[2023-08-29 20:11:29,589 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.518595041322314
[2023-08-29 20:11:29,589 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 251 transitions.
[2023-08-29 20:11:29,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 251 transitions.
[2023-08-29 20:11:29,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-29 20:11:29,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 251 transitions.
[2023-08-29 20:11:29,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 0 states have call successors, (0), 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:11:29,599 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:11:29,599 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:11:29,601 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 75 flow. Second operand 2 states and 251 transitions.
[2023-08-29 20:11:29,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 105 flow
[2023-08-29 20:11:29,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 26 transitions, 102 flow, removed 0 selfloop flow, removed 3 redundant places.
[2023-08-29 20:11:29,605 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 58 flow
[2023-08-29 20:11:29,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=58, PETRI_PLACES=34, PETRI_TRANSITIONS=26}
[2023-08-29 20:11:29,609 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -8 predicate places.
[2023-08-29 20:11:29,610 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 58 flow
[2023-08-29 20:11:29,610 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:11:29,610 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-29 20:11:29,610 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-08-29 20:11:29,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-08-29 20:11:29,611 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:11:29,612 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-29 20:11:29,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1776669952, now seen corresponding path program 1 times
[2023-08-29 20:11:29,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-29 20:11:29,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399905620]
[2023-08-29 20:11:29,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-29 20:11:29,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-29 20:11:29,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-29 20:11:29,912 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:11:29,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-29 20:11:29,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399905620]
[2023-08-29 20:11:29,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399905620] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-29 20:11:29,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-29 20:11:29,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-08-29 20:11:29,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071329646]
[2023-08-29 20:11:29,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-29 20:11:29,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-08-29 20:11:29,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-29 20:11:29,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-08-29 20:11:29,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-08-29 20:11:29,919 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 242
[2023-08-29 20:11:29,919 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 58 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:11:29,920 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-29 20:11:29,920 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 242
[2023-08-29 20:11:29,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-29 20:11:30,119 INFO L130 PetriNetUnfolder]: 910/1450 cut-off events.
[2023-08-29 20:11:30,120 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-08-29 20:11:30,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2846 conditions, 1450 events. 910/1450 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 7753 event pairs, 146 based on Foata normal form. 0/1325 useless extension candidates. Maximal degree in co-relation 2843. Up to 1101 conditions per place.
[2023-08-29 20:11:30,128 INFO L137 encePairwiseOnDemand]: 239/242 looper letters, 28 selfloop transitions, 2 changer transitions 2/36 dead transitions.
[2023-08-29 20:11:30,128 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 142 flow
[2023-08-29 20:11:30,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-08-29 20:11:30,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-08-29 20:11:30,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions.
[2023-08-29 20:11:30,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5
[2023-08-29 20:11:30,133 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 363 transitions.
[2023-08-29 20:11:30,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 363 transitions.
[2023-08-29 20:11:30,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-29 20:11:30,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 363 transitions.
[2023-08-29 20:11:30,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 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:11:30,140 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:11:30,141 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:11:30,141 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 58 flow. Second operand 3 states and 363 transitions.
[2023-08-29 20:11:30,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 142 flow
[2023-08-29 20:11:30,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 36 transitions, 142 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-08-29 20:11:30,142 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 58 flow
[2023-08-29 20:11:30,143 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=35, PETRI_TRANSITIONS=24}
[2023-08-29 20:11:30,143 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -7 predicate places.
[2023-08-29 20:11:30,144 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 58 flow
[2023-08-29 20:11:30,144 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:11:30,144 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-29 20:11:30,144 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-29 20:11:30,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-08-29 20:11:30,145 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:11:30,147 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-29 20:11:30,147 INFO L85 PathProgramCache]: Analyzing trace with hash -2017089092, now seen corresponding path program 1 times
[2023-08-29 20:11:30,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-29 20:11:30,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222553632]
[2023-08-29 20:11:30,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-29 20:11:30,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-29 20:11:30,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-29 20:11:30,523 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:11:30,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-29 20:11:30,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222553632]
[2023-08-29 20:11:30,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222553632] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-29 20:11:30,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-29 20:11:30,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-08-29 20:11:30,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426561906]
[2023-08-29 20:11:30,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-29 20:11:30,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-08-29 20:11:30,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-29 20:11:30,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-08-29 20:11:30,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-08-29 20:11:30,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 242
[2023-08-29 20:11:30,545 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 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:11:30,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-29 20:11:30,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 242
[2023-08-29 20:11:30,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-29 20:11:30,985 INFO L130 PetriNetUnfolder]: 2645/3882 cut-off events.
[2023-08-29 20:11:30,985 INFO L131 PetriNetUnfolder]: For 184/184 co-relation queries the response was YES.
[2023-08-29 20:11:30,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8019 conditions, 3882 events. 2645/3882 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 18503 event pairs, 1043 based on Foata normal form. 0/3740 useless extension candidates. Maximal degree in co-relation 8015. Up to 3117 conditions per place.
[2023-08-29 20:11:31,003 INFO L137 encePairwiseOnDemand]: 233/242 looper letters, 37 selfloop transitions, 8 changer transitions 0/45 dead transitions.
[2023-08-29 20:11:31,004 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 45 transitions, 196 flow
[2023-08-29 20:11:31,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-08-29 20:11:31,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-08-29 20:11:31,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 349 transitions.
[2023-08-29 20:11:31,006 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4807162534435262
[2023-08-29 20:11:31,006 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 349 transitions.
[2023-08-29 20:11:31,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 349 transitions.
[2023-08-29 20:11:31,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-29 20:11:31,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 349 transitions.
[2023-08-29 20:11:31,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 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:11:31,009 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:11:31,009 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:11:31,009 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 58 flow. Second operand 3 states and 349 transitions.
[2023-08-29 20:11:31,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 45 transitions, 196 flow
[2023-08-29 20:11:31,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 45 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-08-29 20:11:31,012 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 116 flow
[2023-08-29 20:11:31,012 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=36, PETRI_TRANSITIONS=31}
[2023-08-29 20:11:31,013 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -6 predicate places.
[2023-08-29 20:11:31,016 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 31 transitions, 116 flow
[2023-08-29 20:11:31,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 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:11:31,017 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-29 20:11:31,017 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-29 20:11:31,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-08-29 20:11:31,018 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:11:31,018 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-29 20:11:31,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1894747978, now seen corresponding path program 1 times
[2023-08-29 20:11:31,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-29 20:11:31,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708646366]
[2023-08-29 20:11:31,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-29 20:11:31,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-29 20:11:31,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-29 20:11:31,395 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:11:31,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-29 20:11:31,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708646366]
[2023-08-29 20:11:31,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708646366] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-29 20:11:31,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-29 20:11:31,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-08-29 20:11:31,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737702119]
[2023-08-29 20:11:31,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-29 20:11:31,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-08-29 20:11:31,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-29 20:11:31,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-08-29 20:11:31,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2023-08-29 20:11:31,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 242
[2023-08-29 20:11:31,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 116 flow. Second operand has 6 states, 6 states have (on average 97.66666666666667) internal successors, (586), 6 states have internal predecessors, (586), 0 states have call successors, (0), 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:11:31,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-29 20:11:31,602 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 242
[2023-08-29 20:11:31,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-29 20:11:32,073 INFO L130 PetriNetUnfolder]: 1803/2912 cut-off events.
[2023-08-29 20:11:32,073 INFO L131 PetriNetUnfolder]: For 929/1008 co-relation queries the response was YES.
[2023-08-29 20:11:32,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7114 conditions, 2912 events. 1803/2912 cut-off events. For 929/1008 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 15800 event pairs, 1016 based on Foata normal form. 238/3096 useless extension candidates. Maximal degree in co-relation 7109. Up to 1715 conditions per place.
[2023-08-29 20:11:32,088 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 38 selfloop transitions, 8 changer transitions 15/67 dead transitions.
[2023-08-29 20:11:32,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 67 transitions, 356 flow
[2023-08-29 20:11:32,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2023-08-29 20:11:32,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-08-29 20:11:32,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 630 transitions.
[2023-08-29 20:11:32,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43388429752066116
[2023-08-29 20:11:32,091 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 630 transitions.
[2023-08-29 20:11:32,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 630 transitions.
[2023-08-29 20:11:32,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-29 20:11:32,091 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 630 transitions.
[2023-08-29 20:11:32,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 105.0) internal successors, (630), 6 states have internal predecessors, (630), 0 states have call successors, (0), 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:11:32,095 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:11:32,096 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:11:32,096 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 116 flow. Second operand 6 states and 630 transitions.
[2023-08-29 20:11:32,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 67 transitions, 356 flow
[2023-08-29 20:11:32,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 67 transitions, 326 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-08-29 20:11:32,103 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 148 flow
[2023-08-29 20:11:32,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=148, PETRI_PLACES=43, PETRI_TRANSITIONS=35}
[2023-08-29 20:11:32,104 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places.
[2023-08-29 20:11:32,104 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 148 flow
[2023-08-29 20:11:32,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.66666666666667) internal successors, (586), 6 states have internal predecessors, (586), 0 states have call successors, (0), 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:11:32,105 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-29 20:11:32,105 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-29 20:11:32,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-08-29 20:11:32,106 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:11:32,106 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-29 20:11:32,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1472517924, now seen corresponding path program 1 times
[2023-08-29 20:11:32,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-29 20:11:32,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267055223]
[2023-08-29 20:11:32,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-29 20:11:32,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-29 20:11:32,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-29 20:11:32,250 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:11:32,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-29 20:11:32,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267055223]
[2023-08-29 20:11:32,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267055223] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-29 20:11:32,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-29 20:11:32,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-08-29 20:11:32,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033180357]
[2023-08-29 20:11:32,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-29 20:11:32,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-08-29 20:11:32,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-29 20:11:32,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-08-29 20:11:32,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2023-08-29 20:11:32,264 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 242
[2023-08-29 20:11:32,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 103.75) internal successors, (415), 4 states have internal predecessors, (415), 0 states have call successors, (0), 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:11:32,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-29 20:11:32,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 242
[2023-08-29 20:11:32,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-29 20:11:32,574 INFO L130 PetriNetUnfolder]: 1869/2786 cut-off events.
[2023-08-29 20:11:32,575 INFO L131 PetriNetUnfolder]: For 826/826 co-relation queries the response was YES.
[2023-08-29 20:11:32,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7331 conditions, 2786 events. 1869/2786 cut-off events. For 826/826 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 12574 event pairs, 602 based on Foata normal form. 0/2732 useless extension candidates. Maximal degree in co-relation 7322. Up to 1611 conditions per place.
[2023-08-29 20:11:32,590 INFO L137 encePairwiseOnDemand]: 234/242 looper letters, 52 selfloop transitions, 8 changer transitions 0/60 dead transitions.
[2023-08-29 20:11:32,590 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 60 transitions, 351 flow
[2023-08-29 20:11:32,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2023-08-29 20:11:32,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-08-29 20:11:32,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 454 transitions.
[2023-08-29 20:11:32,592 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4690082644628099
[2023-08-29 20:11:32,592 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 454 transitions.
[2023-08-29 20:11:32,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 454 transitions.
[2023-08-29 20:11:32,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-29 20:11:32,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 454 transitions.
[2023-08-29 20:11:32,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 113.5) internal successors, (454), 4 states have internal predecessors, (454), 0 states have call successors, (0), 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:11:32,596 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:11:32,596 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:11:32,596 INFO L175 Difference]: Start difference. First operand has 43 places, 35 transitions, 148 flow. Second operand 4 states and 454 transitions.
[2023-08-29 20:11:32,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 60 transitions, 351 flow
[2023-08-29 20:11:32,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 60 transitions, 338 flow, removed 3 selfloop flow, removed 2 redundant places.
[2023-08-29 20:11:32,605 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 200 flow
[2023-08-29 20:11:32,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=200, PETRI_PLACES=46, PETRI_TRANSITIONS=39}
[2023-08-29 20:11:32,605 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places.
[2023-08-29 20:11:32,606 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 200 flow
[2023-08-29 20:11:32,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.75) internal successors, (415), 4 states have internal predecessors, (415), 0 states have call successors, (0), 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:11:32,606 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-29 20:11:32,606 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-29 20:11:32,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-08-29 20:11:32,607 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:11:32,607 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-29 20:11:32,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1596584222, now seen corresponding path program 1 times
[2023-08-29 20:11:32,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-29 20:11:32,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120968071]
[2023-08-29 20:11:32,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-29 20:11:32,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-29 20:11:32,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-29 20:11:32,979 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:11:32,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-29 20:11:32,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120968071]
[2023-08-29 20:11:32,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120968071] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-29 20:11:32,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-29 20:11:32,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-08-29 20:11:32,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520080951]
[2023-08-29 20:11:32,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-29 20:11:32,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-08-29 20:11:32,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-29 20:11:32,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-08-29 20:11:32,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2023-08-29 20:11:33,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 242
[2023-08-29 20:11:33,110 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 200 flow. Second operand has 6 states, 6 states have (on average 98.83333333333333) internal successors, (593), 6 states have internal predecessors, (593), 0 states have call successors, (0), 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:11:33,110 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-29 20:11:33,110 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 242
[2023-08-29 20:11:33,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-29 20:11:33,465 INFO L130 PetriNetUnfolder]: 1271/2103 cut-off events.
[2023-08-29 20:11:33,465 INFO L131 PetriNetUnfolder]: For 1452/1505 co-relation queries the response was YES.
[2023-08-29 20:11:33,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5411 conditions, 2103 events. 1271/2103 cut-off events. For 1452/1505 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 10937 event pairs, 374 based on Foata normal form. 111/2158 useless extension candidates. Maximal degree in co-relation 5401. Up to 1167 conditions per place.
[2023-08-29 20:11:33,482 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 32 selfloop transitions, 7 changer transitions 13/65 dead transitions.
[2023-08-29 20:11:33,483 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 65 transitions, 388 flow
[2023-08-29 20:11:33,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2023-08-29 20:11:33,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-08-29 20:11:33,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 627 transitions.
[2023-08-29 20:11:33,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818
[2023-08-29 20:11:33,485 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 627 transitions.
[2023-08-29 20:11:33,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 627 transitions.
[2023-08-29 20:11:33,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-29 20:11:33,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 627 transitions.
[2023-08-29 20:11:33,488 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 104.5) internal successors, (627), 6 states have internal predecessors, (627), 0 states have call successors, (0), 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:11:33,490 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:11:33,491 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:11:33,491 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 200 flow. Second operand 6 states and 627 transitions.
[2023-08-29 20:11:33,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 65 transitions, 388 flow
[2023-08-29 20:11:33,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 65 transitions, 385 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-08-29 20:11:33,505 INFO L231 Difference]: Finished difference. Result has 52 places, 38 transitions, 215 flow
[2023-08-29 20:11:33,505 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=215, PETRI_PLACES=52, PETRI_TRANSITIONS=38}
[2023-08-29 20:11:33,506 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 10 predicate places.
[2023-08-29 20:11:33,506 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 38 transitions, 215 flow
[2023-08-29 20:11:33,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.83333333333333) internal successors, (593), 6 states have internal predecessors, (593), 0 states have call successors, (0), 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:11:33,506 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-29 20:11:33,506 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-29 20:11:33,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-08-29 20:11:33,507 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-29 20:11:33,507 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-29 20:11:33,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1078831507, now seen corresponding path program 1 times
[2023-08-29 20:11:33,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-29 20:11:33,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067137883]
[2023-08-29 20:11:33,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-29 20:11:33,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-29 20:11:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-29 20:11:33,803 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:11:33,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-29 20:11:33,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067137883]
[2023-08-29 20:11:33,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067137883] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-29 20:11:33,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-29 20:11:33,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-08-29 20:11:33,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193841449]
[2023-08-29 20:11:33,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-29 20:11:33,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-08-29 20:11:33,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-29 20:11:33,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-08-29 20:11:33,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2023-08-29 20:11:33,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 242
[2023-08-29 20:11:33,909 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 38 transitions, 215 flow. Second operand has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 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:11:33,909 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-29 20:11:33,909 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 242
[2023-08-29 20:11:33,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-29 20:11:34,221 INFO L130 PetriNetUnfolder]: 1201/1950 cut-off events.
[2023-08-29 20:11:34,221 INFO L131 PetriNetUnfolder]: For 1944/1951 co-relation queries the response was YES.
[2023-08-29 20:11:34,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5505 conditions, 1950 events. 1201/1950 cut-off events. For 1944/1951 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 9545 event pairs, 334 based on Foata normal form. 74/1975 useless extension candidates. Maximal degree in co-relation 5492. Up to 1166 conditions per place.
[2023-08-29 20:11:34,235 INFO L137 encePairwiseOnDemand]: 236/242 looper letters, 35 selfloop transitions, 9 changer transitions 11/64 dead transitions.
[2023-08-29 20:11:34,235 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 64 transitions, 414 flow
[2023-08-29 20:11:34,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2023-08-29 20:11:34,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-08-29 20:11:34,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 622 transitions.
[2023-08-29 20:11:34,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4283746556473829
[2023-08-29 20:11:34,237 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 622 transitions.
[2023-08-29 20:11:34,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 622 transitions.
[2023-08-29 20:11:34,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-29 20:11:34,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 622 transitions.
[2023-08-29 20:11:34,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 103.66666666666667) internal successors, (622), 6 states have internal predecessors, (622), 0 states have call successors, (0), 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:11:34,241 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:11:34,242 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:11:34,242 INFO L175 Difference]: Start difference. First operand has 52 places, 38 transitions, 215 flow. Second operand 6 states and 622 transitions.
[2023-08-29 20:11:34,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 64 transitions, 414 flow
[2023-08-29 20:11:34,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 64 transitions, 390 flow, removed 2 selfloop flow, removed 5 redundant places.
[2023-08-29 20:11:34,252 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 231 flow
[2023-08-29 20:11:34,252 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=231, PETRI_PLACES=53, PETRI_TRANSITIONS=39}
[2023-08-29 20:11:34,252 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 11 predicate places.
[2023-08-29 20:11:34,253 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 231 flow
[2023-08-29 20:11:34,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 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:11:34,253 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-29 20:11:34,253 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-29 20:11:34,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-08-29 20:11:34,254 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:11:34,254 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-29 20:11:34,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1768523128, now seen corresponding path program 1 times
[2023-08-29 20:11:34,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-29 20:11:34,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509561105]
[2023-08-29 20:11:34,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-29 20:11:34,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-29 20:11:34,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-29 20:11:34,430 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:11:34,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-29 20:11:34,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509561105]
[2023-08-29 20:11:34,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509561105] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-29 20:11:34,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-29 20:11:34,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-08-29 20:11:34,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533887638]
[2023-08-29 20:11:34,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-29 20:11:34,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-08-29 20:11:34,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-29 20:11:34,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-08-29 20:11:34,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-08-29 20:11:34,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 242
[2023-08-29 20:11:34,442 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 39 transitions, 231 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:11:34,442 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-29 20:11:34,442 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 242
[2023-08-29 20:11:34,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-29 20:11:34,652 INFO L130 PetriNetUnfolder]: 704/1253 cut-off events.
[2023-08-29 20:11:34,652 INFO L131 PetriNetUnfolder]: For 902/919 co-relation queries the response was YES.
[2023-08-29 20:11:34,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3317 conditions, 1253 events. 704/1253 cut-off events. For 902/919 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6473 event pairs, 173 based on Foata normal form. 122/1325 useless extension candidates. Maximal degree in co-relation 3303. Up to 712 conditions per place.
[2023-08-29 20:11:34,661 INFO L137 encePairwiseOnDemand]: 236/242 looper letters, 53 selfloop transitions, 8 changer transitions 0/74 dead transitions.
[2023-08-29 20:11:34,661 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 74 transitions, 468 flow
[2023-08-29 20:11:34,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-08-29 20:11:34,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-08-29 20:11:34,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 584 transitions.
[2023-08-29 20:11:34,663 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4826446280991736
[2023-08-29 20:11:34,663 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 584 transitions.
[2023-08-29 20:11:34,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 584 transitions.
[2023-08-29 20:11:34,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-29 20:11:34,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 584 transitions.
[2023-08-29 20:11:34,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.8) internal successors, (584), 5 states have internal predecessors, (584), 0 states have call successors, (0), 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:11:34,667 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:11:34,667 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:11:34,667 INFO L175 Difference]: Start difference. First operand has 53 places, 39 transitions, 231 flow. Second operand 5 states and 584 transitions.
[2023-08-29 20:11:34,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 74 transitions, 468 flow
[2023-08-29 20:11:34,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 74 transitions, 444 flow, removed 1 selfloop flow, removed 5 redundant places.
[2023-08-29 20:11:34,672 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 268 flow
[2023-08-29 20:11:34,672 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=268, PETRI_PLACES=54, PETRI_TRANSITIONS=46}
[2023-08-29 20:11:34,672 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places.
[2023-08-29 20:11:34,673 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 268 flow
[2023-08-29 20:11:34,673 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:11:34,673 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-29 20:11:34,673 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:11:34,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-08-29 20:11:34,674 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:11:34,674 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-29 20:11:34,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1846522568, now seen corresponding path program 1 times
[2023-08-29 20:11:34,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-29 20:11:34,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704309807]
[2023-08-29 20:11:34,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-29 20:11:34,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-29 20:11:34,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-29 20:11:34,841 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:11:34,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-29 20:11:34,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704309807]
[2023-08-29 20:11:34,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704309807] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-29 20:11:34,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-29 20:11:34,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-08-29 20:11:34,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845726908]
[2023-08-29 20:11:34,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-29 20:11:34,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-08-29 20:11:34,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-29 20:11:34,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-08-29 20:11:34,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-08-29 20:11:34,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 242
[2023-08-29 20:11:34,853 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 268 flow. Second operand has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 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:11:34,853 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-29 20:11:34,853 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 242
[2023-08-29 20:11:34,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-29 20:11:35,136 INFO L130 PetriNetUnfolder]: 1079/1922 cut-off events.
[2023-08-29 20:11:35,136 INFO L131 PetriNetUnfolder]: For 2552/2611 co-relation queries the response was YES.
[2023-08-29 20:11:35,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6387 conditions, 1922 events. 1079/1922 cut-off events. For 2552/2611 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 10986 event pairs, 322 based on Foata normal form. 21/1886 useless extension candidates. Maximal degree in co-relation 6372. Up to 945 conditions per place.
[2023-08-29 20:11:35,151 INFO L137 encePairwiseOnDemand]: 239/242 looper letters, 66 selfloop transitions, 3 changer transitions 5/85 dead transitions.
[2023-08-29 20:11:35,151 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 85 transitions, 618 flow
[2023-08-29 20:11:35,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2023-08-29 20:11:35,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-08-29 20:11:35,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 474 transitions.
[2023-08-29 20:11:35,154 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4896694214876033
[2023-08-29 20:11:35,154 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 474 transitions.
[2023-08-29 20:11:35,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 474 transitions.
[2023-08-29 20:11:35,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-29 20:11:35,154 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 474 transitions.
[2023-08-29 20:11:35,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 0 states have call successors, (0), 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:11:35,158 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:11:35,159 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:11:35,159 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 268 flow. Second operand 4 states and 474 transitions.
[2023-08-29 20:11:35,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 85 transitions, 618 flow
[2023-08-29 20:11:35,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 85 transitions, 609 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-08-29 20:11:35,165 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 277 flow
[2023-08-29 20:11:35,165 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=277, PETRI_PLACES=58, PETRI_TRANSITIONS=46}
[2023-08-29 20:11:35,166 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 16 predicate places.
[2023-08-29 20:11:35,166 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 277 flow
[2023-08-29 20:11:35,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 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:11:35,167 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-29 20:11:35,167 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-29 20:11:35,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-08-29 20:11:35,167 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:11:35,167 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-29 20:11:35,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1031967790, now seen corresponding path program 1 times
[2023-08-29 20:11:35,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-29 20:11:35,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971694808]
[2023-08-29 20:11:35,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-29 20:11:35,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-29 20:11:35,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-29 20:11:35,571 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:11:35,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-29 20:11:35,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971694808]
[2023-08-29 20:11:35,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971694808] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-29 20:11:35,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-29 20:11:35,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-08-29 20:11:35,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775836947]
[2023-08-29 20:11:35,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-29 20:11:35,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-08-29 20:11:35,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-29 20:11:35,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-08-29 20:11:35,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2023-08-29 20:11:35,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 242
[2023-08-29 20:11:35,605 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 277 flow. Second operand has 7 states, 7 states have (on average 98.42857142857143) internal successors, (689), 7 states have internal predecessors, (689), 0 states have call successors, (0), 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:11:35,605 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-29 20:11:35,605 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 242
[2023-08-29 20:11:35,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-29 20:11:36,034 INFO L130 PetriNetUnfolder]: 1508/2478 cut-off events.
[2023-08-29 20:11:36,034 INFO L131 PetriNetUnfolder]: For 3664/3664 co-relation queries the response was YES.
[2023-08-29 20:11:36,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8814 conditions, 2478 events. 1508/2478 cut-off events. For 3664/3664 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 12681 event pairs, 154 based on Foata normal form. 4/2482 useless extension candidates. Maximal degree in co-relation 8797. Up to 1787 conditions per place.
[2023-08-29 20:11:36,050 INFO L137 encePairwiseOnDemand]: 230/242 looper letters, 83 selfloop transitions, 30 changer transitions 19/132 dead transitions.
[2023-08-29 20:11:36,051 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 132 transitions, 987 flow
[2023-08-29 20:11:36,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2023-08-29 20:11:36,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2023-08-29 20:11:36,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 954 transitions.
[2023-08-29 20:11:36,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4380165289256198
[2023-08-29 20:11:36,054 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 954 transitions.
[2023-08-29 20:11:36,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 954 transitions.
[2023-08-29 20:11:36,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-29 20:11:36,055 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 954 transitions.
[2023-08-29 20:11:36,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 106.0) internal successors, (954), 9 states have internal predecessors, (954), 0 states have call successors, (0), 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:11:36,059 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:11:36,060 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:11:36,060 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 277 flow. Second operand 9 states and 954 transitions.
[2023-08-29 20:11:36,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 132 transitions, 987 flow
[2023-08-29 20:11:36,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 132 transitions, 982 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-08-29 20:11:36,068 INFO L231 Difference]: Finished difference. Result has 71 places, 62 transitions, 482 flow
[2023-08-29 20:11:36,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=482, PETRI_PLACES=71, PETRI_TRANSITIONS=62}
[2023-08-29 20:11:36,068 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 29 predicate places.
[2023-08-29 20:11:36,068 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 62 transitions, 482 flow
[2023-08-29 20:11:36,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.42857142857143) internal successors, (689), 7 states have internal predecessors, (689), 0 states have call successors, (0), 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:11:36,069 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-29 20:11:36,069 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-29 20:11:36,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-08-29 20:11:36,069 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:11:36,070 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-29 20:11:36,070 INFO L85 PathProgramCache]: Analyzing trace with hash -2020332632, now seen corresponding path program 2 times
[2023-08-29 20:11:36,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-29 20:11:36,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021806016]
[2023-08-29 20:11:36,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-29 20:11:36,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-29 20:11:36,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-29 20:11:36,288 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:11:36,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-29 20:11:36,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021806016]
[2023-08-29 20:11:36,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021806016] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-29 20:11:36,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-29 20:11:36,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-08-29 20:11:36,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706597081]
[2023-08-29 20:11:36,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-29 20:11:36,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-08-29 20:11:36,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-29 20:11:36,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-08-29 20:11:36,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2023-08-29 20:11:36,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 242
[2023-08-29 20:11:36,301 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 62 transitions, 482 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:11:36,301 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-29 20:11:36,301 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 242
[2023-08-29 20:11:36,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-29 20:11:36,523 INFO L130 PetriNetUnfolder]: 506/1005 cut-off events.
[2023-08-29 20:11:36,523 INFO L131 PetriNetUnfolder]: For 2550/2599 co-relation queries the response was YES.
[2023-08-29 20:11:36,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3979 conditions, 1005 events. 506/1005 cut-off events. For 2550/2599 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5492 event pairs, 98 based on Foata normal form. 111/1079 useless extension candidates. Maximal degree in co-relation 3957. Up to 377 conditions per place.
[2023-08-29 20:11:36,530 INFO L137 encePairwiseOnDemand]: 236/242 looper letters, 80 selfloop transitions, 11 changer transitions 12/124 dead transitions.
[2023-08-29 20:11:36,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 124 transitions, 1075 flow
[2023-08-29 20:11:36,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2023-08-29 20:11:36,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-08-29 20:11:36,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 701 transitions.
[2023-08-29 20:11:36,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48278236914600553
[2023-08-29 20:11:36,533 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 701 transitions.
[2023-08-29 20:11:36,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 701 transitions.
[2023-08-29 20:11:36,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-29 20:11:36,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 701 transitions.
[2023-08-29 20:11:36,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 116.83333333333333) internal successors, (701), 6 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:11:36,537 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:11:36,537 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:11:36,538 INFO L175 Difference]: Start difference. First operand has 71 places, 62 transitions, 482 flow. Second operand 6 states and 701 transitions.
[2023-08-29 20:11:36,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 124 transitions, 1075 flow
[2023-08-29 20:11:36,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 124 transitions, 1071 flow, removed 2 selfloop flow, removed 1 redundant places.
[2023-08-29 20:11:36,546 INFO L231 Difference]: Finished difference. Result has 76 places, 69 transitions, 570 flow
[2023-08-29 20:11:36,546 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=570, PETRI_PLACES=76, PETRI_TRANSITIONS=69}
[2023-08-29 20:11:36,547 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 34 predicate places.
[2023-08-29 20:11:36,547 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 69 transitions, 570 flow
[2023-08-29 20:11:36,547 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:11:36,547 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-29 20:11:36,547 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-29 20:11:36,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-08-29 20:11:36,548 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-29 20:11:36,548 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-29 20:11:36,548 INFO L85 PathProgramCache]: Analyzing trace with hash 548743982, now seen corresponding path program 1 times
[2023-08-29 20:11:36,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-29 20:11:36,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331900054]
[2023-08-29 20:11:36,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-29 20:11:36,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-29 20:11:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-29 20:11:36,779 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:11:36,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-29 20:11:36,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331900054]
[2023-08-29 20:11:36,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331900054] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-29 20:11:36,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-29 20:11:36,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-08-29 20:11:36,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222549256]
[2023-08-29 20:11:36,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-29 20:11:36,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-08-29 20:11:36,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-29 20:11:36,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-08-29 20:11:36,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2023-08-29 20:11:36,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 242
[2023-08-29 20:11:36,793 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 69 transitions, 570 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:11:36,793 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-29 20:11:36,794 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 242
[2023-08-29 20:11:36,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-29 20:11:37,020 INFO L130 PetriNetUnfolder]: 440/864 cut-off events.
[2023-08-29 20:11:37,020 INFO L131 PetriNetUnfolder]: For 2430/2473 co-relation queries the response was YES.
[2023-08-29 20:11:37,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3861 conditions, 864 events. 440/864 cut-off events. For 2430/2473 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4642 event pairs, 79 based on Foata normal form. 30/863 useless extension candidates. Maximal degree in co-relation 3836. Up to 337 conditions per place.
[2023-08-29 20:11:37,026 INFO L137 encePairwiseOnDemand]: 236/242 looper letters, 74 selfloop transitions, 15 changer transitions 12/120 dead transitions.
[2023-08-29 20:11:37,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 120 transitions, 1073 flow
[2023-08-29 20:11:37,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2023-08-29 20:11:37,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-08-29 20:11:37,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 914 transitions.
[2023-08-29 20:11:37,029 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47210743801652894
[2023-08-29 20:11:37,029 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 914 transitions.
[2023-08-29 20:11:37,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 914 transitions.
[2023-08-29 20:11:37,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-29 20:11:37,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 914 transitions.
[2023-08-29 20:11:37,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 114.25) internal successors, (914), 8 states have internal predecessors, (914), 0 states have call successors, (0), 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:11:37,034 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:11:37,035 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:11:37,035 INFO L175 Difference]: Start difference. First operand has 76 places, 69 transitions, 570 flow. Second operand 8 states and 914 transitions.
[2023-08-29 20:11:37,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 120 transitions, 1073 flow
[2023-08-29 20:11:37,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 120 transitions, 960 flow, removed 20 selfloop flow, removed 6 redundant places.
[2023-08-29 20:11:37,049 INFO L231 Difference]: Finished difference. Result has 80 places, 65 transitions, 481 flow
[2023-08-29 20:11:37,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=481, PETRI_PLACES=80, PETRI_TRANSITIONS=65}
[2023-08-29 20:11:37,050 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 38 predicate places.
[2023-08-29 20:11:37,050 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 65 transitions, 481 flow
[2023-08-29 20:11:37,050 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:11:37,050 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-29 20:11:37,050 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, 1]
[2023-08-29 20:11:37,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2023-08-29 20:11:37,051 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-29 20:11:37,051 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-29 20:11:37,051 INFO L85 PathProgramCache]: Analyzing trace with hash -759949422, now seen corresponding path program 1 times
[2023-08-29 20:11:37,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-29 20:11:37,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031871363]
[2023-08-29 20:11:37,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-29 20:11:37,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-29 20:11:37,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-29 20:11:37,277 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:11:37,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-29 20:11:37,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031871363]
[2023-08-29 20:11:37,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031871363] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-29 20:11:37,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-29 20:11:37,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-08-29 20:11:37,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394790615]
[2023-08-29 20:11:37,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-29 20:11:37,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-08-29 20:11:37,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-29 20:11:37,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-08-29 20:11:37,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-08-29 20:11:37,297 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 242
[2023-08-29 20:11:37,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 65 transitions, 481 flow. Second operand has 4 states, 4 states have (on average 104.5) internal successors, (418), 4 states have internal predecessors, (418), 0 states have call successors, (0), 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:11:37,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-29 20:11:37,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 242
[2023-08-29 20:11:37,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-29 20:11:37,580 INFO L130 PetriNetUnfolder]: 807/1439 cut-off events.
[2023-08-29 20:11:37,580 INFO L131 PetriNetUnfolder]: For 4511/4511 co-relation queries the response was YES.
[2023-08-29 20:11:37,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6413 conditions, 1439 events. 807/1439 cut-off events. For 4511/4511 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7346 event pairs, 221 based on Foata normal form. 1/1440 useless extension candidates. Maximal degree in co-relation 6388. Up to 984 conditions per place.
[2023-08-29 20:11:37,590 INFO L137 encePairwiseOnDemand]: 232/242 looper letters, 78 selfloop transitions, 27 changer transitions 14/119 dead transitions.
[2023-08-29 20:11:37,591 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 119 transitions, 1115 flow
[2023-08-29 20:11:37,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-08-29 20:11:37,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-08-29 20:11:37,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 557 transitions.
[2023-08-29 20:11:37,593 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46033057851239667
[2023-08-29 20:11:37,593 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 557 transitions.
[2023-08-29 20:11:37,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 557 transitions.
[2023-08-29 20:11:37,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-29 20:11:37,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 557 transitions.
[2023-08-29 20:11:37,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 111.4) internal successors, (557), 5 states have internal predecessors, (557), 0 states have call successors, (0), 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:11:37,597 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:11:37,598 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:11:37,598 INFO L175 Difference]: Start difference. First operand has 80 places, 65 transitions, 481 flow. Second operand 5 states and 557 transitions.
[2023-08-29 20:11:37,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 119 transitions, 1115 flow
[2023-08-29 20:11:37,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 119 transitions, 992 flow, removed 30 selfloop flow, removed 8 redundant places.
[2023-08-29 20:11:37,614 INFO L231 Difference]: Finished difference. Result has 77 places, 72 transitions, 594 flow
[2023-08-29 20:11:37,615 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=594, PETRI_PLACES=77, PETRI_TRANSITIONS=72}
[2023-08-29 20:11:37,615 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 35 predicate places.
[2023-08-29 20:11:37,615 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 72 transitions, 594 flow
[2023-08-29 20:11:37,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.5) internal successors, (418), 4 states have internal predecessors, (418), 0 states have call successors, (0), 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:11:37,616 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-29 20:11:37,616 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, 1]
[2023-08-29 20:11:37,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-08-29 20:11:37,616 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:11:37,617 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-29 20:11:37,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1159652520, now seen corresponding path program 2 times
[2023-08-29 20:11:37,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-29 20:11:37,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161468171]
[2023-08-29 20:11:37,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-29 20:11:37,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-29 20:11:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-29 20:11:38,164 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:11:38,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-29 20:11:38,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161468171]
[2023-08-29 20:11:38,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161468171] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-29 20:11:38,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-29 20:11:38,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-08-29 20:11:38,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129535795]
[2023-08-29 20:11:38,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-29 20:11:38,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-08-29 20:11:38,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-29 20:11:38,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-08-29 20:11:38,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2023-08-29 20:11:38,210 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 242
[2023-08-29 20:11:38,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 72 transitions, 594 flow. Second operand has 8 states, 8 states have (on average 98.75) internal successors, (790), 8 states have internal predecessors, (790), 0 states have call successors, (0), 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:11:38,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-29 20:11:38,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 242
[2023-08-29 20:11:38,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-29 20:11:38,618 INFO L130 PetriNetUnfolder]: 623/1133 cut-off events.
[2023-08-29 20:11:38,619 INFO L131 PetriNetUnfolder]: For 3673/3673 co-relation queries the response was YES.
[2023-08-29 20:11:38,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5182 conditions, 1133 events. 623/1133 cut-off events. For 3673/3673 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5498 event pairs, 45 based on Foata normal form. 1/1134 useless extension candidates. Maximal degree in co-relation 5159. Up to 463 conditions per place.
[2023-08-29 20:11:38,627 INFO L137 encePairwiseOnDemand]: 232/242 looper letters, 114 selfloop transitions, 39 changer transitions 0/153 dead transitions.
[2023-08-29 20:11:38,627 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 153 transitions, 1451 flow
[2023-08-29 20:11:38,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2023-08-29 20:11:38,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2023-08-29 20:11:38,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1448 transitions.
[2023-08-29 20:11:38,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42739079102715466
[2023-08-29 20:11:38,631 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1448 transitions.
[2023-08-29 20:11:38,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1448 transitions.
[2023-08-29 20:11:38,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-29 20:11:38,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1448 transitions.
[2023-08-29 20:11:38,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 103.42857142857143) internal successors, (1448), 14 states have internal predecessors, (1448), 0 states have call successors, (0), 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:11:38,640 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 242.0) internal successors, (3630), 15 states have internal predecessors, (3630), 0 states have call successors, (0), 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:11:38,641 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 242.0) internal successors, (3630), 15 states have internal predecessors, (3630), 0 states have call successors, (0), 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:11:38,641 INFO L175 Difference]: Start difference. First operand has 77 places, 72 transitions, 594 flow. Second operand 14 states and 1448 transitions.
[2023-08-29 20:11:38,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 153 transitions, 1451 flow
[2023-08-29 20:11:38,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 153 transitions, 1431 flow, removed 10 selfloop flow, removed 2 redundant places.
[2023-08-29 20:11:38,654 INFO L231 Difference]: Finished difference. Result has 89 places, 83 transitions, 825 flow
[2023-08-29 20:11:38,654 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=825, PETRI_PLACES=89, PETRI_TRANSITIONS=83}
[2023-08-29 20:11:38,655 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 47 predicate places.
[2023-08-29 20:11:38,655 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 83 transitions, 825 flow
[2023-08-29 20:11:38,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 98.75) internal successors, (790), 8 states have internal predecessors, (790), 0 states have call successors, (0), 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:11:38,656 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-29 20:11:38,656 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, 1]
[2023-08-29 20:11:38,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2023-08-29 20:11:38,656 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:11:38,656 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-29 20:11:38,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1305912024, now seen corresponding path program 3 times
[2023-08-29 20:11:38,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-29 20:11:38,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534040181]
[2023-08-29 20:11:38,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-29 20:11:38,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-29 20:11:38,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-29 20:11:39,785 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:11:39,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-29 20:11:39,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534040181]
[2023-08-29 20:11:39,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534040181] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-29 20:11:39,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-29 20:11:39,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-08-29 20:11:39,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475840889]
[2023-08-29 20:11:39,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-29 20:11:39,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-08-29 20:11:39,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-29 20:11:39,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-08-29 20:11:39,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2023-08-29 20:11:39,842 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 242
[2023-08-29 20:11:39,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 83 transitions, 825 flow. Second operand has 7 states, 7 states have (on average 105.57142857142857) internal successors, (739), 7 states have internal predecessors, (739), 0 states have call successors, (0), 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:11:39,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-29 20:11:39,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 242
[2023-08-29 20:11:39,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-29 20:11:40,180 INFO L130 PetriNetUnfolder]: 479/1006 cut-off events.
[2023-08-29 20:11:40,180 INFO L131 PetriNetUnfolder]: For 4719/4825 co-relation queries the response was YES.
[2023-08-29 20:11:40,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4864 conditions, 1006 events. 479/1006 cut-off events. For 4719/4825 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5655 event pairs, 41 based on Foata normal form. 8/989 useless extension candidates. Maximal degree in co-relation 4838. Up to 354 conditions per place.
[2023-08-29 20:11:40,188 INFO L137 encePairwiseOnDemand]: 235/242 looper letters, 71 selfloop transitions, 39 changer transitions 0/137 dead transitions.
[2023-08-29 20:11:40,189 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 137 transitions, 1469 flow
[2023-08-29 20:11:40,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2023-08-29 20:11:40,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2023-08-29 20:11:40,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1082 transitions.
[2023-08-29 20:11:40,192 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4471074380165289
[2023-08-29 20:11:40,192 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1082 transitions.
[2023-08-29 20:11:40,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1082 transitions.
[2023-08-29 20:11:40,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-29 20:11:40,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1082 transitions.
[2023-08-29 20:11:40,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 108.2) internal successors, (1082), 10 states have internal predecessors, (1082), 0 states have call successors, (0), 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:11:40,199 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 242.0) internal successors, (2662), 11 states have internal predecessors, (2662), 0 states have call successors, (0), 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:11:40,200 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 242.0) internal successors, (2662), 11 states have internal predecessors, (2662), 0 states have call successors, (0), 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:11:40,200 INFO L175 Difference]: Start difference. First operand has 89 places, 83 transitions, 825 flow. Second operand 10 states and 1082 transitions.
[2023-08-29 20:11:40,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 137 transitions, 1469 flow
[2023-08-29 20:11:40,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 137 transitions, 1364 flow, removed 9 selfloop flow, removed 11 redundant places.
[2023-08-29 20:11:40,215 INFO L231 Difference]: Finished difference. Result has 88 places, 98 transitions, 996 flow
[2023-08-29 20:11:40,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=996, PETRI_PLACES=88, PETRI_TRANSITIONS=98}
[2023-08-29 20:11:40,216 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 46 predicate places.
[2023-08-29 20:11:40,216 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 98 transitions, 996 flow
[2023-08-29 20:11:40,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 105.57142857142857) internal successors, (739), 7 states have internal predecessors, (739), 0 states have call successors, (0), 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:11:40,216 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-29 20:11:40,217 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, 1]
[2023-08-29 20:11:40,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2023-08-29 20:11:40,217 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:11:40,217 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-29 20:11:40,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1226118710, now seen corresponding path program 4 times
[2023-08-29 20:11:40,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-29 20:11:40,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502616669]
[2023-08-29 20:11:40,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-29 20:11:40,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-29 20:11:40,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-08-29 20:11:40,264 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-08-29 20:11:40,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-08-29 20:11:40,354 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-08-29 20:11:40,356 INFO L360 BasicCegarLoop]: Counterexample is feasible
[2023-08-29 20:11:40,358 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining)
[2023-08-29 20:11:40,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining)
[2023-08-29 20:11:40,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining)
[2023-08-29 20:11:40,360 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining)
[2023-08-29 20:11:40,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining)
[2023-08-29 20:11:40,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining)
[2023-08-29 20:11:40,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining)
[2023-08-29 20:11:40,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining)
[2023-08-29 20:11:40,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining)
[2023-08-29 20:11:40,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining)
[2023-08-29 20:11:40,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining)
[2023-08-29 20:11:40,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining)
[2023-08-29 20:11:40,364 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining)
[2023-08-29 20:11:40,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2023-08-29 20:11:40,365 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-29 20:11:40,370 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2023-08-29 20:11:40,371 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2023-08-29 20:11:40,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:11:40 BasicIcfg
[2023-08-29 20:11:40,438 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-08-29 20:11:40,439 INFO L113 PluginConnector]: ------------------------Witness Printer----------------------------
[2023-08-29 20:11:40,439 INFO L271 PluginConnector]: Initializing Witness Printer...
[2023-08-29 20:11:40,439 INFO L275 PluginConnector]: Witness Printer initialized
[2023-08-29 20:11:40,440 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:11:24" (3/4) ...
[2023-08-29 20:11:40,442 INFO L140 WitnessPrinter]: No result that supports witness generation found
[2023-08-29 20:11:40,442 INFO L132 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2023-08-29 20:11:40,442 INFO L158 Benchmark]: Toolchain (without parser) took 17044.74ms. Allocated memory was 81.8MB in the beginning and 469.8MB in the end (delta: 388.0MB). Free memory was 61.2MB in the beginning and 283.2MB in the end (delta: -222.0MB). Peak memory consumption was 165.2MB. Max. memory is 16.1GB.
[2023-08-29 20:11:40,442 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 65.0MB. Free memory is still 42.9MB. There was no memory consumed. Max. memory is 16.1GB.
[2023-08-29 20:11:40,443 INFO L158 Benchmark]: CACSL2BoogieTranslator took 525.75ms. Allocated memory is still 81.8MB. Free memory was 61.0MB in the beginning and 56.6MB in the end (delta: 4.4MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB.
[2023-08-29 20:11:40,443 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.82ms. Allocated memory is still 81.8MB. Free memory was 56.6MB in the beginning and 53.9MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2023-08-29 20:11:40,443 INFO L158 Benchmark]: Boogie Preprocessor took 51.83ms. Allocated memory is still 81.8MB. Free memory was 53.9MB in the beginning and 51.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-08-29 20:11:40,443 INFO L158 Benchmark]: RCFGBuilder took 699.44ms. Allocated memory is still 81.8MB. Free memory was 51.8MB in the beginning and 35.1MB in the end (delta: 16.7MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB.
[2023-08-29 20:11:40,444 INFO L158 Benchmark]: TraceAbstraction took 15700.01ms. Allocated memory was 81.8MB in the beginning and 469.8MB in the end (delta: 388.0MB). Free memory was 34.2MB in the beginning and 283.2MB in the end (delta: -249.0MB). Peak memory consumption was 138.3MB. Max. memory is 16.1GB.
[2023-08-29 20:11:40,444 INFO L158 Benchmark]: Witness Printer took 2.86ms. Allocated memory is still 469.8MB. Free memory is still 283.2MB. There was no memory consumed. Max. memory is 16.1GB.
[2023-08-29 20:11:40,445 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.17ms. Allocated memory is still 65.0MB. Free memory is still 42.9MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 525.75ms. Allocated memory is still 81.8MB. Free memory was 61.0MB in the beginning and 56.6MB in the end (delta: 4.4MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 59.82ms. Allocated memory is still 81.8MB. Free memory was 56.6MB in the beginning and 53.9MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 51.83ms. Allocated memory is still 81.8MB. Free memory was 53.9MB in the beginning and 51.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 699.44ms. Allocated memory is still 81.8MB. Free memory was 51.8MB in the beginning and 35.1MB in the end (delta: 16.7MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB.
* TraceAbstraction took 15700.01ms. Allocated memory was 81.8MB in the beginning and 469.8MB in the end (delta: 388.0MB). Free memory was 34.2MB in the beginning and 283.2MB in the end (delta: -249.0MB). Peak memory consumption was 138.3MB. Max. memory is 16.1GB.
* Witness Printer took 2.86ms. Allocated memory is still 469.8MB. Free memory is still 283.2MB. 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.0s, 128 PlacesBefore, 42 PlacesAfterwards, 120 TransitionsBefore, 33 TransitionsAfterwards, 2200 CoEnabledTransitionPairs, 7 FixpointIterations, 53 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 119 TotalNumberOfCompositions, 6520 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3089, independent: 2887, independent conditional: 0, independent unconditional: 2887, dependent: 202, dependent conditional: 0, dependent unconditional: 202, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1214, independent: 1177, independent conditional: 0, independent unconditional: 1177, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3089, independent: 1710, independent conditional: 0, independent unconditional: 1710, dependent: 165, dependent conditional: 0, dependent unconditional: 165, unknown: 1214, unknown conditional: 0, unknown unconditional: 1214] , Statistics on independence cache: Total cache size (in pairs): 127, Positive cache size: 113, Positive conditional cache size: 0, Positive unconditional cache size: 113, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, 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_p0_EBX = 0;
[L715] 0 int __unbuffered_p1_EAX = 0;
[L717] 0 int __unbuffered_p1_EBX = 0;
[L719] 0 int __unbuffered_p2_EAX = 0;
[L721] 0 int __unbuffered_p2_EBX = 0;
[L722] 0 _Bool main$tmp_guard0;
[L723] 0 _Bool main$tmp_guard1;
[L725] 0 int x = 0;
[L727] 0 int y = 0;
[L728] 0 _Bool y$flush_delayed;
[L729] 0 int y$mem_tmp;
[L730] 0 _Bool y$r_buff0_thd0;
[L731] 0 _Bool y$r_buff0_thd1;
[L732] 0 _Bool y$r_buff0_thd2;
[L733] 0 _Bool y$r_buff0_thd3;
[L734] 0 _Bool y$r_buff1_thd0;
[L735] 0 _Bool y$r_buff1_thd1;
[L736] 0 _Bool y$r_buff1_thd2;
[L737] 0 _Bool y$r_buff1_thd3;
[L738] 0 _Bool y$read_delayed;
[L739] 0 int *y$read_delayed_var;
[L740] 0 int y$w_buff0;
[L741] 0 _Bool y$w_buff0_used;
[L742] 0 int y$w_buff1;
[L743] 0 _Bool y$w_buff1_used;
[L745] 0 int z = 0;
[L746] 0 _Bool weak$$choice0;
[L747] 0 _Bool weak$$choice2;
[L853] 0 pthread_t t17;
[L854] FCALL, FORK 0 pthread_create(&t17, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t17, ((void *)0), P0, ((void *)0))=-2, t17={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L855] 0 pthread_t t18;
[L856] FCALL, FORK 0 pthread_create(&t18, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t18, ((void *)0), P1, ((void *)0))=-1, t17={5:0}, t18={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L857] 0 pthread_t t19;
[L858] FCALL, FORK 0 pthread_create(&t19, ((void *)0), P2, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t19, ((void *)0), P2, ((void *)0))=0, t17={5:0}, t18={6:0}, t19={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L800] 3 y$w_buff1 = y$w_buff0
[L801] 3 y$w_buff0 = 1
[L802] 3 y$w_buff1_used = y$w_buff0_used
[L803] 3 y$w_buff0_used = (_Bool)1
[L804] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L18] COND FALSE 3 !(!expression)
[L804] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L805] 3 y$r_buff1_thd0 = y$r_buff0_thd0
[L806] 3 y$r_buff1_thd1 = y$r_buff0_thd1
[L807] 3 y$r_buff1_thd2 = y$r_buff0_thd2
[L808] 3 y$r_buff1_thd3 = y$r_buff0_thd3
[L809] 3 y$r_buff0_thd3 = (_Bool)1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L812] 3 weak$$choice0 = __VERIFIER_nondet_bool()
[L813] 3 weak$$choice2 = __VERIFIER_nondet_bool()
[L814] 3 y$flush_delayed = weak$$choice2
[L815] 3 y$mem_tmp = y
[L816] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L817] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L818] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L819] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L820] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L821] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L822] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L823] 3 __unbuffered_p2_EAX = y
[L824] 3 y = y$flush_delayed ? y$mem_tmp : y
[L825] 3 y$flush_delayed = (_Bool)0
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L828] 3 __unbuffered_p2_EBX = z
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L751] 1 z = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L754] 1 __unbuffered_p0_EAX = z
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L757] 1 __unbuffered_p0_EBX = x
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L769] 2 x = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L772] 2 __unbuffered_p1_EAX = x
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L775] 2 weak$$choice0 = __VERIFIER_nondet_bool()
[L776] 2 weak$$choice2 = __VERIFIER_nondet_bool()
[L777] 2 y$flush_delayed = weak$$choice2
[L778] 2 y$mem_tmp = y
[L779] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)
[L780] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))
[L781] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))
[L782] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))
[L783] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L784] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))
[L785] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L786] 2 __unbuffered_p1_EBX = y
[L787] 2 y = y$flush_delayed ? y$mem_tmp : y
[L788] 2 y$flush_delayed = (_Bool)0
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L831] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L832] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L833] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L834] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L835] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1]
[L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1
[L840] 3 return 0;
[L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1
[L764] 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 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L865] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L866] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L867] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L868] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t17={5:0}, t18={6:0}, t19={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1]
[L871] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, 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: 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.
- 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.
- 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: 15.5s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 936 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 722 mSDsluCounter, 406 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 323 mSDsCounter, 102 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2560 IncrementalHoareTripleChecker+Invalid, 2662 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 102 mSolverCounterUnsat, 83 mSDtfsCounter, 2560 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=996occurred in iteration=15, InterpolantAutomatonStates: 91, 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, 4.5s InterpolantComputationTime, 238 NumberOfCodeBlocks, 238 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 201 ConstructedInterpolants, 0 QuantifiedInterpolants, 2765 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:11:40,473 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/mix001.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 21c0308f80ae5e3a4b410ebaece3730b9f788bd0cc89fb6ef65f8dd9f7120f36 --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:11:42,374 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2023-08-29 20:11:42,376 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2023-08-29 20:11:42,416 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-08-29 20:11:42,417 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-08-29 20:11:42,418 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-08-29 20:11:42,419 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-08-29 20:11:42,420 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2023-08-29 20:11:42,422 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-08-29 20:11:42,422 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-08-29 20:11:42,423 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2023-08-29 20:11:42,426 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-08-29 20:11:42,427 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-08-29 20:11:42,430 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-08-29 20:11:42,431 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-08-29 20:11:42,432 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-08-29 20:11:42,432 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-08-29 20:11:42,433 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-08-29 20:11:42,434 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-08-29 20:11:42,435 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2023-08-29 20:11:42,437 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-08-29 20:11:42,446 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-08-29 20:11:42,450 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2023-08-29 20:11:42,450 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-08-29 20:11:42,459 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-08-29 20:11:42,460 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-08-29 20:11:42,463 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-08-29 20:11:42,464 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-08-29 20:11:42,466 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-08-29 20:11:42,466 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-08-29 20:11:42,467 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-08-29 20:11:42,468 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-08-29 20:11:42,470 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-08-29 20:11:42,471 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2023-08-29 20:11:42,472 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-08-29 20:11:42,472 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2023-08-29 20:11:42,472 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-08-29 20:11:42,473 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-08-29 20:11:42,473 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2023-08-29 20:11:42,473 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2023-08-29 20:11:42,474 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2023-08-29 20:11:42,475 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:11:42,501 INFO L113 SettingsManager]: Loading preferences was successful
[2023-08-29 20:11:42,501 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2023-08-29 20:11:42,502 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-08-29 20:11:42,502 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-08-29 20:11:42,503 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-08-29 20:11:42,503 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-08-29 20:11:42,504 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-08-29 20:11:42,504 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2023-08-29 20:11:42,504 INFO L138 SettingsManager]: * Use SBE=true
[2023-08-29 20:11:42,504 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-08-29 20:11:42,505 INFO L138 SettingsManager]: * sizeof long=4
[2023-08-29 20:11:42,505 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2023-08-29 20:11:42,505 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2023-08-29 20:11:42,506 INFO L138 SettingsManager]: * sizeof POINTER=4
[2023-08-29 20:11:42,506 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2023-08-29 20:11:42,506 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2023-08-29 20:11:42,506 INFO L138 SettingsManager]: * Bitprecise bitfields=true
[2023-08-29 20:11:42,506 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2023-08-29 20:11:42,506 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-08-29 20:11:42,507 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true
[2023-08-29 20:11:42,507 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true
[2023-08-29 20:11:42,507 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution
[2023-08-29 20:11:42,507 INFO L138 SettingsManager]: * sizeof long double=12
[2023-08-29 20:11:42,507 INFO L138 SettingsManager]: * Use constant arrays=true
[2023-08-29 20:11:42,507 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-08-29 20:11:42,507 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2023-08-29 20:11:42,508 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2023-08-29 20:11:42,508 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-08-29 20:11:42,508 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-08-29 20:11:42,508 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2023-08-29 20:11:42,508 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF
[2023-08-29 20:11:42,508 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt
[2023-08-29 20:11:42,509 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2023-08-29 20:11:42,509 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2023-08-29 20:11:42,509 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2023-08-29 20:11:42,509 INFO L138 SettingsManager]: * Logic for external solver=AUFBV
[2023-08-29 20:11:42,509 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-08-29 20:11:42,509 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 -> 21c0308f80ae5e3a4b410ebaece3730b9f788bd0cc89fb6ef65f8dd9f7120f36
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:11:42,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2023-08-29 20:11:42,832 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-08-29 20:11:42,835 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-08-29 20:11:42,836 INFO L271 PluginConnector]: Initializing CDTParser...
[2023-08-29 20:11:42,836 INFO L275 PluginConnector]: CDTParser initialized
[2023-08-29 20:11:42,838 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix001.opt.i
[2023-08-29 20:11:44,104 INFO L500 CDTParser]: Created temporary CDT project at NULL
[2023-08-29 20:11:44,395 INFO L351 CDTParser]: Found 1 translation units.
[2023-08-29 20:11:44,396 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix001.opt.i
[2023-08-29 20:11:44,409 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8621b5e97/3c10d287d5d44143ab0b1dbf953f3112/FLAG013672d50
[2023-08-29 20:11:44,423 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8621b5e97/3c10d287d5d44143ab0b1dbf953f3112
[2023-08-29 20:11:44,429 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-08-29 20:11:44,430 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements.
[2023-08-29 20:11:44,431 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-08-29 20:11:44,431 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-08-29 20:11:44,435 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2023-08-29 20:11:44,436 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:11:44" (1/1) ...
[2023-08-29 20:11:44,437 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d6bc93b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:11:44, skipping insertion in model container
[2023-08-29 20:11:44,439 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:11:44" (1/1) ...
[2023-08-29 20:11:44,444 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2023-08-29 20:11:44,500 INFO L178 MainTranslator]: Built tables and reachable declarations
[2023-08-29 20:11:44,623 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/mix001.opt.i[944,957]
[2023-08-29 20:11:44,864 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-08-29 20:11:44,881 INFO L203 MainTranslator]: Completed pre-run
[2023-08-29 20:11:44,892 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/mix001.opt.i[944,957]
[2023-08-29 20:11:44,955 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-08-29 20:11:45,010 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler.
[2023-08-29 20:11:45,011 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler.
[2023-08-29 20:11:45,017 INFO L208 MainTranslator]: Completed translation
[2023-08-29 20:11:45,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:11:45 WrapperNode
[2023-08-29 20:11:45,017 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-08-29 20:11:45,018 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-08-29 20:11:45,019 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-08-29 20:11:45,019 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2023-08-29 20:11:45,025 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:11:45" (1/1) ...
[2023-08-29 20:11:45,059 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:11:45" (1/1) ...
[2023-08-29 20:11:45,101 INFO L138 Inliner]: procedures = 179, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 153
[2023-08-29 20:11:45,102 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-08-29 20:11:45,102 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-08-29 20:11:45,103 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2023-08-29 20:11:45,103 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2023-08-29 20:11:45,111 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:11:45" (1/1) ...
[2023-08-29 20:11:45,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:11:45" (1/1) ...
[2023-08-29 20:11:45,125 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:11:45" (1/1) ...
[2023-08-29 20:11:45,125 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:11:45" (1/1) ...
[2023-08-29 20:11:45,133 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:11:45" (1/1) ...
[2023-08-29 20:11:45,146 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:11:45" (1/1) ...
[2023-08-29 20:11:45,148 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:11:45" (1/1) ...
[2023-08-29 20:11:45,149 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:11:45" (1/1) ...
[2023-08-29 20:11:45,152 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-08-29 20:11:45,153 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-08-29 20:11:45,153 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2023-08-29 20:11:45,153 INFO L275 PluginConnector]: RCFGBuilder initialized
[2023-08-29 20:11:45,154 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:11:45" (1/1) ...
[2023-08-29 20:11:45,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-08-29 20:11:45,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-08-29 20:11:45,186 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:11:45,210 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:11:45,225 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2023-08-29 20:11:45,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-08-29 20:11:45,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-08-29 20:11:45,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-08-29 20:11:45,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4
[2023-08-29 20:11:45,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1
[2023-08-29 20:11:45,226 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2023-08-29 20:11:45,226 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2023-08-29 20:11:45,226 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2023-08-29 20:11:45,226 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2023-08-29 20:11:45,227 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2023-08-29 20:11:45,227 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2023-08-29 20:11:45,227 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2023-08-29 20:11:45,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-08-29 20:11:45,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-08-29 20:11:45,229 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:11:45,367 INFO L236 CfgBuilder]: Building ICFG
[2023-08-29 20:11:45,369 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation
[2023-08-29 20:11:45,783 INFO L277 CfgBuilder]: Performing block encoding
[2023-08-29 20:11:45,889 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-08-29 20:11:45,890 INFO L302 CfgBuilder]: Removed 0 assume(true) statements.
[2023-08-29 20:11:45,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:11:45 BoogieIcfgContainer
[2023-08-29 20:11:45,892 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-08-29 20:11:45,904 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-08-29 20:11:45,904 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2023-08-29 20:11:45,907 INFO L275 PluginConnector]: TraceAbstraction initialized
[2023-08-29 20:11:45,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:11:44" (1/3) ...
[2023-08-29 20:11:45,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@181a890c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:11:45, skipping insertion in model container
[2023-08-29 20:11:45,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:11:45" (2/3) ...
[2023-08-29 20:11:45,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@181a890c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:11:45, skipping insertion in model container
[2023-08-29 20:11:45,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:11:45" (3/3) ...
[2023-08-29 20:11:45,910 INFO L112 eAbstractionObserver]: Analyzing ICFG mix001.opt.i
[2023-08-29 20:11:45,924 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-08-29 20:11:45,924 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations.
[2023-08-29 20:11:45,925 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-08-29 20:11:45,990 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-08-29 20:11:46,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 263 flow
[2023-08-29 20:11:46,095 INFO L130 PetriNetUnfolder]: 2/121 cut-off events.
[2023-08-29 20:11:46,096 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-08-29 20:11:46,102 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 83 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:11:46,102 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 124 transitions, 263 flow
[2023-08-29 20:11:46,108 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 121 transitions, 251 flow
[2023-08-29 20:11:46,111 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-08-29 20:11:46,119 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 121 transitions, 251 flow
[2023-08-29 20:11:46,121 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 121 transitions, 251 flow
[2023-08-29 20:11:46,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 121 transitions, 251 flow
[2023-08-29 20:11:46,153 INFO L130 PetriNetUnfolder]: 2/121 cut-off events.
[2023-08-29 20:11:46,153 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-08-29 20:11:46,155 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 83 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:11:46,157 INFO L119 LiptonReduction]: Number of co-enabled transitions 2200
[2023-08-29 20:11:52,577 INFO L134 LiptonReduction]: Checked pairs total: 6629
[2023-08-29 20:11:52,577 INFO L136 LiptonReduction]: Total number of compositions: 122
[2023-08-29 20:11:52,588 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-08-29 20:11:52,593 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;@354142b1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-08-29 20:11:52,593 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations.
[2023-08-29 20:11:52,595 INFO L130 PetriNetUnfolder]: 0/0 cut-off events.
[2023-08-29 20:11:52,595 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-08-29 20:11:52,595 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-29 20:11:52,596 INFO L208 CegarLoopForPetriNet]: trace histogram [1]
[2023-08-29 20:11:52,596 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] ===
[2023-08-29 20:11:52,600 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-29 20:11:52,601 INFO L85 PathProgramCache]: Analyzing trace with hash 557, now seen corresponding path program 1 times
[2023-08-29 20:11:52,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-08-29 20:11:52,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1064380285]
[2023-08-29 20:11:52,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-29 20:11:52,613 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:11:52,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-08-29 20:11:52,616 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:11:52,619 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:11:52,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-29 20:11:52,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core
[2023-08-29 20:11:52,712 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2023-08-29 20:11:52,715 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:11:52,715 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-08-29 20:11:52,716 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-08-29 20:11:52,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1064380285]
[2023-08-29 20:11:52,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1064380285] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-29 20:11:52,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-29 20:11:52,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-08-29 20:11:52,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652362307]
[2023-08-29 20:11:52,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-29 20:11:52,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-08-29 20:11:52,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-08-29 20:11:52,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-08-29 20:11:52,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-08-29 20:11:52,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 246
[2023-08-29 20:11:52,759 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 75 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:11:52,759 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-29 20:11:52,760 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 246
[2023-08-29 20:11:52,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-29 20:11:53,102 INFO L130 PetriNetUnfolder]: 1101/1671 cut-off events.
[2023-08-29 20:11:53,102 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES.
[2023-08-29 20:11:53,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3344 conditions, 1671 events. 1101/1671 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 8519 event pairs, 1101 based on Foata normal form. 0/1411 useless extension candidates. Maximal degree in co-relation 3333. Up to 1637 conditions per place.
[2023-08-29 20:11:53,114 INFO L137 encePairwiseOnDemand]: 239/246 looper letters, 22 selfloop transitions, 0 changer transitions 0/26 dead transitions.
[2023-08-29 20:11:53,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 105 flow
[2023-08-29 20:11:53,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2023-08-29 20:11:53,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-08-29 20:11:53,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 253 transitions.
[2023-08-29 20:11:53,126 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142276422764228
[2023-08-29 20:11:53,126 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 253 transitions.
[2023-08-29 20:11:53,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 253 transitions.
[2023-08-29 20:11:53,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-29 20:11:53,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 253 transitions.
[2023-08-29 20:11:53,132 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:11:53,139 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 0 states have call successors, (0), 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:11:53,140 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 0 states have call successors, (0), 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:11:53,142 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 75 flow. Second operand 2 states and 253 transitions.
[2023-08-29 20:11:53,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 105 flow
[2023-08-29 20:11:53,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 26 transitions, 102 flow, removed 0 selfloop flow, removed 3 redundant places.
[2023-08-29 20:11:53,149 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 58 flow
[2023-08-29 20:11:53,151 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=58, PETRI_PLACES=34, PETRI_TRANSITIONS=26}
[2023-08-29 20:11:53,155 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -8 predicate places.
[2023-08-29 20:11:53,156 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 58 flow
[2023-08-29 20:11:53,156 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:11:53,156 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-29 20:11:53,156 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-08-29 20:11:53,172 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:11:53,365 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:11:53,366 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:11:53,366 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-29 20:11:53,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1982083978, now seen corresponding path program 1 times
[2023-08-29 20:11:53,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-08-29 20:11:53,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [705462813]
[2023-08-29 20:11:53,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-29 20:11:53,368 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:11:53,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-08-29 20:11:53,374 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:11:53,378 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:11:53,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-29 20:11:53,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core
[2023-08-29 20:11:53,464 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2023-08-29 20:11:53,493 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:11:53,494 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-08-29 20:11:53,494 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-08-29 20:11:53,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [705462813]
[2023-08-29 20:11:53,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [705462813] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-29 20:11:53,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-29 20:11:53,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-08-29 20:11:53,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731500804]
[2023-08-29 20:11:53,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-29 20:11:53,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-08-29 20:11:53,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-08-29 20:11:53,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-08-29 20:11:53,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-08-29 20:11:53,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 246
[2023-08-29 20:11:53,506 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 58 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:11:53,506 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-29 20:11:53,506 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 246
[2023-08-29 20:11:53,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-29 20:11:53,713 INFO L130 PetriNetUnfolder]: 910/1453 cut-off events.
[2023-08-29 20:11:53,713 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-08-29 20:11:53,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2849 conditions, 1453 events. 910/1453 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 7810 event pairs, 146 based on Foata normal form. 0/1328 useless extension candidates. Maximal degree in co-relation 2846. Up to 1101 conditions per place.
[2023-08-29 20:11:53,720 INFO L137 encePairwiseOnDemand]: 243/246 looper letters, 28 selfloop transitions, 2 changer transitions 2/36 dead transitions.
[2023-08-29 20:11:53,720 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 142 flow
[2023-08-29 20:11:53,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-08-29 20:11:53,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-08-29 20:11:53,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions.
[2023-08-29 20:11:53,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4959349593495935
[2023-08-29 20:11:53,723 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 366 transitions.
[2023-08-29 20:11:53,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 366 transitions.
[2023-08-29 20:11:53,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-29 20:11:53,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 366 transitions.
[2023-08-29 20:11:53,730 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:11:53,733 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 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:11:53,733 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 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:11:53,734 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 58 flow. Second operand 3 states and 366 transitions.
[2023-08-29 20:11:53,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 142 flow
[2023-08-29 20:11:53,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 36 transitions, 142 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-08-29 20:11:53,735 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 58 flow
[2023-08-29 20:11:53,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=35, PETRI_TRANSITIONS=24}
[2023-08-29 20:11:53,736 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -7 predicate places.
[2023-08-29 20:11:53,736 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 58 flow
[2023-08-29 20:11:53,737 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:11:53,737 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-29 20:11:53,737 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-29 20:11:53,749 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:11:53,946 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:11:53,947 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:11:53,947 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-29 20:11:53,947 INFO L85 PathProgramCache]: Analyzing trace with hash 2112265576, now seen corresponding path program 1 times
[2023-08-29 20:11:53,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-08-29 20:11:53,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [301925093]
[2023-08-29 20:11:53,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-29 20:11:53,948 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:11:53,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-08-29 20:11:53,949 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:11:53,953 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:11:54,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-29 20:11:54,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjunts are in the unsatisfiable core
[2023-08-29 20:11:54,029 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2023-08-29 20:11:54,074 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:11:54,075 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-08-29 20:11:54,075 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-08-29 20:11:54,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [301925093]
[2023-08-29 20:11:54,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [301925093] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-29 20:11:54,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-29 20:11:54,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-08-29 20:11:54,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691811254]
[2023-08-29 20:11:54,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-29 20:11:54,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-08-29 20:11:54,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-08-29 20:11:54,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-08-29 20:11:54,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-08-29 20:11:54,094 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 246
[2023-08-29 20:11:54,095 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 58 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:11:54,095 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-29 20:11:54,095 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 246
[2023-08-29 20:11:54,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-29 20:11:54,304 INFO L130 PetriNetUnfolder]: 514/857 cut-off events.
[2023-08-29 20:11:54,304 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES.
[2023-08-29 20:11:54,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1793 conditions, 857 events. 514/857 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4147 event pairs, 96 based on Foata normal form. 60/877 useless extension candidates. Maximal degree in co-relation 1789. Up to 609 conditions per place.
[2023-08-29 20:11:54,309 INFO L137 encePairwiseOnDemand]: 240/246 looper letters, 29 selfloop transitions, 4 changer transitions 19/56 dead transitions.
[2023-08-29 20:11:54,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 56 transitions, 236 flow
[2023-08-29 20:11:54,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-08-29 20:11:54,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-08-29 20:11:54,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions.
[2023-08-29 20:11:54,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4788617886178862
[2023-08-29 20:11:54,311 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 589 transitions.
[2023-08-29 20:11:54,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 589 transitions.
[2023-08-29 20:11:54,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-29 20:11:54,312 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 589 transitions.
[2023-08-29 20:11:54,314 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:11:54,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 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:11:54,316 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 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:11:54,317 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 58 flow. Second operand 5 states and 589 transitions.
[2023-08-29 20:11:54,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 56 transitions, 236 flow
[2023-08-29 20:11:54,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 56 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-08-29 20:11:54,319 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 90 flow
[2023-08-29 20:11:54,319 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=90, PETRI_PLACES=39, PETRI_TRANSITIONS=27}
[2023-08-29 20:11:54,320 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places.
[2023-08-29 20:11:54,320 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 90 flow
[2023-08-29 20:11:54,320 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:11:54,320 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-29 20:11:54,321 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-29 20:11:54,335 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:11:54,530 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:11:54,530 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:11:54,531 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-29 20:11:54,531 INFO L85 PathProgramCache]: Analyzing trace with hash -632038657, now seen corresponding path program 1 times
[2023-08-29 20:11:54,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-08-29 20:11:54,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [121056913]
[2023-08-29 20:11:54,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-29 20:11:54,531 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:11:54,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-08-29 20:11:54,534 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:11:54,536 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:11:54,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-29 20:11:54,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core
[2023-08-29 20:11:54,615 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2023-08-29 20:11:54,653 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:11:54,653 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-08-29 20:11:54,653 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-08-29 20:11:54,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [121056913]
[2023-08-29 20:11:54,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [121056913] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-29 20:11:54,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-29 20:11:54,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-08-29 20:11:54,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110706665]
[2023-08-29 20:11:54,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-29 20:11:54,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-08-29 20:11:54,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-08-29 20:11:54,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-08-29 20:11:54,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2023-08-29 20:11:54,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 246
[2023-08-29 20:11:54,676 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 90 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:11:54,676 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-29 20:11:54,676 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 246
[2023-08-29 20:11:54,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-29 20:11:54,878 INFO L130 PetriNetUnfolder]: 208/397 cut-off events.
[2023-08-29 20:11:54,878 INFO L131 PetriNetUnfolder]: For 147/147 co-relation queries the response was YES.
[2023-08-29 20:11:54,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1076 conditions, 397 events. 208/397 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1669 event pairs, 44 based on Foata normal form. 36/419 useless extension candidates. Maximal degree in co-relation 1069. Up to 136 conditions per place.
[2023-08-29 20:11:54,880 INFO L137 encePairwiseOnDemand]: 240/246 looper letters, 37 selfloop transitions, 7 changer transitions 19/67 dead transitions.
[2023-08-29 20:11:54,880 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 67 transitions, 340 flow
[2023-08-29 20:11:54,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2023-08-29 20:11:54,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-08-29 20:11:54,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 707 transitions.
[2023-08-29 20:11:54,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47899728997289975
[2023-08-29 20:11:54,883 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 707 transitions.
[2023-08-29 20:11:54,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 707 transitions.
[2023-08-29 20:11:54,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-29 20:11:54,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 707 transitions.
[2023-08-29 20:11:54,885 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:11:54,888 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 246.0) internal successors, (1722), 7 states have internal predecessors, (1722), 0 states have call successors, (0), 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:11:54,888 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 246.0) internal successors, (1722), 7 states have internal predecessors, (1722), 0 states have call successors, (0), 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:11:54,889 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 90 flow. Second operand 6 states and 707 transitions.
[2023-08-29 20:11:54,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 67 transitions, 340 flow
[2023-08-29 20:11:54,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 67 transitions, 334 flow, removed 1 selfloop flow, removed 2 redundant places.
[2023-08-29 20:11:54,892 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 140 flow
[2023-08-29 20:11:54,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=35, 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=6, PETRI_FLOW=140, PETRI_PLACES=43, PETRI_TRANSITIONS=30}
[2023-08-29 20:11:54,893 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places.
[2023-08-29 20:11:54,893 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 140 flow
[2023-08-29 20:11:54,893 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:11:54,893 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-29 20:11:54,893 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-29 20:11:54,905 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:11:55,103 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:11:55,103 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:11:55,104 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-29 20:11:55,104 INFO L85 PathProgramCache]: Analyzing trace with hash 2050518102, now seen corresponding path program 1 times
[2023-08-29 20:11:55,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-08-29 20:11:55,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [84110599]
[2023-08-29 20:11:55,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-29 20:11:55,105 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:11:55,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-08-29 20:11:55,106 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:11:55,109 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:11:55,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-29 20:11:55,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 7 conjunts are in the unsatisfiable core
[2023-08-29 20:11:55,201 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2023-08-29 20:11:55,261 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:11:55,261 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-08-29 20:11:55,262 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-08-29 20:11:55,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [84110599]
[2023-08-29 20:11:55,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [84110599] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-29 20:11:55,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-29 20:11:55,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-08-29 20:11:55,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845161060]
[2023-08-29 20:11:55,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-29 20:11:55,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-08-29 20:11:55,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-08-29 20:11:55,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-08-29 20:11:55,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2023-08-29 20:11:55,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 246
[2023-08-29 20:11:55,292 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 140 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:11:55,292 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-29 20:11:55,292 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 246
[2023-08-29 20:11:55,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-29 20:11:55,528 INFO L130 PetriNetUnfolder]: 120/238 cut-off events.
[2023-08-29 20:11:55,528 INFO L131 PetriNetUnfolder]: For 263/263 co-relation queries the response was YES.
[2023-08-29 20:11:55,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 718 conditions, 238 events. 120/238 cut-off events. For 263/263 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 866 event pairs, 39 based on Foata normal form. 10/243 useless extension candidates. Maximal degree in co-relation 709. Up to 90 conditions per place.
[2023-08-29 20:11:55,529 INFO L137 encePairwiseOnDemand]: 240/246 looper letters, 34 selfloop transitions, 10 changer transitions 10/58 dead transitions.
[2023-08-29 20:11:55,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 58 transitions, 338 flow
[2023-08-29 20:11:55,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2023-08-29 20:11:55,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-08-29 20:11:55,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 805 transitions.
[2023-08-29 20:11:55,532 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46747967479674796
[2023-08-29 20:11:55,532 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 805 transitions.
[2023-08-29 20:11:55,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 805 transitions.
[2023-08-29 20:11:55,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-29 20:11:55,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 805 transitions.
[2023-08-29 20:11:55,534 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:11:55,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 0 states have call successors, (0), 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:11:55,538 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 0 states have call successors, (0), 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:11:55,538 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 140 flow. Second operand 7 states and 805 transitions.
[2023-08-29 20:11:55,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 58 transitions, 338 flow
[2023-08-29 20:11:55,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 58 transitions, 302 flow, removed 14 selfloop flow, removed 4 redundant places.
[2023-08-29 20:11:55,541 INFO L231 Difference]: Finished difference. Result has 46 places, 30 transitions, 142 flow
[2023-08-29 20:11:55,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=142, PETRI_PLACES=46, PETRI_TRANSITIONS=30}
[2023-08-29 20:11:55,542 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places.
[2023-08-29 20:11:55,542 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 30 transitions, 142 flow
[2023-08-29 20:11:55,543 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:11:55,543 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-29 20:11:55,543 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, 1]
[2023-08-29 20:11:55,552 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:11:55,752 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:11:55,752 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:11:55,753 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-29 20:11:55,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1006782031, now seen corresponding path program 1 times
[2023-08-29 20:11:55,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-08-29 20:11:55,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1587693272]
[2023-08-29 20:11:55,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-29 20:11:55,753 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:11:55,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-08-29 20:11:55,754 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:11:55,756 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:11:55,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-29 20:11:55,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 6 conjunts are in the unsatisfiable core
[2023-08-29 20:11:55,870 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2023-08-29 20:11:55,902 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:11:55,903 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-08-29 20:11:55,903 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-08-29 20:11:55,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1587693272]
[2023-08-29 20:11:55,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1587693272] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-29 20:11:55,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-29 20:11:55,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-08-29 20:11:55,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419047946]
[2023-08-29 20:11:55,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-29 20:11:55,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-08-29 20:11:55,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-08-29 20:11:55,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-08-29 20:11:55,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-08-29 20:11:55,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 246
[2023-08-29 20:11:55,915 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 30 transitions, 142 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:11:55,915 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-29 20:11:55,915 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 246
[2023-08-29 20:11:55,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-29 20:11:56,056 INFO L130 PetriNetUnfolder]: 202/399 cut-off events.
[2023-08-29 20:11:56,057 INFO L131 PetriNetUnfolder]: For 418/418 co-relation queries the response was YES.
[2023-08-29 20:11:56,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1166 conditions, 399 events. 202/399 cut-off events. For 418/418 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1695 event pairs, 35 based on Foata normal form. 0/397 useless extension candidates. Maximal degree in co-relation 1156. Up to 203 conditions per place.
[2023-08-29 20:11:56,059 INFO L137 encePairwiseOnDemand]: 243/246 looper letters, 55 selfloop transitions, 2 changer transitions 0/60 dead transitions.
[2023-08-29 20:11:56,059 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 60 transitions, 414 flow
[2023-08-29 20:11:56,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2023-08-29 20:11:56,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-08-29 20:11:56,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 476 transitions.
[2023-08-29 20:11:56,061 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.483739837398374
[2023-08-29 20:11:56,061 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 476 transitions.
[2023-08-29 20:11:56,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 476 transitions.
[2023-08-29 20:11:56,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-29 20:11:56,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 476 transitions.
[2023-08-29 20:11:56,063 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:11:56,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 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:11:56,065 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 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:11:56,065 INFO L175 Difference]: Start difference. First operand has 46 places, 30 transitions, 142 flow. Second operand 4 states and 476 transitions.
[2023-08-29 20:11:56,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 60 transitions, 414 flow
[2023-08-29 20:11:56,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 60 transitions, 334 flow, removed 24 selfloop flow, removed 6 redundant places.
[2023-08-29 20:11:56,069 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 117 flow
[2023-08-29 20:11:56,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=38, 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=117, PETRI_PLACES=43, PETRI_TRANSITIONS=31}
[2023-08-29 20:11:56,070 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places.
[2023-08-29 20:11:56,070 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 117 flow
[2023-08-29 20:11:56,070 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:11:56,070 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-29 20:11:56,070 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, 1]
[2023-08-29 20:11:56,083 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:11:56,280 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:11:56,281 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:11:56,281 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-29 20:11:56,281 INFO L85 PathProgramCache]: Analyzing trace with hash -595773561, now seen corresponding path program 2 times
[2023-08-29 20:11:56,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-08-29 20:11:56,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1905267350]
[2023-08-29 20:11:56,282 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-08-29 20:11:56,282 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:11:56,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-08-29 20:11:56,283 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:11:56,284 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:11:56,390 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2023-08-29 20:11:56,391 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2023-08-29 20:11:56,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 6 conjunts are in the unsatisfiable core
[2023-08-29 20:11:56,397 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2023-08-29 20:11:56,440 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:11:56,441 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-08-29 20:11:56,441 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-08-29 20:11:56,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1905267350]
[2023-08-29 20:11:56,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1905267350] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-29 20:11:56,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-29 20:11:56,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-08-29 20:11:56,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070554559]
[2023-08-29 20:11:56,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-29 20:11:56,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-08-29 20:11:56,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-08-29 20:11:56,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-08-29 20:11:56,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-08-29 20:11:56,452 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 246
[2023-08-29 20:11:56,452 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 117 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:11:56,453 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-29 20:11:56,453 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 246
[2023-08-29 20:11:56,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-29 20:11:56,599 INFO L130 PetriNetUnfolder]: 227/483 cut-off events.
[2023-08-29 20:11:56,599 INFO L131 PetriNetUnfolder]: For 440/440 co-relation queries the response was YES.
[2023-08-29 20:11:56,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1368 conditions, 483 events. 227/483 cut-off events. For 440/440 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2430 event pairs, 44 based on Foata normal form. 1/474 useless extension candidates. Maximal degree in co-relation 1359. Up to 277 conditions per place.
[2023-08-29 20:11:56,602 INFO L137 encePairwiseOnDemand]: 243/246 looper letters, 55 selfloop transitions, 2 changer transitions 0/61 dead transitions.
[2023-08-29 20:11:56,602 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 61 transitions, 353 flow
[2023-08-29 20:11:56,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2023-08-29 20:11:56,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-08-29 20:11:56,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 476 transitions.
[2023-08-29 20:11:56,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.483739837398374
[2023-08-29 20:11:56,604 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 476 transitions.
[2023-08-29 20:11:56,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 476 transitions.
[2023-08-29 20:11:56,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-29 20:11:56,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 476 transitions.
[2023-08-29 20:11:56,606 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:11:56,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 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:11:56,608 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 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:11:56,608 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 117 flow. Second operand 4 states and 476 transitions.
[2023-08-29 20:11:56,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 61 transitions, 353 flow
[2023-08-29 20:11:56,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 61 transitions, 350 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-08-29 20:11:56,611 INFO L231 Difference]: Finished difference. Result has 47 places, 32 transitions, 129 flow
[2023-08-29 20:11:56,611 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=129, PETRI_PLACES=47, PETRI_TRANSITIONS=32}
[2023-08-29 20:11:56,612 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 5 predicate places.
[2023-08-29 20:11:56,612 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 32 transitions, 129 flow
[2023-08-29 20:11:56,612 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:11:56,613 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-29 20:11:56,613 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, 1]
[2023-08-29 20:11:56,633 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:11:56,825 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:11:56,825 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:11:56,826 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-29 20:11:56,826 INFO L85 PathProgramCache]: Analyzing trace with hash 803591675, now seen corresponding path program 3 times
[2023-08-29 20:11:56,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-08-29 20:11:56,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [30315678]
[2023-08-29 20:11:56,826 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2023-08-29 20:11:56,827 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:11:56,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-08-29 20:11:56,828 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:11:56,828 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:11:56,931 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s)
[2023-08-29 20:11:56,931 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2023-08-29 20:11:56,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 19 conjunts are in the unsatisfiable core
[2023-08-29 20:11:56,938 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2023-08-29 20:11:57,791 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:11:57,791 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-08-29 20:11:57,791 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace
[2023-08-29 20:11:57,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [30315678]
[2023-08-29 20:11:57,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [30315678] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-29 20:11:57,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-29 20:11:57,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-08-29 20:11:57,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436705185]
[2023-08-29 20:11:57,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-29 20:11:57,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-08-29 20:11:57,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF
[2023-08-29 20:11:57,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-08-29 20:11:57,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2023-08-29 20:11:57,851 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 246
[2023-08-29 20:11:57,852 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 32 transitions, 129 flow. Second operand has 7 states, 7 states have (on average 108.57142857142857) internal successors, (760), 7 states have internal predecessors, (760), 0 states have call successors, (0), 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:11:57,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-29 20:11:57,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 246
[2023-08-29 20:11:57,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-29 20:11:58,175 INFO L130 PetriNetUnfolder]: 226/504 cut-off events.
[2023-08-29 20:11:58,175 INFO L131 PetriNetUnfolder]: For 561/563 co-relation queries the response was YES.
[2023-08-29 20:11:58,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1555 conditions, 504 events. 226/504 cut-off events. For 561/563 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2642 event pairs, 58 based on Foata normal form. 1/491 useless extension candidates. Maximal degree in co-relation 1544. Up to 136 conditions per place.
[2023-08-29 20:11:58,178 INFO L137 encePairwiseOnDemand]: 239/246 looper letters, 54 selfloop transitions, 7 changer transitions 0/67 dead transitions.
[2023-08-29 20:11:58,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 67 transitions, 423 flow
[2023-08-29 20:11:58,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2023-08-29 20:11:58,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-08-29 20:11:58,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 892 transitions.
[2023-08-29 20:11:58,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4532520325203252
[2023-08-29 20:11:58,181 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 892 transitions.
[2023-08-29 20:11:58,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 892 transitions.
[2023-08-29 20:11:58,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-29 20:11:58,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 892 transitions.
[2023-08-29 20:11:58,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 111.5) internal successors, (892), 8 states have internal predecessors, (892), 0 states have call successors, (0), 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:11:58,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 246.0) internal successors, (2214), 9 states have internal predecessors, (2214), 0 states have call successors, (0), 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:11:58,186 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 246.0) internal successors, (2214), 9 states have internal predecessors, (2214), 0 states have call successors, (0), 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:11:58,187 INFO L175 Difference]: Start difference. First operand has 47 places, 32 transitions, 129 flow. Second operand 8 states and 892 transitions.
[2023-08-29 20:11:58,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 67 transitions, 423 flow
[2023-08-29 20:11:58,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 67 transitions, 418 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-08-29 20:11:58,190 INFO L231 Difference]: Finished difference. Result has 55 places, 34 transitions, 154 flow
[2023-08-29 20:11:58,190 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=154, PETRI_PLACES=55, PETRI_TRANSITIONS=34}
[2023-08-29 20:11:58,191 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 13 predicate places.
[2023-08-29 20:11:58,191 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 34 transitions, 154 flow
[2023-08-29 20:11:58,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.57142857142857) internal successors, (760), 7 states have internal predecessors, (760), 0 states have call successors, (0), 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:11:58,191 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-29 20:11:58,192 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, 1]
[2023-08-29 20:11:58,204 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:11:58,401 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:11:58,402 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:11:58,402 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-29 20:11:58,402 INFO L85 PathProgramCache]: Analyzing trace with hash -388206359, now seen corresponding path program 4 times
[2023-08-29 20:11:58,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF
[2023-08-29 20:11:58,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1332577143]
[2023-08-29 20:11:58,403 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2023-08-29 20:11:58,403 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:11:58,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat
[2023-08-29 20:11:58,404 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null)
[2023-08-29 20:11:58,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process
[2023-08-29 20:11:58,541 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2023-08-29 20:11:58,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat
[2023-08-29 20:11:58,541 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-08-29 20:11:58,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-08-29 20:11:58,671 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace
[2023-08-29 20:11:58,671 INFO L360 BasicCegarLoop]: Counterexample is feasible
[2023-08-29 20:11:58,672 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining)
[2023-08-29 20:11:58,673 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining)
[2023-08-29 20:11:58,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining)
[2023-08-29 20:11:58,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining)
[2023-08-29 20:11:58,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining)
[2023-08-29 20:11:58,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining)
[2023-08-29 20:11:58,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining)
[2023-08-29 20:11:58,674 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining)
[2023-08-29 20:11:58,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining)
[2023-08-29 20:11:58,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining)
[2023-08-29 20:11:58,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining)
[2023-08-29 20:11:58,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining)
[2023-08-29 20:11:58,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining)
[2023-08-29 20:11:58,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0
[2023-08-29 20:11:58,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3
[2023-08-29 20:11:58,887 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1]
[2023-08-29 20:11:58,891 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2023-08-29 20:11:58,891 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2023-08-29 20:11:58,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:11:58 BasicIcfg
[2023-08-29 20:11:58,969 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-08-29 20:11:58,970 INFO L113 PluginConnector]: ------------------------Witness Printer----------------------------
[2023-08-29 20:11:58,970 INFO L271 PluginConnector]: Initializing Witness Printer...
[2023-08-29 20:11:58,970 INFO L275 PluginConnector]: Witness Printer initialized
[2023-08-29 20:11:58,971 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:11:45" (3/4) ...
[2023-08-29 20:11:58,973 INFO L140 WitnessPrinter]: No result that supports witness generation found
[2023-08-29 20:11:58,973 INFO L132 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2023-08-29 20:11:58,974 INFO L158 Benchmark]: Toolchain (without parser) took 14543.43ms. Allocated memory was 86.0MB in the beginning and 130.0MB in the end (delta: 44.0MB). Free memory was 62.7MB in the beginning and 85.1MB in the end (delta: -22.5MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB.
[2023-08-29 20:11:58,974 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 62.9MB. Free memory was 40.8MB in the beginning and 40.7MB in the end (delta: 98.0kB). There was no memory consumed. Max. memory is 16.1GB.
[2023-08-29 20:11:58,974 INFO L158 Benchmark]: CACSL2BoogieTranslator took 586.73ms. Allocated memory is still 86.0MB. Free memory was 62.4MB in the beginning and 57.9MB in the end (delta: 4.6MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB.
[2023-08-29 20:11:58,975 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.42ms. Allocated memory is still 86.0MB. Free memory was 57.9MB in the beginning and 55.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-08-29 20:11:58,980 INFO L158 Benchmark]: Boogie Preprocessor took 50.00ms. Allocated memory is still 86.0MB. Free memory was 55.4MB in the beginning and 52.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-08-29 20:11:58,981 INFO L158 Benchmark]: RCFGBuilder took 738.77ms. Allocated memory is still 86.0MB. Free memory was 52.8MB in the beginning and 35.1MB in the end (delta: 17.8MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB.
[2023-08-29 20:11:58,981 INFO L158 Benchmark]: TraceAbstraction took 13065.26ms. Allocated memory was 86.0MB in the beginning and 130.0MB in the end (delta: 44.0MB). Free memory was 62.6MB in the beginning and 85.1MB in the end (delta: -22.6MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB.
[2023-08-29 20:11:58,981 INFO L158 Benchmark]: Witness Printer took 2.97ms. Allocated memory is still 130.0MB. Free memory is still 85.1MB. There was no memory consumed. Max. memory is 16.1GB.
[2023-08-29 20:11:58,984 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 62.9MB. Free memory was 40.8MB in the beginning and 40.7MB in the end (delta: 98.0kB). There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 586.73ms. Allocated memory is still 86.0MB. Free memory was 62.4MB in the beginning and 57.9MB in the end (delta: 4.6MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 83.42ms. Allocated memory is still 86.0MB. Free memory was 57.9MB in the beginning and 55.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 50.00ms. Allocated memory is still 86.0MB. Free memory was 55.4MB in the beginning and 52.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* RCFGBuilder took 738.77ms. Allocated memory is still 86.0MB. Free memory was 52.8MB in the beginning and 35.1MB in the end (delta: 17.8MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB.
* TraceAbstraction took 13065.26ms. Allocated memory was 86.0MB in the beginning and 130.0MB in the end (delta: 44.0MB). Free memory was 62.6MB in the beginning and 85.1MB in the end (delta: -22.6MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB.
* Witness Printer took 2.97ms. Allocated memory is still 130.0MB. Free memory is still 85.1MB. 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.5s, 129 PlacesBefore, 42 PlacesAfterwards, 121 TransitionsBefore, 33 TransitionsAfterwards, 2200 CoEnabledTransitionPairs, 7 FixpointIterations, 54 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 122 TotalNumberOfCompositions, 6629 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2831, independent: 2627, independent conditional: 0, independent unconditional: 2627, dependent: 204, dependent conditional: 0, dependent unconditional: 204, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1207, independent: 1171, independent conditional: 0, independent unconditional: 1171, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2831, independent: 1456, independent conditional: 0, independent unconditional: 1456, dependent: 168, dependent conditional: 0, dependent unconditional: 168, unknown: 1207, unknown conditional: 0, unknown unconditional: 1207] , Statistics on independence cache: Total cache size (in pairs): 138, Positive cache size: 121, Positive conditional cache size: 0, Positive unconditional cache size: 121, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, 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_p0_EBX = 0;
[L715] 0 int __unbuffered_p1_EAX = 0;
[L717] 0 int __unbuffered_p1_EBX = 0;
[L719] 0 int __unbuffered_p2_EAX = 0;
[L721] 0 int __unbuffered_p2_EBX = 0;
[L722] 0 _Bool main$tmp_guard0;
[L723] 0 _Bool main$tmp_guard1;
[L725] 0 int x = 0;
[L727] 0 int y = 0;
[L728] 0 _Bool y$flush_delayed;
[L729] 0 int y$mem_tmp;
[L730] 0 _Bool y$r_buff0_thd0;
[L731] 0 _Bool y$r_buff0_thd1;
[L732] 0 _Bool y$r_buff0_thd2;
[L733] 0 _Bool y$r_buff0_thd3;
[L734] 0 _Bool y$r_buff1_thd0;
[L735] 0 _Bool y$r_buff1_thd1;
[L736] 0 _Bool y$r_buff1_thd2;
[L737] 0 _Bool y$r_buff1_thd3;
[L738] 0 _Bool y$read_delayed;
[L739] 0 int *y$read_delayed_var;
[L740] 0 int y$w_buff0;
[L741] 0 _Bool y$w_buff0_used;
[L742] 0 int y$w_buff1;
[L743] 0 _Bool y$w_buff1_used;
[L745] 0 int z = 0;
[L746] 0 _Bool weak$$choice0;
[L747] 0 _Bool weak$$choice2;
[L853] 0 pthread_t t17;
[L854] FCALL, FORK 0 pthread_create(&t17, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t17, ((void *)0), P0, ((void *)0))=16384, t17={-6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L855] 0 pthread_t t18;
[L856] FCALL, FORK 0 pthread_create(&t18, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t18, ((void *)0), P1, ((void *)0))=16385, t17={-6:0}, t18={-10:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L857] 0 pthread_t t19;
[L858] FCALL, FORK 0 pthread_create(&t19, ((void *)0), P2, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t19, ((void *)0), P2, ((void *)0))=16386, t17={-6:0}, t18={-10:0}, t19={-2:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L800] 3 y$w_buff1 = y$w_buff0
[L801] 3 y$w_buff0 = 1
[L802] 3 y$w_buff1_used = y$w_buff0_used
[L803] 3 y$w_buff0_used = (_Bool)1
[L804] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L18] COND FALSE 3 !(!expression)
[L804] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L805] 3 y$r_buff1_thd0 = y$r_buff0_thd0
[L806] 3 y$r_buff1_thd1 = y$r_buff0_thd1
[L807] 3 y$r_buff1_thd2 = y$r_buff0_thd2
[L808] 3 y$r_buff1_thd3 = y$r_buff0_thd3
[L809] 3 y$r_buff0_thd3 = (_Bool)1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L812] 3 weak$$choice0 = __VERIFIER_nondet_bool()
[L813] 3 weak$$choice2 = __VERIFIER_nondet_bool()
[L814] 3 y$flush_delayed = weak$$choice2
[L815] 3 y$mem_tmp = y
[L816] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)
[L817] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))
[L818] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1))
[L819] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used))
[L820] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L821] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3))
[L822] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L823] 3 __unbuffered_p2_EAX = y
[L824] 3 y = y$flush_delayed ? y$mem_tmp : y
[L825] 3 y$flush_delayed = (_Bool)0
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L828] 3 __unbuffered_p2_EBX = z
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L751] 1 z = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L754] 1 __unbuffered_p0_EAX = z
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L757] 1 __unbuffered_p0_EBX = x
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L769] 2 x = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L772] 2 __unbuffered_p1_EAX = x
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L775] 2 weak$$choice0 = __VERIFIER_nondet_bool()
[L776] 2 weak$$choice2 = __VERIFIER_nondet_bool()
[L777] 2 y$flush_delayed = weak$$choice2
[L778] 2 y$mem_tmp = y
[L779] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)
[L780] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))
[L781] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))
[L782] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))
[L783] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L784] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))
[L785] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))
[L786] 2 __unbuffered_p1_EBX = y
[L787] 2 y = y$flush_delayed ? y$mem_tmp : y
[L788] 2 y$flush_delayed = (_Bool)0
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1
[L764] 1 return 0;
[L831] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L832] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L833] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L834] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L835] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1]
[L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1
[L840] 3 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 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L865] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L866] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L867] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L868] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t17={-6:0}, t18={-10:0}, t19={-2:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1]
[L871] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 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=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, 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, 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: 12.9s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 249 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 205 mSDsluCounter, 74 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 62 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1004 IncrementalHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 12 mSDtfsCounter, 1004 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=154occurred in iteration=8, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 105 ConstructedInterpolants, 0 QuantifiedInterpolants, 503 SizeOfPredicates, 10 NumberOfNonLiveVariables, 983 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
[2023-08-29 20:11:59,009 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