./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/thin002_rmo.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/thin002_rmo.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.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 f0d8ae33a1a7c98578096fc4895533f629cc4062ad641b886abfeea14ddb85d4 --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:51:46,751 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:51:46,753 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:51:46,797 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:51:46,797 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:51:46,800 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:51:46,802 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:51:46,805 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:51:46,807 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:51:46,811 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:51:46,812 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:51:46,814 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:51:46,815 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:51:46,816 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:51:46,818 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:51:46,823 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:51:46,824 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:51:46,825 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:51:46,827 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:51:46,833 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:51:46,834 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:51:46,835 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:51:46,836 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:51:46,836 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:51:46,842 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:51:46,843 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:51:46,843 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:51:46,845 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:51:46,846 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:51:46,846 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:51:46,847 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:51:46,848 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:51:46,850 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:51:46,851 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:51:46,852 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:51:46,852 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:51:46,852 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:51:46,853 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:51:46,853 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:51:46,853 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:51:46,854 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:51:46,855 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:51:46,889 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:51:46,890 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:51:46,891 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:51:46,891 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:51:46,892 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:51:46,892 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:51:46,892 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:51:46,892 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:51:46,893 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:51:46,893 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:51:46,894 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:51:46,894 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:51:46,894 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:51:46,894 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:51:46,894 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:51:46,895 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:51:46,895 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:51:46,895 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:51:46,895 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:51:46,895 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:51:46,895 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:51:46,896 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:51:46,896 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:51:46,896 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:51:46,896 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:51:46,896 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:51:46,897 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:51:46,897 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:51:46,897 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 20:51:46,897 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 20:51:46,897 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:51:46,897 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:51:46,898 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:51:46,898 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:51:46,898 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 -> f0d8ae33a1a7c98578096fc4895533f629cc4062ad641b886abfeea14ddb85d4 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:51:47,202 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:51:47,229 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:51:47,232 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:51:47,233 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:51:47,233 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:51:47,234 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/thin002_rmo.i [2023-08-29 20:51:48,341 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:51:48,632 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:51:48,632 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/thin002_rmo.i [2023-08-29 20:51:48,646 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/009afc0b2/200626d296de4d7dbe114c320223ad37/FLAG239089e4b [2023-08-29 20:51:48,659 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/009afc0b2/200626d296de4d7dbe114c320223ad37 [2023-08-29 20:51:48,661 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:51:48,662 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:51:48,663 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:51:48,663 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:51:48,666 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:51:48,666 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:51:48" (1/1) ... [2023-08-29 20:51:48,667 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72a5b4f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:48, skipping insertion in model container [2023-08-29 20:51:48,667 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:51:48" (1/1) ... [2023-08-29 20:51:48,673 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:51:48,711 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:51:48,826 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/thin002_rmo.i[988,1001] [2023-08-29 20:51:49,017 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:51:49,030 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:51:49,048 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/thin002_rmo.i[988,1001] [2023-08-29 20:51:49,107 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:51:49,155 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:51:49,155 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:51:49,161 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:51:49,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:49 WrapperNode [2023-08-29 20:51:49,161 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:51:49,163 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:51:49,163 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:51:49,163 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:51:49,169 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:51:49" (1/1) ... [2023-08-29 20:51:49,206 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:51:49" (1/1) ... [2023-08-29 20:51:49,243 INFO L138 Inliner]: procedures = 177, calls = 80, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 155 [2023-08-29 20:51:49,249 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:51:49,249 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:51:49,250 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:51:49,250 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:51:49,258 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:49" (1/1) ... [2023-08-29 20:51:49,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:49" (1/1) ... [2023-08-29 20:51:49,278 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:49" (1/1) ... [2023-08-29 20:51:49,282 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:49" (1/1) ... [2023-08-29 20:51:49,289 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:49" (1/1) ... [2023-08-29 20:51:49,300 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:49" (1/1) ... [2023-08-29 20:51:49,312 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:49" (1/1) ... [2023-08-29 20:51:49,314 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:49" (1/1) ... [2023-08-29 20:51:49,317 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:51:49,318 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:51:49,318 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:51:49,318 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:51:49,319 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:49" (1/1) ... [2023-08-29 20:51:49,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:51:49,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:51:49,361 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:51:49,383 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:51:49,401 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-29 20:51:49,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 20:51:49,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:51:49,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:51:49,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:51:49,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:51:49,404 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:51:49,404 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:51:49,404 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:51:49,404 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:51:49,405 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:51:49,405 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:51:49,405 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-29 20:51:49,405 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-29 20:51:49,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 20:51:49,405 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:51:49,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:51:49,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:51:49,407 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:51:49,612 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:51:49,614 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:51:50,079 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:51:50,378 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:51:50,378 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:51:50,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:51:50 BoogieIcfgContainer [2023-08-29 20:51:50,381 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:51:50,383 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:51:50,383 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:51:50,386 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:51:50,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:51:48" (1/3) ... [2023-08-29 20:51:50,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@589dfddd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:51:50, skipping insertion in model container [2023-08-29 20:51:50,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:49" (2/3) ... [2023-08-29 20:51:50,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@589dfddd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:51:50, skipping insertion in model container [2023-08-29 20:51:50,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:51:50" (3/3) ... [2023-08-29 20:51:50,389 INFO L112 eAbstractionObserver]: Analyzing ICFG thin002_rmo.i [2023-08-29 20:51:50,404 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:51:50,405 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2023-08-29 20:51:50,405 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:51:50,521 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:51:50,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 194 places, 183 transitions, 386 flow [2023-08-29 20:51:50,658 INFO L130 PetriNetUnfolder]: 2/179 cut-off events. [2023-08-29 20:51:50,659 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:51:50,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 179 events. 2/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 200 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 116. Up to 2 conditions per place. [2023-08-29 20:51:50,665 INFO L82 GeneralOperation]: Start removeDead. Operand has 194 places, 183 transitions, 386 flow [2023-08-29 20:51:50,672 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 190 places, 179 transitions, 370 flow [2023-08-29 20:51:50,676 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:51:50,693 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 190 places, 179 transitions, 370 flow [2023-08-29 20:51:50,696 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 190 places, 179 transitions, 370 flow [2023-08-29 20:51:50,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 190 places, 179 transitions, 370 flow [2023-08-29 20:51:50,753 INFO L130 PetriNetUnfolder]: 2/179 cut-off events. [2023-08-29 20:51:50,753 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:51:50,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 179 events. 2/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 201 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 116. Up to 2 conditions per place. [2023-08-29 20:51:50,759 INFO L119 LiptonReduction]: Number of co-enabled transitions 6020 [2023-08-29 20:51:58,162 INFO L134 LiptonReduction]: Checked pairs total: 25065 [2023-08-29 20:51:58,163 INFO L136 LiptonReduction]: Total number of compositions: 162 [2023-08-29 20:51:58,174 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:51:58,180 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;@235e870b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:51:58,180 INFO L358 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2023-08-29 20:51:58,182 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:51:58,182 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:51:58,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:58,183 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:51:58,183 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-08-29 20:51:58,194 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:58,195 INFO L85 PathProgramCache]: Analyzing trace with hash 870, now seen corresponding path program 1 times [2023-08-29 20:51:58,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:51:58,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169446942] [2023-08-29 20:51:58,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:58,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:51:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:58,315 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:51:58,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:51:58,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169446942] [2023-08-29 20:51:58,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169446942] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:58,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:58,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:51:58,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743701928] [2023-08-29 20:51:58,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:58,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:51:58,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:51:58,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:51:58,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:51:58,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 345 [2023-08-29 20:51:58,359 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 67 transitions, 146 flow. Second operand has 2 states, 2 states have (on average 150.5) internal successors, (301), 2 states have internal predecessors, (301), 0 states have call successors, (0), 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:51:58,359 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:58,360 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 345 [2023-08-29 20:51:58,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:52:01,564 INFO L130 PetriNetUnfolder]: 18300/25103 cut-off events. [2023-08-29 20:52:01,566 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2023-08-29 20:52:01,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49797 conditions, 25103 events. 18300/25103 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 1530. Compared 158024 event pairs, 18300 based on Foata normal form. 0/15875 useless extension candidates. Maximal degree in co-relation 49785. Up to 24557 conditions per place. [2023-08-29 20:52:01,788 INFO L137 encePairwiseOnDemand]: 326/345 looper letters, 40 selfloop transitions, 0 changer transitions 0/47 dead transitions. [2023-08-29 20:52:01,788 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 47 transitions, 186 flow [2023-08-29 20:52:01,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:52:01,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:52:01,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 359 transitions. [2023-08-29 20:52:01,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5202898550724637 [2023-08-29 20:52:01,806 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 359 transitions. [2023-08-29 20:52:01,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 359 transitions. [2023-08-29 20:52:01,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:52:01,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 359 transitions. [2023-08-29 20:52:01,815 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 179.5) internal successors, (359), 2 states have internal predecessors, (359), 0 states have call successors, (0), 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:52:01,818 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 345.0) internal successors, (1035), 3 states have internal predecessors, (1035), 0 states have call successors, (0), 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:52:01,819 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 345.0) internal successors, (1035), 3 states have internal predecessors, (1035), 0 states have call successors, (0), 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:52:01,821 INFO L175 Difference]: Start difference. First operand has 79 places, 67 transitions, 146 flow. Second operand 2 states and 359 transitions. [2023-08-29 20:52:01,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 47 transitions, 186 flow [2023-08-29 20:52:01,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 47 transitions, 182 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 20:52:01,828 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 102 flow [2023-08-29 20:52:01,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=102, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2023-08-29 20:52:01,834 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, -22 predicate places. [2023-08-29 20:52:01,835 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 102 flow [2023-08-29 20:52:01,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 150.5) internal successors, (301), 2 states have internal predecessors, (301), 0 states have call successors, (0), 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:52:01,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:52:01,838 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 20:52:01,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 20:52:01,839 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-08-29 20:52:01,840 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:52:01,840 INFO L85 PathProgramCache]: Analyzing trace with hash 855741, now seen corresponding path program 1 times [2023-08-29 20:52:01,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:52:01,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571735655] [2023-08-29 20:52:01,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:52:01,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:52:01,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:52:02,119 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:52:02,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:52:02,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571735655] [2023-08-29 20:52:02,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571735655] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:52:02,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:52:02,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:52:02,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545205923] [2023-08-29 20:52:02,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:52:02,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:52:02,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:52:02,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:52:02,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:52:02,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 345 [2023-08-29 20:52:02,173 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:52:02,173 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:52:02,173 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 345 [2023-08-29 20:52:02,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:52:03,599 INFO L130 PetriNetUnfolder]: 8243/11526 cut-off events. [2023-08-29 20:52:03,600 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:52:03,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22831 conditions, 11526 events. 8243/11526 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 686. Compared 67403 event pairs, 8243 based on Foata normal form. 0/8467 useless extension candidates. Maximal degree in co-relation 22828. Up to 11196 conditions per place. [2023-08-29 20:52:03,667 INFO L137 encePairwiseOnDemand]: 338/345 looper letters, 33 selfloop transitions, 1 changer transitions 0/41 dead transitions. [2023-08-29 20:52:03,667 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 41 transitions, 158 flow [2023-08-29 20:52:03,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:52:03,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:52:03,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions. [2023-08-29 20:52:03,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4676328502415459 [2023-08-29 20:52:03,670 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 484 transitions. [2023-08-29 20:52:03,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 484 transitions. [2023-08-29 20:52:03,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:52:03,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 484 transitions. [2023-08-29 20:52:03,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 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:52:03,674 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 345.0) internal successors, (1380), 4 states have internal predecessors, (1380), 0 states have call successors, (0), 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:52:03,675 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 345.0) internal successors, (1380), 4 states have internal predecessors, (1380), 0 states have call successors, (0), 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:52:03,675 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 102 flow. Second operand 3 states and 484 transitions. [2023-08-29 20:52:03,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 41 transitions, 158 flow [2023-08-29 20:52:03,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 41 transitions, 158 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:52:03,677 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 92 flow [2023-08-29 20:52:03,677 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2023-08-29 20:52:03,678 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, -26 predicate places. [2023-08-29 20:52:03,678 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 92 flow [2023-08-29 20:52:03,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:52:03,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:52:03,679 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 20:52:03,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 20:52:03,679 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-08-29 20:52:03,679 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:52:03,680 INFO L85 PathProgramCache]: Analyzing trace with hash 855740, now seen corresponding path program 1 times [2023-08-29 20:52:03,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:52:03,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415708534] [2023-08-29 20:52:03,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:52:03,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:52:03,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:52:03,727 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:52:03,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:52:03,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415708534] [2023-08-29 20:52:03,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415708534] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:52:03,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:52:03,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:52:03,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333131758] [2023-08-29 20:52:03,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:52:03,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:52:03,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:52:03,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:52:03,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:52:03,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 345 [2023-08-29 20:52:03,772 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 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:52:03,772 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:52:03,772 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 345 [2023-08-29 20:52:03,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:52:04,890 INFO L130 PetriNetUnfolder]: 8968/12709 cut-off events. [2023-08-29 20:52:04,891 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:52:04,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25246 conditions, 12709 events. 8968/12709 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 758. Compared 76410 event pairs, 5131 based on Foata normal form. 0/10905 useless extension candidates. Maximal degree in co-relation 25242. Up to 6833 conditions per place. [2023-08-29 20:52:04,969 INFO L137 encePairwiseOnDemand]: 330/345 looper letters, 40 selfloop transitions, 9 changer transitions 0/53 dead transitions. [2023-08-29 20:52:04,970 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 53 transitions, 214 flow [2023-08-29 20:52:04,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:52:04,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:52:04,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions. [2023-08-29 20:52:04,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4676328502415459 [2023-08-29 20:52:04,972 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 484 transitions. [2023-08-29 20:52:04,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 484 transitions. [2023-08-29 20:52:04,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:52:04,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 484 transitions. [2023-08-29 20:52:04,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 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:52:04,976 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 345.0) internal successors, (1380), 4 states have internal predecessors, (1380), 0 states have call successors, (0), 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:52:04,977 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 345.0) internal successors, (1380), 4 states have internal predecessors, (1380), 0 states have call successors, (0), 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:52:04,977 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 92 flow. Second operand 3 states and 484 transitions. [2023-08-29 20:52:04,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 53 transitions, 214 flow [2023-08-29 20:52:04,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 53 transitions, 213 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:52:04,979 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 159 flow [2023-08-29 20:52:04,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=159, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2023-08-29 20:52:04,981 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, -25 predicate places. [2023-08-29 20:52:04,983 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 159 flow [2023-08-29 20:52:04,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 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:52:04,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:52:04,984 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:52:04,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 20:52:04,985 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-08-29 20:52:04,985 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:52:04,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1331303151, now seen corresponding path program 1 times [2023-08-29 20:52:04,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:52:04,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884007117] [2023-08-29 20:52:04,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:52:04,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:52:05,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:52:05,212 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:52:05,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:52:05,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884007117] [2023-08-29 20:52:05,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884007117] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:52:05,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:52:05,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:52:05,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135168450] [2023-08-29 20:52:05,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:52:05,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:52:05,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:52:05,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:52:05,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:52:05,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 345 [2023-08-29 20:52:05,224 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 159 flow. Second operand has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 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:52:05,224 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:52:05,224 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 345 [2023-08-29 20:52:05,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:52:06,405 INFO L130 PetriNetUnfolder]: 7723/11284 cut-off events. [2023-08-29 20:52:06,405 INFO L131 PetriNetUnfolder]: For 2348/2465 co-relation queries the response was YES. [2023-08-29 20:52:06,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27748 conditions, 11284 events. 7723/11284 cut-off events. For 2348/2465 co-relation queries the response was YES. Maximal size of possible extension queue 694. Compared 70170 event pairs, 4954 based on Foata normal form. 0/10218 useless extension candidates. Maximal degree in co-relation 27743. Up to 6975 conditions per place. [2023-08-29 20:52:06,497 INFO L137 encePairwiseOnDemand]: 341/345 looper letters, 63 selfloop transitions, 3 changer transitions 0/75 dead transitions. [2023-08-29 20:52:06,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 75 transitions, 387 flow [2023-08-29 20:52:06,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:52:06,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:52:06,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 506 transitions. [2023-08-29 20:52:06,500 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2023-08-29 20:52:06,500 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 506 transitions. [2023-08-29 20:52:06,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 506 transitions. [2023-08-29 20:52:06,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:52:06,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 506 transitions. [2023-08-29 20:52:06,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 0 states have call successors, (0), 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:52:06,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 345.0) internal successors, (1380), 4 states have internal predecessors, (1380), 0 states have call successors, (0), 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:52:06,505 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 345.0) internal successors, (1380), 4 states have internal predecessors, (1380), 0 states have call successors, (0), 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:52:06,505 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 159 flow. Second operand 3 states and 506 transitions. [2023-08-29 20:52:06,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 75 transitions, 387 flow [2023-08-29 20:52:06,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 75 transitions, 359 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:52:06,531 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 154 flow [2023-08-29 20:52:06,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-08-29 20:52:06,532 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, -24 predicate places. [2023-08-29 20:52:06,533 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 154 flow [2023-08-29 20:52:06,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 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:52:06,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:52:06,534 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:52:06,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 20:52:06,534 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-08-29 20:52:06,534 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:52:06,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1331303423, now seen corresponding path program 1 times [2023-08-29 20:52:06,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:52:06,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212025344] [2023-08-29 20:52:06,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:52:06,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:52:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:52:06,963 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:52:06,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:52:06,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212025344] [2023-08-29 20:52:06,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212025344] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:52:06,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:52:06,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:52:06,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010827212] [2023-08-29 20:52:06,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:52:06,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:52:06,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:52:06,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:52:06,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:52:06,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 345 [2023-08-29 20:52:06,973 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 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:52:06,973 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:52:06,973 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 345 [2023-08-29 20:52:06,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:52:08,137 INFO L130 PetriNetUnfolder]: 7692/11277 cut-off events. [2023-08-29 20:52:08,137 INFO L131 PetriNetUnfolder]: For 2251/2395 co-relation queries the response was YES. [2023-08-29 20:52:08,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27786 conditions, 11277 events. 7692/11277 cut-off events. For 2251/2395 co-relation queries the response was YES. Maximal size of possible extension queue 702. Compared 71236 event pairs, 3883 based on Foata normal form. 12/9962 useless extension candidates. Maximal degree in co-relation 27780. Up to 9866 conditions per place. [2023-08-29 20:52:08,215 INFO L137 encePairwiseOnDemand]: 341/345 looper letters, 56 selfloop transitions, 4 changer transitions 0/69 dead transitions. [2023-08-29 20:52:08,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 69 transitions, 346 flow [2023-08-29 20:52:08,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:52:08,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:52:08,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 502 transitions. [2023-08-29 20:52:08,217 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.485024154589372 [2023-08-29 20:52:08,218 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 502 transitions. [2023-08-29 20:52:08,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 502 transitions. [2023-08-29 20:52:08,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:52:08,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 502 transitions. [2023-08-29 20:52:08,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 0 states have call successors, (0), 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:52:08,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 345.0) internal successors, (1380), 4 states have internal predecessors, (1380), 0 states have call successors, (0), 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:52:08,222 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 345.0) internal successors, (1380), 4 states have internal predecessors, (1380), 0 states have call successors, (0), 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:52:08,222 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 154 flow. Second operand 3 states and 502 transitions. [2023-08-29 20:52:08,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 69 transitions, 346 flow [2023-08-29 20:52:08,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 69 transitions, 336 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:52:08,226 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 180 flow [2023-08-29 20:52:08,226 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2023-08-29 20:52:08,227 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, -23 predicate places. [2023-08-29 20:52:08,227 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 180 flow [2023-08-29 20:52:08,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 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:52:08,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:52:08,228 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:52:08,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 20:52:08,228 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-08-29 20:52:08,229 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:52:08,229 INFO L85 PathProgramCache]: Analyzing trace with hash 445037158, now seen corresponding path program 1 times [2023-08-29 20:52:08,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:52:08,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364563047] [2023-08-29 20:52:08,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:52:08,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:52:08,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:52:08,604 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:52:08,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:52:08,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364563047] [2023-08-29 20:52:08,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364563047] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:52:08,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:52:08,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:52:08,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333668920] [2023-08-29 20:52:08,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:52:08,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:52:08,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:52:08,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:52:08,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:52:08,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 345 [2023-08-29 20:52:08,620 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 180 flow. Second operand has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 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:52:08,620 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:52:08,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 345 [2023-08-29 20:52:08,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:52:09,506 INFO L130 PetriNetUnfolder]: 7453/11058 cut-off events. [2023-08-29 20:52:09,506 INFO L131 PetriNetUnfolder]: For 2257/2302 co-relation queries the response was YES. [2023-08-29 20:52:09,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27899 conditions, 11058 events. 7453/11058 cut-off events. For 2257/2302 co-relation queries the response was YES. Maximal size of possible extension queue 705. Compared 70725 event pairs, 1681 based on Foata normal form. 36/9965 useless extension candidates. Maximal degree in co-relation 27892. Up to 8428 conditions per place. [2023-08-29 20:52:09,579 INFO L137 encePairwiseOnDemand]: 342/345 looper letters, 55 selfloop transitions, 3 changer transitions 0/67 dead transitions. [2023-08-29 20:52:09,580 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 67 transitions, 352 flow [2023-08-29 20:52:09,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:52:09,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:52:09,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 493 transitions. [2023-08-29 20:52:09,582 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47632850241545893 [2023-08-29 20:52:09,582 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 493 transitions. [2023-08-29 20:52:09,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 493 transitions. [2023-08-29 20:52:09,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:52:09,583 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 493 transitions. [2023-08-29 20:52:09,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 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:52:09,586 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 345.0) internal successors, (1380), 4 states have internal predecessors, (1380), 0 states have call successors, (0), 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:52:09,586 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 345.0) internal successors, (1380), 4 states have internal predecessors, (1380), 0 states have call successors, (0), 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:52:09,587 INFO L175 Difference]: Start difference. First operand has 56 places, 49 transitions, 180 flow. Second operand 3 states and 493 transitions. [2023-08-29 20:52:09,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 67 transitions, 352 flow [2023-08-29 20:52:09,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 67 transitions, 348 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:52:09,589 INFO L231 Difference]: Finished difference. Result has 58 places, 49 transitions, 187 flow [2023-08-29 20:52:09,589 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=187, PETRI_PLACES=58, PETRI_TRANSITIONS=49} [2023-08-29 20:52:09,590 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, -21 predicate places. [2023-08-29 20:52:09,590 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 49 transitions, 187 flow [2023-08-29 20:52:09,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 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:52:09,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:52:09,591 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:52:09,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 20:52:09,591 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-08-29 20:52:09,592 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:52:09,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1244364154, now seen corresponding path program 1 times [2023-08-29 20:52:09,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:52:09,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097864181] [2023-08-29 20:52:09,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:52:09,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:52:09,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:52:09,852 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:52:09,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:52:09,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097864181] [2023-08-29 20:52:09,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097864181] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:52:09,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:52:09,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:52:09,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929261026] [2023-08-29 20:52:09,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:52:09,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:52:09,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:52:09,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:52:09,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:52:09,936 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 345 [2023-08-29 20:52:09,937 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 49 transitions, 187 flow. Second operand has 6 states, 6 states have (on average 145.33333333333334) internal successors, (872), 6 states have internal predecessors, (872), 0 states have call successors, (0), 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:52:09,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:52:09,937 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 345 [2023-08-29 20:52:09,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:52:10,780 INFO L130 PetriNetUnfolder]: 7894/11460 cut-off events. [2023-08-29 20:52:10,781 INFO L131 PetriNetUnfolder]: For 3112/3112 co-relation queries the response was YES. [2023-08-29 20:52:10,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29608 conditions, 11460 events. 7894/11460 cut-off events. For 3112/3112 co-relation queries the response was YES. Maximal size of possible extension queue 715. Compared 71775 event pairs, 3503 based on Foata normal form. 0/10592 useless extension candidates. Maximal degree in co-relation 29600. Up to 6965 conditions per place. [2023-08-29 20:52:10,845 INFO L137 encePairwiseOnDemand]: 342/345 looper letters, 66 selfloop transitions, 5 changer transitions 0/78 dead transitions. [2023-08-29 20:52:10,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 78 transitions, 421 flow [2023-08-29 20:52:10,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:52:10,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:52:10,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 631 transitions. [2023-08-29 20:52:10,848 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4572463768115942 [2023-08-29 20:52:10,848 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 631 transitions. [2023-08-29 20:52:10,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 631 transitions. [2023-08-29 20:52:10,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:52:10,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 631 transitions. [2023-08-29 20:52:10,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 157.75) internal successors, (631), 4 states have internal predecessors, (631), 0 states have call successors, (0), 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:52:10,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 345.0) internal successors, (1725), 5 states have internal predecessors, (1725), 0 states have call successors, (0), 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:52:10,853 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 345.0) internal successors, (1725), 5 states have internal predecessors, (1725), 0 states have call successors, (0), 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:52:10,853 INFO L175 Difference]: Start difference. First operand has 58 places, 49 transitions, 187 flow. Second operand 4 states and 631 transitions. [2023-08-29 20:52:10,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 78 transitions, 421 flow [2023-08-29 20:52:10,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 78 transitions, 415 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:52:10,858 INFO L231 Difference]: Finished difference. Result has 58 places, 48 transitions, 187 flow [2023-08-29 20:52:10,858 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=187, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2023-08-29 20:52:10,858 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, -21 predicate places. [2023-08-29 20:52:10,859 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 187 flow [2023-08-29 20:52:10,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 145.33333333333334) internal successors, (872), 6 states have internal predecessors, (872), 0 states have call successors, (0), 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:52:10,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:52:10,859 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:52:10,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 20:52:10,860 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-08-29 20:52:10,860 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:52:10,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1679268089, now seen corresponding path program 1 times [2023-08-29 20:52:10,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:52:10,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156937967] [2023-08-29 20:52:10,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:52:10,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:52:10,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:52:10,980 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:52:10,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:52:10,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156937967] [2023-08-29 20:52:10,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156937967] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:52:10,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:52:10,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:52:10,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911753435] [2023-08-29 20:52:10,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:52:10,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:52:10,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:52:10,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:52:10,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:52:11,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 345 [2023-08-29 20:52:11,018 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 187 flow. Second operand has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 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:52:11,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:52:11,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 345 [2023-08-29 20:52:11,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:52:12,046 INFO L130 PetriNetUnfolder]: 8118/11796 cut-off events. [2023-08-29 20:52:12,046 INFO L131 PetriNetUnfolder]: For 4605/4749 co-relation queries the response was YES. [2023-08-29 20:52:12,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31068 conditions, 11796 events. 8118/11796 cut-off events. For 4605/4749 co-relation queries the response was YES. Maximal size of possible extension queue 745. Compared 73457 event pairs, 4255 based on Foata normal form. 96/10673 useless extension candidates. Maximal degree in co-relation 31060. Up to 7261 conditions per place. [2023-08-29 20:52:12,103 INFO L137 encePairwiseOnDemand]: 338/345 looper letters, 56 selfloop transitions, 9 changer transitions 0/72 dead transitions. [2023-08-29 20:52:12,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 72 transitions, 388 flow [2023-08-29 20:52:12,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:52:12,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:52:12,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 492 transitions. [2023-08-29 20:52:12,106 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4753623188405797 [2023-08-29 20:52:12,106 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 492 transitions. [2023-08-29 20:52:12,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 492 transitions. [2023-08-29 20:52:12,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:52:12,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 492 transitions. [2023-08-29 20:52:12,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 0 states have call successors, (0), 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:52:12,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 345.0) internal successors, (1380), 4 states have internal predecessors, (1380), 0 states have call successors, (0), 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:52:12,110 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 345.0) internal successors, (1380), 4 states have internal predecessors, (1380), 0 states have call successors, (0), 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:52:12,110 INFO L175 Difference]: Start difference. First operand has 58 places, 48 transitions, 187 flow. Second operand 3 states and 492 transitions. [2023-08-29 20:52:12,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 72 transitions, 388 flow [2023-08-29 20:52:12,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 72 transitions, 377 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:52:12,113 INFO L231 Difference]: Finished difference. Result has 57 places, 52 transitions, 229 flow [2023-08-29 20:52:12,113 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=229, PETRI_PLACES=57, PETRI_TRANSITIONS=52} [2023-08-29 20:52:12,114 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, -22 predicate places. [2023-08-29 20:52:12,114 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 229 flow [2023-08-29 20:52:12,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 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:52:12,114 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:52:12,114 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:52:12,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 20:52:12,115 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-08-29 20:52:12,115 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:52:12,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1679127231, now seen corresponding path program 1 times [2023-08-29 20:52:12,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:52:12,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075990715] [2023-08-29 20:52:12,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:52:12,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:52:12,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:52:12,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:52:12,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:52:12,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075990715] [2023-08-29 20:52:12,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075990715] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:52:12,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:52:12,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:52:12,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862985362] [2023-08-29 20:52:12,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:52:12,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:52:12,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:52:12,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:52:12,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:52:12,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 345 [2023-08-29 20:52:12,368 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 229 flow. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 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:52:12,368 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:52:12,368 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 345 [2023-08-29 20:52:12,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:52:13,220 INFO L130 PetriNetUnfolder]: 7375/11094 cut-off events. [2023-08-29 20:52:13,221 INFO L131 PetriNetUnfolder]: For 7511/7601 co-relation queries the response was YES. [2023-08-29 20:52:13,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30234 conditions, 11094 events. 7375/11094 cut-off events. For 7511/7601 co-relation queries the response was YES. Maximal size of possible extension queue 729. Compared 73757 event pairs, 3041 based on Foata normal form. 45/9956 useless extension candidates. Maximal degree in co-relation 30226. Up to 6621 conditions per place. [2023-08-29 20:52:13,284 INFO L137 encePairwiseOnDemand]: 342/345 looper letters, 63 selfloop transitions, 5 changer transitions 0/78 dead transitions. [2023-08-29 20:52:13,285 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 78 transitions, 449 flow [2023-08-29 20:52:13,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:52:13,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:52:13,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 505 transitions. [2023-08-29 20:52:13,288 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48792270531400966 [2023-08-29 20:52:13,288 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 505 transitions. [2023-08-29 20:52:13,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 505 transitions. [2023-08-29 20:52:13,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:52:13,289 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 505 transitions. [2023-08-29 20:52:13,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 0 states have call successors, (0), 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:52:13,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 345.0) internal successors, (1380), 4 states have internal predecessors, (1380), 0 states have call successors, (0), 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:52:13,292 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 345.0) internal successors, (1380), 4 states have internal predecessors, (1380), 0 states have call successors, (0), 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:52:13,292 INFO L175 Difference]: Start difference. First operand has 57 places, 52 transitions, 229 flow. Second operand 3 states and 505 transitions. [2023-08-29 20:52:13,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 78 transitions, 449 flow [2023-08-29 20:52:13,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 78 transitions, 440 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:52:13,419 INFO L231 Difference]: Finished difference. Result has 59 places, 52 transitions, 237 flow [2023-08-29 20:52:13,419 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=237, PETRI_PLACES=59, PETRI_TRANSITIONS=52} [2023-08-29 20:52:13,420 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, -20 predicate places. [2023-08-29 20:52:13,420 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 237 flow [2023-08-29 20:52:13,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 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:52:13,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:52:13,420 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:52:13,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 20:52:13,421 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-08-29 20:52:13,421 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:52:13,421 INFO L85 PathProgramCache]: Analyzing trace with hash -517696488, now seen corresponding path program 1 times [2023-08-29 20:52:13,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:52:13,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250329888] [2023-08-29 20:52:13,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:52:13,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:52:13,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:52:13,675 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:52:13,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:52:13,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250329888] [2023-08-29 20:52:13,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250329888] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:52:13,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:52:13,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:52:13,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921631350] [2023-08-29 20:52:13,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:52:13,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:52:13,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:52:13,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:52:13,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:52:13,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 345 [2023-08-29 20:52:13,680 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 52 transitions, 237 flow. Second operand has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 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:52:13,680 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:52:13,680 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 345 [2023-08-29 20:52:13,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:52:14,584 INFO L130 PetriNetUnfolder]: 7440/11184 cut-off events. [2023-08-29 20:52:14,585 INFO L131 PetriNetUnfolder]: For 7655/7757 co-relation queries the response was YES. [2023-08-29 20:52:14,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31309 conditions, 11184 events. 7440/11184 cut-off events. For 7655/7757 co-relation queries the response was YES. Maximal size of possible extension queue 737. Compared 73186 event pairs, 4210 based on Foata normal form. 24/10025 useless extension candidates. Maximal degree in co-relation 31300. Up to 7257 conditions per place. [2023-08-29 20:52:14,634 INFO L137 encePairwiseOnDemand]: 342/345 looper letters, 74 selfloop transitions, 2 changer transitions 0/86 dead transitions. [2023-08-29 20:52:14,634 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 86 transitions, 555 flow [2023-08-29 20:52:14,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:52:14,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:52:14,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 497 transitions. [2023-08-29 20:52:14,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4801932367149758 [2023-08-29 20:52:14,636 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 497 transitions. [2023-08-29 20:52:14,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 497 transitions. [2023-08-29 20:52:14,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:52:14,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 497 transitions. [2023-08-29 20:52:14,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 0 states have call successors, (0), 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:52:14,639 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 345.0) internal successors, (1380), 4 states have internal predecessors, (1380), 0 states have call successors, (0), 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:52:14,639 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 345.0) internal successors, (1380), 4 states have internal predecessors, (1380), 0 states have call successors, (0), 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:52:14,640 INFO L175 Difference]: Start difference. First operand has 59 places, 52 transitions, 237 flow. Second operand 3 states and 497 transitions. [2023-08-29 20:52:14,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 86 transitions, 555 flow [2023-08-29 20:52:14,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 86 transitions, 537 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:52:14,653 INFO L231 Difference]: Finished difference. Result has 60 places, 52 transitions, 235 flow [2023-08-29 20:52:14,654 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=235, PETRI_PLACES=60, PETRI_TRANSITIONS=52} [2023-08-29 20:52:14,654 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, -19 predicate places. [2023-08-29 20:52:14,654 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 52 transitions, 235 flow [2023-08-29 20:52:14,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 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:52:14,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:52:14,655 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:52:14,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 20:52:14,655 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-08-29 20:52:14,656 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:52:14,656 INFO L85 PathProgramCache]: Analyzing trace with hash -517638866, now seen corresponding path program 1 times [2023-08-29 20:52:14,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:52:14,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375950224] [2023-08-29 20:52:14,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:52:14,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:52:14,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:52:14,778 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:52:14,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:52:14,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375950224] [2023-08-29 20:52:14,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375950224] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:52:14,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:52:14,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:52:14,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328841303] [2023-08-29 20:52:14,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:52:14,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:52:14,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:52:14,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:52:14,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:52:14,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 345 [2023-08-29 20:52:14,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 235 flow. Second operand has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 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:52:14,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:52:14,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 345 [2023-08-29 20:52:14,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:52:15,704 INFO L130 PetriNetUnfolder]: 7944/11471 cut-off events. [2023-08-29 20:52:15,705 INFO L131 PetriNetUnfolder]: For 5706/5706 co-relation queries the response was YES. [2023-08-29 20:52:15,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33868 conditions, 11471 events. 7944/11471 cut-off events. For 5706/5706 co-relation queries the response was YES. Maximal size of possible extension queue 735. Compared 69991 event pairs, 2109 based on Foata normal form. 45/10531 useless extension candidates. Maximal degree in co-relation 33858. Up to 4759 conditions per place. [2023-08-29 20:52:15,766 INFO L137 encePairwiseOnDemand]: 332/345 looper letters, 55 selfloop transitions, 16 changer transitions 0/75 dead transitions. [2023-08-29 20:52:15,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 75 transitions, 473 flow [2023-08-29 20:52:15,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:52:15,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:52:15,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 616 transitions. [2023-08-29 20:52:15,768 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4463768115942029 [2023-08-29 20:52:15,768 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 616 transitions. [2023-08-29 20:52:15,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 616 transitions. [2023-08-29 20:52:15,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:52:15,769 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 616 transitions. [2023-08-29 20:52:15,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 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:52:15,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 345.0) internal successors, (1725), 5 states have internal predecessors, (1725), 0 states have call successors, (0), 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:52:15,772 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 345.0) internal successors, (1725), 5 states have internal predecessors, (1725), 0 states have call successors, (0), 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:52:15,772 INFO L175 Difference]: Start difference. First operand has 60 places, 52 transitions, 235 flow. Second operand 4 states and 616 transitions. [2023-08-29 20:52:15,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 75 transitions, 473 flow [2023-08-29 20:52:15,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 75 transitions, 465 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:52:15,785 INFO L231 Difference]: Finished difference. Result has 63 places, 56 transitions, 336 flow [2023-08-29 20:52:15,785 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=336, PETRI_PLACES=63, PETRI_TRANSITIONS=56} [2023-08-29 20:52:15,786 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, -16 predicate places. [2023-08-29 20:52:15,786 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 56 transitions, 336 flow [2023-08-29 20:52:15,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 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:52:15,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:52:15,787 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:52:15,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 20:52:15,787 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-08-29 20:52:15,787 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:52:15,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1734157239, now seen corresponding path program 1 times [2023-08-29 20:52:15,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:52:15,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387624614] [2023-08-29 20:52:15,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:52:15,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:52:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:52:16,019 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:52:16,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:52:16,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387624614] [2023-08-29 20:52:16,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387624614] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:52:16,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:52:16,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:52:16,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389289023] [2023-08-29 20:52:16,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:52:16,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:52:16,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:52:16,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:52:16,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:52:16,026 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 345 [2023-08-29 20:52:16,026 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 56 transitions, 336 flow. Second operand has 4 states, 4 states have (on average 150.0) internal successors, (600), 4 states have internal predecessors, (600), 0 states have call successors, (0), 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:52:16,027 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:52:16,027 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 345 [2023-08-29 20:52:16,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:52:17,292 INFO L130 PetriNetUnfolder]: 11720/17273 cut-off events. [2023-08-29 20:52:17,292 INFO L131 PetriNetUnfolder]: For 19374/20319 co-relation queries the response was YES. [2023-08-29 20:52:17,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52531 conditions, 17273 events. 11720/17273 cut-off events. For 19374/20319 co-relation queries the response was YES. Maximal size of possible extension queue 1087. Compared 120303 event pairs, 3359 based on Foata normal form. 336/16185 useless extension candidates. Maximal degree in co-relation 52520. Up to 5953 conditions per place. [2023-08-29 20:52:17,383 INFO L137 encePairwiseOnDemand]: 341/345 looper letters, 104 selfloop transitions, 3 changer transitions 0/117 dead transitions. [2023-08-29 20:52:17,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 117 transitions, 851 flow [2023-08-29 20:52:17,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:52:17,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:52:17,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 662 transitions. [2023-08-29 20:52:17,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4797101449275362 [2023-08-29 20:52:17,385 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 662 transitions. [2023-08-29 20:52:17,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 662 transitions. [2023-08-29 20:52:17,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:52:17,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 662 transitions. [2023-08-29 20:52:17,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 165.5) internal successors, (662), 4 states have internal predecessors, (662), 0 states have call successors, (0), 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:52:17,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 345.0) internal successors, (1725), 5 states have internal predecessors, (1725), 0 states have call successors, (0), 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:52:17,389 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 345.0) internal successors, (1725), 5 states have internal predecessors, (1725), 0 states have call successors, (0), 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:52:17,389 INFO L175 Difference]: Start difference. First operand has 63 places, 56 transitions, 336 flow. Second operand 4 states and 662 transitions. [2023-08-29 20:52:17,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 117 transitions, 851 flow [2023-08-29 20:52:17,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 117 transitions, 846 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:52:17,415 INFO L231 Difference]: Finished difference. Result has 67 places, 57 transitions, 352 flow [2023-08-29 20:52:17,415 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=352, PETRI_PLACES=67, PETRI_TRANSITIONS=57} [2023-08-29 20:52:17,416 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, -12 predicate places. [2023-08-29 20:52:17,416 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 57 transitions, 352 flow [2023-08-29 20:52:17,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 150.0) internal successors, (600), 4 states have internal predecessors, (600), 0 states have call successors, (0), 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:52:17,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:52:17,417 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:52:17,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 20:52:17,417 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-08-29 20:52:17,417 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:52:17,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1133061533, now seen corresponding path program 1 times [2023-08-29 20:52:17,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:52:17,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955873614] [2023-08-29 20:52:17,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:52:17,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:52:17,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:52:17,638 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:52:17,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:52:17,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955873614] [2023-08-29 20:52:17,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955873614] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:52:17,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:52:17,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:52:17,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429582401] [2023-08-29 20:52:17,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:52:17,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:52:17,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:52:17,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:52:17,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:52:17,749 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 345 [2023-08-29 20:52:17,750 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 57 transitions, 352 flow. Second operand has 7 states, 7 states have (on average 138.28571428571428) internal successors, (968), 7 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:52:17,750 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:52:17,750 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 345 [2023-08-29 20:52:17,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:52:18,856 INFO L130 PetriNetUnfolder]: 10437/15098 cut-off events. [2023-08-29 20:52:18,856 INFO L131 PetriNetUnfolder]: For 14454/14478 co-relation queries the response was YES. [2023-08-29 20:52:18,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49630 conditions, 15098 events. 10437/15098 cut-off events. For 14454/14478 co-relation queries the response was YES. Maximal size of possible extension queue 950. Compared 96527 event pairs, 2566 based on Foata normal form. 147/14317 useless extension candidates. Maximal degree in co-relation 49616. Up to 4855 conditions per place. [2023-08-29 20:52:18,940 INFO L137 encePairwiseOnDemand]: 332/345 looper letters, 76 selfloop transitions, 15 changer transitions 0/95 dead transitions. [2023-08-29 20:52:18,940 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 95 transitions, 714 flow [2023-08-29 20:52:18,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:52:18,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:52:18,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 887 transitions. [2023-08-29 20:52:18,943 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4285024154589372 [2023-08-29 20:52:18,943 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 887 transitions. [2023-08-29 20:52:18,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 887 transitions. [2023-08-29 20:52:18,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:52:18,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 887 transitions. [2023-08-29 20:52:18,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 147.83333333333334) internal successors, (887), 6 states have internal predecessors, (887), 0 states have call successors, (0), 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:52:18,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 345.0) internal successors, (2415), 7 states have internal predecessors, (2415), 0 states have call successors, (0), 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:52:18,948 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 345.0) internal successors, (2415), 7 states have internal predecessors, (2415), 0 states have call successors, (0), 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:52:18,948 INFO L175 Difference]: Start difference. First operand has 67 places, 57 transitions, 352 flow. Second operand 6 states and 887 transitions. [2023-08-29 20:52:18,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 95 transitions, 714 flow [2023-08-29 20:52:19,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 95 transitions, 693 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-29 20:52:19,006 INFO L231 Difference]: Finished difference. Result has 71 places, 61 transitions, 444 flow [2023-08-29 20:52:19,006 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=444, PETRI_PLACES=71, PETRI_TRANSITIONS=61} [2023-08-29 20:52:19,006 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, -8 predicate places. [2023-08-29 20:52:19,007 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 61 transitions, 444 flow [2023-08-29 20:52:19,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 138.28571428571428) internal successors, (968), 7 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:52:19,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:52:19,007 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:52:19,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 20:52:19,008 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-08-29 20:52:19,008 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:52:19,008 INFO L85 PathProgramCache]: Analyzing trace with hash -640649720, now seen corresponding path program 1 times [2023-08-29 20:52:19,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:52:19,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428589936] [2023-08-29 20:52:19,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:52:19,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:52:19,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:52:19,236 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:52:19,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:52:19,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428589936] [2023-08-29 20:52:19,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428589936] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:52:19,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:52:19,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:52:19,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116681043] [2023-08-29 20:52:19,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:52:19,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:52:19,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:52:19,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:52:19,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:52:19,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 345 [2023-08-29 20:52:19,241 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 61 transitions, 444 flow. Second operand has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 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:52:19,242 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:52:19,242 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 345 [2023-08-29 20:52:19,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:52:20,321 INFO L130 PetriNetUnfolder]: 8815/13551 cut-off events. [2023-08-29 20:52:20,321 INFO L131 PetriNetUnfolder]: For 24204/24846 co-relation queries the response was YES. [2023-08-29 20:52:20,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45965 conditions, 13551 events. 8815/13551 cut-off events. For 24204/24846 co-relation queries the response was YES. Maximal size of possible extension queue 863. Compared 94910 event pairs, 2609 based on Foata normal form. 106/12589 useless extension candidates. Maximal degree in co-relation 45951. Up to 8951 conditions per place. [2023-08-29 20:52:20,390 INFO L137 encePairwiseOnDemand]: 342/345 looper letters, 86 selfloop transitions, 2 changer transitions 0/100 dead transitions. [2023-08-29 20:52:20,390 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 100 transitions, 935 flow [2023-08-29 20:52:20,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:52:20,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:52:20,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2023-08-29 20:52:20,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4782608695652174 [2023-08-29 20:52:20,392 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 495 transitions. [2023-08-29 20:52:20,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 495 transitions. [2023-08-29 20:52:20,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:52:20,392 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 495 transitions. [2023-08-29 20:52:20,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 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:52:20,394 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 345.0) internal successors, (1380), 4 states have internal predecessors, (1380), 0 states have call successors, (0), 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:52:20,394 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 345.0) internal successors, (1380), 4 states have internal predecessors, (1380), 0 states have call successors, (0), 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:52:20,394 INFO L175 Difference]: Start difference. First operand has 71 places, 61 transitions, 444 flow. Second operand 3 states and 495 transitions. [2023-08-29 20:52:20,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 100 transitions, 935 flow [2023-08-29 20:52:20,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 100 transitions, 918 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:52:20,462 INFO L231 Difference]: Finished difference. Result has 71 places, 61 transitions, 442 flow [2023-08-29 20:52:20,462 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=442, PETRI_PLACES=71, PETRI_TRANSITIONS=61} [2023-08-29 20:52:20,462 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, -8 predicate places. [2023-08-29 20:52:20,463 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 61 transitions, 442 flow [2023-08-29 20:52:20,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 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:52:20,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:52:20,463 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:52:20,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-29 20:52:20,463 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-08-29 20:52:20,463 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:52:20,463 INFO L85 PathProgramCache]: Analyzing trace with hash 765170444, now seen corresponding path program 1 times [2023-08-29 20:52:20,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:52:20,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885274747] [2023-08-29 20:52:20,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:52:20,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:52:20,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:52:21,120 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:52:21,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:52:21,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885274747] [2023-08-29 20:52:21,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885274747] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:52:21,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:52:21,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-08-29 20:52:21,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544039725] [2023-08-29 20:52:21,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:52:21,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-29 20:52:21,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:52:21,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-29 20:52:21,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-08-29 20:52:21,756 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 345 [2023-08-29 20:52:21,758 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 61 transitions, 442 flow. Second operand has 12 states, 12 states have (on average 131.5) internal successors, (1578), 12 states have internal predecessors, (1578), 0 states have call successors, (0), 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:52:21,758 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:52:21,758 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 345 [2023-08-29 20:52:21,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:52:23,743 INFO L130 PetriNetUnfolder]: 12604/18719 cut-off events. [2023-08-29 20:52:23,743 INFO L131 PetriNetUnfolder]: For 30203/30522 co-relation queries the response was YES. [2023-08-29 20:52:23,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66968 conditions, 18719 events. 12604/18719 cut-off events. For 30203/30522 co-relation queries the response was YES. Maximal size of possible extension queue 1136. Compared 130236 event pairs, 4281 based on Foata normal form. 24/17888 useless extension candidates. Maximal degree in co-relation 66952. Up to 9646 conditions per place. [2023-08-29 20:52:23,853 INFO L137 encePairwiseOnDemand]: 335/345 looper letters, 136 selfloop transitions, 23 changer transitions 0/167 dead transitions. [2023-08-29 20:52:23,853 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 167 transitions, 1366 flow [2023-08-29 20:52:23,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-29 20:52:23,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-29 20:52:23,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1409 transitions. [2023-08-29 20:52:23,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40840579710144925 [2023-08-29 20:52:23,857 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1409 transitions. [2023-08-29 20:52:23,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1409 transitions. [2023-08-29 20:52:23,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:52:23,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1409 transitions. [2023-08-29 20:52:23,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 140.9) internal successors, (1409), 10 states have internal predecessors, (1409), 0 states have call successors, (0), 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:52:23,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 345.0) internal successors, (3795), 11 states have internal predecessors, (3795), 0 states have call successors, (0), 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:52:23,866 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 345.0) internal successors, (3795), 11 states have internal predecessors, (3795), 0 states have call successors, (0), 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:52:23,866 INFO L175 Difference]: Start difference. First operand has 71 places, 61 transitions, 442 flow. Second operand 10 states and 1409 transitions. [2023-08-29 20:52:23,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 167 transitions, 1366 flow [2023-08-29 20:52:24,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 167 transitions, 1350 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:52:24,054 INFO L231 Difference]: Finished difference. Result has 84 places, 82 transitions, 721 flow [2023-08-29 20:52:24,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=721, PETRI_PLACES=84, PETRI_TRANSITIONS=82} [2023-08-29 20:52:24,054 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, 5 predicate places. [2023-08-29 20:52:24,054 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 82 transitions, 721 flow [2023-08-29 20:52:24,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 131.5) internal successors, (1578), 12 states have internal predecessors, (1578), 0 states have call successors, (0), 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:52:24,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:52:24,055 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:52:24,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-29 20:52:24,055 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-08-29 20:52:24,055 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:52:24,055 INFO L85 PathProgramCache]: Analyzing trace with hash 765170380, now seen corresponding path program 1 times [2023-08-29 20:52:24,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:52:24,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39652673] [2023-08-29 20:52:24,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:52:24,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:52:24,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:52:24,443 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:52:24,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:52:24,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39652673] [2023-08-29 20:52:24,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39652673] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:52:24,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:52:24,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 20:52:24,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408571476] [2023-08-29 20:52:24,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:52:24,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-29 20:52:24,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:52:24,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-29 20:52:24,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-08-29 20:52:24,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 345 [2023-08-29 20:52:24,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 82 transitions, 721 flow. Second operand has 10 states, 10 states have (on average 132.7) internal successors, (1327), 10 states have internal predecessors, (1327), 0 states have call successors, (0), 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:52:24,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:52:24,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 345 [2023-08-29 20:52:24,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:52:27,393 INFO L130 PetriNetUnfolder]: 17581/25561 cut-off events. [2023-08-29 20:52:27,393 INFO L131 PetriNetUnfolder]: For 55301/55341 co-relation queries the response was YES. [2023-08-29 20:52:27,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95379 conditions, 25561 events. 17581/25561 cut-off events. For 55301/55341 co-relation queries the response was YES. Maximal size of possible extension queue 1481. Compared 179106 event pairs, 3268 based on Foata normal form. 253/24899 useless extension candidates. Maximal degree in co-relation 95357. Up to 5659 conditions per place. [2023-08-29 20:52:27,591 INFO L137 encePairwiseOnDemand]: 329/345 looper letters, 123 selfloop transitions, 53 changer transitions 0/180 dead transitions. [2023-08-29 20:52:27,591 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 180 transitions, 1709 flow [2023-08-29 20:52:27,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 20:52:27,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 20:52:27,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1295 transitions. [2023-08-29 20:52:27,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4170692431561997 [2023-08-29 20:52:27,595 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1295 transitions. [2023-08-29 20:52:27,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1295 transitions. [2023-08-29 20:52:27,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:52:27,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1295 transitions. [2023-08-29 20:52:27,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 143.88888888888889) internal successors, (1295), 9 states have internal predecessors, (1295), 0 states have call successors, (0), 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:52:27,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 345.0) internal successors, (3450), 10 states have internal predecessors, (3450), 0 states have call successors, (0), 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:52:27,604 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 345.0) internal successors, (3450), 10 states have internal predecessors, (3450), 0 states have call successors, (0), 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:52:27,604 INFO L175 Difference]: Start difference. First operand has 84 places, 82 transitions, 721 flow. Second operand 9 states and 1295 transitions. [2023-08-29 20:52:27,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 180 transitions, 1709 flow [2023-08-29 20:52:28,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 180 transitions, 1707 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:52:28,166 INFO L231 Difference]: Finished difference. Result has 95 places, 107 transitions, 1247 flow [2023-08-29 20:52:28,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=719, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1247, PETRI_PLACES=95, PETRI_TRANSITIONS=107} [2023-08-29 20:52:28,167 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, 16 predicate places. [2023-08-29 20:52:28,167 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 107 transitions, 1247 flow [2023-08-29 20:52:28,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 132.7) internal successors, (1327), 10 states have internal predecessors, (1327), 0 states have call successors, (0), 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:52:28,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:52:28,168 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:52:28,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-29 20:52:28,169 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-08-29 20:52:28,169 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:52:28,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1432589183, now seen corresponding path program 1 times [2023-08-29 20:52:28,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:52:28,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723492243] [2023-08-29 20:52:28,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:52:28,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:52:28,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:52:28,638 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:52:28,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:52:28,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723492243] [2023-08-29 20:52:28,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723492243] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:52:28,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:52:28,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 20:52:28,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169413331] [2023-08-29 20:52:28,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:52:28,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-29 20:52:28,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:52:28,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-29 20:52:28,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-08-29 20:52:29,207 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 345 [2023-08-29 20:52:29,208 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 107 transitions, 1247 flow. Second operand has 10 states, 10 states have (on average 131.9) internal successors, (1319), 10 states have internal predecessors, (1319), 0 states have call successors, (0), 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:52:29,208 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:52:29,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 345 [2023-08-29 20:52:29,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:52:31,633 INFO L130 PetriNetUnfolder]: 14333/21193 cut-off events. [2023-08-29 20:52:31,634 INFO L131 PetriNetUnfolder]: For 77759/78038 co-relation queries the response was YES. [2023-08-29 20:52:31,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88075 conditions, 21193 events. 14333/21193 cut-off events. For 77759/78038 co-relation queries the response was YES. Maximal size of possible extension queue 1251. Compared 147769 event pairs, 1914 based on Foata normal form. 36/20806 useless extension candidates. Maximal degree in co-relation 88049. Up to 6631 conditions per place. [2023-08-29 20:52:31,781 INFO L137 encePairwiseOnDemand]: 336/345 looper letters, 106 selfloop transitions, 40 changer transitions 2/159 dead transitions. [2023-08-29 20:52:31,782 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 159 transitions, 1778 flow [2023-08-29 20:52:31,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 20:52:31,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 20:52:31,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1253 transitions. [2023-08-29 20:52:31,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4035426731078905 [2023-08-29 20:52:31,785 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1253 transitions. [2023-08-29 20:52:31,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1253 transitions. [2023-08-29 20:52:31,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:52:31,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1253 transitions. [2023-08-29 20:52:31,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 139.22222222222223) internal successors, (1253), 9 states have internal predecessors, (1253), 0 states have call successors, (0), 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:52:31,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 345.0) internal successors, (3450), 10 states have internal predecessors, (3450), 0 states have call successors, (0), 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:52:31,792 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 345.0) internal successors, (3450), 10 states have internal predecessors, (3450), 0 states have call successors, (0), 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:52:31,792 INFO L175 Difference]: Start difference. First operand has 95 places, 107 transitions, 1247 flow. Second operand 9 states and 1253 transitions. [2023-08-29 20:52:31,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 159 transitions, 1778 flow [2023-08-29 20:52:32,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 159 transitions, 1753 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-29 20:52:32,797 INFO L231 Difference]: Finished difference. Result has 99 places, 101 transitions, 1208 flow [2023-08-29 20:52:32,798 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=1128, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1208, PETRI_PLACES=99, PETRI_TRANSITIONS=101} [2023-08-29 20:52:32,798 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, 20 predicate places. [2023-08-29 20:52:32,798 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 101 transitions, 1208 flow [2023-08-29 20:52:32,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 131.9) internal successors, (1319), 10 states have internal predecessors, (1319), 0 states have call successors, (0), 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:52:32,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:52:32,799 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:52:32,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-29 20:52:32,799 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-08-29 20:52:32,800 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:52:32,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1320493122, now seen corresponding path program 1 times [2023-08-29 20:52:32,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:52:32,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055158664] [2023-08-29 20:52:32,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:52:32,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:52:32,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:52:33,005 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:52:33,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:52:33,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055158664] [2023-08-29 20:52:33,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055158664] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:52:33,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:52:33,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:52:33,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45555891] [2023-08-29 20:52:33,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:52:33,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:52:33,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:52:33,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:52:33,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:52:33,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 345 [2023-08-29 20:52:33,012 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 101 transitions, 1208 flow. Second operand has 4 states, 4 states have (on average 150.25) internal successors, (601), 4 states have internal predecessors, (601), 0 states have call successors, (0), 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:52:33,012 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:52:33,012 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 345 [2023-08-29 20:52:33,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:52:36,642 INFO L130 PetriNetUnfolder]: 24274/36032 cut-off events. [2023-08-29 20:52:36,643 INFO L131 PetriNetUnfolder]: For 199838/202247 co-relation queries the response was YES. [2023-08-29 20:52:36,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153594 conditions, 36032 events. 24274/36032 cut-off events. For 199838/202247 co-relation queries the response was YES. Maximal size of possible extension queue 2096. Compared 274859 event pairs, 6026 based on Foata normal form. 880/36264 useless extension candidates. Maximal degree in co-relation 153567. Up to 12995 conditions per place. [2023-08-29 20:52:36,958 INFO L137 encePairwiseOnDemand]: 341/345 looper letters, 200 selfloop transitions, 4 changer transitions 0/223 dead transitions. [2023-08-29 20:52:36,958 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 223 transitions, 3243 flow [2023-08-29 20:52:36,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:52:36,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:52:36,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 651 transitions. [2023-08-29 20:52:36,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4717391304347826 [2023-08-29 20:52:36,960 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 651 transitions. [2023-08-29 20:52:36,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 651 transitions. [2023-08-29 20:52:36,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:52:36,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 651 transitions. [2023-08-29 20:52:36,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 162.75) internal successors, (651), 4 states have internal predecessors, (651), 0 states have call successors, (0), 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:52:36,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 345.0) internal successors, (1725), 5 states have internal predecessors, (1725), 0 states have call successors, (0), 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:52:36,964 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 345.0) internal successors, (1725), 5 states have internal predecessors, (1725), 0 states have call successors, (0), 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:52:36,964 INFO L175 Difference]: Start difference. First operand has 99 places, 101 transitions, 1208 flow. Second operand 4 states and 651 transitions. [2023-08-29 20:52:36,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 223 transitions, 3243 flow [2023-08-29 20:52:39,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 223 transitions, 3043 flow, removed 6 selfloop flow, removed 8 redundant places. [2023-08-29 20:52:39,100 INFO L231 Difference]: Finished difference. Result has 96 places, 103 transitions, 1155 flow [2023-08-29 20:52:39,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=1124, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1155, PETRI_PLACES=96, PETRI_TRANSITIONS=103} [2023-08-29 20:52:39,100 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, 17 predicate places. [2023-08-29 20:52:39,100 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 103 transitions, 1155 flow [2023-08-29 20:52:39,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 150.25) internal successors, (601), 4 states have internal predecessors, (601), 0 states have call successors, (0), 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:52:39,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:52:39,101 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:52:39,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-29 20:52:39,101 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-08-29 20:52:39,102 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:52:39,102 INFO L85 PathProgramCache]: Analyzing trace with hash -2049518601, now seen corresponding path program 1 times [2023-08-29 20:52:39,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:52:39,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616251693] [2023-08-29 20:52:39,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:52:39,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:52:39,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:52:39,179 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:52:39,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:52:39,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616251693] [2023-08-29 20:52:39,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616251693] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:52:39,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:52:39,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:52:39,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585515330] [2023-08-29 20:52:39,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:52:39,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:52:39,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:52:39,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:52:39,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:52:39,245 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 345 [2023-08-29 20:52:39,246 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 103 transitions, 1155 flow. Second operand has 4 states, 4 states have (on average 144.5) internal successors, (578), 4 states have internal predecessors, (578), 0 states have call successors, (0), 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:52:39,246 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:52:39,246 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 345 [2023-08-29 20:52:39,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:52:43,294 INFO L130 PetriNetUnfolder]: 23660/34252 cut-off events. [2023-08-29 20:52:43,294 INFO L131 PetriNetUnfolder]: For 121105/121225 co-relation queries the response was YES. [2023-08-29 20:52:43,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139186 conditions, 34252 events. 23660/34252 cut-off events. For 121105/121225 co-relation queries the response was YES. Maximal size of possible extension queue 2037. Compared 247065 event pairs, 13127 based on Foata normal form. 369/34531 useless extension candidates. Maximal degree in co-relation 139157. Up to 24302 conditions per place. [2023-08-29 20:52:43,620 INFO L137 encePairwiseOnDemand]: 333/345 looper letters, 52 selfloop transitions, 19 changer transitions 43/118 dead transitions. [2023-08-29 20:52:43,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 118 transitions, 1516 flow [2023-08-29 20:52:43,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:52:43,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:52:43,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 609 transitions. [2023-08-29 20:52:43,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44130434782608696 [2023-08-29 20:52:43,622 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 609 transitions. [2023-08-29 20:52:43,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 609 transitions. [2023-08-29 20:52:43,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:52:43,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 609 transitions. [2023-08-29 20:52:43,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 152.25) internal successors, (609), 4 states have internal predecessors, (609), 0 states have call successors, (0), 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:52:43,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 345.0) internal successors, (1725), 5 states have internal predecessors, (1725), 0 states have call successors, (0), 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:52:43,626 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 345.0) internal successors, (1725), 5 states have internal predecessors, (1725), 0 states have call successors, (0), 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:52:43,626 INFO L175 Difference]: Start difference. First operand has 96 places, 103 transitions, 1155 flow. Second operand 4 states and 609 transitions. [2023-08-29 20:52:43,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 118 transitions, 1516 flow [2023-08-29 20:52:45,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 118 transitions, 1504 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-29 20:52:45,725 INFO L231 Difference]: Finished difference. Result has 98 places, 66 transitions, 700 flow [2023-08-29 20:52:45,725 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=1146, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=700, PETRI_PLACES=98, PETRI_TRANSITIONS=66} [2023-08-29 20:52:45,725 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, 19 predicate places. [2023-08-29 20:52:45,726 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 66 transitions, 700 flow [2023-08-29 20:52:45,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 144.5) internal successors, (578), 4 states have internal predecessors, (578), 0 states have call successors, (0), 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:52:45,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:52:45,726 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:52:45,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-29 20:52:45,726 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-08-29 20:52:45,727 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:52:45,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1176052047, now seen corresponding path program 1 times [2023-08-29 20:52:45,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:52:45,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831563303] [2023-08-29 20:52:45,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:52:45,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:52:45,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:52:46,049 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:52:46,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:52:46,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831563303] [2023-08-29 20:52:46,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831563303] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:52:46,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:52:46,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-29 20:52:46,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368807813] [2023-08-29 20:52:46,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:52:46,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-29 20:52:46,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:52:46,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-29 20:52:46,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-08-29 20:52:46,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 345 [2023-08-29 20:52:46,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 66 transitions, 700 flow. Second operand has 11 states, 11 states have (on average 131.63636363636363) internal successors, (1448), 11 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:52:46,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:52:46,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 345 [2023-08-29 20:52:46,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:52:48,473 INFO L130 PetriNetUnfolder]: 13955/20323 cut-off events. [2023-08-29 20:52:48,473 INFO L131 PetriNetUnfolder]: For 55105/55185 co-relation queries the response was YES. [2023-08-29 20:52:48,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71116 conditions, 20323 events. 13955/20323 cut-off events. For 55105/55185 co-relation queries the response was YES. Maximal size of possible extension queue 1017. Compared 135960 event pairs, 4528 based on Foata normal form. 206/20507 useless extension candidates. Maximal degree in co-relation 71086. Up to 6380 conditions per place. [2023-08-29 20:52:48,554 INFO L137 encePairwiseOnDemand]: 329/345 looper letters, 78 selfloop transitions, 13 changer transitions 106/200 dead transitions. [2023-08-29 20:52:48,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 200 transitions, 1831 flow [2023-08-29 20:52:48,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-29 20:52:48,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-29 20:52:48,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1843 transitions. [2023-08-29 20:52:48,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4109253065774805 [2023-08-29 20:52:48,557 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1843 transitions. [2023-08-29 20:52:48,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1843 transitions. [2023-08-29 20:52:48,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:52:48,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1843 transitions. [2023-08-29 20:52:48,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 141.76923076923077) internal successors, (1843), 13 states have internal predecessors, (1843), 0 states have call successors, (0), 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:52:48,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 345.0) internal successors, (4830), 14 states have internal predecessors, (4830), 0 states have call successors, (0), 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:52:48,565 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 345.0) internal successors, (4830), 14 states have internal predecessors, (4830), 0 states have call successors, (0), 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:52:48,565 INFO L175 Difference]: Start difference. First operand has 98 places, 66 transitions, 700 flow. Second operand 13 states and 1843 transitions. [2023-08-29 20:52:48,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 200 transitions, 1831 flow [2023-08-29 20:52:49,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 200 transitions, 1643 flow, removed 16 selfloop flow, removed 11 redundant places. [2023-08-29 20:52:49,009 INFO L231 Difference]: Finished difference. Result has 97 places, 50 transitions, 355 flow [2023-08-29 20:52:49,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=355, PETRI_PLACES=97, PETRI_TRANSITIONS=50} [2023-08-29 20:52:49,009 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, 18 predicate places. [2023-08-29 20:52:49,010 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 50 transitions, 355 flow [2023-08-29 20:52:49,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 131.63636363636363) internal successors, (1448), 11 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:52:49,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:52:49,010 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] [2023-08-29 20:52:49,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-29 20:52:49,011 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-08-29 20:52:49,011 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:52:49,011 INFO L85 PathProgramCache]: Analyzing trace with hash 515318745, now seen corresponding path program 1 times [2023-08-29 20:52:49,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:52:49,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799114996] [2023-08-29 20:52:49,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:52:49,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:52:49,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:52:49,330 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:52:49,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:52:49,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799114996] [2023-08-29 20:52:49,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799114996] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:52:49,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:52:49,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:52:49,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908539015] [2023-08-29 20:52:49,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:52:49,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:52:49,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:52:49,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:52:49,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:52:49,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 345 [2023-08-29 20:52:49,337 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 50 transitions, 355 flow. Second operand has 4 states, 4 states have (on average 150.25) internal successors, (601), 4 states have internal predecessors, (601), 0 states have call successors, (0), 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:52:49,337 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:52:49,337 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 345 [2023-08-29 20:52:49,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:52:50,967 INFO L130 PetriNetUnfolder]: 11285/17452 cut-off events. [2023-08-29 20:52:50,967 INFO L131 PetriNetUnfolder]: For 25297/26219 co-relation queries the response was YES. [2023-08-29 20:52:51,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47919 conditions, 17452 events. 11285/17452 cut-off events. For 25297/26219 co-relation queries the response was YES. Maximal size of possible extension queue 969. Compared 125261 event pairs, 3135 based on Foata normal form. 282/17580 useless extension candidates. Maximal degree in co-relation 47894. Up to 6914 conditions per place. [2023-08-29 20:52:51,024 INFO L137 encePairwiseOnDemand]: 341/345 looper letters, 70 selfloop transitions, 3 changer transitions 6/90 dead transitions. [2023-08-29 20:52:51,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 90 transitions, 762 flow [2023-08-29 20:52:51,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:52:51,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:52:51,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 651 transitions. [2023-08-29 20:52:51,025 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4717391304347826 [2023-08-29 20:52:51,025 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 651 transitions. [2023-08-29 20:52:51,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 651 transitions. [2023-08-29 20:52:51,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:52:51,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 651 transitions. [2023-08-29 20:52:51,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 162.75) internal successors, (651), 4 states have internal predecessors, (651), 0 states have call successors, (0), 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:52:51,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 345.0) internal successors, (1725), 5 states have internal predecessors, (1725), 0 states have call successors, (0), 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:52:51,028 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 345.0) internal successors, (1725), 5 states have internal predecessors, (1725), 0 states have call successors, (0), 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:52:51,028 INFO L175 Difference]: Start difference. First operand has 97 places, 50 transitions, 355 flow. Second operand 4 states and 651 transitions. [2023-08-29 20:52:51,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 90 transitions, 762 flow [2023-08-29 20:52:51,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 90 transitions, 647 flow, removed 27 selfloop flow, removed 10 redundant places. [2023-08-29 20:52:51,099 INFO L231 Difference]: Finished difference. Result has 86 places, 49 transitions, 296 flow [2023-08-29 20:52:51,099 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=296, PETRI_PLACES=86, PETRI_TRANSITIONS=49} [2023-08-29 20:52:51,099 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, 7 predicate places. [2023-08-29 20:52:51,099 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 49 transitions, 296 flow [2023-08-29 20:52:51,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 150.25) internal successors, (601), 4 states have internal predecessors, (601), 0 states have call successors, (0), 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:52:51,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:52:51,100 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:52:51,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-29 20:52:51,100 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-08-29 20:52:51,100 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:52:51,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1529544272, now seen corresponding path program 1 times [2023-08-29 20:52:51,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:52:51,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991391845] [2023-08-29 20:52:51,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:52:51,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:52:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:52:52,454 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:52:52,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:52:52,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991391845] [2023-08-29 20:52:52,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991391845] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:52:52,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:52:52,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 20:52:52,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246996840] [2023-08-29 20:52:52,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:52:52,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 20:52:52,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:52:52,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 20:52:52,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-08-29 20:52:52,730 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 345 [2023-08-29 20:52:52,730 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 49 transitions, 296 flow. Second operand has 9 states, 9 states have (on average 128.0) internal successors, (1152), 9 states have internal predecessors, (1152), 0 states have call successors, (0), 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:52:52,730 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:52:52,731 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 345 [2023-08-29 20:52:52,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:52:55,004 INFO L130 PetriNetUnfolder]: 15865/23371 cut-off events. [2023-08-29 20:52:55,004 INFO L131 PetriNetUnfolder]: For 20431/20681 co-relation queries the response was YES. [2023-08-29 20:52:55,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64673 conditions, 23371 events. 15865/23371 cut-off events. For 20431/20681 co-relation queries the response was YES. Maximal size of possible extension queue 1354. Compared 160711 event pairs, 9431 based on Foata normal form. 290/23612 useless extension candidates. Maximal degree in co-relation 64653. Up to 17537 conditions per place. [2023-08-29 20:52:55,101 INFO L137 encePairwiseOnDemand]: 336/345 looper letters, 83 selfloop transitions, 15 changer transitions 2/105 dead transitions. [2023-08-29 20:52:55,101 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 105 transitions, 752 flow [2023-08-29 20:52:55,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 20:52:55,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 20:52:55,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1212 transitions. [2023-08-29 20:52:55,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3903381642512077 [2023-08-29 20:52:55,104 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1212 transitions. [2023-08-29 20:52:55,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1212 transitions. [2023-08-29 20:52:55,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:52:55,105 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1212 transitions. [2023-08-29 20:52:55,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 134.66666666666666) internal successors, (1212), 9 states have internal predecessors, (1212), 0 states have call successors, (0), 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:52:55,108 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 345.0) internal successors, (3450), 10 states have internal predecessors, (3450), 0 states have call successors, (0), 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:52:55,108 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 345.0) internal successors, (3450), 10 states have internal predecessors, (3450), 0 states have call successors, (0), 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:52:55,109 INFO L175 Difference]: Start difference. First operand has 86 places, 49 transitions, 296 flow. Second operand 9 states and 1212 transitions. [2023-08-29 20:52:55,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 105 transitions, 752 flow [2023-08-29 20:52:55,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 105 transitions, 722 flow, removed 2 selfloop flow, removed 5 redundant places. [2023-08-29 20:52:55,238 INFO L231 Difference]: Finished difference. Result has 94 places, 61 transitions, 431 flow [2023-08-29 20:52:55,238 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=431, PETRI_PLACES=94, PETRI_TRANSITIONS=61} [2023-08-29 20:52:55,239 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, 15 predicate places. [2023-08-29 20:52:55,239 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 61 transitions, 431 flow [2023-08-29 20:52:55,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 128.0) internal successors, (1152), 9 states have internal predecessors, (1152), 0 states have call successors, (0), 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:52:55,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:52:55,239 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:52:55,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-29 20:52:55,240 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-08-29 20:52:55,240 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:52:55,240 INFO L85 PathProgramCache]: Analyzing trace with hash -2124043086, now seen corresponding path program 2 times [2023-08-29 20:52:55,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:52:55,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628426851] [2023-08-29 20:52:55,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:52:55,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:52:55,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:52:56,560 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:52:56,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:52:56,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628426851] [2023-08-29 20:52:56,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628426851] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:52:56,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:52:56,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-29 20:52:56,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061369004] [2023-08-29 20:52:56,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:52:56,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-29 20:52:56,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:52:56,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-29 20:52:56,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-08-29 20:52:56,916 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 345 [2023-08-29 20:52:56,917 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 61 transitions, 431 flow. Second operand has 11 states, 11 states have (on average 128.63636363636363) internal successors, (1415), 11 states have internal predecessors, (1415), 0 states have call successors, (0), 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:52:56,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:52:56,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 345 [2023-08-29 20:52:56,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:52:59,412 INFO L130 PetriNetUnfolder]: 17356/25478 cut-off events. [2023-08-29 20:52:59,412 INFO L131 PetriNetUnfolder]: For 24532/24752 co-relation queries the response was YES. [2023-08-29 20:52:59,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72247 conditions, 25478 events. 17356/25478 cut-off events. For 24532/24752 co-relation queries the response was YES. Maximal size of possible extension queue 1496. Compared 176330 event pairs, 8482 based on Foata normal form. 260/25696 useless extension candidates. Maximal degree in co-relation 72224. Up to 14163 conditions per place. [2023-08-29 20:52:59,727 INFO L137 encePairwiseOnDemand]: 334/345 looper letters, 82 selfloop transitions, 29 changer transitions 3/119 dead transitions. [2023-08-29 20:52:59,727 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 119 transitions, 901 flow [2023-08-29 20:52:59,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-29 20:52:59,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-29 20:52:59,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1481 transitions. [2023-08-29 20:52:59,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39025032938076415 [2023-08-29 20:52:59,729 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1481 transitions. [2023-08-29 20:52:59,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1481 transitions. [2023-08-29 20:52:59,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:52:59,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1481 transitions. [2023-08-29 20:52:59,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 134.63636363636363) internal successors, (1481), 11 states have internal predecessors, (1481), 0 states have call successors, (0), 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:52:59,734 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 345.0) internal successors, (4140), 12 states have internal predecessors, (4140), 0 states have call successors, (0), 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:52:59,734 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 345.0) internal successors, (4140), 12 states have internal predecessors, (4140), 0 states have call successors, (0), 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:52:59,734 INFO L175 Difference]: Start difference. First operand has 94 places, 61 transitions, 431 flow. Second operand 11 states and 1481 transitions. [2023-08-29 20:52:59,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 119 transitions, 901 flow [2023-08-29 20:52:59,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 119 transitions, 894 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-29 20:52:59,956 INFO L231 Difference]: Finished difference. Result has 109 places, 71 transitions, 606 flow [2023-08-29 20:52:59,956 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=606, PETRI_PLACES=109, PETRI_TRANSITIONS=71} [2023-08-29 20:52:59,956 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, 30 predicate places. [2023-08-29 20:52:59,956 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 71 transitions, 606 flow [2023-08-29 20:52:59,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 128.63636363636363) internal successors, (1415), 11 states have internal predecessors, (1415), 0 states have call successors, (0), 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:52:59,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:52:59,957 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:52:59,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-29 20:52:59,957 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-08-29 20:52:59,958 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:52:59,958 INFO L85 PathProgramCache]: Analyzing trace with hash -2118647046, now seen corresponding path program 3 times [2023-08-29 20:52:59,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:52:59,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000719539] [2023-08-29 20:52:59,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:52:59,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:53:00,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:53:01,317 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:53:01,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:53:01,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000719539] [2023-08-29 20:53:01,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000719539] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:53:01,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:53:01,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-29 20:53:01,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462400110] [2023-08-29 20:53:01,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:53:01,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-29 20:53:01,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:53:01,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-29 20:53:01,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-08-29 20:53:01,706 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 345 [2023-08-29 20:53:01,707 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 71 transitions, 606 flow. Second operand has 11 states, 11 states have (on average 129.63636363636363) internal successors, (1426), 11 states have internal predecessors, (1426), 0 states have call successors, (0), 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:53:01,707 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:53:01,707 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 345 [2023-08-29 20:53:01,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:53:04,428 INFO L130 PetriNetUnfolder]: 18190/26629 cut-off events. [2023-08-29 20:53:04,428 INFO L131 PetriNetUnfolder]: For 33566/33746 co-relation queries the response was YES. [2023-08-29 20:53:04,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79663 conditions, 26629 events. 18190/26629 cut-off events. For 33566/33746 co-relation queries the response was YES. Maximal size of possible extension queue 1575. Compared 185647 event pairs, 4496 based on Foata normal form. 196/26774 useless extension candidates. Maximal degree in co-relation 79634. Up to 13408 conditions per place. [2023-08-29 20:53:04,565 INFO L137 encePairwiseOnDemand]: 335/345 looper letters, 74 selfloop transitions, 34 changer transitions 5/118 dead transitions. [2023-08-29 20:53:04,566 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 118 transitions, 1020 flow [2023-08-29 20:53:04,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-29 20:53:04,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-29 20:53:04,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1490 transitions. [2023-08-29 20:53:04,567 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3926218708827404 [2023-08-29 20:53:04,567 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1490 transitions. [2023-08-29 20:53:04,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1490 transitions. [2023-08-29 20:53:04,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:53:04,568 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1490 transitions. [2023-08-29 20:53:04,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 135.45454545454547) internal successors, (1490), 11 states have internal predecessors, (1490), 0 states have call successors, (0), 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:53:04,572 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 345.0) internal successors, (4140), 12 states have internal predecessors, (4140), 0 states have call successors, (0), 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:53:04,572 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 345.0) internal successors, (4140), 12 states have internal predecessors, (4140), 0 states have call successors, (0), 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:53:04,573 INFO L175 Difference]: Start difference. First operand has 109 places, 71 transitions, 606 flow. Second operand 11 states and 1490 transitions. [2023-08-29 20:53:04,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 118 transitions, 1020 flow [2023-08-29 20:53:04,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 118 transitions, 967 flow, removed 13 selfloop flow, removed 4 redundant places. [2023-08-29 20:53:04,989 INFO L231 Difference]: Finished difference. Result has 118 places, 77 transitions, 700 flow [2023-08-29 20:53:04,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=700, PETRI_PLACES=118, PETRI_TRANSITIONS=77} [2023-08-29 20:53:04,990 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, 39 predicate places. [2023-08-29 20:53:04,990 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 77 transitions, 700 flow [2023-08-29 20:53:04,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 129.63636363636363) internal successors, (1426), 11 states have internal predecessors, (1426), 0 states have call successors, (0), 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:53:04,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:53:04,990 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:53:04,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-29 20:53:04,991 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-08-29 20:53:04,991 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:53:04,991 INFO L85 PathProgramCache]: Analyzing trace with hash -913372064, now seen corresponding path program 4 times [2023-08-29 20:53:04,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:53:04,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509416775] [2023-08-29 20:53:04,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:53:04,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:53:05,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:53:06,692 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:53:06,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:53:06,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509416775] [2023-08-29 20:53:06,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509416775] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:53:06,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:53:06,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-29 20:53:06,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132848828] [2023-08-29 20:53:06,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:53:06,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-29 20:53:06,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:53:06,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-29 20:53:06,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-08-29 20:53:07,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 345 [2023-08-29 20:53:07,077 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 77 transitions, 700 flow. Second operand has 11 states, 11 states have (on average 125.63636363636364) internal successors, (1382), 11 states have internal predecessors, (1382), 0 states have call successors, (0), 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:53:07,078 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:53:07,078 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 345 [2023-08-29 20:53:07,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:53:10,091 INFO L130 PetriNetUnfolder]: 18170/26588 cut-off events. [2023-08-29 20:53:10,091 INFO L131 PetriNetUnfolder]: For 36263/36423 co-relation queries the response was YES. [2023-08-29 20:53:10,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81094 conditions, 26588 events. 18170/26588 cut-off events. For 36263/36423 co-relation queries the response was YES. Maximal size of possible extension queue 1574. Compared 186299 event pairs, 3724 based on Foata normal form. 168/26704 useless extension candidates. Maximal degree in co-relation 81062. Up to 12377 conditions per place. [2023-08-29 20:53:10,281 INFO L137 encePairwiseOnDemand]: 336/345 looper letters, 72 selfloop transitions, 36 changer transitions 8/121 dead transitions. [2023-08-29 20:53:10,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 121 transitions, 1085 flow [2023-08-29 20:53:10,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-29 20:53:10,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-29 20:53:10,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1572 transitions. [2023-08-29 20:53:10,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37971014492753624 [2023-08-29 20:53:10,284 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1572 transitions. [2023-08-29 20:53:10,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1572 transitions. [2023-08-29 20:53:10,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:53:10,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1572 transitions. [2023-08-29 20:53:10,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 131.0) internal successors, (1572), 12 states have internal predecessors, (1572), 0 states have call successors, (0), 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:53:10,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 345.0) internal successors, (4485), 13 states have internal predecessors, (4485), 0 states have call successors, (0), 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:53:10,290 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 345.0) internal successors, (4485), 13 states have internal predecessors, (4485), 0 states have call successors, (0), 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:53:10,290 INFO L175 Difference]: Start difference. First operand has 118 places, 77 transitions, 700 flow. Second operand 12 states and 1572 transitions. [2023-08-29 20:53:10,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 121 transitions, 1085 flow [2023-08-29 20:53:10,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 121 transitions, 1036 flow, removed 5 selfloop flow, removed 6 redundant places. [2023-08-29 20:53:10,622 INFO L231 Difference]: Finished difference. Result has 124 places, 78 transitions, 751 flow [2023-08-29 20:53:10,622 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=751, PETRI_PLACES=124, PETRI_TRANSITIONS=78} [2023-08-29 20:53:10,622 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, 45 predicate places. [2023-08-29 20:53:10,623 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 78 transitions, 751 flow [2023-08-29 20:53:10,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 125.63636363636364) internal successors, (1382), 11 states have internal predecessors, (1382), 0 states have call successors, (0), 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:53:10,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:53:10,623 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:53:10,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-29 20:53:10,623 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-08-29 20:53:10,623 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:53:10,623 INFO L85 PathProgramCache]: Analyzing trace with hash -731395461, now seen corresponding path program 1 times [2023-08-29 20:53:10,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:53:10,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806812477] [2023-08-29 20:53:10,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:53:10,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:53:10,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:53:10,821 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:53:10,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:53:10,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806812477] [2023-08-29 20:53:10,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806812477] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:53:10,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:53:10,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:53:10,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188604242] [2023-08-29 20:53:10,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:53:10,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:53:10,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:53:10,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:53:10,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:53:10,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 345 [2023-08-29 20:53:10,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 78 transitions, 751 flow. Second operand has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 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:53:10,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:53:10,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 345 [2023-08-29 20:53:10,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:53:12,708 INFO L130 PetriNetUnfolder]: 11664/18384 cut-off events. [2023-08-29 20:53:12,708 INFO L131 PetriNetUnfolder]: For 28144/28297 co-relation queries the response was YES. [2023-08-29 20:53:12,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53536 conditions, 18384 events. 11664/18384 cut-off events. For 28144/28297 co-relation queries the response was YES. Maximal size of possible extension queue 1251. Compared 139584 event pairs, 3727 based on Foata normal form. 287/18577 useless extension candidates. Maximal degree in co-relation 53504. Up to 17197 conditions per place. [2023-08-29 20:53:12,825 INFO L137 encePairwiseOnDemand]: 339/345 looper letters, 83 selfloop transitions, 5 changer transitions 5/112 dead transitions. [2023-08-29 20:53:12,825 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 112 transitions, 1240 flow [2023-08-29 20:53:12,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:53:12,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:53:12,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 481 transitions. [2023-08-29 20:53:12,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4647342995169082 [2023-08-29 20:53:12,826 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 481 transitions. [2023-08-29 20:53:12,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 481 transitions. [2023-08-29 20:53:12,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:53:12,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 481 transitions. [2023-08-29 20:53:12,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 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:53:12,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 345.0) internal successors, (1380), 4 states have internal predecessors, (1380), 0 states have call successors, (0), 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:53:12,828 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 345.0) internal successors, (1380), 4 states have internal predecessors, (1380), 0 states have call successors, (0), 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:53:12,828 INFO L175 Difference]: Start difference. First operand has 124 places, 78 transitions, 751 flow. Second operand 3 states and 481 transitions. [2023-08-29 20:53:12,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 112 transitions, 1240 flow [2023-08-29 20:53:12,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 112 transitions, 1147 flow, removed 10 selfloop flow, removed 8 redundant places. [2023-08-29 20:53:12,977 INFO L231 Difference]: Finished difference. Result has 119 places, 82 transitions, 718 flow [2023-08-29 20:53:12,977 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=718, PETRI_PLACES=119, PETRI_TRANSITIONS=82} [2023-08-29 20:53:12,978 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, 40 predicate places. [2023-08-29 20:53:12,978 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 82 transitions, 718 flow [2023-08-29 20:53:12,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 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:53:12,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:53:12,978 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, 1] [2023-08-29 20:53:12,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-29 20:53:12,978 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-08-29 20:53:12,979 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:53:12,979 INFO L85 PathProgramCache]: Analyzing trace with hash -246702038, now seen corresponding path program 1 times [2023-08-29 20:53:12,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:53:12,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628655114] [2023-08-29 20:53:12,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:53:12,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:53:13,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:53:13,188 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:53:13,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:53:13,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628655114] [2023-08-29 20:53:13,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628655114] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:53:13,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:53:13,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:53:13,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975051329] [2023-08-29 20:53:13,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:53:13,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:53:13,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:53:13,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:53:13,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:53:13,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 345 [2023-08-29 20:53:13,198 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 82 transitions, 718 flow. Second operand has 4 states, 4 states have (on average 149.5) internal successors, (598), 4 states have internal predecessors, (598), 0 states have call successors, (0), 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:53:13,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:53:13,198 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 345 [2023-08-29 20:53:13,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:53:14,315 INFO L130 PetriNetUnfolder]: 6667/11517 cut-off events. [2023-08-29 20:53:14,315 INFO L131 PetriNetUnfolder]: For 20706/21115 co-relation queries the response was YES. [2023-08-29 20:53:14,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40462 conditions, 11517 events. 6667/11517 cut-off events. For 20706/21115 co-relation queries the response was YES. Maximal size of possible extension queue 726. Compared 90280 event pairs, 1038 based on Foata normal form. 701/12138 useless extension candidates. Maximal degree in co-relation 40431. Up to 8749 conditions per place. [2023-08-29 20:53:14,378 INFO L137 encePairwiseOnDemand]: 339/345 looper letters, 96 selfloop transitions, 9 changer transitions 11/135 dead transitions. [2023-08-29 20:53:14,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 135 transitions, 1410 flow [2023-08-29 20:53:14,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:53:14,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:53:14,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 639 transitions. [2023-08-29 20:53:14,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46304347826086956 [2023-08-29 20:53:14,380 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 639 transitions. [2023-08-29 20:53:14,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 639 transitions. [2023-08-29 20:53:14,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:53:14,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 639 transitions. [2023-08-29 20:53:14,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 159.75) internal successors, (639), 4 states have internal predecessors, (639), 0 states have call successors, (0), 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:53:14,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 345.0) internal successors, (1725), 5 states have internal predecessors, (1725), 0 states have call successors, (0), 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:53:14,382 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 345.0) internal successors, (1725), 5 states have internal predecessors, (1725), 0 states have call successors, (0), 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:53:14,382 INFO L175 Difference]: Start difference. First operand has 119 places, 82 transitions, 718 flow. Second operand 4 states and 639 transitions. [2023-08-29 20:53:14,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 135 transitions, 1410 flow [2023-08-29 20:53:14,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 135 transitions, 1405 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:53:14,450 INFO L231 Difference]: Finished difference. Result has 122 places, 86 transitions, 765 flow [2023-08-29 20:53:14,450 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=713, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=765, PETRI_PLACES=122, PETRI_TRANSITIONS=86} [2023-08-29 20:53:14,451 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, 43 predicate places. [2023-08-29 20:53:14,451 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 86 transitions, 765 flow [2023-08-29 20:53:14,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 149.5) internal successors, (598), 4 states have internal predecessors, (598), 0 states have call successors, (0), 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:53:14,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:53:14,451 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, 1, 1] [2023-08-29 20:53:14,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-08-29 20:53:14,452 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-08-29 20:53:14,452 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:53:14,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1331618678, now seen corresponding path program 1 times [2023-08-29 20:53:14,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:53:14,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477241539] [2023-08-29 20:53:14,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:53:14,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:53:14,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:53:14,657 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:53:14,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:53:14,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477241539] [2023-08-29 20:53:14,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477241539] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:53:14,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:53:14,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:53:14,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474124491] [2023-08-29 20:53:14,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:53:14,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:53:14,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:53:14,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:53:14,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:53:14,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 345 [2023-08-29 20:53:14,666 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 86 transitions, 765 flow. Second operand has 5 states, 5 states have (on average 148.8) internal successors, (744), 5 states have internal predecessors, (744), 0 states have call successors, (0), 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:53:14,667 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:53:14,667 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 345 [2023-08-29 20:53:14,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:53:15,319 INFO L130 PetriNetUnfolder]: 3659/6681 cut-off events. [2023-08-29 20:53:15,319 INFO L131 PetriNetUnfolder]: For 17923/18611 co-relation queries the response was YES. [2023-08-29 20:53:15,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28050 conditions, 6681 events. 3659/6681 cut-off events. For 17923/18611 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 51308 event pairs, 276 based on Foata normal form. 837/7451 useless extension candidates. Maximal degree in co-relation 28018. Up to 3450 conditions per place. [2023-08-29 20:53:15,352 INFO L137 encePairwiseOnDemand]: 339/345 looper letters, 104 selfloop transitions, 13 changer transitions 13/149 dead transitions. [2023-08-29 20:53:15,352 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 149 transitions, 1571 flow [2023-08-29 20:53:15,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:53:15,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:53:15,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 795 transitions. [2023-08-29 20:53:15,354 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4608695652173913 [2023-08-29 20:53:15,354 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 795 transitions. [2023-08-29 20:53:15,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 795 transitions. [2023-08-29 20:53:15,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:53:15,354 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 795 transitions. [2023-08-29 20:53:15,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 159.0) internal successors, (795), 5 states have internal predecessors, (795), 0 states have call successors, (0), 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:53:15,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 345.0) internal successors, (2070), 6 states have internal predecessors, (2070), 0 states have call successors, (0), 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:53:15,356 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 345.0) internal successors, (2070), 6 states have internal predecessors, (2070), 0 states have call successors, (0), 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:53:15,356 INFO L175 Difference]: Start difference. First operand has 122 places, 86 transitions, 765 flow. Second operand 5 states and 795 transitions. [2023-08-29 20:53:15,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 149 transitions, 1571 flow [2023-08-29 20:53:15,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 149 transitions, 1553 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-29 20:53:15,375 INFO L231 Difference]: Finished difference. Result has 125 places, 90 transitions, 815 flow [2023-08-29 20:53:15,375 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=747, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=815, PETRI_PLACES=125, PETRI_TRANSITIONS=90} [2023-08-29 20:53:15,375 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, 46 predicate places. [2023-08-29 20:53:15,375 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 90 transitions, 815 flow [2023-08-29 20:53:15,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 148.8) internal successors, (744), 5 states have internal predecessors, (744), 0 states have call successors, (0), 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:53:15,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:53:15,376 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, 1, 1, 1] [2023-08-29 20:53:15,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-08-29 20:53:15,376 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-08-29 20:53:15,376 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:53:15,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1227706352, now seen corresponding path program 1 times [2023-08-29 20:53:15,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:53:15,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839828236] [2023-08-29 20:53:15,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:53:15,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:53:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:53:15,587 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:53:15,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:53:15,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839828236] [2023-08-29 20:53:15,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839828236] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:53:15,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:53:15,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:53:15,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540828063] [2023-08-29 20:53:15,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:53:15,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:53:15,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:53:15,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:53:15,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:53:15,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 345 [2023-08-29 20:53:15,598 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 90 transitions, 815 flow. Second operand has 6 states, 6 states have (on average 148.33333333333334) internal successors, (890), 6 states have internal predecessors, (890), 0 states have call successors, (0), 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:53:15,598 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:53:15,598 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 345 [2023-08-29 20:53:15,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:53:16,220 INFO L130 PetriNetUnfolder]: 3138/5446 cut-off events. [2023-08-29 20:53:16,221 INFO L131 PetriNetUnfolder]: For 17590/18264 co-relation queries the response was YES. [2023-08-29 20:53:16,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24241 conditions, 5446 events. 3138/5446 cut-off events. For 17590/18264 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 40115 event pairs, 199 based on Foata normal form. 567/5950 useless extension candidates. Maximal degree in co-relation 24208. Up to 2170 conditions per place. [2023-08-29 20:53:16,248 INFO L137 encePairwiseOnDemand]: 339/345 looper letters, 83 selfloop transitions, 17 changer transitions 23/135 dead transitions. [2023-08-29 20:53:16,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 135 transitions, 1410 flow [2023-08-29 20:53:16,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:53:16,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:53:16,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 938 transitions. [2023-08-29 20:53:16,250 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45314009661835747 [2023-08-29 20:53:16,250 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 938 transitions. [2023-08-29 20:53:16,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 938 transitions. [2023-08-29 20:53:16,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:53:16,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 938 transitions. [2023-08-29 20:53:16,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 156.33333333333334) internal successors, (938), 6 states have internal predecessors, (938), 0 states have call successors, (0), 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:53:16,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 345.0) internal successors, (2415), 7 states have internal predecessors, (2415), 0 states have call successors, (0), 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:53:16,252 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 345.0) internal successors, (2415), 7 states have internal predecessors, (2415), 0 states have call successors, (0), 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:53:16,252 INFO L175 Difference]: Start difference. First operand has 125 places, 90 transitions, 815 flow. Second operand 6 states and 938 transitions. [2023-08-29 20:53:16,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 135 transitions, 1410 flow [2023-08-29 20:53:16,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 135 transitions, 1259 flow, removed 24 selfloop flow, removed 18 redundant places. [2023-08-29 20:53:16,459 INFO L231 Difference]: Finished difference. Result has 103 places, 69 transitions, 561 flow [2023-08-29 20:53:16,459 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=561, PETRI_PLACES=103, PETRI_TRANSITIONS=69} [2023-08-29 20:53:16,460 INFO L281 CegarLoopForPetriNet]: 79 programPoint places, 24 predicate places. [2023-08-29 20:53:16,460 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 69 transitions, 561 flow [2023-08-29 20:53:16,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 148.33333333333334) internal successors, (890), 6 states have internal predecessors, (890), 0 states have call successors, (0), 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:53:16,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:53:16,461 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, 1, 1, 1, 1, 1] [2023-08-29 20:53:16,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-08-29 20:53:16,461 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-08-29 20:53:16,461 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:53:16,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1313914556, now seen corresponding path program 1 times [2023-08-29 20:53:16,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:53:16,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956709536] [2023-08-29 20:53:16,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:53:16,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:53:16,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:53:16,501 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:53:16,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:53:16,562 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 20:53:16,563 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:53:16,563 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (55 of 56 remaining) [2023-08-29 20:53:16,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 56 remaining) [2023-08-29 20:53:16,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 56 remaining) [2023-08-29 20:53:16,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 56 remaining) [2023-08-29 20:53:16,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 56 remaining) [2023-08-29 20:53:16,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 56 remaining) [2023-08-29 20:53:16,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 56 remaining) [2023-08-29 20:53:16,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 56 remaining) [2023-08-29 20:53:16,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 56 remaining) [2023-08-29 20:53:16,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 56 remaining) [2023-08-29 20:53:16,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 56 remaining) [2023-08-29 20:53:16,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 56 remaining) [2023-08-29 20:53:16,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 56 remaining) [2023-08-29 20:53:16,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 56 remaining) [2023-08-29 20:53:16,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 56 remaining) [2023-08-29 20:53:16,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 56 remaining) [2023-08-29 20:53:16,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 56 remaining) [2023-08-29 20:53:16,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 56 remaining) [2023-08-29 20:53:16,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 56 remaining) [2023-08-29 20:53:16,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 56 remaining) [2023-08-29 20:53:16,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 56 remaining) [2023-08-29 20:53:16,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 56 remaining) [2023-08-29 20:53:16,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 56 remaining) [2023-08-29 20:53:16,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 56 remaining) [2023-08-29 20:53:16,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 56 remaining) [2023-08-29 20:53:16,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 56 remaining) [2023-08-29 20:53:16,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 56 remaining) [2023-08-29 20:53:16,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 56 remaining) [2023-08-29 20:53:16,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 56 remaining) [2023-08-29 20:53:16,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 56 remaining) [2023-08-29 20:53:16,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 56 remaining) [2023-08-29 20:53:16,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 56 remaining) [2023-08-29 20:53:16,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 56 remaining) [2023-08-29 20:53:16,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (22 of 56 remaining) [2023-08-29 20:53:16,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 56 remaining) [2023-08-29 20:53:16,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 56 remaining) [2023-08-29 20:53:16,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 56 remaining) [2023-08-29 20:53:16,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 56 remaining) [2023-08-29 20:53:16,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 56 remaining) [2023-08-29 20:53:16,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 56 remaining) [2023-08-29 20:53:16,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 56 remaining) [2023-08-29 20:53:16,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 56 remaining) [2023-08-29 20:53:16,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 56 remaining) [2023-08-29 20:53:16,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 56 remaining) [2023-08-29 20:53:16,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 56 remaining) [2023-08-29 20:53:16,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 56 remaining) [2023-08-29 20:53:16,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 56 remaining) [2023-08-29 20:53:16,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 56 remaining) [2023-08-29 20:53:16,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 56 remaining) [2023-08-29 20:53:16,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 56 remaining) [2023-08-29 20:53:16,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 56 remaining) [2023-08-29 20:53:16,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 56 remaining) [2023-08-29 20:53:16,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 56 remaining) [2023-08-29 20:53:16,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 56 remaining) [2023-08-29 20:53:16,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 56 remaining) [2023-08-29 20:53:16,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 56 remaining) [2023-08-29 20:53:16,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-08-29 20:53:16,575 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:53:16,580 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:53:16,580 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:53:16,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:53:16 BasicIcfg [2023-08-29 20:53:16,685 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:53:16,686 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:53:16,686 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:53:16,686 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:53:16,686 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:51:50" (3/4) ... [2023-08-29 20:53:16,688 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:53:16,689 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:53:16,689 INFO L158 Benchmark]: Toolchain (without parser) took 88026.94ms. Allocated memory was 67.1MB in the beginning and 9.9GB in the end (delta: 9.9GB). Free memory was 42.8MB in the beginning and 7.1GB in the end (delta: -7.0GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. [2023-08-29 20:53:16,689 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 67.1MB. Free memory is still 44.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:53:16,689 INFO L158 Benchmark]: CACSL2BoogieTranslator took 498.76ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 42.7MB in the beginning and 49.6MB in the end (delta: -7.0MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2023-08-29 20:53:16,690 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.30ms. Allocated memory is still 81.8MB. Free memory was 49.6MB in the beginning and 47.1MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-29 20:53:16,690 INFO L158 Benchmark]: Boogie Preprocessor took 67.91ms. Allocated memory is still 81.8MB. Free memory was 47.1MB in the beginning and 45.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:53:16,690 INFO L158 Benchmark]: RCFGBuilder took 1063.08ms. Allocated memory is still 81.8MB. Free memory was 45.0MB in the beginning and 39.2MB in the end (delta: 5.7MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. [2023-08-29 20:53:16,690 INFO L158 Benchmark]: TraceAbstraction took 86302.59ms. Allocated memory was 81.8MB in the beginning and 9.9GB in the end (delta: 9.9GB). Free memory was 38.7MB in the beginning and 7.1GB in the end (delta: -7.0GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. [2023-08-29 20:53:16,691 INFO L158 Benchmark]: Witness Printer took 2.90ms. Allocated memory is still 9.9GB. Free memory is still 7.1GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:53:16,695 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.23ms. Allocated memory is still 67.1MB. Free memory is still 44.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 498.76ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 42.7MB in the beginning and 49.6MB in the end (delta: -7.0MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.30ms. Allocated memory is still 81.8MB. Free memory was 49.6MB in the beginning and 47.1MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.91ms. Allocated memory is still 81.8MB. Free memory was 47.1MB in the beginning and 45.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1063.08ms. Allocated memory is still 81.8MB. Free memory was 45.0MB in the beginning and 39.2MB in the end (delta: 5.7MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. * TraceAbstraction took 86302.59ms. Allocated memory was 81.8MB in the beginning and 9.9GB in the end (delta: 9.9GB). Free memory was 38.7MB in the beginning and 7.1GB in the end (delta: -7.0GB). Peak memory consumption was 2.8GB. Max. memory is 16.1GB. * Witness Printer took 2.90ms. Allocated memory is still 9.9GB. Free memory is still 7.1GB. 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: 7.5s, 190 PlacesBefore, 79 PlacesAfterwards, 179 TransitionsBefore, 67 TransitionsAfterwards, 6020 CoEnabledTransitionPairs, 8 FixpointIterations, 75 TrivialSequentialCompositions, 82 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 162 TotalNumberOfCompositions, 25065 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9905, independent: 9357, independent conditional: 0, independent unconditional: 9357, dependent: 548, dependent conditional: 0, dependent unconditional: 548, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2764, independent: 2685, independent conditional: 0, independent unconditional: 2685, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9905, independent: 6672, independent conditional: 0, independent unconditional: 6672, dependent: 469, dependent conditional: 0, dependent unconditional: 469, unknown: 2764, unknown conditional: 0, unknown unconditional: 2764] , Statistics on independence cache: Total cache size (in pairs): 462, Positive cache size: 419, Positive conditional cache size: 0, Positive unconditional cache size: 419, Negative cache size: 43, Negative conditional cache size: 0, Negative unconditional cache size: 43, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p1_EAX = 0; [L735] 0 int __unbuffered_p2_EAX = 0; [L737] 0 int __unbuffered_p3_EAX = 0; [L739] 0 int a = 0; [L740] 0 _Bool a$flush_delayed; [L741] 0 int a$mem_tmp; [L742] 0 _Bool a$r_buff0_thd0; [L743] 0 _Bool a$r_buff0_thd1; [L744] 0 _Bool a$r_buff0_thd2; [L745] 0 _Bool a$r_buff0_thd3; [L746] 0 _Bool a$r_buff0_thd4; [L747] 0 _Bool a$r_buff1_thd0; [L748] 0 _Bool a$r_buff1_thd1; [L749] 0 _Bool a$r_buff1_thd2; [L750] 0 _Bool a$r_buff1_thd3; [L751] 0 _Bool a$r_buff1_thd4; [L752] 0 _Bool a$read_delayed; [L753] 0 int *a$read_delayed_var; [L754] 0 int a$w_buff0; [L755] 0 _Bool a$w_buff0_used; [L756] 0 int a$w_buff1; [L757] 0 _Bool a$w_buff1_used; [L758] 0 _Bool main$tmp_guard0; [L759] 0 _Bool main$tmp_guard1; [L761] 0 int x = 0; [L763] 0 int y = 0; [L765] 0 int z = 0; [L766] 0 _Bool weak$$choice0; [L767] 0 _Bool weak$$choice1; [L768] 0 _Bool weak$$choice2; [L860] 0 pthread_t t2721; [L861] FCALL, FORK 0 pthread_create(&t2721, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2721, ((void *)0), P0, ((void *)0))=-3, t2721={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z=0] [L862] 0 pthread_t t2722; [L772] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 1 a$flush_delayed = weak$$choice2 [L775] EXPR 1 \read(a) [L775] 1 a$mem_tmp = a [L776] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff1) [L776] EXPR 1 \read(a) [L776] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff1) [L776] 1 a = !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff1) [L777] 1 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff0)) [L778] 1 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff1 : a$w_buff1)) [L779] 1 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used)) [L780] 1 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L781] 1 a$r_buff0_thd1 = weak$$choice2 ? a$r_buff0_thd1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$r_buff0_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1)) [L782] 1 a$r_buff1_thd1 = weak$$choice2 ? a$r_buff1_thd1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$r_buff1_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L783] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L784] 1 __unbuffered_p0_EAX$read_delayed_var = &a [L785] EXPR 1 \read(a) [L785] 1 __unbuffered_p0_EAX = a [L786] EXPR 1 a$flush_delayed ? a$mem_tmp : a [L786] 1 a = a$flush_delayed ? a$mem_tmp : a [L787] 1 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=0, y=0, z=0] [L863] FCALL, FORK 0 pthread_create(&t2722, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2722, ((void *)0), P1, ((void *)0))=-2, t2721={7:0}, t2722={8:0}, weak$$choice1=0, weak$$choice2=1, x=0, y=0, z=0] [L790] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y=0, z=0] [L802] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y=0, z=0] [L864] 0 pthread_t t2723; [L865] FCALL, FORK 0 pthread_create(&t2723, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2723, ((void *)0), P2, ((void *)0))=-1, t2721={7:0}, t2722={8:0}, t2723={9:0}, weak$$choice1=0, weak$$choice2=1, x=1, y=0, z=0] [L866] 0 pthread_t t2724; [L867] FCALL, FORK 0 pthread_create(&t2724, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3: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, pthread_create(&t2724, ((void *)0), P3, ((void *)0))=0, t2721={7:0}, t2722={8:0}, t2723={9:0}, t2724={5:0}, weak$$choice1=0, weak$$choice2=1, x=1, y=0, z=0] [L805] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3: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$$choice1=0, weak$$choice2=1, x=1, y=1, z=0] [L817] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0: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$$choice1=0, weak$$choice2=1, x=1, y=1, z=0] [L820] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0: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$$choice1=0, weak$$choice2=1, x=1, y=1, z=1] [L832] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0: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$$choice1=0, weak$$choice2=1, x=1, y=1, z=1] [L835] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0: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$$choice1=0, weak$$choice2=1, x=1, y=1, z=1] [L838] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L838] EXPR 4 \read(a) [L838] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L838] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L839] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L840] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L841] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L842] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0: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$$choice1=0, weak$$choice2=1, x=1, y=1, z=1] [L795] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 1 return 0; [L810] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 2 return 0; [L825] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L827] 3 return 0; [L845] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L847] 4 return 0; [L869] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L871] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L871] RET 0 assume_abort_if_not(main$tmp_guard0) [L873] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L873] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L873] EXPR 0 \read(a) [L873] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L873] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L873] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L874] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L875] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L876] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L877] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2721={7:0}, t2722={8:0}, t2723={9:0}, t2724={5:0}, weak$$choice1=0, weak$$choice2=1, x=1, y=1, z=1] [L880] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L881] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L881] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L881] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L881] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L881] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L881] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p3_EAX == 1) [L884] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x=1, y=1, z=1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 865]: 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: 861]: 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: 863]: 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: 867]: 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 9 procedures, 233 locations, 56 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: 86.0s, OverallIterations: 30, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 66.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4037 SdHoareTripleChecker+Valid, 7.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3263 mSDsluCounter, 1186 SdHoareTripleChecker+Invalid, 6.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1000 mSDsCounter, 603 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10635 IncrementalHoareTripleChecker+Invalid, 11238 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 603 mSolverCounterUnsat, 186 mSDtfsCounter, 10635 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1247occurred in iteration=16, InterpolantAutomatonStates: 161, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 10.9s InterpolantComputationTime, 516 NumberOfCodeBlocks, 516 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 460 ConstructedInterpolants, 0 QuantifiedInterpolants, 6793 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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:53:16,733 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 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/thin002_rmo.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.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 f0d8ae33a1a7c98578096fc4895533f629cc4062ad641b886abfeea14ddb85d4 --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:53:19,093 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:53:19,095 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:53:19,139 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:53:19,141 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:53:19,144 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:53:19,145 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:53:19,148 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:53:19,150 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:53:19,154 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:53:19,155 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:53:19,157 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:53:19,157 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:53:19,159 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:53:19,160 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:53:19,165 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:53:19,165 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:53:19,166 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:53:19,168 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:53:19,172 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:53:19,173 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:53:19,179 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:53:19,180 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:53:19,181 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:53:19,187 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:53:19,187 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:53:19,187 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:53:19,189 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:53:19,190 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:53:19,191 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:53:19,191 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:53:19,196 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:53:19,196 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:53:19,197 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:53:19,198 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:53:19,198 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:53:19,198 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:53:19,199 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:53:19,199 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:53:19,200 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:53:19,200 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:53:19,203 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:53:19,235 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:53:19,235 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:53:19,236 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:53:19,236 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:53:19,237 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:53:19,237 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:53:19,238 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:53:19,238 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:53:19,238 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:53:19,238 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:53:19,239 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:53:19,239 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:53:19,239 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:53:19,239 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:53:19,239 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:53:19,240 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:53:19,240 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:53:19,240 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:53:19,240 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:53:19,240 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:53:19,240 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-29 20:53:19,240 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-29 20:53:19,241 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:53:19,241 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:53:19,241 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:53:19,241 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:53:19,241 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:53:19,241 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:53:19,242 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:53:19,242 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:53:19,242 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-29 20:53:19,242 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-29 20:53:19,242 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:53:19,242 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:53:19,243 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:53:19,243 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-29 20:53:19,243 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:53:19,243 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 -> f0d8ae33a1a7c98578096fc4895533f629cc4062ad641b886abfeea14ddb85d4 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:53:19,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:53:19,526 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:53:19,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:53:19,528 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:53:19,529 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:53:19,530 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/thin002_rmo.i [2023-08-29 20:53:20,609 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:53:20,868 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:53:20,870 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/thin002_rmo.i [2023-08-29 20:53:20,885 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e4dac202/43f30f7a41504476b0129047a13a7f50/FLAG585d5140c [2023-08-29 20:53:21,174 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e4dac202/43f30f7a41504476b0129047a13a7f50 [2023-08-29 20:53:21,176 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:53:21,177 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:53:21,178 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:53:21,178 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:53:21,182 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:53:21,183 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:53:21" (1/1) ... [2023-08-29 20:53:21,184 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23ae8c8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:53:21, skipping insertion in model container [2023-08-29 20:53:21,184 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:53:21" (1/1) ... [2023-08-29 20:53:21,190 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:53:21,244 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:53:21,415 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/thin002_rmo.i[988,1001] [2023-08-29 20:53:21,626 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:53:21,643 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:53:21,654 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/thin002_rmo.i[988,1001] [2023-08-29 20:53:21,704 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:53:21,758 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:53:21,759 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:53:21,764 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:53:21,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:53:21 WrapperNode [2023-08-29 20:53:21,765 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:53:21,766 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:53:21,766 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:53:21,766 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:53:21,772 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:53:21" (1/1) ... [2023-08-29 20:53:21,788 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:53:21" (1/1) ... [2023-08-29 20:53:21,808 INFO L138 Inliner]: procedures = 181, calls = 80, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 156 [2023-08-29 20:53:21,808 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:53:21,809 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:53:21,809 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:53:21,809 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:53:21,816 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:53:21" (1/1) ... [2023-08-29 20:53:21,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:53:21" (1/1) ... [2023-08-29 20:53:21,820 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:53:21" (1/1) ... [2023-08-29 20:53:21,820 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:53:21" (1/1) ... [2023-08-29 20:53:21,830 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:53:21" (1/1) ... [2023-08-29 20:53:21,834 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:53:21" (1/1) ... [2023-08-29 20:53:21,837 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:53:21" (1/1) ... [2023-08-29 20:53:21,838 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:53:21" (1/1) ... [2023-08-29 20:53:21,841 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:53:21,842 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:53:21,842 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:53:21,842 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:53:21,843 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:53:21" (1/1) ... [2023-08-29 20:53:21,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:53:21,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:53:21,894 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:53:21,908 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:53:21,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-08-29 20:53:21,933 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:53:21,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:53:21,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:53:21,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:53:21,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-29 20:53:21,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-29 20:53:21,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-08-29 20:53:21,934 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:53:21,934 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:53:21,934 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:53:21,934 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:53:21,934 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:53:21,935 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:53:21,935 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-29 20:53:21,935 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-29 20:53:21,935 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:53:21,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:53:21,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:53:21,937 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:53:22,088 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:53:22,090 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:53:22,669 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:53:23,014 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:53:23,014 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:53:23,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:53:23 BoogieIcfgContainer [2023-08-29 20:53:23,017 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:53:23,020 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:53:23,020 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:53:23,022 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:53:23,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:53:21" (1/3) ... [2023-08-29 20:53:23,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1723c7e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:53:23, skipping insertion in model container [2023-08-29 20:53:23,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:53:21" (2/3) ... [2023-08-29 20:53:23,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1723c7e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:53:23, skipping insertion in model container [2023-08-29 20:53:23,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:53:23" (3/3) ... [2023-08-29 20:53:23,026 INFO L112 eAbstractionObserver]: Analyzing ICFG thin002_rmo.i [2023-08-29 20:53:23,042 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:53:23,042 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2023-08-29 20:53:23,042 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:53:23,156 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:53:23,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 195 places, 184 transitions, 388 flow [2023-08-29 20:53:23,277 INFO L130 PetriNetUnfolder]: 2/180 cut-off events. [2023-08-29 20:53:23,277 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:53:23,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 180 events. 2/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 200 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 116. Up to 2 conditions per place. [2023-08-29 20:53:23,285 INFO L82 GeneralOperation]: Start removeDead. Operand has 195 places, 184 transitions, 388 flow [2023-08-29 20:53:23,294 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 191 places, 180 transitions, 372 flow [2023-08-29 20:53:23,297 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:53:23,309 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 180 transitions, 372 flow [2023-08-29 20:53:23,310 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 191 places, 180 transitions, 372 flow [2023-08-29 20:53:23,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 191 places, 180 transitions, 372 flow [2023-08-29 20:53:23,356 INFO L130 PetriNetUnfolder]: 2/180 cut-off events. [2023-08-29 20:53:23,356 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:53:23,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 180 events. 2/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 201 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 116. Up to 2 conditions per place. [2023-08-29 20:53:23,361 INFO L119 LiptonReduction]: Number of co-enabled transitions 6020 [2023-08-29 20:53:35,270 INFO L134 LiptonReduction]: Checked pairs total: 21494 [2023-08-29 20:53:35,271 INFO L136 LiptonReduction]: Total number of compositions: 160 [2023-08-29 20:53:35,291 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:53:35,298 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;@4cac3ae0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:53:35,298 INFO L358 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2023-08-29 20:53:35,301 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:53:35,302 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:53:35,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:53:35,303 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:53:35,304 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-08-29 20:53:35,308 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:53:35,308 INFO L85 PathProgramCache]: Analyzing trace with hash 870, now seen corresponding path program 1 times [2023-08-29 20:53:35,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:53:35,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1962182102] [2023-08-29 20:53:35,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:53:35,319 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:53:35,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:53:35,322 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:53:35,380 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:53:35,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:53:35,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-29 20:53:35,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:53:35,464 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:53:35,464 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:53:35,464 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:53:35,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1962182102] [2023-08-29 20:53:35,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1962182102] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:53:35,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:53:35,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:53:35,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035102570] [2023-08-29 20:53:35,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:53:35,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:53:35,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:53:35,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:53:35,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:53:35,528 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 344 [2023-08-29 20:53:35,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 65 transitions, 142 flow. Second operand has 2 states, 2 states have (on average 151.5) internal successors, (303), 2 states have internal predecessors, (303), 0 states have call successors, (0), 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:53:35,533 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:53:35,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 344 [2023-08-29 20:53:35,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:53:38,584 INFO L130 PetriNetUnfolder]: 18300/25103 cut-off events. [2023-08-29 20:53:38,585 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2023-08-29 20:53:38,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49797 conditions, 25103 events. 18300/25103 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 1530. Compared 157817 event pairs, 18300 based on Foata normal form. 0/15875 useless extension candidates. Maximal degree in co-relation 49785. Up to 24557 conditions per place. [2023-08-29 20:53:38,867 INFO L137 encePairwiseOnDemand]: 326/344 looper letters, 40 selfloop transitions, 0 changer transitions 0/47 dead transitions. [2023-08-29 20:53:38,867 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 47 transitions, 186 flow [2023-08-29 20:53:38,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:53:38,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:53:38,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 360 transitions. [2023-08-29 20:53:38,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5232558139534884 [2023-08-29 20:53:38,884 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 360 transitions. [2023-08-29 20:53:38,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 360 transitions. [2023-08-29 20:53:38,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:53:38,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 360 transitions. [2023-08-29 20:53:38,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 180.0) internal successors, (360), 2 states have internal predecessors, (360), 0 states have call successors, (0), 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:53:38,905 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 344.0) internal successors, (1032), 3 states have internal predecessors, (1032), 0 states have call successors, (0), 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:53:38,907 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 344.0) internal successors, (1032), 3 states have internal predecessors, (1032), 0 states have call successors, (0), 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:53:38,909 INFO L175 Difference]: Start difference. First operand has 78 places, 65 transitions, 142 flow. Second operand 2 states and 360 transitions. [2023-08-29 20:53:38,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 47 transitions, 186 flow [2023-08-29 20:53:38,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 47 transitions, 182 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 20:53:38,918 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 102 flow [2023-08-29 20:53:38,920 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=102, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2023-08-29 20:53:38,923 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -21 predicate places. [2023-08-29 20:53:38,924 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 102 flow [2023-08-29 20:53:38,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 151.5) internal successors, (303), 2 states have internal predecessors, (303), 0 states have call successors, (0), 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:53:38,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:53:38,929 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 20:53:38,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-08-29 20:53:39,137 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:53:39,138 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-08-29 20:53:39,138 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:53:39,138 INFO L85 PathProgramCache]: Analyzing trace with hash 856764, now seen corresponding path program 1 times [2023-08-29 20:53:39,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:53:39,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1285729315] [2023-08-29 20:53:39,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:53:39,139 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:53:39,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:53:39,140 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:53:39,146 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:53:39,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:53:39,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:53:39,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:53:39,290 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-29 20:53:39,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-08-29 20:53:39,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:53:39,330 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:53:39,330 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:53:39,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1285729315] [2023-08-29 20:53:39,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1285729315] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:53:39,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:53:39,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:53:39,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065113708] [2023-08-29 20:53:39,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:53:39,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:53:39,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:53:39,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:53:39,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:53:39,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 344 [2023-08-29 20:53:39,419 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 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:53:39,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:53:39,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 344 [2023-08-29 20:53:39,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:53:41,212 INFO L130 PetriNetUnfolder]: 13313/18054 cut-off events. [2023-08-29 20:53:41,212 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:53:41,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36139 conditions, 18054 events. 13313/18054 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1003. Compared 104720 event pairs, 7613 based on Foata normal form. 324/13015 useless extension candidates. Maximal degree in co-relation 36136. Up to 9099 conditions per place. [2023-08-29 20:53:41,312 INFO L137 encePairwiseOnDemand]: 336/344 looper letters, 51 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-08-29 20:53:41,312 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 58 transitions, 230 flow [2023-08-29 20:53:41,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:53:41,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:53:41,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 497 transitions. [2023-08-29 20:53:41,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48158914728682173 [2023-08-29 20:53:41,316 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 497 transitions. [2023-08-29 20:53:41,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 497 transitions. [2023-08-29 20:53:41,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:53:41,316 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 497 transitions. [2023-08-29 20:53:41,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 0 states have call successors, (0), 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:53:41,322 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 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:53:41,322 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 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:53:41,323 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 102 flow. Second operand 3 states and 497 transitions. [2023-08-29 20:53:41,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 58 transitions, 230 flow [2023-08-29 20:53:41,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 58 transitions, 230 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:53:41,324 INFO L231 Difference]: Finished difference. Result has 58 places, 45 transitions, 112 flow [2023-08-29 20:53:41,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=58, PETRI_TRANSITIONS=45} [2023-08-29 20:53:41,326 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -20 predicate places. [2023-08-29 20:53:41,326 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 45 transitions, 112 flow [2023-08-29 20:53:41,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 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:53:41,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:53:41,327 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 20:53:41,336 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:53:41,536 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:53:41,537 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-08-29 20:53:41,537 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:53:41,537 INFO L85 PathProgramCache]: Analyzing trace with hash 856765, now seen corresponding path program 1 times [2023-08-29 20:53:41,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:53:41,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [747107419] [2023-08-29 20:53:41,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:53:41,538 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:53:41,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:53:41,543 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:53:41,544 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:53:41,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:53:41,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-29 20:53:41,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:53:41,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 20:53:41,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-29 20:53:41,714 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:53:41,714 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:53:41,714 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:53:41,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [747107419] [2023-08-29 20:53:41,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [747107419] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:53:41,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:53:41,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:53:41,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500383766] [2023-08-29 20:53:41,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:53:41,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:53:41,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:53:41,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:53:41,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:53:41,788 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 344 [2023-08-29 20:53:41,789 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 45 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 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:53:41,789 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:53:41,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 344 [2023-08-29 20:53:41,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:53:42,364 INFO L130 PetriNetUnfolder]: 4618/6577 cut-off events. [2023-08-29 20:53:42,364 INFO L131 PetriNetUnfolder]: For 306/405 co-relation queries the response was YES. [2023-08-29 20:53:42,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13829 conditions, 6577 events. 4618/6577 cut-off events. For 306/405 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 36025 event pairs, 4618 based on Foata normal form. 0/5826 useless extension candidates. Maximal degree in co-relation 13824. Up to 6365 conditions per place. [2023-08-29 20:53:42,406 INFO L137 encePairwiseOnDemand]: 337/344 looper letters, 31 selfloop transitions, 1 changer transitions 0/39 dead transitions. [2023-08-29 20:53:42,406 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 39 transitions, 164 flow [2023-08-29 20:53:42,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:53:42,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:53:42,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 488 transitions. [2023-08-29 20:53:42,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4728682170542636 [2023-08-29 20:53:42,408 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 488 transitions. [2023-08-29 20:53:42,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 488 transitions. [2023-08-29 20:53:42,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:53:42,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 488 transitions. [2023-08-29 20:53:42,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 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:53:42,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 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:53:42,412 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 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:53:42,412 INFO L175 Difference]: Start difference. First operand has 58 places, 45 transitions, 112 flow. Second operand 3 states and 488 transitions. [2023-08-29 20:53:42,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 39 transitions, 164 flow [2023-08-29 20:53:42,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 39 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:53:42,418 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 98 flow [2023-08-29 20:53:42,418 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2023-08-29 20:53:42,419 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -26 predicate places. [2023-08-29 20:53:42,419 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 98 flow [2023-08-29 20:53:42,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 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:53:42,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:53:42,419 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:53:42,436 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:53:42,633 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:53:42,634 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-08-29 20:53:42,634 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:53:42,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1933537309, now seen corresponding path program 1 times [2023-08-29 20:53:42,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:53:42,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [858855247] [2023-08-29 20:53:42,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:53:42,636 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:53:42,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:53:42,637 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:53:42,639 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:53:42,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:53:42,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:53:42,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:53:42,796 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:53:42,796 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:53:42,796 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:53:42,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [858855247] [2023-08-29 20:53:42,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [858855247] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:53:42,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:53:42,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:53:42,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926733076] [2023-08-29 20:53:42,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:53:42,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:53:42,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:53:42,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:53:42,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:53:42,814 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 344 [2023-08-29 20:53:42,815 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 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:53:42,815 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:53:42,815 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 344 [2023-08-29 20:53:42,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:53:43,336 INFO L130 PetriNetUnfolder]: 3094/4586 cut-off events. [2023-08-29 20:53:43,336 INFO L131 PetriNetUnfolder]: For 179/246 co-relation queries the response was YES. [2023-08-29 20:53:43,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9582 conditions, 4586 events. 3094/4586 cut-off events. For 179/246 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 25141 event pairs, 976 based on Foata normal form. 24/4084 useless extension candidates. Maximal degree in co-relation 9577. Up to 4311 conditions per place. [2023-08-29 20:53:43,356 INFO L137 encePairwiseOnDemand]: 338/344 looper letters, 44 selfloop transitions, 5 changer transitions 0/56 dead transitions. [2023-08-29 20:53:43,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 56 transitions, 236 flow [2023-08-29 20:53:43,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:53:43,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:53:43,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 488 transitions. [2023-08-29 20:53:43,358 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4728682170542636 [2023-08-29 20:53:43,358 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 488 transitions. [2023-08-29 20:53:43,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 488 transitions. [2023-08-29 20:53:43,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:53:43,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 488 transitions. [2023-08-29 20:53:43,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 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:53:43,362 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 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:53:43,363 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 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:53:43,363 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 98 flow. Second operand 3 states and 488 transitions. [2023-08-29 20:53:43,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 56 transitions, 236 flow [2023-08-29 20:53:43,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 56 transitions, 235 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:53:43,364 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 130 flow [2023-08-29 20:53:43,365 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=51, 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=3, PETRI_FLOW=130, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2023-08-29 20:53:43,365 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -24 predicate places. [2023-08-29 20:53:43,365 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 130 flow [2023-08-29 20:53:43,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 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:53:43,366 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:53:43,366 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:53:43,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-08-29 20:53:43,574 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:53:43,575 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-08-29 20:53:43,575 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:53:43,575 INFO L85 PathProgramCache]: Analyzing trace with hash -2106840175, now seen corresponding path program 1 times [2023-08-29 20:53:43,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:53:43,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1524668366] [2023-08-29 20:53:43,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:53:43,576 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:53:43,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:53:43,577 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:53:43,580 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:53:43,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:53:43,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:53:43,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:53:43,756 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:53:43,756 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:53:43,756 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:53:43,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1524668366] [2023-08-29 20:53:43,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1524668366] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:53:43,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:53:43,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:53:43,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202512157] [2023-08-29 20:53:43,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:53:43,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:53:43,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:53:43,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:53:43,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:53:43,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 344 [2023-08-29 20:53:43,770 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 130 flow. Second operand has 4 states, 4 states have (on average 149.75) internal successors, (599), 4 states have internal predecessors, (599), 0 states have call successors, (0), 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:53:43,770 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:53:43,770 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 344 [2023-08-29 20:53:43,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:53:44,149 INFO L130 PetriNetUnfolder]: 1230/2018 cut-off events. [2023-08-29 20:53:44,149 INFO L131 PetriNetUnfolder]: For 438/461 co-relation queries the response was YES. [2023-08-29 20:53:44,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4916 conditions, 2018 events. 1230/2018 cut-off events. For 438/461 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 10323 event pairs, 281 based on Foata normal form. 44/1836 useless extension candidates. Maximal degree in co-relation 4910. Up to 1557 conditions per place. [2023-08-29 20:53:44,156 INFO L137 encePairwiseOnDemand]: 338/344 looper letters, 54 selfloop transitions, 9 changer transitions 0/70 dead transitions. [2023-08-29 20:53:44,157 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 70 transitions, 328 flow [2023-08-29 20:53:44,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:53:44,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:53:44,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 648 transitions. [2023-08-29 20:53:44,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47093023255813954 [2023-08-29 20:53:44,159 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 648 transitions. [2023-08-29 20:53:44,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 648 transitions. [2023-08-29 20:53:44,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:53:44,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 648 transitions. [2023-08-29 20:53:44,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 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:53:44,164 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 344.0) internal successors, (1720), 5 states have internal predecessors, (1720), 0 states have call successors, (0), 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:53:44,164 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 344.0) internal successors, (1720), 5 states have internal predecessors, (1720), 0 states have call successors, (0), 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:53:44,164 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 130 flow. Second operand 4 states and 648 transitions. [2023-08-29 20:53:44,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 70 transitions, 328 flow [2023-08-29 20:53:44,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 70 transitions, 323 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:53:44,167 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 177 flow [2023-08-29 20:53:44,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=177, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2023-08-29 20:53:44,167 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -21 predicate places. [2023-08-29 20:53:44,167 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 177 flow [2023-08-29 20:53:44,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 149.75) internal successors, (599), 4 states have internal predecessors, (599), 0 states have call successors, (0), 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:53:44,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:53:44,168 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] [2023-08-29 20:53:44,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-08-29 20:53:44,377 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:53:44,378 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-08-29 20:53:44,378 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:53:44,378 INFO L85 PathProgramCache]: Analyzing trace with hash 240759517, now seen corresponding path program 1 times [2023-08-29 20:53:44,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:53:44,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [84536741] [2023-08-29 20:53:44,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:53:44,379 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:53:44,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:53:44,380 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:53:44,382 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:53:44,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:53:44,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-29 20:53:44,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:53:44,580 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:53:44,580 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:53:44,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:53:44,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [84536741] [2023-08-29 20:53:44,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [84536741] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:53:44,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:53:44,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:53:44,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053856673] [2023-08-29 20:53:44,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:53:44,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:53:44,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:53:44,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:53:44,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:53:44,603 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 344 [2023-08-29 20:53:44,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 177 flow. Second operand has 5 states, 5 states have (on average 149.4) internal successors, (747), 5 states have internal predecessors, (747), 0 states have call successors, (0), 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:53:44,605 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:53:44,605 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 344 [2023-08-29 20:53:44,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:53:44,935 INFO L130 PetriNetUnfolder]: 481/845 cut-off events. [2023-08-29 20:53:44,936 INFO L131 PetriNetUnfolder]: For 636/639 co-relation queries the response was YES. [2023-08-29 20:53:44,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2430 conditions, 845 events. 481/845 cut-off events. For 636/639 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3486 event pairs, 95 based on Foata normal form. 30/821 useless extension candidates. Maximal degree in co-relation 2423. Up to 282 conditions per place. [2023-08-29 20:53:44,939 INFO L137 encePairwiseOnDemand]: 338/344 looper letters, 62 selfloop transitions, 13 changer transitions 0/82 dead transitions. [2023-08-29 20:53:44,939 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 82 transitions, 425 flow [2023-08-29 20:53:44,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:53:44,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:53:44,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 806 transitions. [2023-08-29 20:53:44,942 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4686046511627907 [2023-08-29 20:53:44,942 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 806 transitions. [2023-08-29 20:53:44,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 806 transitions. [2023-08-29 20:53:44,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:53:44,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 806 transitions. [2023-08-29 20:53:44,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 161.2) internal successors, (806), 5 states have internal predecessors, (806), 0 states have call successors, (0), 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:53:44,947 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 344.0) internal successors, (2064), 6 states have internal predecessors, (2064), 0 states have call successors, (0), 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:53:44,948 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 344.0) internal successors, (2064), 6 states have internal predecessors, (2064), 0 states have call successors, (0), 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:53:44,948 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 177 flow. Second operand 5 states and 806 transitions. [2023-08-29 20:53:44,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 82 transitions, 425 flow [2023-08-29 20:53:44,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 82 transitions, 407 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-29 20:53:44,952 INFO L231 Difference]: Finished difference. Result has 60 places, 51 transitions, 227 flow [2023-08-29 20:53:44,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=227, PETRI_PLACES=60, PETRI_TRANSITIONS=51} [2023-08-29 20:53:44,953 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -18 predicate places. [2023-08-29 20:53:44,953 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 51 transitions, 227 flow [2023-08-29 20:53:44,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 149.4) internal successors, (747), 5 states have internal predecessors, (747), 0 states have call successors, (0), 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:53:44,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:53:44,954 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, 1] [2023-08-29 20:53:44,964 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:53:45,163 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:53:45,164 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-08-29 20:53:45,164 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:53:45,164 INFO L85 PathProgramCache]: Analyzing trace with hash 950560118, now seen corresponding path program 1 times [2023-08-29 20:53:45,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:53:45,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [45616754] [2023-08-29 20:53:45,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:53:45,165 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:53:45,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:53:45,166 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:53:45,167 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:53:45,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:53:45,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-29 20:53:45,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:53:45,357 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:53:45,357 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:53:45,357 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:53:45,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [45616754] [2023-08-29 20:53:45,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [45616754] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:53:45,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:53:45,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:53:45,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694344414] [2023-08-29 20:53:45,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:53:45,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:53:45,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:53:45,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:53:45,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:53:45,373 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 344 [2023-08-29 20:53:45,374 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 51 transitions, 227 flow. Second operand has 6 states, 6 states have (on average 149.16666666666666) internal successors, (895), 6 states have internal predecessors, (895), 0 states have call successors, (0), 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:53:45,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:53:45,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 344 [2023-08-29 20:53:45,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:53:45,753 INFO L130 PetriNetUnfolder]: 382/634 cut-off events. [2023-08-29 20:53:45,753 INFO L131 PetriNetUnfolder]: For 658/658 co-relation queries the response was YES. [2023-08-29 20:53:45,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1967 conditions, 634 events. 382/634 cut-off events. For 658/658 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2414 event pairs, 76 based on Foata normal form. 9/632 useless extension candidates. Maximal degree in co-relation 1959. Up to 250 conditions per place. [2023-08-29 20:53:45,756 INFO L137 encePairwiseOnDemand]: 338/344 looper letters, 54 selfloop transitions, 17 changer transitions 1/78 dead transitions. [2023-08-29 20:53:45,756 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 78 transitions, 429 flow [2023-08-29 20:53:45,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:53:45,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:53:45,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 949 transitions. [2023-08-29 20:53:45,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45978682170542634 [2023-08-29 20:53:45,758 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 949 transitions. [2023-08-29 20:53:45,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 949 transitions. [2023-08-29 20:53:45,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:53:45,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 949 transitions. [2023-08-29 20:53:45,761 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 158.16666666666666) internal successors, (949), 6 states have internal predecessors, (949), 0 states have call successors, (0), 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:53:45,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 344.0) internal successors, (2408), 7 states have internal predecessors, (2408), 0 states have call successors, (0), 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:53:45,764 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 344.0) internal successors, (2408), 7 states have internal predecessors, (2408), 0 states have call successors, (0), 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:53:45,765 INFO L175 Difference]: Start difference. First operand has 60 places, 51 transitions, 227 flow. Second operand 6 states and 949 transitions. [2023-08-29 20:53:45,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 78 transitions, 429 flow [2023-08-29 20:53:45,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 78 transitions, 393 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-08-29 20:53:45,770 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 217 flow [2023-08-29 20:53:45,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=217, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2023-08-29 20:53:45,770 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -20 predicate places. [2023-08-29 20:53:45,771 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 217 flow [2023-08-29 20:53:45,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 149.16666666666666) internal successors, (895), 6 states have internal predecessors, (895), 0 states have call successors, (0), 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:53:45,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:53:45,771 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, 1, 1, 1, 1, 1] [2023-08-29 20:53:45,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-08-29 20:53:45,981 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:53:45,981 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-08-29 20:53:45,982 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:53:45,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1951470742, now seen corresponding path program 1 times [2023-08-29 20:53:45,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:53:45,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [809965378] [2023-08-29 20:53:45,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:53:45,983 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:53:45,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:53:45,984 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:53:46,004 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:53:46,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:53:46,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 20:53:46,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:53:47,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-08-29 20:53:47,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 68 [2023-08-29 20:53:47,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-08-29 20:53:47,961 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:53:47,961 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:53:47,962 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:53:47,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [809965378] [2023-08-29 20:53:47,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [809965378] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:53:47,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:53:47,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:53:47,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475451217] [2023-08-29 20:53:47,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:53:47,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:53:47,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:53:47,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:53:47,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:53:48,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 344 [2023-08-29 20:53:48,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 217 flow. Second operand has 4 states, 4 states have (on average 149.75) internal successors, (599), 4 states have internal predecessors, (599), 0 states have call successors, (0), 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:53:48,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:53:48,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 344 [2023-08-29 20:53:48,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:53:48,229 INFO L130 PetriNetUnfolder]: 436/768 cut-off events. [2023-08-29 20:53:48,229 INFO L131 PetriNetUnfolder]: For 1119/1119 co-relation queries the response was YES. [2023-08-29 20:53:48,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2295 conditions, 768 events. 436/768 cut-off events. For 1119/1119 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3655 event pairs, 79 based on Foata normal form. 0/762 useless extension candidates. Maximal degree in co-relation 2287. Up to 511 conditions per place. [2023-08-29 20:53:48,232 INFO L137 encePairwiseOnDemand]: 341/344 looper letters, 61 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-08-29 20:53:48,232 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 67 transitions, 442 flow [2023-08-29 20:53:48,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:53:48,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:53:48,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 622 transitions. [2023-08-29 20:53:48,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45203488372093026 [2023-08-29 20:53:48,234 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 622 transitions. [2023-08-29 20:53:48,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 622 transitions. [2023-08-29 20:53:48,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:53:48,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 622 transitions. [2023-08-29 20:53:48,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 155.5) internal successors, (622), 4 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:53:48,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 344.0) internal successors, (1720), 5 states have internal predecessors, (1720), 0 states have call successors, (0), 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:53:48,238 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 344.0) internal successors, (1720), 5 states have internal predecessors, (1720), 0 states have call successors, (0), 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:53:48,238 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 217 flow. Second operand 4 states and 622 transitions. [2023-08-29 20:53:48,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 67 transitions, 442 flow [2023-08-29 20:53:48,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 67 transitions, 377 flow, removed 12 selfloop flow, removed 4 redundant places. [2023-08-29 20:53:48,243 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 169 flow [2023-08-29 20:53:48,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=169, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2023-08-29 20:53:48,244 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -23 predicate places. [2023-08-29 20:53:48,244 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 169 flow [2023-08-29 20:53:48,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 149.75) internal successors, (599), 4 states have internal predecessors, (599), 0 states have call successors, (0), 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:53:48,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:53:48,245 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, 1, 1, 1, 1, 1] [2023-08-29 20:53:48,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-08-29 20:53:48,455 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:53:48,455 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-08-29 20:53:48,455 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:53:48,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1714457499, now seen corresponding path program 1 times [2023-08-29 20:53:48,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:53:48,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [229320558] [2023-08-29 20:53:48,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:53:48,456 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:53:48,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:53:48,458 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:53:48,460 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:53:48,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:53:48,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-29 20:53:48,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:53:49,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 720 treesize of output 716 [2023-08-29 20:53:49,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 716 treesize of output 715 [2023-08-29 20:53:49,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 709 treesize of output 708 [2023-08-29 20:53:49,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 702 treesize of output 698 [2023-08-29 20:53:49,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 698 treesize of output 694 [2023-08-29 20:53:50,096 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:53:50,096 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:53:50,096 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:53:50,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [229320558] [2023-08-29 20:53:50,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [229320558] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:53:50,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:53:50,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:53:50,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303410820] [2023-08-29 20:53:50,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:53:50,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:53:50,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:53:50,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:53:50,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:53:50,216 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 344 [2023-08-29 20:53:50,216 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 169 flow. Second operand has 5 states, 5 states have (on average 151.6) internal successors, (758), 5 states have internal predecessors, (758), 0 states have call successors, (0), 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:53:50,216 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:53:50,216 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 344 [2023-08-29 20:53:50,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:53:50,373 INFO L130 PetriNetUnfolder]: 436/767 cut-off events. [2023-08-29 20:53:50,373 INFO L131 PetriNetUnfolder]: For 674/674 co-relation queries the response was YES. [2023-08-29 20:53:50,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2142 conditions, 767 events. 436/767 cut-off events. For 674/674 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3678 event pairs, 79 based on Foata normal form. 0/762 useless extension candidates. Maximal degree in co-relation 2134. Up to 513 conditions per place. [2023-08-29 20:53:50,376 INFO L137 encePairwiseOnDemand]: 341/344 looper letters, 59 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-08-29 20:53:50,376 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 66 transitions, 375 flow [2023-08-29 20:53:50,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:53:50,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:53:50,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 632 transitions. [2023-08-29 20:53:50,378 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45930232558139533 [2023-08-29 20:53:50,378 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 632 transitions. [2023-08-29 20:53:50,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 632 transitions. [2023-08-29 20:53:50,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:53:50,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 632 transitions. [2023-08-29 20:53:50,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 158.0) internal successors, (632), 4 states have internal predecessors, (632), 0 states have call successors, (0), 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:53:50,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 344.0) internal successors, (1720), 5 states have internal predecessors, (1720), 0 states have call successors, (0), 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:53:50,382 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 344.0) internal successors, (1720), 5 states have internal predecessors, (1720), 0 states have call successors, (0), 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:53:50,382 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 169 flow. Second operand 4 states and 632 transitions. [2023-08-29 20:53:50,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 66 transitions, 375 flow [2023-08-29 20:53:50,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 66 transitions, 372 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:53:50,385 INFO L231 Difference]: Finished difference. Result has 55 places, 44 transitions, 168 flow [2023-08-29 20:53:50,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=168, PETRI_PLACES=55, PETRI_TRANSITIONS=44} [2023-08-29 20:53:50,386 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -23 predicate places. [2023-08-29 20:53:50,386 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 168 flow [2023-08-29 20:53:50,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 151.6) internal successors, (758), 5 states have internal predecessors, (758), 0 states have call successors, (0), 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:53:50,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:53:50,387 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, 1, 1, 1, 1, 1] [2023-08-29 20:53:50,397 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:53:50,592 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:53:50,593 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-08-29 20:53:50,593 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:53:50,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1526008795, now seen corresponding path program 1 times [2023-08-29 20:53:50,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:53:50,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1264786176] [2023-08-29 20:53:50,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:53:50,594 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:53:50,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:53:50,594 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:53:50,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-08-29 20:53:50,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:53:50,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:53:50,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:53:50,762 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:53:50,763 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:53:50,763 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:53:50,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1264786176] [2023-08-29 20:53:50,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1264786176] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:53:50,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:53:50,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:53:50,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553272326] [2023-08-29 20:53:50,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:53:50,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:53:50,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:53:50,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:53:50,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:53:50,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 344 [2023-08-29 20:53:50,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 44 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 152.75) internal successors, (611), 4 states have internal predecessors, (611), 0 states have call successors, (0), 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:53:50,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:53:50,771 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 344 [2023-08-29 20:53:50,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:53:51,001 INFO L130 PetriNetUnfolder]: 669/1149 cut-off events. [2023-08-29 20:53:51,001 INFO L131 PetriNetUnfolder]: For 912/912 co-relation queries the response was YES. [2023-08-29 20:53:51,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3267 conditions, 1149 events. 669/1149 cut-off events. For 912/912 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5851 event pairs, 207 based on Foata normal form. 0/1140 useless extension candidates. Maximal degree in co-relation 3259. Up to 406 conditions per place. [2023-08-29 20:53:51,007 INFO L137 encePairwiseOnDemand]: 340/344 looper letters, 87 selfloop transitions, 3 changer transitions 0/95 dead transitions. [2023-08-29 20:53:51,007 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 95 transitions, 561 flow [2023-08-29 20:53:51,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:53:51,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:53:51,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 649 transitions. [2023-08-29 20:53:51,009 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47165697674418605 [2023-08-29 20:53:51,009 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 649 transitions. [2023-08-29 20:53:51,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 649 transitions. [2023-08-29 20:53:51,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:53:51,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 649 transitions. [2023-08-29 20:53:51,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 162.25) internal successors, (649), 4 states have internal predecessors, (649), 0 states have call successors, (0), 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:53:51,012 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 344.0) internal successors, (1720), 5 states have internal predecessors, (1720), 0 states have call successors, (0), 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:53:51,013 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 344.0) internal successors, (1720), 5 states have internal predecessors, (1720), 0 states have call successors, (0), 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:53:51,013 INFO L175 Difference]: Start difference. First operand has 55 places, 44 transitions, 168 flow. Second operand 4 states and 649 transitions. [2023-08-29 20:53:51,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 95 transitions, 561 flow [2023-08-29 20:53:51,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 95 transitions, 558 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:53:51,019 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 179 flow [2023-08-29 20:53:51,019 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2023-08-29 20:53:51,020 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -21 predicate places. [2023-08-29 20:53:51,020 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 179 flow [2023-08-29 20:53:51,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 152.75) internal successors, (611), 4 states have internal predecessors, (611), 0 states have call successors, (0), 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:53:51,020 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:53:51,020 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, 1, 1, 1, 1, 1] [2023-08-29 20:53:51,031 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 (11)] Forceful destruction successful, exit code 0 [2023-08-29 20:53:51,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:53:51,230 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-08-29 20:53:51,231 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:53:51,231 INFO L85 PathProgramCache]: Analyzing trace with hash -993152963, now seen corresponding path program 2 times [2023-08-29 20:53:51,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:53:51,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1863141146] [2023-08-29 20:53:51,231 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 20:53:51,231 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:53:51,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:53:51,232 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:53:51,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-08-29 20:53:51,353 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 20:53:51,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:53:51,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:53:51,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:53:51,397 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:53:51,397 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:53:51,397 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:53:51,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1863141146] [2023-08-29 20:53:51,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1863141146] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:53:51,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:53:51,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:53:51,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866384475] [2023-08-29 20:53:51,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:53:51,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:53:51,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:53:51,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:53:51,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:53:51,403 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 344 [2023-08-29 20:53:51,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 179 flow. Second operand has 4 states, 4 states have (on average 152.75) internal successors, (611), 4 states have internal predecessors, (611), 0 states have call successors, (0), 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:53:51,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:53:51,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 344 [2023-08-29 20:53:51,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:53:51,625 INFO L130 PetriNetUnfolder]: 984/1696 cut-off events. [2023-08-29 20:53:51,626 INFO L131 PetriNetUnfolder]: For 1456/1456 co-relation queries the response was YES. [2023-08-29 20:53:51,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5092 conditions, 1696 events. 984/1696 cut-off events. For 1456/1456 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 9327 event pairs, 267 based on Foata normal form. 1/1687 useless extension candidates. Maximal degree in co-relation 5083. Up to 650 conditions per place. [2023-08-29 20:53:51,632 INFO L137 encePairwiseOnDemand]: 340/344 looper letters, 83 selfloop transitions, 3 changer transitions 0/91 dead transitions. [2023-08-29 20:53:51,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 91 transitions, 552 flow [2023-08-29 20:53:51,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:53:51,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:53:51,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 644 transitions. [2023-08-29 20:53:51,634 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4680232558139535 [2023-08-29 20:53:51,634 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 644 transitions. [2023-08-29 20:53:51,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 644 transitions. [2023-08-29 20:53:51,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:53:51,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 644 transitions. [2023-08-29 20:53:51,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 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:53:51,637 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 344.0) internal successors, (1720), 5 states have internal predecessors, (1720), 0 states have call successors, (0), 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:53:51,637 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 344.0) internal successors, (1720), 5 states have internal predecessors, (1720), 0 states have call successors, (0), 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:53:51,637 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 179 flow. Second operand 4 states and 644 transitions. [2023-08-29 20:53:51,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 91 transitions, 552 flow [2023-08-29 20:53:51,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 91 transitions, 548 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:53:51,648 INFO L231 Difference]: Finished difference. Result has 59 places, 46 transitions, 189 flow [2023-08-29 20:53:51,648 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=189, PETRI_PLACES=59, PETRI_TRANSITIONS=46} [2023-08-29 20:53:51,649 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -19 predicate places. [2023-08-29 20:53:51,649 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 46 transitions, 189 flow [2023-08-29 20:53:51,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 152.75) internal successors, (611), 4 states have internal predecessors, (611), 0 states have call successors, (0), 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:53:51,649 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:53:51,649 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, 1, 1, 1, 1, 1] [2023-08-29 20:53:51,661 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 (12)] Forceful destruction successful, exit code 0 [2023-08-29 20:53:51,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:53:51,859 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-08-29 20:53:51,860 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:53:51,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1564015551, now seen corresponding path program 3 times [2023-08-29 20:53:51,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:53:51,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1622968655] [2023-08-29 20:53:51,860 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 20:53:51,860 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:53:51,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:53:51,861 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:53:51,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-08-29 20:53:51,985 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-29 20:53:51,986 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:53:51,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:53:51,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:53:52,025 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:53:52,025 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:53:52,025 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:53:52,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1622968655] [2023-08-29 20:53:52,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1622968655] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:53:52,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:53:52,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:53:52,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860506592] [2023-08-29 20:53:52,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:53:52,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:53:52,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:53:52,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:53:52,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:53:52,032 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 344 [2023-08-29 20:53:52,033 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 189 flow. Second operand has 4 states, 4 states have (on average 152.75) internal successors, (611), 4 states have internal predecessors, (611), 0 states have call successors, (0), 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:53:52,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:53:52,033 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 344 [2023-08-29 20:53:52,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:53:52,267 INFO L130 PetriNetUnfolder]: 1305/2221 cut-off events. [2023-08-29 20:53:52,267 INFO L131 PetriNetUnfolder]: For 2187/2187 co-relation queries the response was YES. [2023-08-29 20:53:52,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6998 conditions, 2221 events. 1305/2221 cut-off events. For 2187/2187 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 12548 event pairs, 377 based on Foata normal form. 1/2218 useless extension candidates. Maximal degree in co-relation 6988. Up to 968 conditions per place. [2023-08-29 20:53:52,275 INFO L137 encePairwiseOnDemand]: 340/344 looper letters, 81 selfloop transitions, 3 changer transitions 0/89 dead transitions. [2023-08-29 20:53:52,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 89 transitions, 556 flow [2023-08-29 20:53:52,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:53:52,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:53:52,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 639 transitions. [2023-08-29 20:53:52,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4643895348837209 [2023-08-29 20:53:52,277 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 639 transitions. [2023-08-29 20:53:52,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 639 transitions. [2023-08-29 20:53:52,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:53:52,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 639 transitions. [2023-08-29 20:53:52,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 159.75) internal successors, (639), 4 states have internal predecessors, (639), 0 states have call successors, (0), 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:53:52,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 344.0) internal successors, (1720), 5 states have internal predecessors, (1720), 0 states have call successors, (0), 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:53:52,281 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 344.0) internal successors, (1720), 5 states have internal predecessors, (1720), 0 states have call successors, (0), 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:53:52,281 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 189 flow. Second operand 4 states and 639 transitions. [2023-08-29 20:53:52,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 89 transitions, 556 flow [2023-08-29 20:53:52,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 89 transitions, 552 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:53:52,296 INFO L231 Difference]: Finished difference. Result has 61 places, 47 transitions, 199 flow [2023-08-29 20:53:52,296 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=57, 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=199, PETRI_PLACES=61, PETRI_TRANSITIONS=47} [2023-08-29 20:53:52,297 INFO L281 CegarLoopForPetriNet]: 78 programPoint places, -17 predicate places. [2023-08-29 20:53:52,297 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 47 transitions, 199 flow [2023-08-29 20:53:52,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 152.75) internal successors, (611), 4 states have internal predecessors, (611), 0 states have call successors, (0), 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:53:52,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:53:52,297 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, 1, 1, 1, 1, 1] [2023-08-29 20:53:52,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-08-29 20:53:52,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:53:52,507 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2023-08-29 20:53:52,508 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:53:52,508 INFO L85 PathProgramCache]: Analyzing trace with hash -537238711, now seen corresponding path program 4 times [2023-08-29 20:53:52,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:53:52,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1296669777] [2023-08-29 20:53:52,508 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-29 20:53:52,508 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:53:52,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:53:52,509 INFO L229 MonitoredProcess]: Starting monitored process 14 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:53:52,510 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 (14)] Waiting until timeout for monitored process [2023-08-29 20:53:52,694 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-29 20:53:52,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-29 20:53:52,694 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:53:52,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:53:52,923 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-29 20:53:52,923 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:53:52,924 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (55 of 56 remaining) [2023-08-29 20:53:52,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 56 remaining) [2023-08-29 20:53:52,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 56 remaining) [2023-08-29 20:53:52,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 56 remaining) [2023-08-29 20:53:52,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 56 remaining) [2023-08-29 20:53:52,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 56 remaining) [2023-08-29 20:53:52,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 56 remaining) [2023-08-29 20:53:52,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 56 remaining) [2023-08-29 20:53:52,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 56 remaining) [2023-08-29 20:53:52,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 56 remaining) [2023-08-29 20:53:52,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 56 remaining) [2023-08-29 20:53:52,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 56 remaining) [2023-08-29 20:53:52,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 56 remaining) [2023-08-29 20:53:52,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 56 remaining) [2023-08-29 20:53:52,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 56 remaining) [2023-08-29 20:53:52,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 56 remaining) [2023-08-29 20:53:52,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 56 remaining) [2023-08-29 20:53:52,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 56 remaining) [2023-08-29 20:53:52,932 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 56 remaining) [2023-08-29 20:53:52,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 56 remaining) [2023-08-29 20:53:52,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 56 remaining) [2023-08-29 20:53:52,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 56 remaining) [2023-08-29 20:53:52,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 56 remaining) [2023-08-29 20:53:52,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 56 remaining) [2023-08-29 20:53:52,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 56 remaining) [2023-08-29 20:53:52,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 56 remaining) [2023-08-29 20:53:52,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 56 remaining) [2023-08-29 20:53:52,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 56 remaining) [2023-08-29 20:53:52,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 56 remaining) [2023-08-29 20:53:52,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 56 remaining) [2023-08-29 20:53:52,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 56 remaining) [2023-08-29 20:53:52,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 56 remaining) [2023-08-29 20:53:52,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 56 remaining) [2023-08-29 20:53:52,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (22 of 56 remaining) [2023-08-29 20:53:52,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 56 remaining) [2023-08-29 20:53:52,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 56 remaining) [2023-08-29 20:53:52,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 56 remaining) [2023-08-29 20:53:52,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 56 remaining) [2023-08-29 20:53:52,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 56 remaining) [2023-08-29 20:53:52,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 56 remaining) [2023-08-29 20:53:52,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 56 remaining) [2023-08-29 20:53:52,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 56 remaining) [2023-08-29 20:53:52,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 56 remaining) [2023-08-29 20:53:52,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 56 remaining) [2023-08-29 20:53:52,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 56 remaining) [2023-08-29 20:53:52,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 56 remaining) [2023-08-29 20:53:52,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 56 remaining) [2023-08-29 20:53:52,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 56 remaining) [2023-08-29 20:53:52,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 56 remaining) [2023-08-29 20:53:52,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 56 remaining) [2023-08-29 20:53:52,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 56 remaining) [2023-08-29 20:53:52,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 56 remaining) [2023-08-29 20:53:52,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 56 remaining) [2023-08-29 20:53:52,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 56 remaining) [2023-08-29 20:53:52,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 56 remaining) [2023-08-29 20:53:52,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 56 remaining) [2023-08-29 20:53:52,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-08-29 20:53:53,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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:53:53,158 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:53:53,162 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:53:53,162 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:53:53,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:53:53 BasicIcfg [2023-08-29 20:53:53,263 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:53:53,263 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:53:53,263 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:53:53,264 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:53:53,264 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:53:23" (3/4) ... [2023-08-29 20:53:53,266 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:53:53,266 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:53:53,267 INFO L158 Benchmark]: Toolchain (without parser) took 32089.41ms. Allocated memory was 77.6MB in the beginning and 3.4GB in the end (delta: 3.4GB). Free memory was 56.8MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2023-08-29 20:53:53,267 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 62.9MB. Free memory is still 40.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:53:53,267 INFO L158 Benchmark]: CACSL2BoogieTranslator took 586.88ms. Allocated memory is still 77.6MB. Free memory was 56.8MB in the beginning and 50.6MB in the end (delta: 6.2MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2023-08-29 20:53:53,267 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.48ms. Allocated memory is still 77.6MB. Free memory was 50.6MB in the beginning and 48.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:53:53,267 INFO L158 Benchmark]: Boogie Preprocessor took 32.55ms. Allocated memory is still 77.6MB. Free memory was 48.2MB in the beginning and 45.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:53:53,268 INFO L158 Benchmark]: RCFGBuilder took 1175.23ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 45.7MB in the beginning and 55.8MB in the end (delta: -10.0MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. [2023-08-29 20:53:53,268 INFO L158 Benchmark]: TraceAbstraction took 30243.57ms. Allocated memory was 94.4MB in the beginning and 3.4GB in the end (delta: 3.4GB). Free memory was 55.2MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2023-08-29 20:53:53,268 INFO L158 Benchmark]: Witness Printer took 2.75ms. Allocated memory is still 3.4GB. Free memory is still 2.1GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:53:53,270 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.09ms. Allocated memory is still 62.9MB. Free memory is still 40.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 586.88ms. Allocated memory is still 77.6MB. Free memory was 56.8MB in the beginning and 50.6MB in the end (delta: 6.2MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.48ms. Allocated memory is still 77.6MB. Free memory was 50.6MB in the beginning and 48.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.55ms. Allocated memory is still 77.6MB. Free memory was 48.2MB in the beginning and 45.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1175.23ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 45.7MB in the beginning and 55.8MB in the end (delta: -10.0MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. * TraceAbstraction took 30243.57ms. Allocated memory was 94.4MB in the beginning and 3.4GB in the end (delta: 3.4GB). Free memory was 55.2MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 2.75ms. Allocated memory is still 3.4GB. Free memory is still 2.1GB. 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: 12.0s, 191 PlacesBefore, 78 PlacesAfterwards, 180 TransitionsBefore, 65 TransitionsAfterwards, 6020 CoEnabledTransitionPairs, 7 FixpointIterations, 76 TrivialSequentialCompositions, 78 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 160 TotalNumberOfCompositions, 21494 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8679, independent: 8226, independent conditional: 0, independent unconditional: 8226, dependent: 453, dependent conditional: 0, dependent unconditional: 453, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2769, independent: 2685, independent conditional: 0, independent unconditional: 2685, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8679, independent: 5541, independent conditional: 0, independent unconditional: 5541, dependent: 369, dependent conditional: 0, dependent unconditional: 369, unknown: 2769, unknown conditional: 0, unknown unconditional: 2769] , Statistics on independence cache: Total cache size (in pairs): 430, Positive cache size: 389, Positive conditional cache size: 0, Positive unconditional cache size: 389, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p1_EAX = 0; [L735] 0 int __unbuffered_p2_EAX = 0; [L737] 0 int __unbuffered_p3_EAX = 0; [L739] 0 int a = 0; [L740] 0 _Bool a$flush_delayed; [L741] 0 int a$mem_tmp; [L742] 0 _Bool a$r_buff0_thd0; [L743] 0 _Bool a$r_buff0_thd1; [L744] 0 _Bool a$r_buff0_thd2; [L745] 0 _Bool a$r_buff0_thd3; [L746] 0 _Bool a$r_buff0_thd4; [L747] 0 _Bool a$r_buff1_thd0; [L748] 0 _Bool a$r_buff1_thd1; [L749] 0 _Bool a$r_buff1_thd2; [L750] 0 _Bool a$r_buff1_thd3; [L751] 0 _Bool a$r_buff1_thd4; [L752] 0 _Bool a$read_delayed; [L753] 0 int *a$read_delayed_var; [L754] 0 int a$w_buff0; [L755] 0 _Bool a$w_buff0_used; [L756] 0 int a$w_buff1; [L757] 0 _Bool a$w_buff1_used; [L758] 0 _Bool main$tmp_guard0; [L759] 0 _Bool main$tmp_guard1; [L761] 0 int x = 0; [L763] 0 int y = 0; [L765] 0 int z = 0; [L766] 0 _Bool weak$$choice0; [L767] 0 _Bool weak$$choice1; [L768] 0 _Bool weak$$choice2; [L860] 0 pthread_t t2721; [L861] FCALL, FORK 0 pthread_create(&t2721, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2721, ((void *)0), P0, ((void *)0))=-1, t2721={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z=0] [L862] 0 pthread_t t2722; [L772] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 1 a$flush_delayed = weak$$choice2 [L775] EXPR 1 \read(a) [L775] 1 a$mem_tmp = a [L776] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff1) [L776] EXPR 1 \read(a) [L776] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff1) [L776] 1 a = !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff1) [L777] 1 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff0)) [L778] 1 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff1 : a$w_buff1)) [L779] 1 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used)) [L780] 1 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L781] 1 a$r_buff0_thd1 = weak$$choice2 ? a$r_buff0_thd1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$r_buff0_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1)) [L782] 1 a$r_buff1_thd1 = weak$$choice2 ? a$r_buff1_thd1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$r_buff1_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L783] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L784] 1 __unbuffered_p0_EAX$read_delayed_var = &a [L785] EXPR 1 \read(a) [L785] 1 __unbuffered_p0_EAX = a [L786] EXPR 1 a$flush_delayed ? a$mem_tmp : a [L786] 1 a = a$flush_delayed ? a$mem_tmp : a [L787] 1 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=2, x=0, y=0, z=0] [L790] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=2, x=1, y=0, z=0] [L795] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 1 return 0; [L863] FCALL, FORK 0 pthread_create(&t2722, ((void *)0), P1, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2722, ((void *)0), P1, ((void *)0))=0, t2721={15:0}, t2722={6:0}, weak$$choice1=0, weak$$choice2=2, x=1, y=0, z=0] [L864] 0 pthread_t t2723; [L865] FCALL, FORK 0 pthread_create(&t2723, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2723, ((void *)0), P2, ((void *)0))=1, t2721={15:0}, t2722={6:0}, t2723={7:0}, weak$$choice1=0, weak$$choice2=2, x=1, y=0, z=0] [L802] 2 __unbuffered_p1_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3: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$$choice1=0, weak$$choice2=2, x=1, y=0, z=0] [L805] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3: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$$choice1=0, weak$$choice2=2, x=1, y=1, z=0] [L810] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 2 return 0; [L866] 0 pthread_t t2724; [L817] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3: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$$choice1=0, weak$$choice2=2, x=1, y=1, z=0] [L867] FCALL, FORK 0 pthread_create(&t2724, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0: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, pthread_create(&t2724, ((void *)0), P3, ((void *)0))=2, t2721={15:0}, t2722={6:0}, t2723={7:0}, t2724={23:0}, weak$$choice1=0, weak$$choice2=2, x=1, y=1, z=0] [L820] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0: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$$choice1=0, weak$$choice2=2, x=1, y=1, z=1] [L825] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L827] 3 return 0; [L832] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0: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$$choice1=0, weak$$choice2=2, x=1, y=1, z=1] [L835] 4 a = 1 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0: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$$choice1=0, weak$$choice2=2, x=1, y=1, z=1] [L838] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L838] EXPR 4 \read(a) [L838] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L838] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L839] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L840] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L841] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L842] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0: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$$choice1=0, weak$$choice2=2, x=1, y=1, z=1] [L845] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L847] 4 return 0; [L869] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L871] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L871] RET 0 assume_abort_if_not(main$tmp_guard0) [L873] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L873] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L873] EXPR 0 \read(a) [L873] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L873] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L873] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L874] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L875] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L876] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L877] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2721={15:0}, t2722={6:0}, t2723={7:0}, t2724={23:0}, weak$$choice1=0, weak$$choice2=2, x=1, y=1, z=1] [L880] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L881] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L881] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L881] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L881] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L881] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L881] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p3_EAX == 1) [L884] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=2, weak$$choice2=2, x=1, y=1, z=1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 867]: 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: 865]: 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: 861]: 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: 863]: 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 9 procedures, 234 locations, 56 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: 30.0s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 12.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 614 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 411 mSDsluCounter, 59 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1507 IncrementalHoareTripleChecker+Invalid, 1595 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 9 mSDtfsCounter, 1507 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 210 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=227occurred in iteration=6, InterpolantAutomatonStates: 46, 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.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 243 NumberOfCodeBlocks, 243 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 204 ConstructedInterpolants, 0 QuantifiedInterpolants, 728 SizeOfPredicates, 37 NumberOfNonLiveVariables, 1948 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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:53:53,300 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