./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix021_tso.oepc.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/mix021_tso.oepc.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 1821be0ec0c098ba0cd2fb39edc7421f58889218b21285544a5e01e847e429e6 --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:20:13,452 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:20:13,454 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:20:13,492 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:20:13,495 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:20:13,497 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:20:13,500 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:20:13,503 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:20:13,505 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:20:13,510 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:20:13,510 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:20:13,513 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:20:13,513 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:20:13,515 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:20:13,517 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:20:13,521 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:20:13,521 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:20:13,523 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:20:13,524 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:20:13,529 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:20:13,530 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:20:13,531 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:20:13,532 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:20:13,533 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:20:13,539 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:20:13,539 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:20:13,539 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:20:13,542 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:20:13,542 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:20:13,543 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:20:13,544 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:20:13,549 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:20:13,550 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:20:13,551 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:20:13,552 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:20:13,552 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:20:13,553 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:20:13,553 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:20:13,553 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:20:13,554 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:20:13,554 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:20:13,556 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:20:13,599 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:20:13,599 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:20:13,600 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:20:13,600 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:20:13,601 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:20:13,601 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:20:13,602 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:20:13,602 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:20:13,602 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:20:13,602 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:20:13,603 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:20:13,603 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:20:13,604 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:20:13,604 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:20:13,604 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:20:13,604 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:20:13,604 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:20:13,604 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:20:13,605 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:20:13,606 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:20:13,606 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:20:13,609 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:20:13,610 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:20:13,611 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:20:13,611 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:20:13,611 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:20:13,612 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:20:13,612 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:20:13,612 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 20:20:13,612 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 20:20:13,612 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:20:13,613 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:20:13,613 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:20:13,613 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:20:13,613 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 -> 1821be0ec0c098ba0cd2fb39edc7421f58889218b21285544a5e01e847e429e6 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:20:13,898 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:20:13,915 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:20:13,918 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:20:13,919 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:20:13,919 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:20:13,920 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix021_tso.oepc.i [2023-08-29 20:20:15,127 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:20:15,423 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:20:15,424 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix021_tso.oepc.i [2023-08-29 20:20:15,449 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acc863251/3f194d1e25c24923940b47c1f4733017/FLAG6e3b587e4 [2023-08-29 20:20:15,470 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acc863251/3f194d1e25c24923940b47c1f4733017 [2023-08-29 20:20:15,472 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:20:15,473 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:20:15,474 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:20:15,474 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:20:15,477 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:20:15,478 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:20:15" (1/1) ... [2023-08-29 20:20:15,479 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@552b11b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:20:15, skipping insertion in model container [2023-08-29 20:20:15,479 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:20:15" (1/1) ... [2023-08-29 20:20:15,485 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:20:15,541 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:20:15,683 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/mix021_tso.oepc.i[949,962] [2023-08-29 20:20:15,894 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:20:15,906 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:20:15,918 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/mix021_tso.oepc.i[949,962] [2023-08-29 20:20:15,976 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:20:16,008 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:20:16,008 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:20:16,021 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:20:16,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:20:16 WrapperNode [2023-08-29 20:20:16,022 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:20:16,022 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:20:16,023 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:20:16,023 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:20:16,029 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:20:16" (1/1) ... [2023-08-29 20:20:16,042 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:20:16" (1/1) ... [2023-08-29 20:20:16,067 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 161 [2023-08-29 20:20:16,068 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:20:16,068 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:20:16,068 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:20:16,069 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:20:16,077 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:20:16" (1/1) ... [2023-08-29 20:20:16,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:20:16" (1/1) ... [2023-08-29 20:20:16,081 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:20:16" (1/1) ... [2023-08-29 20:20:16,081 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:20:16" (1/1) ... [2023-08-29 20:20:16,091 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:20:16" (1/1) ... [2023-08-29 20:20:16,093 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:20:16" (1/1) ... [2023-08-29 20:20:16,095 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:20:16" (1/1) ... [2023-08-29 20:20:16,097 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:20:16" (1/1) ... [2023-08-29 20:20:16,100 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:20:16,101 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:20:16,101 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:20:16,101 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:20:16,102 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:20:16" (1/1) ... [2023-08-29 20:20:16,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:20:16,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:20:16,146 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:20:16,173 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:20:16,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 20:20:16,191 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:20:16,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:20:16,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:20:16,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:20:16,191 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:20:16,192 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:20:16,192 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:20:16,192 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:20:16,192 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:20:16,192 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:20:16,193 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-29 20:20:16,193 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-29 20:20:16,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 20:20:16,193 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:20:16,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:20:16,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:20:16,195 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:20:16,324 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:20:16,330 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:20:16,809 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:20:16,943 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:20:16,943 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:20:16,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:20:16 BoogieIcfgContainer [2023-08-29 20:20:16,946 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:20:16,948 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:20:16,948 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:20:16,951 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:20:16,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:20:15" (1/3) ... [2023-08-29 20:20:16,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b00f751 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:20:16, skipping insertion in model container [2023-08-29 20:20:16,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:20:16" (2/3) ... [2023-08-29 20:20:16,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b00f751 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:20:16, skipping insertion in model container [2023-08-29 20:20:16,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:20:16" (3/3) ... [2023-08-29 20:20:16,954 INFO L112 eAbstractionObserver]: Analyzing ICFG mix021_tso.oepc.i [2023-08-29 20:20:16,968 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:20:16,969 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-29 20:20:16,970 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:20:17,044 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:20:17,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 141 transitions, 302 flow [2023-08-29 20:20:17,156 INFO L130 PetriNetUnfolder]: 2/137 cut-off events. [2023-08-29 20:20:17,157 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:20:17,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 137 events. 2/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-29 20:20:17,163 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 141 transitions, 302 flow [2023-08-29 20:20:17,174 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 137 transitions, 286 flow [2023-08-29 20:20:17,179 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:20:17,197 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 137 transitions, 286 flow [2023-08-29 20:20:17,201 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 137 transitions, 286 flow [2023-08-29 20:20:17,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 137 transitions, 286 flow [2023-08-29 20:20:17,258 INFO L130 PetriNetUnfolder]: 2/137 cut-off events. [2023-08-29 20:20:17,259 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:20:17,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 137 events. 2/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 105 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-29 20:20:17,264 INFO L119 LiptonReduction]: Number of co-enabled transitions 3320 [2023-08-29 20:20:21,645 INFO L134 LiptonReduction]: Checked pairs total: 9639 [2023-08-29 20:20:21,645 INFO L136 LiptonReduction]: Total number of compositions: 131 [2023-08-29 20:20:21,657 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:20:21,663 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;@61caa215, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:20:21,663 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-29 20:20:21,665 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:20:21,665 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:20:21,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:20:21,665 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:20:21,666 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:20:21,670 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:20:21,670 INFO L85 PathProgramCache]: Analyzing trace with hash 590, now seen corresponding path program 1 times [2023-08-29 20:20:21,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:20:21,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312102146] [2023-08-29 20:20:21,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:20:21,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:20:21,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:20:21,771 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:20:21,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:20:21,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312102146] [2023-08-29 20:20:21,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312102146] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:20:21,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:20:21,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:20:21,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959187429] [2023-08-29 20:20:21,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:20:21,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:20:21,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:20:21,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:20:21,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:20:21,804 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 272 [2023-08-29 20:20:21,806 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 94 flow. Second operand has 2 states, 2 states have (on average 127.5) internal successors, (255), 2 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:21,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:20:21,807 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 272 [2023-08-29 20:20:21,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:20:22,815 INFO L130 PetriNetUnfolder]: 5761/7953 cut-off events. [2023-08-29 20:20:22,816 INFO L131 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2023-08-29 20:20:22,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15943 conditions, 7953 events. 5761/7953 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 42043 event pairs, 5761 based on Foata normal form. 240/6872 useless extension candidates. Maximal degree in co-relation 15931. Up to 7833 conditions per place. [2023-08-29 20:20:22,872 INFO L137 encePairwiseOnDemand]: 263/272 looper letters, 27 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2023-08-29 20:20:22,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 130 flow [2023-08-29 20:20:22,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:20:22,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:20:22,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 290 transitions. [2023-08-29 20:20:22,890 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5330882352941176 [2023-08-29 20:20:22,891 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 290 transitions. [2023-08-29 20:20:22,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 290 transitions. [2023-08-29 20:20:22,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:20:22,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 290 transitions. [2023-08-29 20:20:22,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 145.0) internal successors, (290), 2 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:22,904 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 272.0) internal successors, (816), 3 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:22,904 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 272.0) internal successors, (816), 3 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:22,906 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 94 flow. Second operand 2 states and 290 transitions. [2023-08-29 20:20:22,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 130 flow [2023-08-29 20:20:22,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 126 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 20:20:22,913 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 72 flow [2023-08-29 20:20:22,915 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2023-08-29 20:20:22,921 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2023-08-29 20:20:22,921 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 72 flow [2023-08-29 20:20:22,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 127.5) internal successors, (255), 2 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:22,923 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:20:22,924 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:20:22,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 20:20:22,924 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:20:22,925 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:20:22,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1373493098, now seen corresponding path program 1 times [2023-08-29 20:20:22,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:20:22,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196509064] [2023-08-29 20:20:22,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:20:22,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:20:22,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:20:23,328 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:20:23,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:20:23,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196509064] [2023-08-29 20:20:23,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196509064] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:20:23,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:20:23,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:20:23,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995258696] [2023-08-29 20:20:23,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:20:23,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:20:23,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:20:23,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:20:23,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:20:23,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 272 [2023-08-29 20:20:23,336 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:23,336 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:20:23,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 272 [2023-08-29 20:20:23,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:20:24,053 INFO L130 PetriNetUnfolder]: 4535/6637 cut-off events. [2023-08-29 20:20:24,053 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:20:24,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12966 conditions, 6637 events. 4535/6637 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 39479 event pairs, 857 based on Foata normal form. 0/5997 useless extension candidates. Maximal degree in co-relation 12963. Up to 4903 conditions per place. [2023-08-29 20:20:24,085 INFO L137 encePairwiseOnDemand]: 269/272 looper letters, 37 selfloop transitions, 2 changer transitions 4/48 dead transitions. [2023-08-29 20:20:24,086 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 48 transitions, 192 flow [2023-08-29 20:20:24,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:20:24,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:20:24,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2023-08-29 20:20:24,088 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5171568627450981 [2023-08-29 20:20:24,088 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 422 transitions. [2023-08-29 20:20:24,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 422 transitions. [2023-08-29 20:20:24,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:20:24,089 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 422 transitions. [2023-08-29 20:20:24,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:24,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 272.0) internal successors, (1088), 4 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:24,092 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 272.0) internal successors, (1088), 4 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:24,093 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 72 flow. Second operand 3 states and 422 transitions. [2023-08-29 20:20:24,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 48 transitions, 192 flow [2023-08-29 20:20:24,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 48 transitions, 192 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:20:24,094 INFO L231 Difference]: Finished difference. Result has 43 places, 29 transitions, 70 flow [2023-08-29 20:20:24,094 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=43, PETRI_TRANSITIONS=29} [2023-08-29 20:20:24,095 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2023-08-29 20:20:24,095 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 29 transitions, 70 flow [2023-08-29 20:20:24,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:24,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:20:24,096 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:20:24,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 20:20:24,096 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:20:24,097 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:20:24,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1949499366, now seen corresponding path program 1 times [2023-08-29 20:20:24,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:20:24,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285088856] [2023-08-29 20:20:24,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:20:24,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:20:24,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:20:24,917 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:20:24,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:20:24,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285088856] [2023-08-29 20:20:24,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285088856] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:20:24,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:20:24,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:20:24,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366117088] [2023-08-29 20:20:24,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:20:24,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:20:24,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:20:24,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:20:24,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:20:24,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 272 [2023-08-29 20:20:24,987 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 29 transitions, 70 flow. Second operand has 5 states, 5 states have (on average 115.4) internal successors, (577), 5 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:24,987 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:20:24,988 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 272 [2023-08-29 20:20:24,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:20:26,857 INFO L130 PetriNetUnfolder]: 12391/16760 cut-off events. [2023-08-29 20:20:26,857 INFO L131 PetriNetUnfolder]: For 852/852 co-relation queries the response was YES. [2023-08-29 20:20:26,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34583 conditions, 16760 events. 12391/16760 cut-off events. For 852/852 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 84535 event pairs, 2087 based on Foata normal form. 0/16276 useless extension candidates. Maximal degree in co-relation 34579. Up to 7441 conditions per place. [2023-08-29 20:20:26,966 INFO L137 encePairwiseOnDemand]: 258/272 looper letters, 72 selfloop transitions, 24 changer transitions 0/97 dead transitions. [2023-08-29 20:20:26,967 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 97 transitions, 408 flow [2023-08-29 20:20:26,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:20:26,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:20:26,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 890 transitions. [2023-08-29 20:20:26,970 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46743697478991597 [2023-08-29 20:20:26,970 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 890 transitions. [2023-08-29 20:20:26,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 890 transitions. [2023-08-29 20:20:26,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:20:26,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 890 transitions. [2023-08-29 20:20:26,973 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.14285714285714) internal successors, (890), 7 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:20:26,976 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:26,977 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:26,977 INFO L175 Difference]: Start difference. First operand has 43 places, 29 transitions, 70 flow. Second operand 7 states and 890 transitions. [2023-08-29 20:20:26,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 97 transitions, 408 flow [2023-08-29 20:20:26,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 97 transitions, 394 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:20:26,983 INFO L231 Difference]: Finished difference. Result has 50 places, 51 transitions, 249 flow [2023-08-29 20:20:26,983 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=249, PETRI_PLACES=50, PETRI_TRANSITIONS=51} [2023-08-29 20:20:26,984 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2023-08-29 20:20:26,984 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 51 transitions, 249 flow [2023-08-29 20:20:26,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.4) internal successors, (577), 5 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:26,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:20:26,985 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:20:26,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 20:20:26,985 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:20:26,986 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:20:26,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1949499307, now seen corresponding path program 1 times [2023-08-29 20:20:26,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:20:26,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666050857] [2023-08-29 20:20:26,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:20:26,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:20:27,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:20:27,526 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:20:27,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:20:27,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666050857] [2023-08-29 20:20:27,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666050857] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:20:27,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:20:27,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:20:27,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500512962] [2023-08-29 20:20:27,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:20:27,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:20:27,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:20:27,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:20:27,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:20:27,827 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 272 [2023-08-29 20:20:27,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 51 transitions, 249 flow. Second operand has 7 states, 7 states have (on average 110.71428571428571) internal successors, (775), 7 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:27,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:20:27,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 272 [2023-08-29 20:20:27,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:20:29,088 INFO L130 PetriNetUnfolder]: 8237/11594 cut-off events. [2023-08-29 20:20:29,089 INFO L131 PetriNetUnfolder]: For 14940/16265 co-relation queries the response was YES. [2023-08-29 20:20:29,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36287 conditions, 11594 events. 8237/11594 cut-off events. For 14940/16265 co-relation queries the response was YES. Maximal size of possible extension queue 588. Compared 64652 event pairs, 1337 based on Foata normal form. 1137/12259 useless extension candidates. Maximal degree in co-relation 36279. Up to 8338 conditions per place. [2023-08-29 20:20:29,165 INFO L137 encePairwiseOnDemand]: 266/272 looper letters, 50 selfloop transitions, 5 changer transitions 11/73 dead transitions. [2023-08-29 20:20:29,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 73 transitions, 449 flow [2023-08-29 20:20:29,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:20:29,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:20:29,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 815 transitions. [2023-08-29 20:20:29,169 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42804621848739494 [2023-08-29 20:20:29,170 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 815 transitions. [2023-08-29 20:20:29,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 815 transitions. [2023-08-29 20:20:29,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:20:29,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 815 transitions. [2023-08-29 20:20:29,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.42857142857143) internal successors, (815), 7 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:29,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:29,177 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:29,177 INFO L175 Difference]: Start difference. First operand has 50 places, 51 transitions, 249 flow. Second operand 7 states and 815 transitions. [2023-08-29 20:20:29,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 73 transitions, 449 flow [2023-08-29 20:20:29,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 73 transitions, 449 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:20:29,210 INFO L231 Difference]: Finished difference. Result has 55 places, 37 transitions, 176 flow [2023-08-29 20:20:29,210 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=49, 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=7, PETRI_FLOW=176, PETRI_PLACES=55, PETRI_TRANSITIONS=37} [2023-08-29 20:20:29,212 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2023-08-29 20:20:29,212 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 37 transitions, 176 flow [2023-08-29 20:20:29,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.71428571428571) internal successors, (775), 7 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:29,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:20:29,213 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:20:29,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 20:20:29,213 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:20:29,214 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:20:29,214 INFO L85 PathProgramCache]: Analyzing trace with hash 799871744, now seen corresponding path program 1 times [2023-08-29 20:20:29,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:20:29,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70355803] [2023-08-29 20:20:29,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:20:29,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:20:29,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:20:29,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:20:29,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:20:29,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70355803] [2023-08-29 20:20:29,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70355803] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:20:29,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:20:29,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:20:29,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592965685] [2023-08-29 20:20:29,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:20:29,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:20:29,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:20:29,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:20:29,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:20:29,835 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 272 [2023-08-29 20:20:29,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 37 transitions, 176 flow. Second operand has 5 states, 5 states have (on average 115.8) internal successors, (579), 5 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:29,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:20:29,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 272 [2023-08-29 20:20:29,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:20:31,274 INFO L130 PetriNetUnfolder]: 9610/13697 cut-off events. [2023-08-29 20:20:31,274 INFO L131 PetriNetUnfolder]: For 17171/17171 co-relation queries the response was YES. [2023-08-29 20:20:31,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42436 conditions, 13697 events. 9610/13697 cut-off events. For 17171/17171 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 76500 event pairs, 1155 based on Foata normal form. 478/14175 useless extension candidates. Maximal degree in co-relation 42427. Up to 8997 conditions per place. [2023-08-29 20:20:31,387 INFO L137 encePairwiseOnDemand]: 259/272 looper letters, 54 selfloop transitions, 21 changer transitions 35/111 dead transitions. [2023-08-29 20:20:31,388 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 111 transitions, 726 flow [2023-08-29 20:20:31,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:20:31,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:20:31,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 896 transitions. [2023-08-29 20:20:31,391 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2023-08-29 20:20:31,391 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 896 transitions. [2023-08-29 20:20:31,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 896 transitions. [2023-08-29 20:20:31,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:20:31,392 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 896 transitions. [2023-08-29 20:20:31,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:31,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:31,396 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:31,397 INFO L175 Difference]: Start difference. First operand has 55 places, 37 transitions, 176 flow. Second operand 7 states and 896 transitions. [2023-08-29 20:20:31,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 111 transitions, 726 flow [2023-08-29 20:20:31,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 111 transitions, 693 flow, removed 4 selfloop flow, removed 7 redundant places. [2023-08-29 20:20:31,461 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 305 flow [2023-08-29 20:20:31,461 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=305, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2023-08-29 20:20:31,464 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 3 predicate places. [2023-08-29 20:20:31,464 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 305 flow [2023-08-29 20:20:31,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.8) internal successors, (579), 5 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:31,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:20:31,465 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:20:31,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 20:20:31,465 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:20:31,465 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:20:31,465 INFO L85 PathProgramCache]: Analyzing trace with hash -913955883, now seen corresponding path program 1 times [2023-08-29 20:20:31,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:20:31,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320440273] [2023-08-29 20:20:31,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:20:31,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:20:31,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:20:32,017 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:20:32,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:20:32,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320440273] [2023-08-29 20:20:32,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320440273] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:20:32,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:20:32,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:20:32,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738834919] [2023-08-29 20:20:32,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:20:32,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:20:32,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:20:32,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:20:32,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:20:32,050 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 272 [2023-08-29 20:20:32,051 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 305 flow. Second operand has 5 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:32,051 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:20:32,051 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 272 [2023-08-29 20:20:32,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:20:33,418 INFO L130 PetriNetUnfolder]: 9813/14107 cut-off events. [2023-08-29 20:20:33,418 INFO L131 PetriNetUnfolder]: For 30638/31557 co-relation queries the response was YES. [2023-08-29 20:20:33,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52257 conditions, 14107 events. 9813/14107 cut-off events. For 30638/31557 co-relation queries the response was YES. Maximal size of possible extension queue 623. Compared 81756 event pairs, 3492 based on Foata normal form. 631/14101 useless extension candidates. Maximal degree in co-relation 52244. Up to 10301 conditions per place. [2023-08-29 20:20:33,497 INFO L137 encePairwiseOnDemand]: 264/272 looper letters, 70 selfloop transitions, 22 changer transitions 17/120 dead transitions. [2023-08-29 20:20:33,498 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 120 transitions, 947 flow [2023-08-29 20:20:33,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:20:33,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:20:33,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 944 transitions. [2023-08-29 20:20:33,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4957983193277311 [2023-08-29 20:20:33,501 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 944 transitions. [2023-08-29 20:20:33,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 944 transitions. [2023-08-29 20:20:33,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:20:33,502 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 944 transitions. [2023-08-29 20:20:33,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 134.85714285714286) internal successors, (944), 7 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:33,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:33,507 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:33,507 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 305 flow. Second operand 7 states and 944 transitions. [2023-08-29 20:20:33,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 120 transitions, 947 flow [2023-08-29 20:20:33,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 120 transitions, 937 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-08-29 20:20:33,578 INFO L231 Difference]: Finished difference. Result has 60 places, 68 transitions, 551 flow [2023-08-29 20:20:33,578 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=551, PETRI_PLACES=60, PETRI_TRANSITIONS=68} [2023-08-29 20:20:33,580 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 7 predicate places. [2023-08-29 20:20:33,581 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 68 transitions, 551 flow [2023-08-29 20:20:33,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:33,583 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:20:33,583 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:20:33,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 20:20:33,583 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:20:33,584 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:20:33,585 INFO L85 PathProgramCache]: Analyzing trace with hash -707960457, now seen corresponding path program 1 times [2023-08-29 20:20:33,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:20:33,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869334375] [2023-08-29 20:20:33,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:20:33,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:20:33,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:20:33,855 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:20:33,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:20:33,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869334375] [2023-08-29 20:20:33,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869334375] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:20:33,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:20:33,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:20:33,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323549626] [2023-08-29 20:20:33,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:20:33,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:20:33,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:20:33,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:20:33,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:20:33,871 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 272 [2023-08-29 20:20:33,872 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 68 transitions, 551 flow. Second operand has 5 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:33,872 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:20:33,873 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 272 [2023-08-29 20:20:33,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:20:35,387 INFO L130 PetriNetUnfolder]: 9829/14299 cut-off events. [2023-08-29 20:20:35,387 INFO L131 PetriNetUnfolder]: For 45148/45974 co-relation queries the response was YES. [2023-08-29 20:20:35,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60616 conditions, 14299 events. 9829/14299 cut-off events. For 45148/45974 co-relation queries the response was YES. Maximal size of possible extension queue 627. Compared 85003 event pairs, 2064 based on Foata normal form. 558/14214 useless extension candidates. Maximal degree in co-relation 60601. Up to 9459 conditions per place. [2023-08-29 20:20:35,469 INFO L137 encePairwiseOnDemand]: 264/272 looper letters, 78 selfloop transitions, 23 changer transitions 22/134 dead transitions. [2023-08-29 20:20:35,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 134 transitions, 1234 flow [2023-08-29 20:20:35,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:20:35,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:20:35,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 815 transitions. [2023-08-29 20:20:35,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4993872549019608 [2023-08-29 20:20:35,473 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 815 transitions. [2023-08-29 20:20:35,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 815 transitions. [2023-08-29 20:20:35,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:20:35,473 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 815 transitions. [2023-08-29 20:20:35,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 135.83333333333334) internal successors, (815), 6 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:35,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 272.0) internal successors, (1904), 7 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:35,478 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 272.0) internal successors, (1904), 7 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:35,478 INFO L175 Difference]: Start difference. First operand has 60 places, 68 transitions, 551 flow. Second operand 6 states and 815 transitions. [2023-08-29 20:20:35,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 134 transitions, 1234 flow [2023-08-29 20:20:35,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 134 transitions, 1234 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:20:35,528 INFO L231 Difference]: Finished difference. Result has 69 places, 80 transitions, 768 flow [2023-08-29 20:20:35,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=768, PETRI_PLACES=69, PETRI_TRANSITIONS=80} [2023-08-29 20:20:35,529 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 16 predicate places. [2023-08-29 20:20:35,529 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 80 transitions, 768 flow [2023-08-29 20:20:35,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:35,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:20:35,530 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:20:35,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 20:20:35,530 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:20:35,530 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:20:35,531 INFO L85 PathProgramCache]: Analyzing trace with hash -661918947, now seen corresponding path program 2 times [2023-08-29 20:20:35,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:20:35,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497666805] [2023-08-29 20:20:35,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:20:35,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:20:35,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:20:35,894 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:20:35,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:20:35,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497666805] [2023-08-29 20:20:35,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497666805] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:20:35,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:20:35,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:20:35,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272973400] [2023-08-29 20:20:35,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:20:35,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:20:35,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:20:35,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:20:35,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:20:35,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 272 [2023-08-29 20:20:35,926 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 80 transitions, 768 flow. Second operand has 6 states, 6 states have (on average 126.5) internal successors, (759), 6 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:35,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:20:35,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 272 [2023-08-29 20:20:35,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:20:37,326 INFO L130 PetriNetUnfolder]: 9872/14331 cut-off events. [2023-08-29 20:20:37,326 INFO L131 PetriNetUnfolder]: For 68052/69382 co-relation queries the response was YES. [2023-08-29 20:20:37,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67749 conditions, 14331 events. 9872/14331 cut-off events. For 68052/69382 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 84679 event pairs, 2227 based on Foata normal form. 721/14396 useless extension candidates. Maximal degree in co-relation 67729. Up to 9557 conditions per place. [2023-08-29 20:20:37,438 INFO L137 encePairwiseOnDemand]: 265/272 looper letters, 80 selfloop transitions, 28 changer transitions 31/150 dead transitions. [2023-08-29 20:20:37,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 150 transitions, 1590 flow [2023-08-29 20:20:37,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:20:37,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:20:37,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 946 transitions. [2023-08-29 20:20:37,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49684873949579833 [2023-08-29 20:20:37,442 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 946 transitions. [2023-08-29 20:20:37,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 946 transitions. [2023-08-29 20:20:37,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:20:37,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 946 transitions. [2023-08-29 20:20:37,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 135.14285714285714) internal successors, (946), 7 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:37,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:37,448 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:37,448 INFO L175 Difference]: Start difference. First operand has 69 places, 80 transitions, 768 flow. Second operand 7 states and 946 transitions. [2023-08-29 20:20:37,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 150 transitions, 1590 flow [2023-08-29 20:20:37,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 150 transitions, 1547 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-08-29 20:20:37,638 INFO L231 Difference]: Finished difference. Result has 74 places, 88 transitions, 938 flow [2023-08-29 20:20:37,638 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=938, PETRI_PLACES=74, PETRI_TRANSITIONS=88} [2023-08-29 20:20:37,639 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 21 predicate places. [2023-08-29 20:20:37,639 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 88 transitions, 938 flow [2023-08-29 20:20:37,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.5) internal successors, (759), 6 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:37,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:20:37,640 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:20:37,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 20:20:37,640 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:20:37,640 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:20:37,641 INFO L85 PathProgramCache]: Analyzing trace with hash -594417346, now seen corresponding path program 1 times [2023-08-29 20:20:37,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:20:37,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582476194] [2023-08-29 20:20:37,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:20:37,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:20:37,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:20:38,050 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:20:38,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:20:38,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582476194] [2023-08-29 20:20:38,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582476194] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:20:38,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:20:38,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:20:38,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070720989] [2023-08-29 20:20:38,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:20:38,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:20:38,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:20:38,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:20:38,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:20:38,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 272 [2023-08-29 20:20:38,077 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 88 transitions, 938 flow. Second operand has 6 states, 6 states have (on average 124.5) internal successors, (747), 6 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:20:38,078 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:20:38,078 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 272 [2023-08-29 20:20:38,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:20:40,280 INFO L130 PetriNetUnfolder]: 10584/15280 cut-off events. [2023-08-29 20:20:40,280 INFO L131 PetriNetUnfolder]: For 98110/100041 co-relation queries the response was YES. [2023-08-29 20:20:40,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75813 conditions, 15280 events. 10584/15280 cut-off events. For 98110/100041 co-relation queries the response was YES. Maximal size of possible extension queue 643. Compared 89779 event pairs, 3393 based on Foata normal form. 1002/15738 useless extension candidates. Maximal degree in co-relation 75791. Up to 10390 conditions per place. [2023-08-29 20:20:40,392 INFO L137 encePairwiseOnDemand]: 263/272 looper letters, 99 selfloop transitions, 56 changer transitions 39/205 dead transitions. [2023-08-29 20:20:40,393 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 205 transitions, 2438 flow [2023-08-29 20:20:40,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:20:40,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:20:40,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1071 transitions. [2023-08-29 20:20:40,396 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4921875 [2023-08-29 20:20:40,396 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1071 transitions. [2023-08-29 20:20:40,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1071 transitions. [2023-08-29 20:20:40,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:20:40,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1071 transitions. [2023-08-29 20:20:40,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 133.875) internal successors, (1071), 8 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:40,402 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 272.0) internal successors, (2448), 9 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:40,403 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 272.0) internal successors, (2448), 9 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:40,403 INFO L175 Difference]: Start difference. First operand has 74 places, 88 transitions, 938 flow. Second operand 8 states and 1071 transitions. [2023-08-29 20:20:40,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 205 transitions, 2438 flow [2023-08-29 20:20:40,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 205 transitions, 2400 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-29 20:20:40,559 INFO L231 Difference]: Finished difference. Result has 81 places, 122 transitions, 1593 flow [2023-08-29 20:20:40,560 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=913, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1593, PETRI_PLACES=81, PETRI_TRANSITIONS=122} [2023-08-29 20:20:40,560 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 28 predicate places. [2023-08-29 20:20:40,561 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 122 transitions, 1593 flow [2023-08-29 20:20:40,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 124.5) internal successors, (747), 6 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:20:40,561 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:20:40,561 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:20:40,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 20:20:40,562 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:20:40,562 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:20:40,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1004152204, now seen corresponding path program 1 times [2023-08-29 20:20:40,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:20:40,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659091402] [2023-08-29 20:20:40,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:20:40,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:20:40,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:20:41,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:20:41,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:20:41,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659091402] [2023-08-29 20:20:41,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659091402] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:20:41,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:20:41,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:20:41,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144794219] [2023-08-29 20:20:41,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:20:41,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:20:41,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:20:41,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:20:41,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:20:41,162 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 272 [2023-08-29 20:20:41,163 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 122 transitions, 1593 flow. Second operand has 7 states, 7 states have (on average 125.28571428571429) internal successors, (877), 7 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:41,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:20:41,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 272 [2023-08-29 20:20:41,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:20:42,906 INFO L130 PetriNetUnfolder]: 9874/14269 cut-off events. [2023-08-29 20:20:42,907 INFO L131 PetriNetUnfolder]: For 128379/130982 co-relation queries the response was YES. [2023-08-29 20:20:42,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78778 conditions, 14269 events. 9874/14269 cut-off events. For 128379/130982 co-relation queries the response was YES. Maximal size of possible extension queue 558. Compared 83434 event pairs, 2145 based on Foata normal form. 978/14678 useless extension candidates. Maximal degree in co-relation 78752. Up to 9912 conditions per place. [2023-08-29 20:20:43,050 INFO L137 encePairwiseOnDemand]: 267/272 looper letters, 124 selfloop transitions, 26 changer transitions 19/180 dead transitions. [2023-08-29 20:20:43,051 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 180 transitions, 2494 flow [2023-08-29 20:20:43,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:20:43,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:20:43,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 808 transitions. [2023-08-29 20:20:43,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4950980392156863 [2023-08-29 20:20:43,053 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 808 transitions. [2023-08-29 20:20:43,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 808 transitions. [2023-08-29 20:20:43,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:20:43,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 808 transitions. [2023-08-29 20:20:43,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 134.66666666666666) internal successors, (808), 6 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:43,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 272.0) internal successors, (1904), 7 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:43,060 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 272.0) internal successors, (1904), 7 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:43,061 INFO L175 Difference]: Start difference. First operand has 81 places, 122 transitions, 1593 flow. Second operand 6 states and 808 transitions. [2023-08-29 20:20:43,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 180 transitions, 2494 flow [2023-08-29 20:20:43,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 180 transitions, 2418 flow, removed 38 selfloop flow, removed 1 redundant places. [2023-08-29 20:20:43,409 INFO L231 Difference]: Finished difference. Result has 86 places, 125 transitions, 1648 flow [2023-08-29 20:20:43,409 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=1521, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1648, PETRI_PLACES=86, PETRI_TRANSITIONS=125} [2023-08-29 20:20:43,409 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 33 predicate places. [2023-08-29 20:20:43,410 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 125 transitions, 1648 flow [2023-08-29 20:20:43,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 125.28571428571429) internal successors, (877), 7 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:43,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:20:43,410 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:20:43,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 20:20:43,411 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:20:43,411 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:20:43,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1068798674, now seen corresponding path program 1 times [2023-08-29 20:20:43,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:20:43,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739437794] [2023-08-29 20:20:43,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:20:43,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:20:43,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:20:43,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:20:43,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:20:43,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739437794] [2023-08-29 20:20:43,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739437794] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:20:43,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:20:43,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:20:43,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970967821] [2023-08-29 20:20:43,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:20:43,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:20:43,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:20:43,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:20:43,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:20:43,812 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 272 [2023-08-29 20:20:43,813 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 125 transitions, 1648 flow. Second operand has 7 states, 7 states have (on average 125.28571428571429) internal successors, (877), 7 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:43,813 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:20:43,813 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 272 [2023-08-29 20:20:43,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:20:45,527 INFO L130 PetriNetUnfolder]: 10290/14901 cut-off events. [2023-08-29 20:20:45,528 INFO L131 PetriNetUnfolder]: For 145667/148350 co-relation queries the response was YES. [2023-08-29 20:20:45,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84276 conditions, 14901 events. 10290/14901 cut-off events. For 145667/148350 co-relation queries the response was YES. Maximal size of possible extension queue 602. Compared 88175 event pairs, 2378 based on Foata normal form. 1001/15356 useless extension candidates. Maximal degree in co-relation 84247. Up to 9779 conditions per place. [2023-08-29 20:20:45,646 INFO L137 encePairwiseOnDemand]: 263/272 looper letters, 122 selfloop transitions, 44 changer transitions 20/197 dead transitions. [2023-08-29 20:20:45,646 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 197 transitions, 2718 flow [2023-08-29 20:20:45,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:20:45,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:20:45,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 943 transitions. [2023-08-29 20:20:45,649 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4952731092436975 [2023-08-29 20:20:45,649 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 943 transitions. [2023-08-29 20:20:45,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 943 transitions. [2023-08-29 20:20:45,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:20:45,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 943 transitions. [2023-08-29 20:20:45,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 134.71428571428572) internal successors, (943), 7 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:45,655 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:45,655 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:45,656 INFO L175 Difference]: Start difference. First operand has 86 places, 125 transitions, 1648 flow. Second operand 7 states and 943 transitions. [2023-08-29 20:20:45,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 197 transitions, 2718 flow [2023-08-29 20:20:45,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 197 transitions, 2660 flow, removed 18 selfloop flow, removed 3 redundant places. [2023-08-29 20:20:45,855 INFO L231 Difference]: Finished difference. Result has 91 places, 133 transitions, 1868 flow [2023-08-29 20:20:45,855 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=1602, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1868, PETRI_PLACES=91, PETRI_TRANSITIONS=133} [2023-08-29 20:20:45,855 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 38 predicate places. [2023-08-29 20:20:45,856 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 133 transitions, 1868 flow [2023-08-29 20:20:45,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 125.28571428571429) internal successors, (877), 7 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:45,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:20:45,856 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:20:45,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 20:20:45,857 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:20:45,857 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:20:45,857 INFO L85 PathProgramCache]: Analyzing trace with hash 955323794, now seen corresponding path program 2 times [2023-08-29 20:20:45,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:20:45,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823479190] [2023-08-29 20:20:45,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:20:45,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:20:45,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:20:46,528 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:20:46,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:20:46,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823479190] [2023-08-29 20:20:46,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823479190] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:20:46,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:20:46,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:20:46,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193048683] [2023-08-29 20:20:46,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:20:46,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:20:46,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:20:46,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:20:46,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:20:46,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 272 [2023-08-29 20:20:46,570 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 133 transitions, 1868 flow. Second operand has 7 states, 7 states have (on average 122.28571428571429) internal successors, (856), 7 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:46,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:20:46,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 272 [2023-08-29 20:20:46,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:20:48,387 INFO L130 PetriNetUnfolder]: 10541/15286 cut-off events. [2023-08-29 20:20:48,387 INFO L131 PetriNetUnfolder]: For 184874/187951 co-relation queries the response was YES. [2023-08-29 20:20:48,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92521 conditions, 15286 events. 10541/15286 cut-off events. For 184874/187951 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 91346 event pairs, 2379 based on Foata normal form. 1004/15683 useless extension candidates. Maximal degree in co-relation 92491. Up to 10184 conditions per place. [2023-08-29 20:20:48,529 INFO L137 encePairwiseOnDemand]: 263/272 looper letters, 126 selfloop transitions, 58 changer transitions 19/214 dead transitions. [2023-08-29 20:20:48,529 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 214 transitions, 3241 flow [2023-08-29 20:20:48,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:20:48,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:20:48,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 922 transitions. [2023-08-29 20:20:48,532 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4842436974789916 [2023-08-29 20:20:48,532 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 922 transitions. [2023-08-29 20:20:48,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 922 transitions. [2023-08-29 20:20:48,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:20:48,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 922 transitions. [2023-08-29 20:20:48,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.71428571428572) internal successors, (922), 7 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:48,538 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:48,538 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:48,538 INFO L175 Difference]: Start difference. First operand has 91 places, 133 transitions, 1868 flow. Second operand 7 states and 922 transitions. [2023-08-29 20:20:48,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 214 transitions, 3241 flow [2023-08-29 20:20:48,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 214 transitions, 3064 flow, removed 48 selfloop flow, removed 5 redundant places. [2023-08-29 20:20:48,885 INFO L231 Difference]: Finished difference. Result has 93 places, 154 transitions, 2296 flow [2023-08-29 20:20:48,885 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=1751, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2296, PETRI_PLACES=93, PETRI_TRANSITIONS=154} [2023-08-29 20:20:48,886 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 40 predicate places. [2023-08-29 20:20:48,886 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 154 transitions, 2296 flow [2023-08-29 20:20:48,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 122.28571428571429) internal successors, (856), 7 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:48,886 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:20:48,887 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:20:48,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 20:20:48,887 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:20:48,887 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:20:48,887 INFO L85 PathProgramCache]: Analyzing trace with hash -471538254, now seen corresponding path program 1 times [2023-08-29 20:20:48,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:20:48,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863877655] [2023-08-29 20:20:48,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:20:48,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:20:48,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:20:49,290 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:20:49,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:20:49,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863877655] [2023-08-29 20:20:49,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863877655] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:20:49,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:20:49,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:20:49,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585348266] [2023-08-29 20:20:49,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:20:49,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:20:49,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:20:49,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:20:49,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:20:49,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 272 [2023-08-29 20:20:49,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 154 transitions, 2296 flow. Second operand has 5 states, 5 states have (on average 128.0) internal successors, (640), 5 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:49,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:20:49,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 272 [2023-08-29 20:20:49,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:20:50,807 INFO L130 PetriNetUnfolder]: 10218/14831 cut-off events. [2023-08-29 20:20:50,807 INFO L131 PetriNetUnfolder]: For 198676/201465 co-relation queries the response was YES. [2023-08-29 20:20:50,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91868 conditions, 14831 events. 10218/14831 cut-off events. For 198676/201465 co-relation queries the response was YES. Maximal size of possible extension queue 615. Compared 87948 event pairs, 3023 based on Foata normal form. 992/15326 useless extension candidates. Maximal degree in co-relation 91837. Up to 11646 conditions per place. [2023-08-29 20:20:50,928 INFO L137 encePairwiseOnDemand]: 267/272 looper letters, 144 selfloop transitions, 14 changer transitions 30/199 dead transitions. [2023-08-29 20:20:50,928 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 199 transitions, 3194 flow [2023-08-29 20:20:50,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:20:50,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:20:50,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 682 transitions. [2023-08-29 20:20:50,930 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5014705882352941 [2023-08-29 20:20:50,931 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 682 transitions. [2023-08-29 20:20:50,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 682 transitions. [2023-08-29 20:20:50,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:20:50,931 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 682 transitions. [2023-08-29 20:20:50,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.4) internal successors, (682), 5 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:50,935 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:50,935 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:50,935 INFO L175 Difference]: Start difference. First operand has 93 places, 154 transitions, 2296 flow. Second operand 5 states and 682 transitions. [2023-08-29 20:20:50,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 199 transitions, 3194 flow [2023-08-29 20:20:51,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 199 transitions, 2913 flow, removed 88 selfloop flow, removed 4 redundant places. [2023-08-29 20:20:51,487 INFO L231 Difference]: Finished difference. Result has 95 places, 154 transitions, 2105 flow [2023-08-29 20:20:51,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=2055, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2105, PETRI_PLACES=95, PETRI_TRANSITIONS=154} [2023-08-29 20:20:51,488 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 42 predicate places. [2023-08-29 20:20:51,488 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 154 transitions, 2105 flow [2023-08-29 20:20:51,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.0) internal successors, (640), 5 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:51,489 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:20:51,489 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:20:51,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 20:20:51,489 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:20:51,489 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:20:51,489 INFO L85 PathProgramCache]: Analyzing trace with hash -469916086, now seen corresponding path program 3 times [2023-08-29 20:20:51,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:20:51,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158233281] [2023-08-29 20:20:51,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:20:51,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:20:51,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:20:52,045 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:20:52,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:20:52,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158233281] [2023-08-29 20:20:52,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158233281] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:20:52,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:20:52,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:20:52,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236730395] [2023-08-29 20:20:52,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:20:52,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:20:52,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:20:52,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:20:52,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:20:52,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 272 [2023-08-29 20:20:52,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 154 transitions, 2105 flow. Second operand has 6 states, 6 states have (on average 113.83333333333333) internal successors, (683), 6 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:52,114 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:20:52,114 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 272 [2023-08-29 20:20:52,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:20:54,705 INFO L130 PetriNetUnfolder]: 16266/22737 cut-off events. [2023-08-29 20:20:54,705 INFO L131 PetriNetUnfolder]: For 259608/259608 co-relation queries the response was YES. [2023-08-29 20:20:54,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132101 conditions, 22737 events. 16266/22737 cut-off events. For 259608/259608 co-relation queries the response was YES. Maximal size of possible extension queue 730. Compared 127345 event pairs, 4101 based on Foata normal form. 500/23237 useless extension candidates. Maximal degree in co-relation 132068. Up to 13754 conditions per place. [2023-08-29 20:20:54,873 INFO L137 encePairwiseOnDemand]: 260/272 looper letters, 117 selfloop transitions, 89 changer transitions 52/258 dead transitions. [2023-08-29 20:20:54,873 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 258 transitions, 3786 flow [2023-08-29 20:20:54,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:20:54,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:20:54,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 746 transitions. [2023-08-29 20:20:54,875 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4571078431372549 [2023-08-29 20:20:54,875 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 746 transitions. [2023-08-29 20:20:54,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 746 transitions. [2023-08-29 20:20:54,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:20:54,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 746 transitions. [2023-08-29 20:20:54,878 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.33333333333333) internal successors, (746), 6 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:54,879 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 272.0) internal successors, (1904), 7 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:54,880 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 272.0) internal successors, (1904), 7 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:54,880 INFO L175 Difference]: Start difference. First operand has 95 places, 154 transitions, 2105 flow. Second operand 6 states and 746 transitions. [2023-08-29 20:20:54,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 258 transitions, 3786 flow [2023-08-29 20:20:55,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 258 transitions, 3672 flow, removed 37 selfloop flow, removed 5 redundant places. [2023-08-29 20:20:55,391 INFO L231 Difference]: Finished difference. Result has 97 places, 183 transitions, 2859 flow [2023-08-29 20:20:55,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=2033, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2859, PETRI_PLACES=97, PETRI_TRANSITIONS=183} [2023-08-29 20:20:55,392 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 44 predicate places. [2023-08-29 20:20:55,392 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 183 transitions, 2859 flow [2023-08-29 20:20:55,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.83333333333333) internal successors, (683), 6 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:55,393 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:20:55,393 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:20:55,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-29 20:20:55,393 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:20:55,394 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:20:55,394 INFO L85 PathProgramCache]: Analyzing trace with hash 2046926406, now seen corresponding path program 4 times [2023-08-29 20:20:55,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:20:55,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101097170] [2023-08-29 20:20:55,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:20:55,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:20:55,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:20:55,940 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:20:55,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:20:55,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101097170] [2023-08-29 20:20:55,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101097170] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:20:55,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:20:55,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:20:55,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955375639] [2023-08-29 20:20:55,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:20:55,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:20:55,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:20:55,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:20:55,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:20:56,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 272 [2023-08-29 20:20:56,013 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 183 transitions, 2859 flow. Second operand has 7 states, 7 states have (on average 113.42857142857143) internal successors, (794), 7 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:56,013 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:20:56,013 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 272 [2023-08-29 20:20:56,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:20:58,584 INFO L130 PetriNetUnfolder]: 15451/21320 cut-off events. [2023-08-29 20:20:58,585 INFO L131 PetriNetUnfolder]: For 273188/273188 co-relation queries the response was YES. [2023-08-29 20:20:58,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142044 conditions, 21320 events. 15451/21320 cut-off events. For 273188/273188 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 114118 event pairs, 3201 based on Foata normal form. 324/21644 useless extension candidates. Maximal degree in co-relation 142010. Up to 12064 conditions per place. [2023-08-29 20:20:58,798 INFO L137 encePairwiseOnDemand]: 260/272 looper letters, 116 selfloop transitions, 123 changer transitions 36/275 dead transitions. [2023-08-29 20:20:58,799 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 275 transitions, 4584 flow [2023-08-29 20:20:58,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:20:58,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:20:58,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 993 transitions. [2023-08-29 20:20:58,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4563419117647059 [2023-08-29 20:20:58,801 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 993 transitions. [2023-08-29 20:20:58,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 993 transitions. [2023-08-29 20:20:58,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:20:58,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 993 transitions. [2023-08-29 20:20:58,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 124.125) internal successors, (993), 8 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:58,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 272.0) internal successors, (2448), 9 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:58,807 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 272.0) internal successors, (2448), 9 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:58,808 INFO L175 Difference]: Start difference. First operand has 97 places, 183 transitions, 2859 flow. Second operand 8 states and 993 transitions. [2023-08-29 20:20:58,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 275 transitions, 4584 flow [2023-08-29 20:20:59,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 275 transitions, 4431 flow, removed 76 selfloop flow, removed 6 redundant places. [2023-08-29 20:20:59,570 INFO L231 Difference]: Finished difference. Result has 96 places, 203 transitions, 3714 flow [2023-08-29 20:20:59,570 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=2812, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3714, PETRI_PLACES=96, PETRI_TRANSITIONS=203} [2023-08-29 20:20:59,571 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 43 predicate places. [2023-08-29 20:20:59,571 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 203 transitions, 3714 flow [2023-08-29 20:20:59,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.42857142857143) internal successors, (794), 7 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:20:59,572 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:20:59,572 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:20:59,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-29 20:20:59,572 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:20:59,572 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:20:59,573 INFO L85 PathProgramCache]: Analyzing trace with hash -898573511, now seen corresponding path program 1 times [2023-08-29 20:20:59,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:20:59,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598525475] [2023-08-29 20:20:59,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:20:59,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:20:59,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:21:00,574 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:21:00,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:21:00,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598525475] [2023-08-29 20:21:00,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598525475] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:21:00,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:21:00,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:21:00,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784204353] [2023-08-29 20:21:00,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:21:00,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 20:21:00,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:21:00,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 20:21:00,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-29 20:21:00,628 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 272 [2023-08-29 20:21:00,629 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 203 transitions, 3714 flow. Second operand has 8 states, 8 states have (on average 111.25) internal successors, (890), 8 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:21:00,629 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:21:00,629 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 272 [2023-08-29 20:21:00,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:21:04,449 INFO L130 PetriNetUnfolder]: 17335/23940 cut-off events. [2023-08-29 20:21:04,449 INFO L131 PetriNetUnfolder]: For 342290/342290 co-relation queries the response was YES. [2023-08-29 20:21:04,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167374 conditions, 23940 events. 17335/23940 cut-off events. For 342290/342290 co-relation queries the response was YES. Maximal size of possible extension queue 756. Compared 131553 event pairs, 1817 based on Foata normal form. 348/24288 useless extension candidates. Maximal degree in co-relation 167339. Up to 13757 conditions per place. [2023-08-29 20:21:04,623 INFO L137 encePairwiseOnDemand]: 258/272 looper letters, 202 selfloop transitions, 151 changer transitions 49/402 dead transitions. [2023-08-29 20:21:04,623 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 402 transitions, 7196 flow [2023-08-29 20:21:04,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-29 20:21:04,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-29 20:21:04,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1241 transitions. [2023-08-29 20:21:04,629 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45625 [2023-08-29 20:21:04,629 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1241 transitions. [2023-08-29 20:21:04,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1241 transitions. [2023-08-29 20:21:04,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:21:04,630 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1241 transitions. [2023-08-29 20:21:04,633 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 124.1) internal successors, (1241), 10 states have internal predecessors, (1241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:04,636 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 272.0) internal successors, (2992), 11 states have internal predecessors, (2992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:04,636 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 272.0) internal successors, (2992), 11 states have internal predecessors, (2992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:04,637 INFO L175 Difference]: Start difference. First operand has 96 places, 203 transitions, 3714 flow. Second operand 10 states and 1241 transitions. [2023-08-29 20:21:04,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 402 transitions, 7196 flow [2023-08-29 20:21:05,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 402 transitions, 7063 flow, removed 66 selfloop flow, removed 2 redundant places. [2023-08-29 20:21:05,647 INFO L231 Difference]: Finished difference. Result has 108 places, 265 transitions, 5485 flow [2023-08-29 20:21:05,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=3667, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5485, PETRI_PLACES=108, PETRI_TRANSITIONS=265} [2023-08-29 20:21:05,647 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 55 predicate places. [2023-08-29 20:21:05,647 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 265 transitions, 5485 flow [2023-08-29 20:21:05,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 111.25) internal successors, (890), 8 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:21:05,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:21:05,648 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:21:05,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-29 20:21:05,648 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:21:05,648 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:21:05,649 INFO L85 PathProgramCache]: Analyzing trace with hash -499966409, now seen corresponding path program 2 times [2023-08-29 20:21:05,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:21:05,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989388606] [2023-08-29 20:21:05,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:21:05,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:21:05,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:21:06,376 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:21:06,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:21:06,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989388606] [2023-08-29 20:21:06,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989388606] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:21:06,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:21:06,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:21:06,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090998818] [2023-08-29 20:21:06,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:21:06,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 20:21:06,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:21:06,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 20:21:06,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-29 20:21:06,438 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 272 [2023-08-29 20:21:06,439 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 265 transitions, 5485 flow. Second operand has 8 states, 8 states have (on average 122.125) internal successors, (977), 8 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:06,439 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:21:06,439 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 272 [2023-08-29 20:21:06,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:21:09,875 INFO L130 PetriNetUnfolder]: 15284/21869 cut-off events. [2023-08-29 20:21:09,876 INFO L131 PetriNetUnfolder]: For 471035/472621 co-relation queries the response was YES. [2023-08-29 20:21:09,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175222 conditions, 21869 events. 15284/21869 cut-off events. For 471035/472621 co-relation queries the response was YES. Maximal size of possible extension queue 897. Compared 132354 event pairs, 3205 based on Foata normal form. 1060/22254 useless extension candidates. Maximal degree in co-relation 175181. Up to 14332 conditions per place. [2023-08-29 20:21:10,093 INFO L137 encePairwiseOnDemand]: 263/272 looper letters, 189 selfloop transitions, 65 changer transitions 18/327 dead transitions. [2023-08-29 20:21:10,093 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 327 transitions, 6803 flow [2023-08-29 20:21:10,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:21:10,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:21:10,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 918 transitions. [2023-08-29 20:21:10,095 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48214285714285715 [2023-08-29 20:21:10,095 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 918 transitions. [2023-08-29 20:21:10,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 918 transitions. [2023-08-29 20:21:10,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:21:10,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 918 transitions. [2023-08-29 20:21:10,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.14285714285714) internal successors, (918), 7 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:10,099 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:10,099 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:10,099 INFO L175 Difference]: Start difference. First operand has 108 places, 265 transitions, 5485 flow. Second operand 7 states and 918 transitions. [2023-08-29 20:21:10,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 327 transitions, 6803 flow [2023-08-29 20:21:11,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 327 transitions, 6499 flow, removed 132 selfloop flow, removed 3 redundant places. [2023-08-29 20:21:11,853 INFO L231 Difference]: Finished difference. Result has 111 places, 272 transitions, 5617 flow [2023-08-29 20:21:11,854 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=5259, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5617, PETRI_PLACES=111, PETRI_TRANSITIONS=272} [2023-08-29 20:21:11,854 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 58 predicate places. [2023-08-29 20:21:11,854 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 272 transitions, 5617 flow [2023-08-29 20:21:11,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 122.125) internal successors, (977), 8 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:11,855 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:21:11,855 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:21:11,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-29 20:21:11,855 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:21:11,855 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:21:11,856 INFO L85 PathProgramCache]: Analyzing trace with hash 283405119, now seen corresponding path program 3 times [2023-08-29 20:21:11,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:21:11,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718185726] [2023-08-29 20:21:11,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:21:11,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:21:11,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:21:12,413 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:21:12,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:21:12,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718185726] [2023-08-29 20:21:12,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718185726] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:21:12,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:21:12,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:21:12,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924198938] [2023-08-29 20:21:12,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:21:12,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 20:21:12,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:21:12,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 20:21:12,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-08-29 20:21:12,462 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 272 [2023-08-29 20:21:12,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 272 transitions, 5617 flow. Second operand has 8 states, 8 states have (on average 123.125) internal successors, (985), 8 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:12,463 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:21:12,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 272 [2023-08-29 20:21:12,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:21:16,161 INFO L130 PetriNetUnfolder]: 15662/22449 cut-off events. [2023-08-29 20:21:16,161 INFO L131 PetriNetUnfolder]: For 429830/431351 co-relation queries the response was YES. [2023-08-29 20:21:16,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174323 conditions, 22449 events. 15662/22449 cut-off events. For 429830/431351 co-relation queries the response was YES. Maximal size of possible extension queue 920. Compared 136701 event pairs, 3197 based on Foata normal form. 1017/22802 useless extension candidates. Maximal degree in co-relation 174279. Up to 13068 conditions per place. [2023-08-29 20:21:16,558 INFO L137 encePairwiseOnDemand]: 265/272 looper letters, 190 selfloop transitions, 72 changer transitions 18/335 dead transitions. [2023-08-29 20:21:16,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 335 transitions, 6942 flow [2023-08-29 20:21:16,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:21:16,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:21:16,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 924 transitions. [2023-08-29 20:21:16,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4852941176470588 [2023-08-29 20:21:16,560 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 924 transitions. [2023-08-29 20:21:16,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 924 transitions. [2023-08-29 20:21:16,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:21:16,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 924 transitions. [2023-08-29 20:21:16,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 132.0) internal successors, (924), 7 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:16,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:16,565 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:16,565 INFO L175 Difference]: Start difference. First operand has 111 places, 272 transitions, 5617 flow. Second operand 7 states and 924 transitions. [2023-08-29 20:21:16,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 335 transitions, 6942 flow [2023-08-29 20:21:17,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 335 transitions, 6789 flow, removed 36 selfloop flow, removed 5 redundant places. [2023-08-29 20:21:17,752 INFO L231 Difference]: Finished difference. Result has 113 places, 278 transitions, 5871 flow [2023-08-29 20:21:17,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=5490, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5871, PETRI_PLACES=113, PETRI_TRANSITIONS=278} [2023-08-29 20:21:17,753 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 60 predicate places. [2023-08-29 20:21:17,753 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 278 transitions, 5871 flow [2023-08-29 20:21:17,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 123.125) internal successors, (985), 8 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:17,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:21:17,754 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:21:17,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-29 20:21:17,754 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:21:17,755 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:21:17,755 INFO L85 PathProgramCache]: Analyzing trace with hash 532500475, now seen corresponding path program 1 times [2023-08-29 20:21:17,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:21:17,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674820490] [2023-08-29 20:21:17,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:21:17,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:21:17,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:21:18,205 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:21:18,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:21:18,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674820490] [2023-08-29 20:21:18,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674820490] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:21:18,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:21:18,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:21:18,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385060072] [2023-08-29 20:21:18,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:21:18,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:21:18,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:21:18,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:21:18,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:21:18,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 272 [2023-08-29 20:21:18,285 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 278 transitions, 5871 flow. Second operand has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:18,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:21:18,286 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 272 [2023-08-29 20:21:18,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:21:23,599 INFO L130 PetriNetUnfolder]: 24817/34709 cut-off events. [2023-08-29 20:21:23,599 INFO L131 PetriNetUnfolder]: For 679755/680871 co-relation queries the response was YES. [2023-08-29 20:21:23,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 270042 conditions, 34709 events. 24817/34709 cut-off events. For 679755/680871 co-relation queries the response was YES. Maximal size of possible extension queue 1294. Compared 209715 event pairs, 1622 based on Foata normal form. 1068/35687 useless extension candidates. Maximal degree in co-relation 269998. Up to 16211 conditions per place. [2023-08-29 20:21:23,936 INFO L137 encePairwiseOnDemand]: 258/272 looper letters, 227 selfloop transitions, 172 changer transitions 178/592 dead transitions. [2023-08-29 20:21:23,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 592 transitions, 13339 flow [2023-08-29 20:21:23,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:21:23,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:21:23,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 878 transitions. [2023-08-29 20:21:23,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46113445378151263 [2023-08-29 20:21:23,938 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 878 transitions. [2023-08-29 20:21:23,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 878 transitions. [2023-08-29 20:21:23,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:21:23,938 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 878 transitions. [2023-08-29 20:21:23,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.42857142857143) internal successors, (878), 7 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:23,941 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:23,942 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:23,942 INFO L175 Difference]: Start difference. First operand has 113 places, 278 transitions, 5871 flow. Second operand 7 states and 878 transitions. [2023-08-29 20:21:23,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 592 transitions, 13339 flow [2023-08-29 20:21:25,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 592 transitions, 13084 flow, removed 46 selfloop flow, removed 5 redundant places. [2023-08-29 20:21:25,599 INFO L231 Difference]: Finished difference. Result has 118 places, 321 transitions, 7309 flow [2023-08-29 20:21:25,600 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=5739, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=7309, PETRI_PLACES=118, PETRI_TRANSITIONS=321} [2023-08-29 20:21:25,600 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 65 predicate places. [2023-08-29 20:21:25,600 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 321 transitions, 7309 flow [2023-08-29 20:21:25,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:25,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:21:25,600 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:21:25,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-29 20:21:25,601 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:21:25,601 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:21:25,601 INFO L85 PathProgramCache]: Analyzing trace with hash -443509635, now seen corresponding path program 2 times [2023-08-29 20:21:25,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:21:25,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394358772] [2023-08-29 20:21:25,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:21:25,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:21:25,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:21:25,784 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:21:25,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:21:25,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394358772] [2023-08-29 20:21:25,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394358772] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:21:25,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:21:25,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:21:25,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751431422] [2023-08-29 20:21:25,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:21:25,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:21:25,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:21:25,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:21:25,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:21:25,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 272 [2023-08-29 20:21:25,793 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 321 transitions, 7309 flow. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:25,794 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:21:25,794 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 272 [2023-08-29 20:21:25,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:21:28,717 INFO L130 PetriNetUnfolder]: 11125/16510 cut-off events. [2023-08-29 20:21:28,717 INFO L131 PetriNetUnfolder]: For 444549/450962 co-relation queries the response was YES. [2023-08-29 20:21:28,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135106 conditions, 16510 events. 11125/16510 cut-off events. For 444549/450962 co-relation queries the response was YES. Maximal size of possible extension queue 915. Compared 106945 event pairs, 2362 based on Foata normal form. 2411/18060 useless extension candidates. Maximal degree in co-relation 135059. Up to 13040 conditions per place. [2023-08-29 20:21:28,844 INFO L137 encePairwiseOnDemand]: 266/272 looper letters, 302 selfloop transitions, 5 changer transitions 10/400 dead transitions. [2023-08-29 20:21:28,844 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 400 transitions, 9672 flow [2023-08-29 20:21:28,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:21:28,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:21:28,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 407 transitions. [2023-08-29 20:21:28,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4987745098039216 [2023-08-29 20:21:28,845 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 407 transitions. [2023-08-29 20:21:28,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 407 transitions. [2023-08-29 20:21:28,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:21:28,846 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 407 transitions. [2023-08-29 20:21:28,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:28,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 272.0) internal successors, (1088), 4 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:28,847 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 272.0) internal successors, (1088), 4 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:28,847 INFO L175 Difference]: Start difference. First operand has 118 places, 321 transitions, 7309 flow. Second operand 3 states and 407 transitions. [2023-08-29 20:21:28,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 400 transitions, 9672 flow [2023-08-29 20:21:29,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 400 transitions, 9498 flow, removed 87 selfloop flow, removed 1 redundant places. [2023-08-29 20:21:29,409 INFO L231 Difference]: Finished difference. Result has 119 places, 280 transitions, 5971 flow [2023-08-29 20:21:29,409 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=6053, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=5971, PETRI_PLACES=119, PETRI_TRANSITIONS=280} [2023-08-29 20:21:29,410 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 66 predicate places. [2023-08-29 20:21:29,410 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 280 transitions, 5971 flow [2023-08-29 20:21:29,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:29,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:21:29,410 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:21:29,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-29 20:21:29,410 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:21:29,411 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:21:29,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1614037922, now seen corresponding path program 1 times [2023-08-29 20:21:29,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:21:29,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041877024] [2023-08-29 20:21:29,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:21:29,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:21:29,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:21:29,972 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:21:29,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:21:29,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041877024] [2023-08-29 20:21:29,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041877024] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:21:29,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:21:29,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:21:29,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695850519] [2023-08-29 20:21:29,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:21:29,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 20:21:29,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:21:29,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 20:21:29,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-29 20:21:30,022 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 272 [2023-08-29 20:21:30,023 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 280 transitions, 5971 flow. Second operand has 8 states, 8 states have (on average 123.25) internal successors, (986), 8 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:30,024 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:21:30,024 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 272 [2023-08-29 20:21:30,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:21:33,574 INFO L130 PetriNetUnfolder]: 13995/21495 cut-off events. [2023-08-29 20:21:33,574 INFO L131 PetriNetUnfolder]: For 458011/460126 co-relation queries the response was YES. [2023-08-29 20:21:33,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170938 conditions, 21495 events. 13995/21495 cut-off events. For 458011/460126 co-relation queries the response was YES. Maximal size of possible extension queue 1022. Compared 149198 event pairs, 2753 based on Foata normal form. 1138/21962 useless extension candidates. Maximal degree in co-relation 170890. Up to 9035 conditions per place. [2023-08-29 20:21:33,794 INFO L137 encePairwiseOnDemand]: 265/272 looper letters, 153 selfloop transitions, 92 changer transitions 60/373 dead transitions. [2023-08-29 20:21:33,794 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 373 transitions, 8123 flow [2023-08-29 20:21:33,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:21:33,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:21:33,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 923 transitions. [2023-08-29 20:21:33,795 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4847689075630252 [2023-08-29 20:21:33,795 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 923 transitions. [2023-08-29 20:21:33,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 923 transitions. [2023-08-29 20:21:33,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:21:33,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 923 transitions. [2023-08-29 20:21:33,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.85714285714286) internal successors, (923), 7 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:33,799 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:33,799 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:33,799 INFO L175 Difference]: Start difference. First operand has 119 places, 280 transitions, 5971 flow. Second operand 7 states and 923 transitions. [2023-08-29 20:21:33,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 373 transitions, 8123 flow [2023-08-29 20:21:35,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 373 transitions, 8077 flow, removed 17 selfloop flow, removed 2 redundant places. [2023-08-29 20:21:35,040 INFO L231 Difference]: Finished difference. Result has 126 places, 272 transitions, 6147 flow [2023-08-29 20:21:35,040 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=5946, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6147, PETRI_PLACES=126, PETRI_TRANSITIONS=272} [2023-08-29 20:21:35,041 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 73 predicate places. [2023-08-29 20:21:35,041 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 272 transitions, 6147 flow [2023-08-29 20:21:35,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 123.25) internal successors, (986), 8 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:35,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:21:35,041 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:21:35,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-29 20:21:35,042 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:21:35,042 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:21:35,042 INFO L85 PathProgramCache]: Analyzing trace with hash -180531709, now seen corresponding path program 1 times [2023-08-29 20:21:35,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:21:35,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250432811] [2023-08-29 20:21:35,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:21:35,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:21:35,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:21:35,222 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:21:35,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:21:35,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250432811] [2023-08-29 20:21:35,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250432811] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:21:35,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:21:35,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:21:35,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150063352] [2023-08-29 20:21:35,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:21:35,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:21:35,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:21:35,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:21:35,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:21:35,230 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 272 [2023-08-29 20:21:35,230 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 272 transitions, 6147 flow. Second operand has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 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:21:35,230 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:21:35,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 272 [2023-08-29 20:21:35,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:21:36,821 INFO L130 PetriNetUnfolder]: 5923/9544 cut-off events. [2023-08-29 20:21:36,821 INFO L131 PetriNetUnfolder]: For 249489/252168 co-relation queries the response was YES. [2023-08-29 20:21:36,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78147 conditions, 9544 events. 5923/9544 cut-off events. For 249489/252168 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 63647 event pairs, 898 based on Foata normal form. 1622/10889 useless extension candidates. Maximal degree in co-relation 78097. Up to 4795 conditions per place. [2023-08-29 20:21:36,906 INFO L137 encePairwiseOnDemand]: 266/272 looper letters, 296 selfloop transitions, 9 changer transitions 18/393 dead transitions. [2023-08-29 20:21:36,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 393 transitions, 10210 flow [2023-08-29 20:21:36,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:21:36,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:21:36,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 544 transitions. [2023-08-29 20:21:36,907 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-08-29 20:21:36,907 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 544 transitions. [2023-08-29 20:21:36,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 544 transitions. [2023-08-29 20:21:36,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:21:36,908 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 544 transitions. [2023-08-29 20:21:36,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:36,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 272.0) internal successors, (1360), 5 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:36,910 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 272.0) internal successors, (1360), 5 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:36,910 INFO L175 Difference]: Start difference. First operand has 126 places, 272 transitions, 6147 flow. Second operand 4 states and 544 transitions. [2023-08-29 20:21:36,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 393 transitions, 10210 flow [2023-08-29 20:21:37,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 393 transitions, 9456 flow, removed 141 selfloop flow, removed 20 redundant places. [2023-08-29 20:21:37,258 INFO L231 Difference]: Finished difference. Result has 108 places, 216 transitions, 4578 flow [2023-08-29 20:21:37,259 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=4690, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=4578, PETRI_PLACES=108, PETRI_TRANSITIONS=216} [2023-08-29 20:21:37,259 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 55 predicate places. [2023-08-29 20:21:37,259 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 216 transitions, 4578 flow [2023-08-29 20:21:37,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 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:21:37,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:21:37,260 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:21:37,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-29 20:21:37,260 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:21:37,260 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:21:37,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1623658380, now seen corresponding path program 1 times [2023-08-29 20:21:37,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:21:37,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163831246] [2023-08-29 20:21:37,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:21:37,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:21:37,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:21:37,753 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:21:37,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:21:37,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163831246] [2023-08-29 20:21:37,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163831246] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:21:37,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:21:37,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:21:37,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689749644] [2023-08-29 20:21:37,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:21:37,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:21:37,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:21:37,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:21:37,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:21:37,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 272 [2023-08-29 20:21:37,803 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 216 transitions, 4578 flow. Second operand has 5 states, 5 states have (on average 117.2) internal successors, (586), 5 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:37,803 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:21:37,803 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 272 [2023-08-29 20:21:37,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:21:39,912 INFO L130 PetriNetUnfolder]: 9426/14910 cut-off events. [2023-08-29 20:21:39,913 INFO L131 PetriNetUnfolder]: For 256964/257662 co-relation queries the response was YES. [2023-08-29 20:21:39,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115294 conditions, 14910 events. 9426/14910 cut-off events. For 256964/257662 co-relation queries the response was YES. Maximal size of possible extension queue 567. Compared 98351 event pairs, 2625 based on Foata normal form. 627/15500 useless extension candidates. Maximal degree in co-relation 115254. Up to 7225 conditions per place. [2023-08-29 20:21:40,023 INFO L137 encePairwiseOnDemand]: 265/272 looper letters, 133 selfloop transitions, 25 changer transitions 165/327 dead transitions. [2023-08-29 20:21:40,023 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 327 transitions, 7042 flow [2023-08-29 20:21:40,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:21:40,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:21:40,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 759 transitions. [2023-08-29 20:21:40,025 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4650735294117647 [2023-08-29 20:21:40,025 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 759 transitions. [2023-08-29 20:21:40,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 759 transitions. [2023-08-29 20:21:40,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:21:40,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 759 transitions. [2023-08-29 20:21:40,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 126.5) internal successors, (759), 6 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:40,027 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 272.0) internal successors, (1904), 7 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:40,027 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 272.0) internal successors, (1904), 7 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:40,027 INFO L175 Difference]: Start difference. First operand has 108 places, 216 transitions, 4578 flow. Second operand 6 states and 759 transitions. [2023-08-29 20:21:40,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 327 transitions, 7042 flow [2023-08-29 20:21:40,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 327 transitions, 6990 flow, removed 17 selfloop flow, removed 4 redundant places. [2023-08-29 20:21:40,521 INFO L231 Difference]: Finished difference. Result has 112 places, 127 transitions, 2424 flow [2023-08-29 20:21:40,521 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=4542, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2424, PETRI_PLACES=112, PETRI_TRANSITIONS=127} [2023-08-29 20:21:40,522 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 59 predicate places. [2023-08-29 20:21:40,522 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 127 transitions, 2424 flow [2023-08-29 20:21:40,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.2) internal successors, (586), 5 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:40,522 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:21:40,522 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:21:40,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-29 20:21:40,523 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:21:40,523 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:21:40,523 INFO L85 PathProgramCache]: Analyzing trace with hash 649783711, now seen corresponding path program 1 times [2023-08-29 20:21:40,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:21:40,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458566588] [2023-08-29 20:21:40,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:21:40,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:21:40,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:21:40,710 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:21:40,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:21:40,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458566588] [2023-08-29 20:21:40,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458566588] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:21:40,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:21:40,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:21:40,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353448979] [2023-08-29 20:21:40,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:21:40,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:21:40,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:21:40,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:21:40,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:21:40,720 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 272 [2023-08-29 20:21:40,720 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 127 transitions, 2424 flow. Second operand has 5 states, 5 states have (on average 125.8) internal successors, (629), 5 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:40,721 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:21:40,721 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 272 [2023-08-29 20:21:40,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:21:41,641 INFO L130 PetriNetUnfolder]: 3889/6428 cut-off events. [2023-08-29 20:21:41,641 INFO L131 PetriNetUnfolder]: For 124736/125977 co-relation queries the response was YES. [2023-08-29 20:21:41,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49873 conditions, 6428 events. 3889/6428 cut-off events. For 124736/125977 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 42003 event pairs, 500 based on Foata normal form. 1035/7272 useless extension candidates. Maximal degree in co-relation 49832. Up to 2975 conditions per place. [2023-08-29 20:21:41,680 INFO L137 encePairwiseOnDemand]: 266/272 looper letters, 176 selfloop transitions, 13 changer transitions 26/244 dead transitions. [2023-08-29 20:21:41,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 244 transitions, 5230 flow [2023-08-29 20:21:41,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:21:41,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:21:41,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 679 transitions. [2023-08-29 20:21:41,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49926470588235294 [2023-08-29 20:21:41,681 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 679 transitions. [2023-08-29 20:21:41,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 679 transitions. [2023-08-29 20:21:41,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:21:41,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 679 transitions. [2023-08-29 20:21:41,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:41,684 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:41,684 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:41,684 INFO L175 Difference]: Start difference. First operand has 112 places, 127 transitions, 2424 flow. Second operand 5 states and 679 transitions. [2023-08-29 20:21:41,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 244 transitions, 5230 flow [2023-08-29 20:21:41,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 244 transitions, 4849 flow, removed 50 selfloop flow, removed 9 redundant places. [2023-08-29 20:21:41,917 INFO L231 Difference]: Finished difference. Result has 106 places, 117 transitions, 1981 flow [2023-08-29 20:21:41,917 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=2154, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1981, PETRI_PLACES=106, PETRI_TRANSITIONS=117} [2023-08-29 20:21:41,918 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 53 predicate places. [2023-08-29 20:21:41,918 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 117 transitions, 1981 flow [2023-08-29 20:21:41,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.8) internal successors, (629), 5 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:41,918 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:21:41,918 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:21:41,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-29 20:21:41,918 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:21:41,919 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:21:41,919 INFO L85 PathProgramCache]: Analyzing trace with hash 106227319, now seen corresponding path program 1 times [2023-08-29 20:21:41,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:21:41,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105233201] [2023-08-29 20:21:41,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:21:41,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:21:41,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:21:42,111 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:21:42,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:21:42,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105233201] [2023-08-29 20:21:42,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105233201] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:21:42,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:21:42,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:21:42,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613169467] [2023-08-29 20:21:42,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:21:42,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:21:42,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:21:42,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:21:42,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:21:42,125 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 272 [2023-08-29 20:21:42,125 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 117 transitions, 1981 flow. Second operand has 6 states, 6 states have (on average 125.5) internal successors, (753), 6 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:42,126 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:21:42,126 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 272 [2023-08-29 20:21:42,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:21:42,834 INFO L130 PetriNetUnfolder]: 3531/5668 cut-off events. [2023-08-29 20:21:42,834 INFO L131 PetriNetUnfolder]: For 97153/98085 co-relation queries the response was YES. [2023-08-29 20:21:42,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44173 conditions, 5668 events. 3531/5668 cut-off events. For 97153/98085 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 35504 event pairs, 453 based on Foata normal form. 545/6032 useless extension candidates. Maximal degree in co-relation 44137. Up to 2717 conditions per place. [2023-08-29 20:21:42,860 INFO L137 encePairwiseOnDemand]: 266/272 looper letters, 139 selfloop transitions, 17 changer transitions 49/223 dead transitions. [2023-08-29 20:21:42,861 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 223 transitions, 4360 flow [2023-08-29 20:21:42,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:21:42,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:21:42,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 801 transitions. [2023-08-29 20:21:42,862 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49080882352941174 [2023-08-29 20:21:42,862 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 801 transitions. [2023-08-29 20:21:42,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 801 transitions. [2023-08-29 20:21:42,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:21:42,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 801 transitions. [2023-08-29 20:21:42,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 133.5) internal successors, (801), 6 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:42,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 272.0) internal successors, (1904), 7 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:42,864 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 272.0) internal successors, (1904), 7 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:42,864 INFO L175 Difference]: Start difference. First operand has 106 places, 117 transitions, 1981 flow. Second operand 6 states and 801 transitions. [2023-08-29 20:21:42,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 223 transitions, 4360 flow [2023-08-29 20:21:43,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 223 transitions, 4070 flow, removed 70 selfloop flow, removed 7 redundant places. [2023-08-29 20:21:43,172 INFO L231 Difference]: Finished difference. Result has 105 places, 91 transitions, 1364 flow [2023-08-29 20:21:43,173 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=1791, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1364, PETRI_PLACES=105, PETRI_TRANSITIONS=91} [2023-08-29 20:21:43,173 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 52 predicate places. [2023-08-29 20:21:43,173 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 91 transitions, 1364 flow [2023-08-29 20:21:43,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 125.5) internal successors, (753), 6 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:43,174 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:21:43,174 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, 1] [2023-08-29 20:21:43,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-29 20:21:43,174 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:21:43,174 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:21:43,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1804973894, now seen corresponding path program 1 times [2023-08-29 20:21:43,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:21:43,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112063816] [2023-08-29 20:21:43,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:21:43,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:21:43,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:21:43,369 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:21:43,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:21:43,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112063816] [2023-08-29 20:21:43,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112063816] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:21:43,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:21:43,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:21:43,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856255643] [2023-08-29 20:21:43,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:21:43,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:21:43,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:21:43,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:21:43,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:21:43,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 272 [2023-08-29 20:21:43,381 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 91 transitions, 1364 flow. Second operand has 5 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:43,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:21:43,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 272 [2023-08-29 20:21:43,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:21:43,724 INFO L130 PetriNetUnfolder]: 1339/2272 cut-off events. [2023-08-29 20:21:43,724 INFO L131 PetriNetUnfolder]: For 29661/29756 co-relation queries the response was YES. [2023-08-29 20:21:43,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16652 conditions, 2272 events. 1339/2272 cut-off events. For 29661/29756 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 12036 event pairs, 256 based on Foata normal form. 68/2291 useless extension candidates. Maximal degree in co-relation 16618. Up to 1317 conditions per place. [2023-08-29 20:21:43,736 INFO L137 encePairwiseOnDemand]: 268/272 looper letters, 52 selfloop transitions, 1 changer transitions 99/157 dead transitions. [2023-08-29 20:21:43,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 157 transitions, 2576 flow [2023-08-29 20:21:43,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:21:43,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:21:43,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 660 transitions. [2023-08-29 20:21:43,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4852941176470588 [2023-08-29 20:21:43,737 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 660 transitions. [2023-08-29 20:21:43,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 660 transitions. [2023-08-29 20:21:43,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:21:43,738 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 660 transitions. [2023-08-29 20:21:43,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.0) internal successors, (660), 5 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:43,739 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:43,739 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:43,739 INFO L175 Difference]: Start difference. First operand has 105 places, 91 transitions, 1364 flow. Second operand 5 states and 660 transitions. [2023-08-29 20:21:43,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 157 transitions, 2576 flow [2023-08-29 20:21:43,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 157 transitions, 2193 flow, removed 144 selfloop flow, removed 10 redundant places. [2023-08-29 20:21:43,784 INFO L231 Difference]: Finished difference. Result has 101 places, 54 transitions, 564 flow [2023-08-29 20:21:43,784 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=1167, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=564, PETRI_PLACES=101, PETRI_TRANSITIONS=54} [2023-08-29 20:21:43,785 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 48 predicate places. [2023-08-29 20:21:43,785 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 54 transitions, 564 flow [2023-08-29 20:21:43,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:43,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:21:43,785 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, 1] [2023-08-29 20:21:43,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-29 20:21:43,785 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:21:43,786 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:21:43,786 INFO L85 PathProgramCache]: Analyzing trace with hash 152800074, now seen corresponding path program 2 times [2023-08-29 20:21:43,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:21:43,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756006934] [2023-08-29 20:21:43,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:21:43,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:21:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:21:44,644 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:21:44,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:21:44,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756006934] [2023-08-29 20:21:44,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756006934] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:21:44,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:21:44,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 20:21:44,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631045532] [2023-08-29 20:21:44,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:21:44,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-29 20:21:44,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:21:44,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-29 20:21:44,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-29 20:21:44,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 272 [2023-08-29 20:21:44,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 54 transitions, 564 flow. Second operand has 10 states, 10 states have (on average 123.4) internal successors, (1234), 10 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:44,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:21:44,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 272 [2023-08-29 20:21:44,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:21:44,918 INFO L130 PetriNetUnfolder]: 363/659 cut-off events. [2023-08-29 20:21:44,918 INFO L131 PetriNetUnfolder]: For 4871/4875 co-relation queries the response was YES. [2023-08-29 20:21:44,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3933 conditions, 659 events. 363/659 cut-off events. For 4871/4875 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2689 event pairs, 85 based on Foata normal form. 1/656 useless extension candidates. Maximal degree in co-relation 3901. Up to 338 conditions per place. [2023-08-29 20:21:44,922 INFO L137 encePairwiseOnDemand]: 266/272 looper letters, 53 selfloop transitions, 6 changer transitions 30/93 dead transitions. [2023-08-29 20:21:44,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 93 transitions, 1027 flow [2023-08-29 20:21:44,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:21:44,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:21:44,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 771 transitions. [2023-08-29 20:21:44,923 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4724264705882353 [2023-08-29 20:21:44,923 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 771 transitions. [2023-08-29 20:21:44,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 771 transitions. [2023-08-29 20:21:44,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:21:44,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 771 transitions. [2023-08-29 20:21:44,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.5) internal successors, (771), 6 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:44,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 272.0) internal successors, (1904), 7 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:44,925 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 272.0) internal successors, (1904), 7 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:44,925 INFO L175 Difference]: Start difference. First operand has 101 places, 54 transitions, 564 flow. Second operand 6 states and 771 transitions. [2023-08-29 20:21:44,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 93 transitions, 1027 flow [2023-08-29 20:21:44,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 93 transitions, 813 flow, removed 52 selfloop flow, removed 23 redundant places. [2023-08-29 20:21:44,934 INFO L231 Difference]: Finished difference. Result has 78 places, 51 transitions, 382 flow [2023-08-29 20:21:44,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=272, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=382, PETRI_PLACES=78, PETRI_TRANSITIONS=51} [2023-08-29 20:21:44,934 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 25 predicate places. [2023-08-29 20:21:44,934 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 51 transitions, 382 flow [2023-08-29 20:21:44,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 123.4) internal successors, (1234), 10 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:44,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:21:44,935 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, 1] [2023-08-29 20:21:44,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-08-29 20:21:44,935 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:21:44,936 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:21:44,936 INFO L85 PathProgramCache]: Analyzing trace with hash -2072674618, now seen corresponding path program 3 times [2023-08-29 20:21:44,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:21:44,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74811436] [2023-08-29 20:21:44,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:21:44,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:21:44,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:21:44,965 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:21:44,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:21:45,024 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 20:21:45,024 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:21:45,025 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-29 20:21:45,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-29 20:21:45,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-29 20:21:45,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-29 20:21:45,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-29 20:21:45,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-29 20:21:45,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-29 20:21:45,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-29 20:21:45,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-29 20:21:45,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-29 20:21:45,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-29 20:21:45,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-29 20:21:45,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-29 20:21:45,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-29 20:21:45,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-29 20:21:45,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-29 20:21:45,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-08-29 20:21:45,029 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:21:45,034 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:21:45,034 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:21:45,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:21:45 BasicIcfg [2023-08-29 20:21:45,092 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:21:45,092 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:21:45,092 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:21:45,093 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:21:45,093 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:20:16" (3/4) ... [2023-08-29 20:21:45,095 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:21:45,095 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:21:45,096 INFO L158 Benchmark]: Toolchain (without parser) took 89622.31ms. Allocated memory was 58.7MB in the beginning and 11.4GB in the end (delta: 11.3GB). Free memory was 34.3MB in the beginning and 8.9GB in the end (delta: -8.9GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. [2023-08-29 20:21:45,096 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 48.2MB. Free memory was 26.5MB in the beginning and 26.4MB in the end (delta: 33.5kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:21:45,096 INFO L158 Benchmark]: CACSL2BoogieTranslator took 547.79ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 34.2MB in the beginning and 48.8MB in the end (delta: -14.7MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. [2023-08-29 20:21:45,096 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.29ms. Allocated memory is still 71.3MB. Free memory was 48.8MB in the beginning and 46.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:21:45,097 INFO L158 Benchmark]: Boogie Preprocessor took 32.00ms. Allocated memory is still 71.3MB. Free memory was 46.0MB in the beginning and 44.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:21:45,097 INFO L158 Benchmark]: RCFGBuilder took 845.55ms. Allocated memory is still 71.3MB. Free memory was 43.9MB in the beginning and 35.9MB in the end (delta: 8.0MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. [2023-08-29 20:21:45,097 INFO L158 Benchmark]: TraceAbstraction took 88143.74ms. Allocated memory was 71.3MB in the beginning and 11.4GB in the end (delta: 11.3GB). Free memory was 35.3MB in the beginning and 8.9GB in the end (delta: -8.9GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. [2023-08-29 20:21:45,097 INFO L158 Benchmark]: Witness Printer took 2.85ms. Allocated memory is still 11.4GB. Free memory is still 8.9GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:21:45,099 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 48.2MB. Free memory was 26.5MB in the beginning and 26.4MB in the end (delta: 33.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 547.79ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 34.2MB in the beginning and 48.8MB in the end (delta: -14.7MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.29ms. Allocated memory is still 71.3MB. Free memory was 48.8MB in the beginning and 46.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.00ms. Allocated memory is still 71.3MB. Free memory was 46.0MB in the beginning and 44.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 845.55ms. Allocated memory is still 71.3MB. Free memory was 43.9MB in the beginning and 35.9MB in the end (delta: 8.0MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. * TraceAbstraction took 88143.74ms. Allocated memory was 71.3MB in the beginning and 11.4GB in the end (delta: 11.3GB). Free memory was 35.3MB in the beginning and 8.9GB in the end (delta: -8.9GB). Peak memory consumption was 2.5GB. Max. memory is 16.1GB. * Witness Printer took 2.85ms. Allocated memory is still 11.4GB. Free memory is still 8.9GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.4s, 148 PlacesBefore, 53 PlacesAfterwards, 137 TransitionsBefore, 41 TransitionsAfterwards, 3320 CoEnabledTransitionPairs, 7 FixpointIterations, 49 TrivialSequentialCompositions, 74 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 131 TotalNumberOfCompositions, 9639 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4852, independent: 4614, independent conditional: 0, independent unconditional: 4614, dependent: 238, dependent conditional: 0, dependent unconditional: 238, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1741, independent: 1709, independent conditional: 0, independent unconditional: 1709, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4852, independent: 2905, independent conditional: 0, independent unconditional: 2905, dependent: 206, dependent conditional: 0, dependent unconditional: 206, unknown: 1741, unknown conditional: 0, unknown unconditional: 1741] , Statistics on independence cache: Total cache size (in pairs): 230, Positive cache size: 214, Positive conditional cache size: 0, Positive unconditional cache size: 214, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff0_thd4; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$r_buff1_thd4; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L846] 0 pthread_t t577; [L847] FCALL, FORK 0 pthread_create(&t577, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t577, ((void *)0), P0, ((void *)0))=8, t577={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L848] 0 pthread_t t578; [L849] FCALL, FORK 0 pthread_create(&t578, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t578, ((void *)0), P1, ((void *)0))=9, t577={5:0}, t578={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L850] 0 pthread_t t579; [L851] FCALL, FORK 0 pthread_create(&t579, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t579, ((void *)0), P2, ((void *)0))=10, t577={5:0}, t578={6:0}, t579={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L852] 0 pthread_t t580; [L853] FCALL, FORK 0 pthread_create(&t580, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t580, ((void *)0), P3, ((void *)0))=11, t577={5:0}, t578={6:0}, t579={7:0}, t580={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L785] 3 y$w_buff1 = y$w_buff0 [L786] 3 y$w_buff0 = 2 [L787] 3 y$w_buff1_used = y$w_buff0_used [L788] 3 y$w_buff0_used = (_Bool)1 [L789] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L789] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L790] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L791] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L792] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L793] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L794] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L795] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L798] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L815] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L818] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L821] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L765] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L824] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L825] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L826] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L827] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L828] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L768] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 2 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t577={5:0}, t578={6:0}, t579={7:0}, t580={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 y$flush_delayed = weak$$choice2 [L869] 0 y$mem_tmp = y [L870] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L871] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L872] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L873] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L874] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L876] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] 0 y = y$flush_delayed ? y$mem_tmp : y [L879] 0 y$flush_delayed = (_Bool)0 [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 844]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: 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: 849]: 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: 847]: 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: 851]: 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, 177 locations, 16 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: 88.0s, OverallIterations: 28, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 70.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2011 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1664 mSDsluCounter, 1367 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1144 mSDsCounter, 417 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5630 IncrementalHoareTripleChecker+Invalid, 6047 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 417 mSolverCounterUnsat, 223 mSDtfsCounter, 5630 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 159 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7309occurred in iteration=19, InterpolantAutomatonStates: 166, 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.6s SatisfiabilityAnalysisTime, 11.7s InterpolantComputationTime, 491 NumberOfCodeBlocks, 491 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 436 ConstructedInterpolants, 0 QuantifiedInterpolants, 5045 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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:21:45,121 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/mix021_tso.oepc.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 1821be0ec0c098ba0cd2fb39edc7421f58889218b21285544a5e01e847e429e6 --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:21:47,595 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:21:47,598 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:21:47,637 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:21:47,640 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:21:47,643 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:21:47,645 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:21:47,647 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:21:47,649 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:21:47,654 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:21:47,655 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:21:47,657 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:21:47,657 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:21:47,659 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:21:47,661 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:21:47,666 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:21:47,667 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:21:47,668 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:21:47,670 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:21:47,676 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:21:47,678 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:21:47,679 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:21:47,679 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:21:47,680 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:21:47,687 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:21:47,687 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:21:47,687 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:21:47,690 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:21:47,690 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:21:47,691 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:21:47,691 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:21:47,697 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:21:47,699 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:21:47,700 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:21:47,700 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:21:47,700 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:21:47,701 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:21:47,701 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:21:47,701 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:21:47,702 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:21:47,703 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:21:47,704 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:21:47,738 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:21:47,738 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:21:47,740 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:21:47,740 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:21:47,741 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:21:47,741 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:21:47,741 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:21:47,741 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:21:47,742 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:21:47,742 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:21:47,743 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:21:47,743 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:21:47,743 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:21:47,743 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:21:47,744 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:21:47,744 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:21:47,744 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:21:47,744 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:21:47,744 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:21:47,744 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:21:47,745 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-29 20:21:47,745 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-29 20:21:47,745 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:21:47,745 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:21:47,745 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:21:47,746 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:21:47,746 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:21:47,746 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:21:47,746 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:21:47,747 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:21:47,747 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-29 20:21:47,747 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-29 20:21:47,747 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:21:47,747 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:21:47,748 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:21:47,748 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-29 20:21:47,748 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:21:47,748 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 -> 1821be0ec0c098ba0cd2fb39edc7421f58889218b21285544a5e01e847e429e6 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:21:48,017 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:21:48,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:21:48,039 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:21:48,040 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:21:48,041 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:21:48,042 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix021_tso.oepc.i [2023-08-29 20:21:49,190 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:21:49,526 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:21:49,527 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix021_tso.oepc.i [2023-08-29 20:21:49,542 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f8dc59e2/25293c5db81942d684ee6e3fb58b8c8b/FLAG0615fffaa [2023-08-29 20:21:49,562 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f8dc59e2/25293c5db81942d684ee6e3fb58b8c8b [2023-08-29 20:21:49,564 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:21:49,566 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:21:49,569 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:21:49,570 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:21:49,572 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:21:49,573 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:21:49" (1/1) ... [2023-08-29 20:21:49,575 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@712c69e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:21:49, skipping insertion in model container [2023-08-29 20:21:49,575 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:21:49" (1/1) ... [2023-08-29 20:21:49,581 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:21:49,636 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:21:49,813 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/mix021_tso.oepc.i[949,962] [2023-08-29 20:21:49,952 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:21:49,968 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:21:49,981 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/mix021_tso.oepc.i[949,962] [2023-08-29 20:21:50,040 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:21:50,079 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:21:50,080 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:21:50,085 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:21:50,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:21:50 WrapperNode [2023-08-29 20:21:50,086 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:21:50,088 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:21:50,088 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:21:50,088 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:21:50,094 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:21:50" (1/1) ... [2023-08-29 20:21:50,130 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:21:50" (1/1) ... [2023-08-29 20:21:50,171 INFO L138 Inliner]: procedures = 180, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 162 [2023-08-29 20:21:50,177 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:21:50,178 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:21:50,178 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:21:50,178 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:21:50,187 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:21:50" (1/1) ... [2023-08-29 20:21:50,188 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:21:50" (1/1) ... [2023-08-29 20:21:50,198 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:21:50" (1/1) ... [2023-08-29 20:21:50,202 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:21:50" (1/1) ... [2023-08-29 20:21:50,209 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:21:50" (1/1) ... [2023-08-29 20:21:50,223 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:21:50" (1/1) ... [2023-08-29 20:21:50,226 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:21:50" (1/1) ... [2023-08-29 20:21:50,231 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:21:50" (1/1) ... [2023-08-29 20:21:50,235 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:21:50,241 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:21:50,241 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:21:50,241 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:21:50,242 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:21:50" (1/1) ... [2023-08-29 20:21:50,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:21:50,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:21:50,269 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:21:50,298 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:21:50,314 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:21:50,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:21:50,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:21:50,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:21:50,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-29 20:21:50,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-29 20:21:50,315 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:21:50,315 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:21:50,315 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:21:50,316 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:21:50,316 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:21:50,316 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:21:50,316 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-29 20:21:50,316 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-29 20:21:50,316 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:21:50,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:21:50,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:21:50,318 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:21:50,535 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:21:50,537 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:21:50,862 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:21:51,043 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:21:51,043 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:21:51,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:21:51 BoogieIcfgContainer [2023-08-29 20:21:51,047 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:21:51,050 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:21:51,050 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:21:51,053 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:21:51,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:21:49" (1/3) ... [2023-08-29 20:21:51,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54647a34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:21:51, skipping insertion in model container [2023-08-29 20:21:51,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:21:50" (2/3) ... [2023-08-29 20:21:51,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54647a34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:21:51, skipping insertion in model container [2023-08-29 20:21:51,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:21:51" (3/3) ... [2023-08-29 20:21:51,056 INFO L112 eAbstractionObserver]: Analyzing ICFG mix021_tso.oepc.i [2023-08-29 20:21:51,072 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:21:51,072 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-29 20:21:51,072 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:21:51,146 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:21:51,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 142 transitions, 304 flow [2023-08-29 20:21:51,239 INFO L130 PetriNetUnfolder]: 2/138 cut-off events. [2023-08-29 20:21:51,240 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:21:51,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 2/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-29 20:21:51,245 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 142 transitions, 304 flow [2023-08-29 20:21:51,249 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 138 transitions, 288 flow [2023-08-29 20:21:51,252 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:21:51,267 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 138 transitions, 288 flow [2023-08-29 20:21:51,271 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 138 transitions, 288 flow [2023-08-29 20:21:51,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 138 transitions, 288 flow [2023-08-29 20:21:51,300 INFO L130 PetriNetUnfolder]: 2/138 cut-off events. [2023-08-29 20:21:51,303 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:21:51,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 2/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 105 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-29 20:21:51,306 INFO L119 LiptonReduction]: Number of co-enabled transitions 3320 [2023-08-29 20:21:58,696 INFO L134 LiptonReduction]: Checked pairs total: 8867 [2023-08-29 20:21:58,697 INFO L136 LiptonReduction]: Total number of compositions: 134 [2023-08-29 20:21:58,709 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:21:58,714 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;@7b72c37d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:21:58,714 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-29 20:21:58,716 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-29 20:21:58,717 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:21:58,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:21:58,717 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:21:58,718 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:21:58,722 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:21:58,722 INFO L85 PathProgramCache]: Analyzing trace with hash 595, now seen corresponding path program 1 times [2023-08-29 20:21:58,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:21:58,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1663561635] [2023-08-29 20:21:58,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:21:58,733 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:21:58,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:21:58,745 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:21:58,791 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:21:58,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:21:58,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-29 20:21:58,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:21:58,870 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:21:58,871 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:21:58,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:21:58,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1663561635] [2023-08-29 20:21:58,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1663561635] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:21:58,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:21:58,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:21:58,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667643192] [2023-08-29 20:21:58,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:21:58,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:21:58,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:21:58,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:21:58,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:21:58,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 276 [2023-08-29 20:21:58,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 94 flow. Second operand has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:21:58,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:21:58,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 276 [2023-08-29 20:21:58,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:22:00,145 INFO L130 PetriNetUnfolder]: 5761/7953 cut-off events. [2023-08-29 20:22:00,145 INFO L131 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2023-08-29 20:22:00,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15943 conditions, 7953 events. 5761/7953 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 42017 event pairs, 5761 based on Foata normal form. 240/6872 useless extension candidates. Maximal degree in co-relation 15931. Up to 7833 conditions per place. [2023-08-29 20:22:00,194 INFO L137 encePairwiseOnDemand]: 267/276 looper letters, 27 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2023-08-29 20:22:00,194 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 130 flow [2023-08-29 20:22:00,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:22:00,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:22:00,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 292 transitions. [2023-08-29 20:22:00,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5289855072463768 [2023-08-29 20:22:00,210 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 292 transitions. [2023-08-29 20:22:00,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 292 transitions. [2023-08-29 20:22:00,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:22:00,216 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 292 transitions. [2023-08-29 20:22:00,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 146.0) internal successors, (292), 2 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:22:00,225 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 276.0) internal successors, (828), 3 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:22:00,226 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 276.0) internal successors, (828), 3 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:22:00,228 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 94 flow. Second operand 2 states and 292 transitions. [2023-08-29 20:22:00,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 130 flow [2023-08-29 20:22:00,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 126 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 20:22:00,237 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 72 flow [2023-08-29 20:22:00,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2023-08-29 20:22:00,242 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2023-08-29 20:22:00,243 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 72 flow [2023-08-29 20:22:00,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:22:00,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:22:00,244 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:22:00,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-08-29 20:22:00,453 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:22:00,454 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:22:00,454 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:22:00,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1162543712, now seen corresponding path program 1 times [2023-08-29 20:22:00,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:22:00,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [450561800] [2023-08-29 20:22:00,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:22:00,459 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:22:00,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:22:00,460 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:22:00,463 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:22:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:22:00,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:22:00,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:22:00,605 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:22:00,606 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:22:00,606 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:22:00,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [450561800] [2023-08-29 20:22:00,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [450561800] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:22:00,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:22:00,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:22:00,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798592082] [2023-08-29 20:22:00,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:22:00,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:22:00,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:22:00,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:22:00,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:22:00,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 276 [2023-08-29 20:22:00,616 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:22:00,616 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:22:00,617 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 276 [2023-08-29 20:22:00,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:22:01,358 INFO L130 PetriNetUnfolder]: 4535/6637 cut-off events. [2023-08-29 20:22:01,359 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:22:01,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12966 conditions, 6637 events. 4535/6637 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 39367 event pairs, 857 based on Foata normal form. 0/5997 useless extension candidates. Maximal degree in co-relation 12963. Up to 4903 conditions per place. [2023-08-29 20:22:01,397 INFO L137 encePairwiseOnDemand]: 273/276 looper letters, 37 selfloop transitions, 2 changer transitions 4/48 dead transitions. [2023-08-29 20:22:01,397 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 48 transitions, 192 flow [2023-08-29 20:22:01,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:22:01,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:22:01,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2023-08-29 20:22:01,400 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5132850241545893 [2023-08-29 20:22:01,400 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 425 transitions. [2023-08-29 20:22:01,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 425 transitions. [2023-08-29 20:22:01,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:22:01,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 425 transitions. [2023-08-29 20:22:01,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:22:01,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:22:01,406 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:22:01,406 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 72 flow. Second operand 3 states and 425 transitions. [2023-08-29 20:22:01,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 48 transitions, 192 flow [2023-08-29 20:22:01,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 48 transitions, 192 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:22:01,408 INFO L231 Difference]: Finished difference. Result has 43 places, 29 transitions, 70 flow [2023-08-29 20:22:01,408 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=43, PETRI_TRANSITIONS=29} [2023-08-29 20:22:01,409 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2023-08-29 20:22:01,409 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 29 transitions, 70 flow [2023-08-29 20:22:01,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:22:01,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:22:01,410 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:22:01,422 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:22:01,619 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:22:01,620 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:22:01,620 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:22:01,621 INFO L85 PathProgramCache]: Analyzing trace with hash 763352159, now seen corresponding path program 1 times [2023-08-29 20:22:01,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:22:01,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [183299556] [2023-08-29 20:22:01,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:22:01,621 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:22:01,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:22:01,626 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:22:01,629 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:22:01,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:22:01,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:22:01,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:22:01,761 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:22:01,761 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:22:01,761 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:22:01,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [183299556] [2023-08-29 20:22:01,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [183299556] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:22:01,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:22:01,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:22:01,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633066796] [2023-08-29 20:22:01,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:22:01,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:22:01,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:22:01,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:22:01,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:22:01,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 276 [2023-08-29 20:22:01,777 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:22:01,777 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:22:01,777 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 276 [2023-08-29 20:22:01,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:22:02,198 INFO L130 PetriNetUnfolder]: 2335/3391 cut-off events. [2023-08-29 20:22:02,198 INFO L131 PetriNetUnfolder]: For 216/216 co-relation queries the response was YES. [2023-08-29 20:22:02,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7090 conditions, 3391 events. 2335/3391 cut-off events. For 216/216 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 17108 event pairs, 529 based on Foata normal form. 54/3277 useless extension candidates. Maximal degree in co-relation 7086. Up to 3074 conditions per place. [2023-08-29 20:22:02,216 INFO L137 encePairwiseOnDemand]: 270/276 looper letters, 36 selfloop transitions, 5 changer transitions 0/46 dead transitions. [2023-08-29 20:22:02,217 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 46 transitions, 194 flow [2023-08-29 20:22:02,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:22:02,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:22:02,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 411 transitions. [2023-08-29 20:22:02,219 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4963768115942029 [2023-08-29 20:22:02,219 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 411 transitions. [2023-08-29 20:22:02,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 411 transitions. [2023-08-29 20:22:02,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:22:02,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 411 transitions. [2023-08-29 20:22:02,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:22:02,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:22:02,223 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:22:02,223 INFO L175 Difference]: Start difference. First operand has 43 places, 29 transitions, 70 flow. Second operand 3 states and 411 transitions. [2023-08-29 20:22:02,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 46 transitions, 194 flow [2023-08-29 20:22:02,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 46 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:22:02,225 INFO L231 Difference]: Finished difference. Result has 42 places, 33 transitions, 99 flow [2023-08-29 20:22:02,225 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=42, PETRI_TRANSITIONS=33} [2023-08-29 20:22:02,226 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2023-08-29 20:22:02,226 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 99 flow [2023-08-29 20:22:02,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:22:02,227 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:22:02,227 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:22:02,237 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:22:02,437 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:22:02,437 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:22:02,437 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:22:02,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1464677098, now seen corresponding path program 1 times [2023-08-29 20:22:02,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:22:02,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [776664848] [2023-08-29 20:22:02,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:22:02,438 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:22:02,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:22:02,439 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:22:02,442 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:22:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:22:02,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:22:02,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:22:02,605 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:22:02,606 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:22:02,606 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:22:02,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [776664848] [2023-08-29 20:22:02,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [776664848] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:22:02,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:22:02,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:22:02,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45484456] [2023-08-29 20:22:02,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:22:02,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:22:02,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:22:02,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:22:02,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:22:02,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 276 [2023-08-29 20:22:02,623 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 126.5) internal successors, (506), 4 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:22:02,623 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:22:02,623 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 276 [2023-08-29 20:22:02,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:22:02,884 INFO L130 PetriNetUnfolder]: 1120/1777 cut-off events. [2023-08-29 20:22:02,884 INFO L131 PetriNetUnfolder]: For 236/236 co-relation queries the response was YES. [2023-08-29 20:22:02,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4316 conditions, 1777 events. 1120/1777 cut-off events. For 236/236 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8733 event pairs, 230 based on Foata normal form. 81/1785 useless extension candidates. Maximal degree in co-relation 4311. Up to 1054 conditions per place. [2023-08-29 20:22:02,894 INFO L137 encePairwiseOnDemand]: 270/276 looper letters, 47 selfloop transitions, 9 changer transitions 0/61 dead transitions. [2023-08-29 20:22:02,894 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 61 transitions, 285 flow [2023-08-29 20:22:02,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:22:02,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:22:02,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 549 transitions. [2023-08-29 20:22:02,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49728260869565216 [2023-08-29 20:22:02,897 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 549 transitions. [2023-08-29 20:22:02,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 549 transitions. [2023-08-29 20:22:02,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:22:02,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 549 transitions. [2023-08-29 20:22:02,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.25) internal successors, (549), 4 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:22:02,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 276.0) internal successors, (1380), 5 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:22:02,901 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 276.0) internal successors, (1380), 5 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:22:02,901 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 99 flow. Second operand 4 states and 549 transitions. [2023-08-29 20:22:02,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 61 transitions, 285 flow [2023-08-29 20:22:02,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 61 transitions, 280 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:22:02,903 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 146 flow [2023-08-29 20:22:02,904 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2023-08-29 20:22:02,904 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -8 predicate places. [2023-08-29 20:22:02,905 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 146 flow [2023-08-29 20:22:02,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.5) internal successors, (506), 4 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:22:02,905 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:22:02,905 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:22:02,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-29 20:22:03,120 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:22:03,120 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:22:03,121 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:22:03,121 INFO L85 PathProgramCache]: Analyzing trace with hash -290876520, now seen corresponding path program 1 times [2023-08-29 20:22:03,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:22:03,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [758754972] [2023-08-29 20:22:03,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:22:03,122 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:22:03,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:22:03,123 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:22:03,124 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:22:03,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:22:03,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-29 20:22:03,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:22:03,287 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:22:03,287 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:22:03,288 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:22:03,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [758754972] [2023-08-29 20:22:03,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [758754972] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:22:03,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:22:03,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:22:03,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821889690] [2023-08-29 20:22:03,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:22:03,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:22:03,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:22:03,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:22:03,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:22:03,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 276 [2023-08-29 20:22:03,302 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 146 flow. Second operand has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 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:22:03,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:22:03,303 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 276 [2023-08-29 20:22:03,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:22:03,611 INFO L130 PetriNetUnfolder]: 670/1102 cut-off events. [2023-08-29 20:22:03,611 INFO L131 PetriNetUnfolder]: For 756/756 co-relation queries the response was YES. [2023-08-29 20:22:03,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3085 conditions, 1102 events. 670/1102 cut-off events. For 756/756 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5048 event pairs, 169 based on Foata normal form. 45/1119 useless extension candidates. Maximal degree in co-relation 3079. Up to 400 conditions per place. [2023-08-29 20:22:03,618 INFO L137 encePairwiseOnDemand]: 270/276 looper letters, 56 selfloop transitions, 13 changer transitions 0/74 dead transitions. [2023-08-29 20:22:03,619 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 74 transitions, 386 flow [2023-08-29 20:22:03,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:22:03,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:22:03,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 685 transitions. [2023-08-29 20:22:03,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4963768115942029 [2023-08-29 20:22:03,622 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 685 transitions. [2023-08-29 20:22:03,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 685 transitions. [2023-08-29 20:22:03,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:22:03,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 685 transitions. [2023-08-29 20:22:03,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.0) internal successors, (685), 5 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:22:03,627 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 276.0) internal successors, (1656), 6 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:22:03,628 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 276.0) internal successors, (1656), 6 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:22:03,628 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 146 flow. Second operand 5 states and 685 transitions. [2023-08-29 20:22:03,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 74 transitions, 386 flow [2023-08-29 20:22:03,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 74 transitions, 368 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-29 20:22:03,633 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 196 flow [2023-08-29 20:22:03,633 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=196, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2023-08-29 20:22:03,634 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2023-08-29 20:22:03,634 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 196 flow [2023-08-29 20:22:03,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 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:22:03,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:22:03,635 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:22:03,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-29 20:22:03,845 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:22:03,845 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:22:03,845 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:22:03,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1413672234, now seen corresponding path program 1 times [2023-08-29 20:22:03,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:22:03,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1107897695] [2023-08-29 20:22:03,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:22:03,846 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:22:03,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:22:03,850 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:22:03,853 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:22:03,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:22:03,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-29 20:22:03,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:22:04,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:22:04,019 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:22:04,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:22:04,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1107897695] [2023-08-29 20:22:04,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1107897695] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:22:04,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:22:04,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:22:04,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244784129] [2023-08-29 20:22:04,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:22:04,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:22:04,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:22:04,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:22:04,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:22:04,035 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 276 [2023-08-29 20:22:04,036 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 196 flow. Second operand has 6 states, 6 states have (on average 126.33333333333333) internal successors, (758), 6 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:22:04,037 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:22:04,037 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 276 [2023-08-29 20:22:04,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:22:04,391 INFO L130 PetriNetUnfolder]: 615/992 cut-off events. [2023-08-29 20:22:04,391 INFO L131 PetriNetUnfolder]: For 873/873 co-relation queries the response was YES. [2023-08-29 20:22:04,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2896 conditions, 992 events. 615/992 cut-off events. For 873/873 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4501 event pairs, 164 based on Foata normal form. 11/986 useless extension candidates. Maximal degree in co-relation 2889. Up to 400 conditions per place. [2023-08-29 20:22:04,398 INFO L137 encePairwiseOnDemand]: 270/276 looper letters, 52 selfloop transitions, 17 changer transitions 0/74 dead transitions. [2023-08-29 20:22:04,398 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 74 transitions, 412 flow [2023-08-29 20:22:04,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:22:04,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:22:04,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 808 transitions. [2023-08-29 20:22:04,402 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48792270531400966 [2023-08-29 20:22:04,402 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 808 transitions. [2023-08-29 20:22:04,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 808 transitions. [2023-08-29 20:22:04,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:22:04,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 808 transitions. [2023-08-29 20:22:04,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 134.66666666666666) internal successors, (808), 6 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:22:04,408 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:22:04,408 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:22:04,408 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 196 flow. Second operand 6 states and 808 transitions. [2023-08-29 20:22:04,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 74 transitions, 412 flow [2023-08-29 20:22:04,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 74 transitions, 378 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-08-29 20:22:04,419 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 206 flow [2023-08-29 20:22:04,419 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=206, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2023-08-29 20:22:04,420 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -2 predicate places. [2023-08-29 20:22:04,420 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 206 flow [2023-08-29 20:22:04,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.33333333333333) internal successors, (758), 6 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:22:04,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:22:04,421 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, 1] [2023-08-29 20:22:04,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-08-29 20:22:04,630 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:22:04,631 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:22:04,631 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:22:04,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1280005922, now seen corresponding path program 1 times [2023-08-29 20:22:04,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:22:04,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1846625483] [2023-08-29 20:22:04,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:22:04,632 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:22:04,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:22:04,634 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:22:04,635 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:22:04,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:22:04,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:22:04,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:22:04,847 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:22:04,848 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:22:04,848 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:22:04,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1846625483] [2023-08-29 20:22:04,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1846625483] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:22:04,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:22:04,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:22:04,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661980310] [2023-08-29 20:22:04,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:22:04,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:22:04,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:22:04,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:22:04,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:22:04,856 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 276 [2023-08-29 20:22:04,857 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 206 flow. Second operand has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:22:04,857 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:22:04,857 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 276 [2023-08-29 20:22:04,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:22:05,109 INFO L130 PetriNetUnfolder]: 1121/1826 cut-off events. [2023-08-29 20:22:05,110 INFO L131 PetriNetUnfolder]: For 1953/1953 co-relation queries the response was YES. [2023-08-29 20:22:05,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5406 conditions, 1826 events. 1121/1826 cut-off events. For 1953/1953 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9677 event pairs, 545 based on Foata normal form. 0/1784 useless extension candidates. Maximal degree in co-relation 5398. Up to 1068 conditions per place. [2023-08-29 20:22:05,122 INFO L137 encePairwiseOnDemand]: 272/276 looper letters, 66 selfloop transitions, 3 changer transitions 0/73 dead transitions. [2023-08-29 20:22:05,122 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 73 transitions, 526 flow [2023-08-29 20:22:05,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:22:05,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:22:05,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 542 transitions. [2023-08-29 20:22:05,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49094202898550726 [2023-08-29 20:22:05,125 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 542 transitions. [2023-08-29 20:22:05,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 542 transitions. [2023-08-29 20:22:05,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:22:05,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 542 transitions. [2023-08-29 20:22:05,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.5) internal successors, (542), 4 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:22:05,129 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 276.0) internal successors, (1380), 5 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:22:05,129 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 276.0) internal successors, (1380), 5 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:22:05,130 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 206 flow. Second operand 4 states and 542 transitions. [2023-08-29 20:22:05,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 73 transitions, 526 flow [2023-08-29 20:22:05,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 73 transitions, 428 flow, removed 24 selfloop flow, removed 4 redundant places. [2023-08-29 20:22:05,147 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 176 flow [2023-08-29 20:22:05,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2023-08-29 20:22:05,148 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -1 predicate places. [2023-08-29 20:22:05,148 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 176 flow [2023-08-29 20:22:05,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:22:05,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:22:05,149 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, 1] [2023-08-29 20:22:05,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-08-29 20:22:05,359 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:22:05,359 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:22:05,360 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:22:05,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1101918662, now seen corresponding path program 1 times [2023-08-29 20:22:05,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:22:05,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [264672629] [2023-08-29 20:22:05,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:22:05,361 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:22:05,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:22:05,362 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:22:05,365 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:22:05,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:22:05,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-29 20:22:05,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:22:06,243 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:22:06,244 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:22:06,244 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:22:06,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [264672629] [2023-08-29 20:22:06,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [264672629] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:22:06,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:22:06,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:22:06,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163298182] [2023-08-29 20:22:06,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:22:06,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:22:06,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:22:06,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:22:06,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:22:06,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 276 [2023-08-29 20:22:06,705 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 176 flow. Second operand has 6 states, 6 states have (on average 111.83333333333333) internal successors, (671), 6 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:22:06,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:22:06,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 276 [2023-08-29 20:22:06,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:22:07,189 INFO L130 PetriNetUnfolder]: 907/1485 cut-off events. [2023-08-29 20:22:07,189 INFO L131 PetriNetUnfolder]: For 1035/1035 co-relation queries the response was YES. [2023-08-29 20:22:07,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4223 conditions, 1485 events. 907/1485 cut-off events. For 1035/1035 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 7641 event pairs, 127 based on Foata normal form. 2/1469 useless extension candidates. Maximal degree in co-relation 4213. Up to 1137 conditions per place. [2023-08-29 20:22:07,195 INFO L137 encePairwiseOnDemand]: 271/276 looper letters, 54 selfloop transitions, 4 changer transitions 4/67 dead transitions. [2023-08-29 20:22:07,195 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 67 transitions, 414 flow [2023-08-29 20:22:07,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:22:07,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:22:07,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 687 transitions. [2023-08-29 20:22:07,198 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4148550724637681 [2023-08-29 20:22:07,198 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 687 transitions. [2023-08-29 20:22:07,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 687 transitions. [2023-08-29 20:22:07,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:22:07,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 687 transitions. [2023-08-29 20:22:07,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:22:07,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:22:07,203 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 276.0) internal successors, (1932), 7 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:22:07,203 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 176 flow. Second operand 6 states and 687 transitions. [2023-08-29 20:22:07,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 67 transitions, 414 flow [2023-08-29 20:22:07,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 67 transitions, 410 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:22:07,211 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 170 flow [2023-08-29 20:22:07,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=170, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2023-08-29 20:22:07,212 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2023-08-29 20:22:07,212 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 170 flow [2023-08-29 20:22:07,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.83333333333333) internal successors, (671), 6 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:22:07,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:22:07,213 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, 1] [2023-08-29 20:22:07,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-08-29 20:22:07,423 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:22:07,424 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:22:07,424 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:22:07,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1539732038, now seen corresponding path program 2 times [2023-08-29 20:22:07,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:22:07,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [85437527] [2023-08-29 20:22:07,425 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 20:22:07,425 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:22:07,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:22:07,426 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:22:07,427 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:22:07,548 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 20:22:07,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:22:07,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:22:07,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:22:07,872 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:22:07,873 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:22:07,873 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:22:07,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [85437527] [2023-08-29 20:22:07,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [85437527] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:22:07,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:22:07,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:22:07,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13420750] [2023-08-29 20:22:07,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:22:07,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:22:07,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:22:07,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:22:07,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:22:07,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 276 [2023-08-29 20:22:07,885 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 170 flow. Second operand has 5 states, 5 states have (on average 127.8) internal successors, (639), 5 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:22:07,885 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:22:07,885 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 276 [2023-08-29 20:22:07,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:22:08,113 INFO L130 PetriNetUnfolder]: 648/1081 cut-off events. [2023-08-29 20:22:08,113 INFO L131 PetriNetUnfolder]: For 878/878 co-relation queries the response was YES. [2023-08-29 20:22:08,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3190 conditions, 1081 events. 648/1081 cut-off events. For 878/878 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4992 event pairs, 140 based on Foata normal form. 1/1081 useless extension candidates. Maximal degree in co-relation 3180. Up to 686 conditions per place. [2023-08-29 20:22:08,118 INFO L137 encePairwiseOnDemand]: 272/276 looper letters, 42 selfloop transitions, 1 changer transitions 32/79 dead transitions. [2023-08-29 20:22:08,118 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 79 transitions, 494 flow [2023-08-29 20:22:08,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:22:08,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:22:08,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 665 transitions. [2023-08-29 20:22:08,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48188405797101447 [2023-08-29 20:22:08,121 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 665 transitions. [2023-08-29 20:22:08,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 665 transitions. [2023-08-29 20:22:08,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:22:08,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 665 transitions. [2023-08-29 20:22:08,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:22:08,125 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 276.0) internal successors, (1656), 6 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:22:08,125 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 276.0) internal successors, (1656), 6 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:22:08,126 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 170 flow. Second operand 5 states and 665 transitions. [2023-08-29 20:22:08,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 79 transitions, 494 flow [2023-08-29 20:22:08,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 79 transitions, 473 flow, removed 3 selfloop flow, removed 6 redundant places. [2023-08-29 20:22:08,134 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 166 flow [2023-08-29 20:22:08,134 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=166, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2023-08-29 20:22:08,134 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2023-08-29 20:22:08,135 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 166 flow [2023-08-29 20:22:08,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.8) internal successors, (639), 5 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:22:08,135 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:22:08,135 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, 1] [2023-08-29 20:22:08,149 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:22:08,345 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:22:08,345 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:22:08,346 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:22:08,346 INFO L85 PathProgramCache]: Analyzing trace with hash -755145052, now seen corresponding path program 3 times [2023-08-29 20:22:08,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:22:08,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2080022036] [2023-08-29 20:22:08,346 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 20:22:08,346 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:22:08,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:22:08,348 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:22:08,354 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:22:08,464 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-29 20:22:08,465 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:22:08,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:22:08,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:22:08,526 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:22:08,527 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:22:08,527 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:22:08,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2080022036] [2023-08-29 20:22:08,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2080022036] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:22:08,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:22:08,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:22:08,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480654987] [2023-08-29 20:22:08,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:22:08,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:22:08,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:22:08,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:22:08,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:22:08,545 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 276 [2023-08-29 20:22:08,546 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 127.8) internal successors, (639), 5 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:22:08,546 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:22:08,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 276 [2023-08-29 20:22:08,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:22:08,755 INFO L130 PetriNetUnfolder]: 726/1242 cut-off events. [2023-08-29 20:22:08,755 INFO L131 PetriNetUnfolder]: For 1162/1162 co-relation queries the response was YES. [2023-08-29 20:22:08,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3583 conditions, 1242 events. 726/1242 cut-off events. For 1162/1162 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6233 event pairs, 308 based on Foata normal form. 1/1238 useless extension candidates. Maximal degree in co-relation 3572. Up to 464 conditions per place. [2023-08-29 20:22:08,758 INFO L137 encePairwiseOnDemand]: 272/276 looper letters, 37 selfloop transitions, 1 changer transitions 37/79 dead transitions. [2023-08-29 20:22:08,759 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 79 transitions, 504 flow [2023-08-29 20:22:08,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:22:08,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:22:08,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 661 transitions. [2023-08-29 20:22:08,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4789855072463768 [2023-08-29 20:22:08,761 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 661 transitions. [2023-08-29 20:22:08,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 661 transitions. [2023-08-29 20:22:08,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:22:08,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 661 transitions. [2023-08-29 20:22:08,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.2) internal successors, (661), 5 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:22:08,765 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 276.0) internal successors, (1656), 6 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:22:08,765 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 276.0) internal successors, (1656), 6 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:22:08,766 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 166 flow. Second operand 5 states and 661 transitions. [2023-08-29 20:22:08,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 79 transitions, 504 flow [2023-08-29 20:22:08,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 79 transitions, 495 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-29 20:22:08,774 INFO L231 Difference]: Finished difference. Result has 57 places, 40 transitions, 170 flow [2023-08-29 20:22:08,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=170, PETRI_PLACES=57, PETRI_TRANSITIONS=40} [2023-08-29 20:22:08,775 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 4 predicate places. [2023-08-29 20:22:08,775 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 40 transitions, 170 flow [2023-08-29 20:22:08,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.8) internal successors, (639), 5 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:22:08,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:22:08,776 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, 1] [2023-08-29 20:22:08,789 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:22:08,986 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:22:08,986 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:22:08,987 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:22:08,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1341402992, now seen corresponding path program 4 times [2023-08-29 20:22:08,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:22:08,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [431273592] [2023-08-29 20:22:08,987 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-29 20:22:08,987 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:22:08,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:22:08,988 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:22:08,989 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:22:09,098 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-29 20:22:09,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:22:09,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-29 20:22:09,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:22:09,405 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:22:09,406 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:22:09,406 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:22:09,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [431273592] [2023-08-29 20:22:09,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [431273592] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:22:09,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:22:09,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:22:09,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665378759] [2023-08-29 20:22:09,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:22:09,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 20:22:09,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:22:09,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 20:22:09,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-29 20:22:09,450 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 276 [2023-08-29 20:22:09,451 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 40 transitions, 170 flow. Second operand has 8 states, 8 states have (on average 127.0) internal successors, (1016), 8 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:22:09,451 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:22:09,451 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 276 [2023-08-29 20:22:09,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:22:09,635 INFO L130 PetriNetUnfolder]: 731/1243 cut-off events. [2023-08-29 20:22:09,635 INFO L131 PetriNetUnfolder]: For 1236/1243 co-relation queries the response was YES. [2023-08-29 20:22:09,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3767 conditions, 1243 events. 731/1243 cut-off events. For 1236/1243 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5885 event pairs, 275 based on Foata normal form. 3/1232 useless extension candidates. Maximal degree in co-relation 3755. Up to 655 conditions per place. [2023-08-29 20:22:09,639 INFO L137 encePairwiseOnDemand]: 271/276 looper letters, 44 selfloop transitions, 3 changer transitions 17/68 dead transitions. [2023-08-29 20:22:09,639 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 68 transitions, 428 flow [2023-08-29 20:22:09,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:22:09,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:22:09,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 661 transitions. [2023-08-29 20:22:09,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4789855072463768 [2023-08-29 20:22:09,642 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 661 transitions. [2023-08-29 20:22:09,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 661 transitions. [2023-08-29 20:22:09,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:22:09,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 661 transitions. [2023-08-29 20:22:09,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.2) internal successors, (661), 5 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:22:09,646 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 276.0) internal successors, (1656), 6 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:22:09,647 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 276.0) internal successors, (1656), 6 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:22:09,647 INFO L175 Difference]: Start difference. First operand has 57 places, 40 transitions, 170 flow. Second operand 5 states and 661 transitions. [2023-08-29 20:22:09,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 68 transitions, 428 flow [2023-08-29 20:22:09,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 68 transitions, 420 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-29 20:22:09,655 INFO L231 Difference]: Finished difference. Result has 58 places, 40 transitions, 177 flow [2023-08-29 20:22:09,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=177, PETRI_PLACES=58, PETRI_TRANSITIONS=40} [2023-08-29 20:22:09,656 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 5 predicate places. [2023-08-29 20:22:09,656 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 40 transitions, 177 flow [2023-08-29 20:22:09,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 127.0) internal successors, (1016), 8 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:22:09,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:22:09,657 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, 1] [2023-08-29 20:22:09,669 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:22:09,867 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:22:09,868 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:22:09,868 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:22:09,868 INFO L85 PathProgramCache]: Analyzing trace with hash 31968300, now seen corresponding path program 5 times [2023-08-29 20:22:09,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:22:09,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1933468212] [2023-08-29 20:22:09,869 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-29 20:22:09,869 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:22:09,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:22:09,870 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:22:09,871 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:22:10,014 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 20:22:10,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-29 20:22:10,015 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:22:10,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:22:10,197 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-29 20:22:10,198 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:22:10,198 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-29 20:22:10,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-29 20:22:10,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-29 20:22:10,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-29 20:22:10,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-29 20:22:10,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-29 20:22:10,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-29 20:22:10,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-29 20:22:10,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-29 20:22:10,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-29 20:22:10,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-29 20:22:10,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-29 20:22:10,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-29 20:22:10,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-29 20:22:10,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-29 20:22:10,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-29 20:22:10,216 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 (13)] Forceful destruction successful, exit code 0 [2023-08-29 20:22:10,413 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:22:10,413 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:22:10,417 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:22:10,417 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:22:10,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:22:10 BasicIcfg [2023-08-29 20:22:10,509 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:22:10,510 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:22:10,510 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:22:10,510 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:22:10,511 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:21:51" (3/4) ... [2023-08-29 20:22:10,513 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:22:10,513 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:22:10,514 INFO L158 Benchmark]: Toolchain (without parser) took 20948.06ms. Allocated memory was 60.8MB in the beginning and 935.3MB in the end (delta: 874.5MB). Free memory was 35.3MB in the beginning and 576.3MB in the end (delta: -540.9MB). Peak memory consumption was 336.6MB. Max. memory is 16.1GB. [2023-08-29 20:22:10,514 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 50.3MB. Free memory was 27.5MB in the beginning and 27.5MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:22:10,514 INFO L158 Benchmark]: CACSL2BoogieTranslator took 517.28ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 35.1MB in the beginning and 48.8MB in the end (delta: -13.8MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. [2023-08-29 20:22:10,515 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.50ms. Allocated memory is still 73.4MB. Free memory was 48.8MB in the beginning and 46.0MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:22:10,515 INFO L158 Benchmark]: Boogie Preprocessor took 62.43ms. Allocated memory is still 73.4MB. Free memory was 46.0MB in the beginning and 43.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:22:10,515 INFO L158 Benchmark]: RCFGBuilder took 806.12ms. Allocated memory is still 73.4MB. Free memory was 43.6MB in the beginning and 44.8MB in the end (delta: -1.2MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2023-08-29 20:22:10,517 INFO L158 Benchmark]: TraceAbstraction took 19459.80ms. Allocated memory was 73.4MB in the beginning and 935.3MB in the end (delta: 861.9MB). Free memory was 43.9MB in the beginning and 576.3MB in the end (delta: -532.3MB). Peak memory consumption was 329.2MB. Max. memory is 16.1GB. [2023-08-29 20:22:10,518 INFO L158 Benchmark]: Witness Printer took 3.25ms. Allocated memory is still 935.3MB. Free memory is still 576.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:22:10,522 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 50.3MB. Free memory was 27.5MB in the beginning and 27.5MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 517.28ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 35.1MB in the beginning and 48.8MB in the end (delta: -13.8MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.50ms. Allocated memory is still 73.4MB. Free memory was 48.8MB in the beginning and 46.0MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.43ms. Allocated memory is still 73.4MB. Free memory was 46.0MB in the beginning and 43.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 806.12ms. Allocated memory is still 73.4MB. Free memory was 43.6MB in the beginning and 44.8MB in the end (delta: -1.2MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. * TraceAbstraction took 19459.80ms. Allocated memory was 73.4MB in the beginning and 935.3MB in the end (delta: 861.9MB). Free memory was 43.9MB in the beginning and 576.3MB in the end (delta: -532.3MB). Peak memory consumption was 329.2MB. Max. memory is 16.1GB. * Witness Printer took 3.25ms. Allocated memory is still 935.3MB. Free memory is still 576.3MB. 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.4s, 149 PlacesBefore, 53 PlacesAfterwards, 138 TransitionsBefore, 41 TransitionsAfterwards, 3320 CoEnabledTransitionPairs, 6 FixpointIterations, 54 TrivialSequentialCompositions, 72 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 134 TotalNumberOfCompositions, 8867 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4527, independent: 4321, independent conditional: 0, independent unconditional: 4321, dependent: 206, dependent conditional: 0, dependent unconditional: 206, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1755, independent: 1723, independent conditional: 0, independent unconditional: 1723, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4527, independent: 2598, independent conditional: 0, independent unconditional: 2598, dependent: 174, dependent conditional: 0, dependent unconditional: 174, unknown: 1755, unknown conditional: 0, unknown unconditional: 1755] , Statistics on independence cache: Total cache size (in pairs): 223, Positive cache size: 207, Positive conditional cache size: 0, Positive unconditional cache size: 207, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff0_thd4; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$r_buff1_thd4; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L846] 0 pthread_t t577; [L847] FCALL, FORK 0 pthread_create(&t577, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t577, ((void *)0), P0, ((void *)0))=-1, t577={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L848] 0 pthread_t t578; [L849] FCALL, FORK 0 pthread_create(&t578, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t578, ((void *)0), P1, ((void *)0))=0, t577={11:0}, t578={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L850] 0 pthread_t t579; [L851] FCALL, FORK 0 pthread_create(&t579, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t579, ((void *)0), P2, ((void *)0))=1, t577={11:0}, t578={15:0}, t579={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L852] 0 pthread_t t580; [L785] 3 y$w_buff1 = y$w_buff0 [L786] 3 y$w_buff0 = 2 [L787] 3 y$w_buff1_used = y$w_buff0_used [L788] 3 y$w_buff0_used = (_Bool)1 [L789] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L789] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L790] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L791] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L792] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L793] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L794] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L795] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L853] FCALL, FORK 0 pthread_create(&t580, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t580, ((void *)0), P3, ((void *)0))=2, t577={11:0}, t578={15:0}, t579={7:0}, t580={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L798] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L815] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L818] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L821] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L765] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L768] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 2 return 0; [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L824] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L825] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L826] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L827] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L828] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t577={11:0}, t578={15:0}, t579={7:0}, t580={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 y$flush_delayed = weak$$choice2 [L869] 0 y$mem_tmp = y [L870] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L871] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L872] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L873] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L874] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L876] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] 0 y = y$flush_delayed ? y$mem_tmp : y [L879] 0 y$flush_delayed = (_Bool)0 [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 844]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 851]: 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: 853]: 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: 849]: 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: 847]: 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, 178 locations, 16 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: 19.2s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 423 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 321 mSDsluCounter, 132 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 108 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1619 IncrementalHoareTripleChecker+Invalid, 1698 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 24 mSDtfsCounter, 1619 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 212 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=206occurred in iteration=6, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 245 NumberOfCodeBlocks, 245 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 206 ConstructedInterpolants, 22 QuantifiedInterpolants, 1986 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1740 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-29 20:22:10,542 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