./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix038_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/mix038_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 b1e6ad0aca14cacb1f3fe02bd616009a97ed12a62626693737be4e470d14e12e --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:26:03,056 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:26:03,058 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:26:03,101 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:26:03,103 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:26:03,106 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:26:03,107 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:26:03,110 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:26:03,112 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:26:03,116 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:26:03,117 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:26:03,119 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:26:03,120 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:26:03,121 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:26:03,122 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:26:03,127 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:26:03,129 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:26:03,130 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:26:03,131 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:26:03,136 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:26:03,137 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:26:03,138 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:26:03,138 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:26:03,139 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:26:03,145 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:26:03,146 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:26:03,146 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:26:03,148 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:26:03,148 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:26:03,149 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:26:03,150 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:26:03,155 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:26:03,157 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:26:03,158 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:26:03,158 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:26:03,159 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:26:03,159 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:26:03,159 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:26:03,160 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:26:03,160 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:26:03,161 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:26:03,162 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:26:03,200 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:26:03,201 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:26:03,202 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:26:03,202 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:26:03,203 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:26:03,203 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:26:03,204 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:26:03,204 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:26:03,204 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:26:03,205 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:26:03,205 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:26:03,206 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:26:03,206 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:26:03,206 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:26:03,206 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:26:03,206 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:26:03,207 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:26:03,207 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:26:03,207 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:26:03,207 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:26:03,208 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:26:03,208 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:26:03,208 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:26:03,208 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:26:03,208 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:26:03,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:26:03,209 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:26:03,209 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:26:03,209 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 20:26:03,210 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 20:26:03,210 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:26:03,210 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:26:03,211 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:26:03,211 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:26:03,211 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 -> b1e6ad0aca14cacb1f3fe02bd616009a97ed12a62626693737be4e470d14e12e 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:26:03,519 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:26:03,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:26:03,539 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:26:03,540 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:26:03,540 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:26:03,542 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i [2023-08-29 20:26:04,617 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:26:04,915 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:26:04,916 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i [2023-08-29 20:26:04,935 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5234533f/a34c51bddf4e4e29a89790e6843d4e9a/FLAG6d7629cab [2023-08-29 20:26:04,955 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5234533f/a34c51bddf4e4e29a89790e6843d4e9a [2023-08-29 20:26:04,959 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:26:04,960 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:26:04,962 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:26:04,962 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:26:04,965 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:26:04,965 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:26:04" (1/1) ... [2023-08-29 20:26:04,966 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ad2d12c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:26:04, skipping insertion in model container [2023-08-29 20:26:04,966 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:26:04" (1/1) ... [2023-08-29 20:26:04,972 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:26:05,012 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:26:05,148 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/mix038_tso.oepc.i[949,962] [2023-08-29 20:26:05,349 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:26:05,358 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:26:05,373 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/mix038_tso.oepc.i[949,962] [2023-08-29 20:26:05,440 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:26:05,494 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:26:05,494 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:26:05,500 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:26:05,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:26:05 WrapperNode [2023-08-29 20:26:05,500 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:26:05,501 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:26:05,501 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:26:05,501 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:26:05,523 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:26:05" (1/1) ... [2023-08-29 20:26:05,563 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:26:05" (1/1) ... [2023-08-29 20:26:05,597 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 147 [2023-08-29 20:26:05,598 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:26:05,598 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:26:05,599 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:26:05,599 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:26:05,607 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:26:05" (1/1) ... [2023-08-29 20:26:05,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:26:05" (1/1) ... [2023-08-29 20:26:05,623 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:26:05" (1/1) ... [2023-08-29 20:26:05,624 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:26:05" (1/1) ... [2023-08-29 20:26:05,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:26:05" (1/1) ... [2023-08-29 20:26:05,643 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:26:05" (1/1) ... [2023-08-29 20:26:05,645 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:26:05" (1/1) ... [2023-08-29 20:26:05,646 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:26:05" (1/1) ... [2023-08-29 20:26:05,653 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:26:05,657 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:26:05,657 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:26:05,657 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:26:05,658 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:26:05" (1/1) ... [2023-08-29 20:26:05,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:26:05,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:26:05,690 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:26:05,713 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:26:05,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 20:26:05,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:26:05,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:26:05,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:26:05,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:26:05,729 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:26:05,729 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:26:05,729 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:26:05,729 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:26:05,729 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:26:05,730 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:26:05,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 20:26:05,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:26:05,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:26:05,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:26:05,731 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:26:05,922 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:26:05,923 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:26:06,201 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:26:06,346 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:26:06,349 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:26:06,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:26:06 BoogieIcfgContainer [2023-08-29 20:26:06,352 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:26:06,354 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:26:06,354 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:26:06,357 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:26:06,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:26:04" (1/3) ... [2023-08-29 20:26:06,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cf588d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:26:06, skipping insertion in model container [2023-08-29 20:26:06,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:26:05" (2/3) ... [2023-08-29 20:26:06,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cf588d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:26:06, skipping insertion in model container [2023-08-29 20:26:06,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:26:06" (3/3) ... [2023-08-29 20:26:06,361 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038_tso.oepc.i [2023-08-29 20:26:06,376 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:26:06,377 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-29 20:26:06,377 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:26:06,431 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:26:06,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 122 transitions, 259 flow [2023-08-29 20:26:06,545 INFO L130 PetriNetUnfolder]: 2/119 cut-off events. [2023-08-29 20:26:06,546 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:26:06,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 119 events. 2/119 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 85 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2023-08-29 20:26:06,551 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 122 transitions, 259 flow [2023-08-29 20:26:06,555 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 119 transitions, 247 flow [2023-08-29 20:26:06,559 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:26:06,568 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 119 transitions, 247 flow [2023-08-29 20:26:06,571 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 119 transitions, 247 flow [2023-08-29 20:26:06,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 119 transitions, 247 flow [2023-08-29 20:26:06,607 INFO L130 PetriNetUnfolder]: 2/119 cut-off events. [2023-08-29 20:26:06,609 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:26:06,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 119 events. 2/119 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 85 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2023-08-29 20:26:06,612 INFO L119 LiptonReduction]: Number of co-enabled transitions 2314 [2023-08-29 20:26:12,052 INFO L134 LiptonReduction]: Checked pairs total: 6156 [2023-08-29 20:26:12,052 INFO L136 LiptonReduction]: Total number of compositions: 124 [2023-08-29 20:26:12,064 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:26:12,070 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;@a183b46, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:26:12,070 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-29 20:26:12,072 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-29 20:26:12,073 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:26:12,073 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:12,074 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:26:12,074 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:26:12,078 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:12,079 INFO L85 PathProgramCache]: Analyzing trace with hash 536, now seen corresponding path program 1 times [2023-08-29 20:26:12,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:26:12,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430811277] [2023-08-29 20:26:12,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:12,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:26:12,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:12,178 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:26:12,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:26:12,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430811277] [2023-08-29 20:26:12,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430811277] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:12,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:12,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:26:12,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146869349] [2023-08-29 20:26:12,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:12,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:26:12,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:26:12,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:26:12,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:26:12,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 246 [2023-08-29 20:26:12,216 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 71 flow. Second operand has 2 states, 2 states have (on average 109.5) internal successors, (219), 2 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:12,216 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:12,216 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 246 [2023-08-29 20:26:12,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:12,560 INFO L130 PetriNetUnfolder]: 1093/1691 cut-off events. [2023-08-29 20:26:12,560 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2023-08-29 20:26:12,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3368 conditions, 1691 events. 1093/1691 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 8292 event pairs, 1093 based on Foata normal form. 0/1347 useless extension candidates. Maximal degree in co-relation 3357. Up to 1623 conditions per place. [2023-08-29 20:26:12,577 INFO L137 encePairwiseOnDemand]: 240/246 looper letters, 21 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2023-08-29 20:26:12,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 101 flow [2023-08-29 20:26:12,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:26:12,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:26:12,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 245 transitions. [2023-08-29 20:26:12,594 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49796747967479676 [2023-08-29 20:26:12,595 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 245 transitions. [2023-08-29 20:26:12,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 245 transitions. [2023-08-29 20:26:12,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:12,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 245 transitions. [2023-08-29 20:26:12,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 122.5) internal successors, (245), 2 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:12,609 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:12,610 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:12,612 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 71 flow. Second operand 2 states and 245 transitions. [2023-08-29 20:26:12,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 101 flow [2023-08-29 20:26:12,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 98 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:26:12,618 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 56 flow [2023-08-29 20:26:12,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2023-08-29 20:26:12,624 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -8 predicate places. [2023-08-29 20:26:12,624 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 56 flow [2023-08-29 20:26:12,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 109.5) internal successors, (219), 2 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:12,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:12,626 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 20:26:12,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 20:26:12,627 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:26:12,638 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:12,638 INFO L85 PathProgramCache]: Analyzing trace with hash 505873126, now seen corresponding path program 1 times [2023-08-29 20:26:12,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:26:12,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831806599] [2023-08-29 20:26:12,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:12,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:26:12,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:12,946 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:26:12,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:26:12,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831806599] [2023-08-29 20:26:12,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831806599] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:12,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:12,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:26:12,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666747351] [2023-08-29 20:26:12,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:12,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:26:12,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:26:12,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:26:12,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:26:12,951 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 246 [2023-08-29 20:26:12,952 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:12,952 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:12,953 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 246 [2023-08-29 20:26:12,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:13,215 INFO L130 PetriNetUnfolder]: 855/1354 cut-off events. [2023-08-29 20:26:13,215 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:26:13,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2679 conditions, 1354 events. 855/1354 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 6635 event pairs, 237 based on Foata normal form. 0/1205 useless extension candidates. Maximal degree in co-relation 2676. Up to 1027 conditions per place. [2023-08-29 20:26:13,221 INFO L137 encePairwiseOnDemand]: 243/246 looper letters, 29 selfloop transitions, 2 changer transitions 2/37 dead transitions. [2023-08-29 20:26:13,221 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 37 transitions, 148 flow [2023-08-29 20:26:13,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:26:13,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:26:13,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2023-08-29 20:26:13,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48509485094850946 [2023-08-29 20:26:13,226 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 358 transitions. [2023-08-29 20:26:13,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 358 transitions. [2023-08-29 20:26:13,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:13,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 358 transitions. [2023-08-29 20:26:13,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:13,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:13,232 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:13,232 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 56 flow. Second operand 3 states and 358 transitions. [2023-08-29 20:26:13,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 37 transitions, 148 flow [2023-08-29 20:26:13,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 37 transitions, 148 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:26:13,234 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 56 flow [2023-08-29 20:26:13,234 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2023-08-29 20:26:13,234 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2023-08-29 20:26:13,235 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 56 flow [2023-08-29 20:26:13,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:13,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:13,235 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:26:13,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 20:26:13,235 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:26:13,237 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:13,238 INFO L85 PathProgramCache]: Analyzing trace with hash -556240679, now seen corresponding path program 1 times [2023-08-29 20:26:13,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:26:13,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989573535] [2023-08-29 20:26:13,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:13,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:26:13,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:14,060 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:26:14,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:26:14,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989573535] [2023-08-29 20:26:14,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989573535] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:14,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:14,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:26:14,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840938006] [2023-08-29 20:26:14,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:14,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:26:14,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:26:14,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:26:14,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:26:14,112 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 246 [2023-08-29 20:26:14,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 101.25) internal successors, (405), 4 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:14,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:14,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 246 [2023-08-29 20:26:14,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:14,474 INFO L130 PetriNetUnfolder]: 1381/2072 cut-off events. [2023-08-29 20:26:14,474 INFO L131 PetriNetUnfolder]: For 133/133 co-relation queries the response was YES. [2023-08-29 20:26:14,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4333 conditions, 2072 events. 1381/2072 cut-off events. For 133/133 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 9227 event pairs, 417 based on Foata normal form. 0/1991 useless extension candidates. Maximal degree in co-relation 4329. Up to 1349 conditions per place. [2023-08-29 20:26:14,484 INFO L137 encePairwiseOnDemand]: 236/246 looper letters, 33 selfloop transitions, 9 changer transitions 0/43 dead transitions. [2023-08-29 20:26:14,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 43 transitions, 184 flow [2023-08-29 20:26:14,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:26:14,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:26:14,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 439 transitions. [2023-08-29 20:26:14,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44613821138211385 [2023-08-29 20:26:14,487 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 439 transitions. [2023-08-29 20:26:14,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 439 transitions. [2023-08-29 20:26:14,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:14,487 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 439 transitions. [2023-08-29 20:26:14,488 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:14,491 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:14,492 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:14,492 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 56 flow. Second operand 4 states and 439 transitions. [2023-08-29 20:26:14,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 43 transitions, 184 flow [2023-08-29 20:26:14,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 43 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:26:14,494 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 118 flow [2023-08-29 20:26:14,494 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2023-08-29 20:26:14,496 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -4 predicate places. [2023-08-29 20:26:14,498 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 118 flow [2023-08-29 20:26:14,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.25) internal successors, (405), 4 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:14,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:14,499 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:26:14,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 20:26:14,500 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:26:14,501 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:14,501 INFO L85 PathProgramCache]: Analyzing trace with hash -556240661, now seen corresponding path program 1 times [2023-08-29 20:26:14,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:26:14,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752414286] [2023-08-29 20:26:14,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:14,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:26:14,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:14,846 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:26:14,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:26:14,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752414286] [2023-08-29 20:26:14,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752414286] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:14,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:14,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:26:14,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259959595] [2023-08-29 20:26:14,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:14,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:26:14,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:26:14,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:26:14,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:26:14,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 246 [2023-08-29 20:26:14,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 96.8) internal successors, (484), 5 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:14,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:14,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 246 [2023-08-29 20:26:14,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:15,291 INFO L130 PetriNetUnfolder]: 1092/1715 cut-off events. [2023-08-29 20:26:15,291 INFO L131 PetriNetUnfolder]: For 679/749 co-relation queries the response was YES. [2023-08-29 20:26:15,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4502 conditions, 1715 events. 1092/1715 cut-off events. For 679/749 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 8375 event pairs, 150 based on Foata normal form. 36/1708 useless extension candidates. Maximal degree in co-relation 4496. Up to 1167 conditions per place. [2023-08-29 20:26:15,301 INFO L137 encePairwiseOnDemand]: 241/246 looper letters, 37 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2023-08-29 20:26:15,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 46 transitions, 244 flow [2023-08-29 20:26:15,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:26:15,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:26:15,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 513 transitions. [2023-08-29 20:26:15,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4170731707317073 [2023-08-29 20:26:15,304 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 513 transitions. [2023-08-29 20:26:15,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 513 transitions. [2023-08-29 20:26:15,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:15,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 513 transitions. [2023-08-29 20:26:15,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.6) internal successors, (513), 5 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:15,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:15,309 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:15,309 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 118 flow. Second operand 5 states and 513 transitions. [2023-08-29 20:26:15,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 46 transitions, 244 flow [2023-08-29 20:26:15,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 46 transitions, 233 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:26:15,313 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 111 flow [2023-08-29 20:26:15,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=111, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2023-08-29 20:26:15,314 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -2 predicate places. [2023-08-29 20:26:15,314 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 111 flow [2023-08-29 20:26:15,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.8) internal successors, (484), 5 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:15,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:15,315 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:26:15,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 20:26:15,316 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:26:15,316 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:15,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1972797444, now seen corresponding path program 1 times [2023-08-29 20:26:15,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:26:15,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469845882] [2023-08-29 20:26:15,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:15,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:26:15,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:16,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:26:16,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:26:16,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469845882] [2023-08-29 20:26:16,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469845882] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:16,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:16,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:26:16,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449811462] [2023-08-29 20:26:16,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:16,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:26:16,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:26:16,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:26:16,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:26:16,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 246 [2023-08-29 20:26:16,058 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 111 flow. Second operand has 5 states, 5 states have (on average 100.2) internal successors, (501), 5 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:16,058 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:16,058 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 246 [2023-08-29 20:26:16,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:16,482 INFO L130 PetriNetUnfolder]: 1653/2470 cut-off events. [2023-08-29 20:26:16,482 INFO L131 PetriNetUnfolder]: For 664/664 co-relation queries the response was YES. [2023-08-29 20:26:16,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6558 conditions, 2470 events. 1653/2470 cut-off events. For 664/664 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 11537 event pairs, 235 based on Foata normal form. 12/2482 useless extension candidates. Maximal degree in co-relation 6551. Up to 2123 conditions per place. [2023-08-29 20:26:16,496 INFO L137 encePairwiseOnDemand]: 234/246 looper letters, 48 selfloop transitions, 17 changer transitions 0/65 dead transitions. [2023-08-29 20:26:16,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 65 transitions, 366 flow [2023-08-29 20:26:16,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:26:16,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:26:16,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 452 transitions. [2023-08-29 20:26:16,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45934959349593496 [2023-08-29 20:26:16,498 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 452 transitions. [2023-08-29 20:26:16,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 452 transitions. [2023-08-29 20:26:16,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:16,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 452 transitions. [2023-08-29 20:26:16,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:16,502 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:16,502 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:16,503 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 111 flow. Second operand 4 states and 452 transitions. [2023-08-29 20:26:16,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 65 transitions, 366 flow [2023-08-29 20:26:16,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 65 transitions, 346 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 20:26:16,508 INFO L231 Difference]: Finished difference. Result has 41 places, 41 transitions, 243 flow [2023-08-29 20:26:16,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=243, PETRI_PLACES=41, PETRI_TRANSITIONS=41} [2023-08-29 20:26:16,509 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places. [2023-08-29 20:26:16,510 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 41 transitions, 243 flow [2023-08-29 20:26:16,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.2) internal successors, (501), 5 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:16,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:16,510 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:26:16,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 20:26:16,511 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:26:16,511 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:16,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1972797426, now seen corresponding path program 1 times [2023-08-29 20:26:16,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:26:16,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388550649] [2023-08-29 20:26:16,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:16,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:26:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:16,842 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:26:16,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:26:16,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388550649] [2023-08-29 20:26:16,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388550649] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:16,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:16,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:26:16,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088450028] [2023-08-29 20:26:16,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:16,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:26:16,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:26:16,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:26:16,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:26:16,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 246 [2023-08-29 20:26:16,921 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 41 transitions, 243 flow. Second operand has 5 states, 5 states have (on average 96.0) internal successors, (480), 5 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:16,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:16,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 246 [2023-08-29 20:26:16,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:17,173 INFO L130 PetriNetUnfolder]: 938/1512 cut-off events. [2023-08-29 20:26:17,173 INFO L131 PetriNetUnfolder]: For 2067/2117 co-relation queries the response was YES. [2023-08-29 20:26:17,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4662 conditions, 1512 events. 938/1512 cut-off events. For 2067/2117 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7199 event pairs, 301 based on Foata normal form. 107/1583 useless extension candidates. Maximal degree in co-relation 4653. Up to 1236 conditions per place. [2023-08-29 20:26:17,183 INFO L137 encePairwiseOnDemand]: 242/246 looper letters, 32 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2023-08-29 20:26:17,184 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 42 transitions, 278 flow [2023-08-29 20:26:17,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:26:17,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:26:17,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 498 transitions. [2023-08-29 20:26:17,186 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40487804878048783 [2023-08-29 20:26:17,187 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 498 transitions. [2023-08-29 20:26:17,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 498 transitions. [2023-08-29 20:26:17,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:17,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 498 transitions. [2023-08-29 20:26:17,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 99.6) internal successors, (498), 5 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:17,191 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:17,191 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:17,191 INFO L175 Difference]: Start difference. First operand has 41 places, 41 transitions, 243 flow. Second operand 5 states and 498 transitions. [2023-08-29 20:26:17,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 42 transitions, 278 flow [2023-08-29 20:26:17,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 249 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-08-29 20:26:17,196 INFO L231 Difference]: Finished difference. Result has 41 places, 30 transitions, 137 flow [2023-08-29 20:26:17,197 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=137, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2023-08-29 20:26:17,199 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places. [2023-08-29 20:26:17,199 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 137 flow [2023-08-29 20:26:17,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.0) internal successors, (480), 5 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:17,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:17,200 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:26:17,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 20:26:17,200 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:26:17,200 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:17,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1295579775, now seen corresponding path program 1 times [2023-08-29 20:26:17,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:26:17,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095475759] [2023-08-29 20:26:17,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:17,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:26:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:17,939 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:26:17,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:26:17,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095475759] [2023-08-29 20:26:17,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095475759] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:17,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:17,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:26:17,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982318616] [2023-08-29 20:26:17,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:17,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:26:17,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:26:17,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:26:17,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:26:17,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 246 [2023-08-29 20:26:17,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 137 flow. Second operand has 6 states, 6 states have (on average 101.0) internal successors, (606), 6 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:17,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:17,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 246 [2023-08-29 20:26:17,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:18,318 INFO L130 PetriNetUnfolder]: 1342/1985 cut-off events. [2023-08-29 20:26:18,319 INFO L131 PetriNetUnfolder]: For 1567/1567 co-relation queries the response was YES. [2023-08-29 20:26:18,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6116 conditions, 1985 events. 1342/1985 cut-off events. For 1567/1567 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 8360 event pairs, 310 based on Foata normal form. 16/2001 useless extension candidates. Maximal degree in co-relation 6107. Up to 1609 conditions per place. [2023-08-29 20:26:18,332 INFO L137 encePairwiseOnDemand]: 235/246 looper letters, 62 selfloop transitions, 19 changer transitions 0/81 dead transitions. [2023-08-29 20:26:18,333 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 81 transitions, 519 flow [2023-08-29 20:26:18,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:26:18,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:26:18,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 667 transitions. [2023-08-29 20:26:18,336 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4518970189701897 [2023-08-29 20:26:18,336 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 667 transitions. [2023-08-29 20:26:18,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 667 transitions. [2023-08-29 20:26:18,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:18,337 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 667 transitions. [2023-08-29 20:26:18,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 111.16666666666667) internal successors, (667), 6 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:18,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 246.0) internal successors, (1722), 7 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:18,341 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 246.0) internal successors, (1722), 7 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:18,341 INFO L175 Difference]: Start difference. First operand has 41 places, 30 transitions, 137 flow. Second operand 6 states and 667 transitions. [2023-08-29 20:26:18,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 81 transitions, 519 flow [2023-08-29 20:26:18,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 81 transitions, 506 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:26:18,345 INFO L231 Difference]: Finished difference. Result has 47 places, 47 transitions, 317 flow [2023-08-29 20:26:18,346 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=317, PETRI_PLACES=47, PETRI_TRANSITIONS=47} [2023-08-29 20:26:18,346 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 6 predicate places. [2023-08-29 20:26:18,347 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 47 transitions, 317 flow [2023-08-29 20:26:18,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.0) internal successors, (606), 6 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:18,347 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:18,347 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:26:18,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 20:26:18,348 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:26:18,348 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:18,348 INFO L85 PathProgramCache]: Analyzing trace with hash 591262714, now seen corresponding path program 1 times [2023-08-29 20:26:18,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:26:18,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638308193] [2023-08-29 20:26:18,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:18,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:26:18,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:18,734 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:26:18,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:26:18,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638308193] [2023-08-29 20:26:18,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638308193] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:18,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:18,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:26:18,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225766531] [2023-08-29 20:26:18,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:18,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:26:18,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:26:18,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:26:18,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:26:18,756 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 246 [2023-08-29 20:26:18,757 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 47 transitions, 317 flow. Second operand has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:18,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:18,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 246 [2023-08-29 20:26:18,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:19,048 INFO L130 PetriNetUnfolder]: 1186/1821 cut-off events. [2023-08-29 20:26:19,048 INFO L131 PetriNetUnfolder]: For 4074/4187 co-relation queries the response was YES. [2023-08-29 20:26:19,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6937 conditions, 1821 events. 1186/1821 cut-off events. For 4074/4187 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8271 event pairs, 270 based on Foata normal form. 22/1781 useless extension candidates. Maximal degree in co-relation 6924. Up to 1297 conditions per place. [2023-08-29 20:26:19,066 INFO L137 encePairwiseOnDemand]: 240/246 looper letters, 48 selfloop transitions, 16 changer transitions 0/72 dead transitions. [2023-08-29 20:26:19,067 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 72 transitions, 569 flow [2023-08-29 20:26:19,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:26:19,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:26:19,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 472 transitions. [2023-08-29 20:26:19,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4796747967479675 [2023-08-29 20:26:19,069 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 472 transitions. [2023-08-29 20:26:19,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 472 transitions. [2023-08-29 20:26:19,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:19,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 472 transitions. [2023-08-29 20:26:19,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:19,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:19,073 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:19,073 INFO L175 Difference]: Start difference. First operand has 47 places, 47 transitions, 317 flow. Second operand 4 states and 472 transitions. [2023-08-29 20:26:19,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 72 transitions, 569 flow [2023-08-29 20:26:19,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 72 transitions, 551 flow, removed 9 selfloop flow, removed 0 redundant places. [2023-08-29 20:26:19,080 INFO L231 Difference]: Finished difference. Result has 51 places, 52 transitions, 391 flow [2023-08-29 20:26:19,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=391, PETRI_PLACES=51, PETRI_TRANSITIONS=52} [2023-08-29 20:26:19,083 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 10 predicate places. [2023-08-29 20:26:19,083 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 52 transitions, 391 flow [2023-08-29 20:26:19,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:19,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:19,084 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:26:19,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 20:26:19,084 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:26:19,084 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:19,084 INFO L85 PathProgramCache]: Analyzing trace with hash -832828316, now seen corresponding path program 1 times [2023-08-29 20:26:19,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:26:19,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678183257] [2023-08-29 20:26:19,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:19,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:26:19,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:19,296 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:26:19,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:26:19,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678183257] [2023-08-29 20:26:19,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678183257] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:19,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:19,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:26:19,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064293966] [2023-08-29 20:26:19,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:19,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:26:19,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:26:19,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:26:19,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:26:19,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 246 [2023-08-29 20:26:19,305 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 52 transitions, 391 flow. Second operand has 4 states, 4 states have (on average 108.25) internal successors, (433), 4 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:19,306 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:19,306 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 246 [2023-08-29 20:26:19,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:19,691 INFO L130 PetriNetUnfolder]: 1553/2451 cut-off events. [2023-08-29 20:26:19,691 INFO L131 PetriNetUnfolder]: For 7768/7814 co-relation queries the response was YES. [2023-08-29 20:26:19,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9890 conditions, 2451 events. 1553/2451 cut-off events. For 7768/7814 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 12559 event pairs, 267 based on Foata normal form. 84/2504 useless extension candidates. Maximal degree in co-relation 9875. Up to 1140 conditions per place. [2023-08-29 20:26:19,713 INFO L137 encePairwiseOnDemand]: 243/246 looper letters, 69 selfloop transitions, 2 changer transitions 6/86 dead transitions. [2023-08-29 20:26:19,713 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 86 transitions, 771 flow [2023-08-29 20:26:19,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:26:19,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:26:19,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 458 transitions. [2023-08-29 20:26:19,716 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4654471544715447 [2023-08-29 20:26:19,716 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 458 transitions. [2023-08-29 20:26:19,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 458 transitions. [2023-08-29 20:26:19,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:19,717 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 458 transitions. [2023-08-29 20:26:19,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 114.5) internal successors, (458), 4 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:19,721 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:19,722 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:19,722 INFO L175 Difference]: Start difference. First operand has 51 places, 52 transitions, 391 flow. Second operand 4 states and 458 transitions. [2023-08-29 20:26:19,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 86 transitions, 771 flow [2023-08-29 20:26:19,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 86 transitions, 757 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:26:19,728 INFO L231 Difference]: Finished difference. Result has 55 places, 53 transitions, 401 flow [2023-08-29 20:26:19,729 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=401, PETRI_PLACES=55, PETRI_TRANSITIONS=53} [2023-08-29 20:26:19,730 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places. [2023-08-29 20:26:19,730 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 53 transitions, 401 flow [2023-08-29 20:26:19,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.25) internal successors, (433), 4 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:19,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:19,730 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:26:19,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 20:26:19,731 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:26:19,731 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:19,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1539283354, now seen corresponding path program 2 times [2023-08-29 20:26:19,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:26:19,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568818119] [2023-08-29 20:26:19,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:19,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:26:19,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:20,321 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:26:20,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:26:20,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568818119] [2023-08-29 20:26:20,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568818119] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:20,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:20,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:26:20,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844393756] [2023-08-29 20:26:20,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:20,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:26:20,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:26:20,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:26:20,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:26:20,350 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 246 [2023-08-29 20:26:20,351 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 53 transitions, 401 flow. Second operand has 6 states, 6 states have (on average 109.16666666666667) internal successors, (655), 6 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:20,351 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:20,351 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 246 [2023-08-29 20:26:20,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:20,729 INFO L130 PetriNetUnfolder]: 1573/2462 cut-off events. [2023-08-29 20:26:20,729 INFO L131 PetriNetUnfolder]: For 8163/8320 co-relation queries the response was YES. [2023-08-29 20:26:20,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9925 conditions, 2462 events. 1573/2462 cut-off events. For 8163/8320 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 12385 event pairs, 375 based on Foata normal form. 29/2389 useless extension candidates. Maximal degree in co-relation 9908. Up to 1903 conditions per place. [2023-08-29 20:26:20,745 INFO L137 encePairwiseOnDemand]: 242/246 looper letters, 51 selfloop transitions, 11 changer transitions 0/71 dead transitions. [2023-08-29 20:26:20,745 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 71 transitions, 601 flow [2023-08-29 20:26:20,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:26:20,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:26:20,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 469 transitions. [2023-08-29 20:26:20,747 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4766260162601626 [2023-08-29 20:26:20,747 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 469 transitions. [2023-08-29 20:26:20,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 469 transitions. [2023-08-29 20:26:20,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:20,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 469 transitions. [2023-08-29 20:26:20,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:20,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:20,752 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:20,752 INFO L175 Difference]: Start difference. First operand has 55 places, 53 transitions, 401 flow. Second operand 4 states and 469 transitions. [2023-08-29 20:26:20,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 71 transitions, 601 flow [2023-08-29 20:26:20,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 71 transitions, 598 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:26:20,760 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 432 flow [2023-08-29 20:26:20,761 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=432, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2023-08-29 20:26:20,762 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 17 predicate places. [2023-08-29 20:26:20,762 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 432 flow [2023-08-29 20:26:20,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.16666666666667) internal successors, (655), 6 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:20,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:20,763 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:26:20,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 20:26:20,763 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:26:20,764 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:20,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1710878759, now seen corresponding path program 1 times [2023-08-29 20:26:20,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:26:20,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671311946] [2023-08-29 20:26:20,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:20,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:26:20,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:21,432 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:26:21,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:26:21,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671311946] [2023-08-29 20:26:21,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671311946] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:21,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:21,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:26:21,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440250150] [2023-08-29 20:26:21,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:21,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:26:21,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:26:21,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:26:21,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:26:21,481 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 246 [2023-08-29 20:26:21,482 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 432 flow. Second operand has 7 states, 7 states have (on average 98.14285714285714) internal successors, (687), 7 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:26:21,482 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:21,482 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 246 [2023-08-29 20:26:21,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:22,298 INFO L130 PetriNetUnfolder]: 2684/4092 cut-off events. [2023-08-29 20:26:22,298 INFO L131 PetriNetUnfolder]: For 12299/12299 co-relation queries the response was YES. [2023-08-29 20:26:22,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16714 conditions, 4092 events. 2684/4092 cut-off events. For 12299/12299 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 21107 event pairs, 473 based on Foata normal form. 18/4110 useless extension candidates. Maximal degree in co-relation 16696. Up to 2456 conditions per place. [2023-08-29 20:26:22,320 INFO L137 encePairwiseOnDemand]: 237/246 looper letters, 83 selfloop transitions, 34 changer transitions 5/122 dead transitions. [2023-08-29 20:26:22,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 122 transitions, 1127 flow [2023-08-29 20:26:22,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:26:22,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:26:22,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 746 transitions. [2023-08-29 20:26:22,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4332171893147503 [2023-08-29 20:26:22,324 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 746 transitions. [2023-08-29 20:26:22,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 746 transitions. [2023-08-29 20:26:22,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:22,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 746 transitions. [2023-08-29 20:26:22,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 106.57142857142857) internal successors, (746), 7 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:26:22,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:22,330 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:22,330 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 432 flow. Second operand 7 states and 746 transitions. [2023-08-29 20:26:22,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 122 transitions, 1127 flow [2023-08-29 20:26:22,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 122 transitions, 1104 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-29 20:26:22,343 INFO L231 Difference]: Finished difference. Result has 66 places, 75 transitions, 749 flow [2023-08-29 20:26:22,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=749, PETRI_PLACES=66, PETRI_TRANSITIONS=75} [2023-08-29 20:26:22,344 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 25 predicate places. [2023-08-29 20:26:22,344 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 75 transitions, 749 flow [2023-08-29 20:26:22,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.14285714285714) internal successors, (687), 7 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:26:22,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:22,345 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:26:22,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 20:26:22,345 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:26:22,345 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:22,345 INFO L85 PathProgramCache]: Analyzing trace with hash 474674659, now seen corresponding path program 1 times [2023-08-29 20:26:22,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:26:22,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994860069] [2023-08-29 20:26:22,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:22,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:26:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:22,754 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:26:22,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:26:22,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994860069] [2023-08-29 20:26:22,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994860069] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:22,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:22,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:26:22,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229656750] [2023-08-29 20:26:22,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:22,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:26:22,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:26:22,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:26:22,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:26:22,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 246 [2023-08-29 20:26:22,771 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 75 transitions, 749 flow. Second operand has 6 states, 6 states have (on average 106.16666666666667) internal successors, (637), 6 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:22,771 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:22,772 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 246 [2023-08-29 20:26:22,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:23,308 INFO L130 PetriNetUnfolder]: 2107/3393 cut-off events. [2023-08-29 20:26:23,308 INFO L131 PetriNetUnfolder]: For 16898/17003 co-relation queries the response was YES. [2023-08-29 20:26:23,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15824 conditions, 3393 events. 2107/3393 cut-off events. For 16898/17003 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 18762 event pairs, 701 based on Foata normal form. 22/3311 useless extension candidates. Maximal degree in co-relation 15802. Up to 2651 conditions per place. [2023-08-29 20:26:23,334 INFO L137 encePairwiseOnDemand]: 239/246 looper letters, 64 selfloop transitions, 29 changer transitions 0/107 dead transitions. [2023-08-29 20:26:23,334 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 107 transitions, 1122 flow [2023-08-29 20:26:23,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:26:23,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:26:23,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 571 transitions. [2023-08-29 20:26:23,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46422764227642277 [2023-08-29 20:26:23,337 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 571 transitions. [2023-08-29 20:26:23,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 571 transitions. [2023-08-29 20:26:23,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:23,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 571 transitions. [2023-08-29 20:26:23,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:23,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:23,341 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:23,341 INFO L175 Difference]: Start difference. First operand has 66 places, 75 transitions, 749 flow. Second operand 5 states and 571 transitions. [2023-08-29 20:26:23,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 107 transitions, 1122 flow [2023-08-29 20:26:23,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 107 transitions, 1081 flow, removed 20 selfloop flow, removed 1 redundant places. [2023-08-29 20:26:23,362 INFO L231 Difference]: Finished difference. Result has 71 places, 82 transitions, 885 flow [2023-08-29 20:26:23,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=885, PETRI_PLACES=71, PETRI_TRANSITIONS=82} [2023-08-29 20:26:23,363 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 30 predicate places. [2023-08-29 20:26:23,363 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 82 transitions, 885 flow [2023-08-29 20:26:23,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.16666666666667) internal successors, (637), 6 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:23,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:23,364 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:26:23,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 20:26:23,364 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:26:23,365 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:23,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1828279169, now seen corresponding path program 2 times [2023-08-29 20:26:23,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:26:23,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778115874] [2023-08-29 20:26:23,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:23,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:26:23,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:24,286 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:26:24,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:26:24,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778115874] [2023-08-29 20:26:24,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778115874] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:24,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:24,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:26:24,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33818300] [2023-08-29 20:26:24,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:24,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:26:24,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:26:24,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:26:24,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:26:24,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 246 [2023-08-29 20:26:24,344 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 82 transitions, 885 flow. Second operand has 7 states, 7 states have (on average 98.14285714285714) internal successors, (687), 7 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:26:24,345 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:24,345 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 246 [2023-08-29 20:26:24,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:25,064 INFO L130 PetriNetUnfolder]: 2656/4078 cut-off events. [2023-08-29 20:26:25,064 INFO L131 PetriNetUnfolder]: For 20412/20412 co-relation queries the response was YES. [2023-08-29 20:26:25,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20056 conditions, 4078 events. 2656/4078 cut-off events. For 20412/20412 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 21037 event pairs, 825 based on Foata normal form. 14/4092 useless extension candidates. Maximal degree in co-relation 20032. Up to 3139 conditions per place. [2023-08-29 20:26:25,090 INFO L137 encePairwiseOnDemand]: 236/246 looper letters, 86 selfloop transitions, 35 changer transitions 17/138 dead transitions. [2023-08-29 20:26:25,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 138 transitions, 1548 flow [2023-08-29 20:26:25,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:26:25,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:26:25,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 748 transitions. [2023-08-29 20:26:25,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4343786295005807 [2023-08-29 20:26:25,094 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 748 transitions. [2023-08-29 20:26:25,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 748 transitions. [2023-08-29 20:26:25,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:25,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 748 transitions. [2023-08-29 20:26:25,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 106.85714285714286) internal successors, (748), 7 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:25,099 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:25,100 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:25,100 INFO L175 Difference]: Start difference. First operand has 71 places, 82 transitions, 885 flow. Second operand 7 states and 748 transitions. [2023-08-29 20:26:25,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 138 transitions, 1548 flow [2023-08-29 20:26:25,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 138 transitions, 1523 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-08-29 20:26:25,130 INFO L231 Difference]: Finished difference. Result has 79 places, 87 transitions, 1010 flow [2023-08-29 20:26:25,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=861, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1010, PETRI_PLACES=79, PETRI_TRANSITIONS=87} [2023-08-29 20:26:25,131 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 38 predicate places. [2023-08-29 20:26:25,131 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 87 transitions, 1010 flow [2023-08-29 20:26:25,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.14285714285714) internal successors, (687), 7 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:26:25,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:25,132 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:26:25,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 20:26:25,132 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:26:25,133 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:25,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1205158333, now seen corresponding path program 3 times [2023-08-29 20:26:25,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:26:25,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413460535] [2023-08-29 20:26:25,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:25,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:26:25,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:25,840 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:26:25,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:26:25,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413460535] [2023-08-29 20:26:25,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413460535] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:25,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:25,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:26:25,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938821300] [2023-08-29 20:26:25,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:25,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:26:25,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:26:25,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:26:25,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:26:25,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 246 [2023-08-29 20:26:25,900 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 87 transitions, 1010 flow. Second operand has 6 states, 6 states have (on average 99.5) internal successors, (597), 6 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:25,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:25,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 246 [2023-08-29 20:26:25,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:26,557 INFO L130 PetriNetUnfolder]: 2472/3862 cut-off events. [2023-08-29 20:26:26,557 INFO L131 PetriNetUnfolder]: For 24545/24545 co-relation queries the response was YES. [2023-08-29 20:26:26,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19500 conditions, 3862 events. 2472/3862 cut-off events. For 24545/24545 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 20536 event pairs, 662 based on Foata normal form. 88/3950 useless extension candidates. Maximal degree in co-relation 19473. Up to 1987 conditions per place. [2023-08-29 20:26:26,578 INFO L137 encePairwiseOnDemand]: 239/246 looper letters, 80 selfloop transitions, 33 changer transitions 3/116 dead transitions. [2023-08-29 20:26:26,579 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 116 transitions, 1469 flow [2023-08-29 20:26:26,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:26:26,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:26:26,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 535 transitions. [2023-08-29 20:26:26,581 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4349593495934959 [2023-08-29 20:26:26,581 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 535 transitions. [2023-08-29 20:26:26,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 535 transitions. [2023-08-29 20:26:26,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:26,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 535 transitions. [2023-08-29 20:26:26,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:26,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:26,585 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:26,586 INFO L175 Difference]: Start difference. First operand has 79 places, 87 transitions, 1010 flow. Second operand 5 states and 535 transitions. [2023-08-29 20:26:26,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 116 transitions, 1469 flow [2023-08-29 20:26:26,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 116 transitions, 1349 flow, removed 25 selfloop flow, removed 6 redundant places. [2023-08-29 20:26:26,626 INFO L231 Difference]: Finished difference. Result has 79 places, 95 transitions, 1113 flow [2023-08-29 20:26:26,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=887, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1113, PETRI_PLACES=79, PETRI_TRANSITIONS=95} [2023-08-29 20:26:26,627 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 38 predicate places. [2023-08-29 20:26:26,627 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 95 transitions, 1113 flow [2023-08-29 20:26:26,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.5) internal successors, (597), 6 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:26,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:26,627 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:26:26,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-29 20:26:26,628 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:26:26,628 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:26,628 INFO L85 PathProgramCache]: Analyzing trace with hash 11701410, now seen corresponding path program 2 times [2023-08-29 20:26:26,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:26:26,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424291260] [2023-08-29 20:26:26,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:26,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:26:26,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:26,808 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:26:26,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:26:26,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424291260] [2023-08-29 20:26:26,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424291260] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:26,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:26,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:26:26,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720011259] [2023-08-29 20:26:26,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:26,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:26:26,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:26:26,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:26:26,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:26:26,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 246 [2023-08-29 20:26:26,821 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 95 transitions, 1113 flow. Second operand has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:26,821 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:26,821 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 246 [2023-08-29 20:26:26,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:27,233 INFO L130 PetriNetUnfolder]: 1415/2475 cut-off events. [2023-08-29 20:26:27,233 INFO L131 PetriNetUnfolder]: For 20990/21324 co-relation queries the response was YES. [2023-08-29 20:26:27,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12790 conditions, 2475 events. 1415/2475 cut-off events. For 20990/21324 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 15302 event pairs, 300 based on Foata normal form. 487/2896 useless extension candidates. Maximal degree in co-relation 12763. Up to 1319 conditions per place. [2023-08-29 20:26:27,251 INFO L137 encePairwiseOnDemand]: 240/246 looper letters, 90 selfloop transitions, 7 changer transitions 25/142 dead transitions. [2023-08-29 20:26:27,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 142 transitions, 1827 flow [2023-08-29 20:26:27,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:26:27,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:26:27,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 557 transitions. [2023-08-29 20:26:27,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45284552845528453 [2023-08-29 20:26:27,254 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 557 transitions. [2023-08-29 20:26:27,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 557 transitions. [2023-08-29 20:26:27,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:27,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 557 transitions. [2023-08-29 20:26:27,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 111.4) internal successors, (557), 5 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:27,258 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:27,258 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:27,258 INFO L175 Difference]: Start difference. First operand has 79 places, 95 transitions, 1113 flow. Second operand 5 states and 557 transitions. [2023-08-29 20:26:27,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 142 transitions, 1827 flow [2023-08-29 20:26:27,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 142 transitions, 1724 flow, removed 14 selfloop flow, removed 6 redundant places. [2023-08-29 20:26:27,282 INFO L231 Difference]: Finished difference. Result has 80 places, 79 transitions, 856 flow [2023-08-29 20:26:27,282 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=856, PETRI_PLACES=80, PETRI_TRANSITIONS=79} [2023-08-29 20:26:27,282 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 39 predicate places. [2023-08-29 20:26:27,283 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 79 transitions, 856 flow [2023-08-29 20:26:27,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:27,283 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:27,283 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:26:27,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-29 20:26:27,284 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:26:27,284 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:27,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1630951301, now seen corresponding path program 1 times [2023-08-29 20:26:27,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:26:27,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880696629] [2023-08-29 20:26:27,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:27,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:26:27,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:27,465 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:26:27,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:26:27,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880696629] [2023-08-29 20:26:27,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880696629] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:27,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:27,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:26:27,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472682578] [2023-08-29 20:26:27,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:27,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:26:27,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:26:27,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:26:27,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:26:27,481 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 246 [2023-08-29 20:26:27,482 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 79 transitions, 856 flow. Second operand has 5 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:27,482 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:27,482 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 246 [2023-08-29 20:26:27,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:27,840 INFO L130 PetriNetUnfolder]: 998/1821 cut-off events. [2023-08-29 20:26:27,840 INFO L131 PetriNetUnfolder]: For 15293/15721 co-relation queries the response was YES. [2023-08-29 20:26:27,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9908 conditions, 1821 events. 998/1821 cut-off events. For 15293/15721 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 11083 event pairs, 125 based on Foata normal form. 342/2115 useless extension candidates. Maximal degree in co-relation 9882. Up to 728 conditions per place. [2023-08-29 20:26:27,852 INFO L137 encePairwiseOnDemand]: 240/246 looper letters, 92 selfloop transitions, 13 changer transitions 32/157 dead transitions. [2023-08-29 20:26:27,852 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 157 transitions, 1923 flow [2023-08-29 20:26:27,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:26:27,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:26:27,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 777 transitions. [2023-08-29 20:26:27,855 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45121951219512196 [2023-08-29 20:26:27,855 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 777 transitions. [2023-08-29 20:26:27,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 777 transitions. [2023-08-29 20:26:27,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:27,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 777 transitions. [2023-08-29 20:26:27,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 111.0) internal successors, (777), 7 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:27,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:27,860 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:27,861 INFO L175 Difference]: Start difference. First operand has 80 places, 79 transitions, 856 flow. Second operand 7 states and 777 transitions. [2023-08-29 20:26:27,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 157 transitions, 1923 flow [2023-08-29 20:26:27,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 157 transitions, 1820 flow, removed 14 selfloop flow, removed 5 redundant places. [2023-08-29 20:26:27,879 INFO L231 Difference]: Finished difference. Result has 84 places, 76 transitions, 789 flow [2023-08-29 20:26:27,880 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=789, PETRI_PLACES=84, PETRI_TRANSITIONS=76} [2023-08-29 20:26:27,880 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 43 predicate places. [2023-08-29 20:26:27,880 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 76 transitions, 789 flow [2023-08-29 20:26:27,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:27,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:27,881 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:26:27,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-29 20:26:27,881 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:26:27,881 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:27,882 INFO L85 PathProgramCache]: Analyzing trace with hash -2122496674, now seen corresponding path program 1 times [2023-08-29 20:26:27,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:26:27,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482014706] [2023-08-29 20:26:27,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:27,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:26:27,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:28,083 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:26:28,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:26:28,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482014706] [2023-08-29 20:26:28,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482014706] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:28,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:28,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:26:28,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812535170] [2023-08-29 20:26:28,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:28,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:26:28,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:26:28,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:26:28,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:26:28,097 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 246 [2023-08-29 20:26:28,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 76 transitions, 789 flow. Second operand has 6 states, 6 states have (on average 103.5) internal successors, (621), 6 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:28,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:28,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 246 [2023-08-29 20:26:28,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:28,420 INFO L130 PetriNetUnfolder]: 880/1609 cut-off events. [2023-08-29 20:26:28,420 INFO L131 PetriNetUnfolder]: For 12359/12636 co-relation queries the response was YES. [2023-08-29 20:26:28,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9242 conditions, 1609 events. 880/1609 cut-off events. For 12359/12636 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 9869 event pairs, 101 based on Foata normal form. 182/1742 useless extension candidates. Maximal degree in co-relation 9214. Up to 677 conditions per place. [2023-08-29 20:26:28,429 INFO L137 encePairwiseOnDemand]: 240/246 looper letters, 75 selfloop transitions, 17 changer transitions 47/149 dead transitions. [2023-08-29 20:26:28,429 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 149 transitions, 1778 flow [2023-08-29 20:26:28,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 20:26:28,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 20:26:28,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 979 transitions. [2023-08-29 20:26:28,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4421860885275519 [2023-08-29 20:26:28,440 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 979 transitions. [2023-08-29 20:26:28,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 979 transitions. [2023-08-29 20:26:28,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:28,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 979 transitions. [2023-08-29 20:26:28,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 108.77777777777777) internal successors, (979), 9 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:28,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 246.0) internal successors, (2460), 10 states have internal predecessors, (2460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:28,447 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 246.0) internal successors, (2460), 10 states have internal predecessors, (2460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:28,448 INFO L175 Difference]: Start difference. First operand has 84 places, 76 transitions, 789 flow. Second operand 9 states and 979 transitions. [2023-08-29 20:26:28,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 149 transitions, 1778 flow [2023-08-29 20:26:28,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 149 transitions, 1650 flow, removed 18 selfloop flow, removed 7 redundant places. [2023-08-29 20:26:28,481 INFO L231 Difference]: Finished difference. Result has 88 places, 58 transitions, 553 flow [2023-08-29 20:26:28,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=553, PETRI_PLACES=88, PETRI_TRANSITIONS=58} [2023-08-29 20:26:28,482 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 47 predicate places. [2023-08-29 20:26:28,482 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 58 transitions, 553 flow [2023-08-29 20:26:28,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.5) internal successors, (621), 6 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:28,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:28,482 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:26:28,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-29 20:26:28,483 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:26:28,483 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:28,483 INFO L85 PathProgramCache]: Analyzing trace with hash 635002036, now seen corresponding path program 1 times [2023-08-29 20:26:28,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:26:28,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847372437] [2023-08-29 20:26:28,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:28,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:26:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:29,027 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:26:29,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:26:29,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847372437] [2023-08-29 20:26:29,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847372437] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:29,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:29,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:26:29,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532561962] [2023-08-29 20:26:29,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:29,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:26:29,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:26:29,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:26:29,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:26:29,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 246 [2023-08-29 20:26:29,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 58 transitions, 553 flow. Second operand has 7 states, 7 states have (on average 99.0) internal successors, (693), 7 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:29,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:29,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 246 [2023-08-29 20:26:29,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:29,496 INFO L130 PetriNetUnfolder]: 909/1646 cut-off events. [2023-08-29 20:26:29,496 INFO L131 PetriNetUnfolder]: For 8763/8763 co-relation queries the response was YES. [2023-08-29 20:26:29,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9196 conditions, 1646 events. 909/1646 cut-off events. For 8763/8763 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 9084 event pairs, 93 based on Foata normal form. 1/1647 useless extension candidates. Maximal degree in co-relation 9167. Up to 902 conditions per place. [2023-08-29 20:26:29,505 INFO L137 encePairwiseOnDemand]: 238/246 looper letters, 37 selfloop transitions, 3 changer transitions 109/150 dead transitions. [2023-08-29 20:26:29,505 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 150 transitions, 1658 flow [2023-08-29 20:26:29,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:26:29,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:26:29,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 840 transitions. [2023-08-29 20:26:29,508 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4268292682926829 [2023-08-29 20:26:29,508 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 840 transitions. [2023-08-29 20:26:29,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 840 transitions. [2023-08-29 20:26:29,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:29,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 840 transitions. [2023-08-29 20:26:29,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 105.0) internal successors, (840), 8 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:29,513 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 246.0) internal successors, (2214), 9 states have internal predecessors, (2214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:29,514 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 246.0) internal successors, (2214), 9 states have internal predecessors, (2214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:29,514 INFO L175 Difference]: Start difference. First operand has 88 places, 58 transitions, 553 flow. Second operand 8 states and 840 transitions. [2023-08-29 20:26:29,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 150 transitions, 1658 flow [2023-08-29 20:26:29,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 150 transitions, 1449 flow, removed 43 selfloop flow, removed 12 redundant places. [2023-08-29 20:26:29,541 INFO L231 Difference]: Finished difference. Result has 84 places, 35 transitions, 288 flow [2023-08-29 20:26:29,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=288, PETRI_PLACES=84, PETRI_TRANSITIONS=35} [2023-08-29 20:26:29,541 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 43 predicate places. [2023-08-29 20:26:29,541 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 35 transitions, 288 flow [2023-08-29 20:26:29,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 99.0) internal successors, (693), 7 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:29,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:29,542 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:26:29,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-29 20:26:29,542 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:26:29,543 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:29,543 INFO L85 PathProgramCache]: Analyzing trace with hash 284395870, now seen corresponding path program 2 times [2023-08-29 20:26:29,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:26:29,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308873700] [2023-08-29 20:26:29,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:29,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:26:29,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:30,615 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:26:30,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:26:30,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308873700] [2023-08-29 20:26:30,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308873700] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:30,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:30,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 20:26:30,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012402096] [2023-08-29 20:26:30,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:30,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 20:26:30,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:26:30,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 20:26:30,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-29 20:26:30,696 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 246 [2023-08-29 20:26:30,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 35 transitions, 288 flow. Second operand has 9 states, 9 states have (on average 107.11111111111111) internal successors, (964), 9 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:30,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:30,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 246 [2023-08-29 20:26:30,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:30,965 INFO L130 PetriNetUnfolder]: 208/428 cut-off events. [2023-08-29 20:26:30,965 INFO L131 PetriNetUnfolder]: For 1509/1516 co-relation queries the response was YES. [2023-08-29 20:26:30,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2008 conditions, 428 events. 208/428 cut-off events. For 1509/1516 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1814 event pairs, 39 based on Foata normal form. 1/419 useless extension candidates. Maximal degree in co-relation 1980. Up to 155 conditions per place. [2023-08-29 20:26:30,968 INFO L137 encePairwiseOnDemand]: 240/246 looper letters, 43 selfloop transitions, 8 changer transitions 30/84 dead transitions. [2023-08-29 20:26:30,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 84 transitions, 753 flow [2023-08-29 20:26:30,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:26:30,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:26:30,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 793 transitions. [2023-08-29 20:26:30,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4605110336817654 [2023-08-29 20:26:30,972 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 793 transitions. [2023-08-29 20:26:30,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 793 transitions. [2023-08-29 20:26:30,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:30,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 793 transitions. [2023-08-29 20:26:30,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 113.28571428571429) internal successors, (793), 7 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:30,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:30,989 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 246.0) internal successors, (1968), 8 states have internal predecessors, (1968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:30,989 INFO L175 Difference]: Start difference. First operand has 84 places, 35 transitions, 288 flow. Second operand 7 states and 793 transitions. [2023-08-29 20:26:30,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 84 transitions, 753 flow [2023-08-29 20:26:30,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 84 transitions, 661 flow, removed 39 selfloop flow, removed 17 redundant places. [2023-08-29 20:26:30,997 INFO L231 Difference]: Finished difference. Result has 61 places, 37 transitions, 284 flow [2023-08-29 20:26:30,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=284, PETRI_PLACES=61, PETRI_TRANSITIONS=37} [2023-08-29 20:26:30,997 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 20 predicate places. [2023-08-29 20:26:30,998 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 37 transitions, 284 flow [2023-08-29 20:26:30,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 107.11111111111111) internal successors, (964), 9 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:30,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:30,998 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:26:30,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-29 20:26:30,999 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:26:30,999 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:30,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1836174236, now seen corresponding path program 3 times [2023-08-29 20:26:30,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:26:30,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189224073] [2023-08-29 20:26:31,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:31,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:26:31,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:26:31,053 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:26:31,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:26:31,124 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 20:26:31,124 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:26:31,125 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-29 20:26:31,129 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-29 20:26:31,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-29 20:26:31,132 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-29 20:26:31,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-29 20:26:31,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-29 20:26:31,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-29 20:26:31,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-29 20:26:31,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-29 20:26:31,133 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-29 20:26:31,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-29 20:26:31,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-29 20:26:31,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-29 20:26:31,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-29 20:26:31,134 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:26:31,140 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:26:31,140 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:26:31,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:26:31 BasicIcfg [2023-08-29 20:26:31,217 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:26:31,218 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:26:31,218 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:26:31,218 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:26:31,218 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:26:06" (3/4) ... [2023-08-29 20:26:31,222 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:26:31,222 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:26:31,223 INFO L158 Benchmark]: Toolchain (without parser) took 26262.87ms. Allocated memory was 92.3MB in the beginning and 736.1MB in the end (delta: 643.8MB). Free memory was 68.3MB in the beginning and 380.1MB in the end (delta: -311.8MB). Peak memory consumption was 333.2MB. Max. memory is 16.1GB. [2023-08-29 20:26:31,223 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 75.5MB. Free memory is still 53.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:26:31,223 INFO L158 Benchmark]: CACSL2BoogieTranslator took 538.63ms. Allocated memory is still 92.3MB. Free memory was 68.1MB in the beginning and 68.0MB in the end (delta: 106.3kB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. [2023-08-29 20:26:31,223 INFO L158 Benchmark]: Boogie Procedure Inliner took 96.67ms. Allocated memory is still 92.3MB. Free memory was 68.0MB in the beginning and 65.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:26:31,224 INFO L158 Benchmark]: Boogie Preprocessor took 57.45ms. Allocated memory is still 92.3MB. Free memory was 65.5MB in the beginning and 63.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:26:31,224 INFO L158 Benchmark]: RCFGBuilder took 695.59ms. Allocated memory is still 92.3MB. Free memory was 63.4MB in the beginning and 53.7MB in the end (delta: 9.6MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. [2023-08-29 20:26:31,224 INFO L158 Benchmark]: TraceAbstraction took 24863.41ms. Allocated memory was 92.3MB in the beginning and 736.1MB in the end (delta: 643.8MB). Free memory was 52.9MB in the beginning and 380.1MB in the end (delta: -327.3MB). Peak memory consumption was 316.2MB. Max. memory is 16.1GB. [2023-08-29 20:26:31,224 INFO L158 Benchmark]: Witness Printer took 4.70ms. Allocated memory is still 736.1MB. Free memory is still 380.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:26:31,225 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.21ms. Allocated memory is still 75.5MB. Free memory is still 53.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 538.63ms. Allocated memory is still 92.3MB. Free memory was 68.1MB in the beginning and 68.0MB in the end (delta: 106.3kB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 96.67ms. Allocated memory is still 92.3MB. Free memory was 68.0MB in the beginning and 65.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.45ms. Allocated memory is still 92.3MB. Free memory was 65.5MB in the beginning and 63.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 695.59ms. Allocated memory is still 92.3MB. Free memory was 63.4MB in the beginning and 53.7MB in the end (delta: 9.6MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. * TraceAbstraction took 24863.41ms. Allocated memory was 92.3MB in the beginning and 736.1MB in the end (delta: 643.8MB). Free memory was 52.9MB in the beginning and 380.1MB in the end (delta: -327.3MB). Peak memory consumption was 316.2MB. Max. memory is 16.1GB. * Witness Printer took 4.70ms. Allocated memory is still 736.1MB. Free memory is still 380.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.5s, 127 PlacesBefore, 41 PlacesAfterwards, 119 TransitionsBefore, 31 TransitionsAfterwards, 2314 CoEnabledTransitionPairs, 6 FixpointIterations, 53 TrivialSequentialCompositions, 62 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 124 TotalNumberOfCompositions, 6156 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3018, independent: 2841, independent conditional: 0, independent unconditional: 2841, dependent: 177, dependent conditional: 0, dependent unconditional: 177, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1309, independent: 1267, independent conditional: 0, independent unconditional: 1267, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3018, independent: 1574, independent conditional: 0, independent unconditional: 1574, dependent: 135, dependent conditional: 0, dependent unconditional: 135, unknown: 1309, unknown conditional: 0, unknown unconditional: 1309] , Statistics on independence cache: Total cache size (in pairs): 115, Positive cache size: 102, Positive conditional cache size: 0, Positive unconditional cache size: 102, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L722] 0 _Bool x$flush_delayed; [L723] 0 int x$mem_tmp; [L724] 0 _Bool x$r_buff0_thd0; [L725] 0 _Bool x$r_buff0_thd1; [L726] 0 _Bool x$r_buff0_thd2; [L727] 0 _Bool x$r_buff0_thd3; [L728] 0 _Bool x$r_buff1_thd0; [L729] 0 _Bool x$r_buff1_thd1; [L730] 0 _Bool x$r_buff1_thd2; [L731] 0 _Bool x$r_buff1_thd3; [L732] 0 _Bool x$read_delayed; [L733] 0 int *x$read_delayed_var; [L734] 0 int x$w_buff0; [L735] 0 _Bool x$w_buff0_used; [L736] 0 int x$w_buff1; [L737] 0 _Bool x$w_buff1_used; [L739] 0 int y = 0; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L830] 0 pthread_t t1019; [L831] FCALL, FORK 0 pthread_create(&t1019, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1019, ((void *)0), P0, ((void *)0))=-1, t1019={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L832] 0 pthread_t t1020; [L833] FCALL, FORK 0 pthread_create(&t1020, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1020, ((void *)0), P1, ((void *)0))=0, t1019={5:0}, t1020={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L834] 0 pthread_t t1021; [L835] FCALL, FORK 0 pthread_create(&t1021, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1021, ((void *)0), P2, ((void *)0))=1, t1019={5:0}, t1020={6:0}, t1021={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L767] 2 x$w_buff1 = x$w_buff0 [L768] 2 x$w_buff0 = 2 [L769] 2 x$w_buff1_used = x$w_buff0_used [L770] 2 x$w_buff0_used = (_Bool)1 [L771] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L771] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L772] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L773] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L774] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L775] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L776] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L779] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L796] 3 y = 1 [L799] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L802] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L805] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L747] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L750] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L782] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L783] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L784] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L785] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L786] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 2 return 0; [L753] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L754] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L755] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L756] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L757] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L808] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L837] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L839] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L839] RET 0 assume_abort_if_not(main$tmp_guard0) [L841] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L842] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L843] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L844] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L845] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1019={5:0}, t1020={6:0}, t1021={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L848] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L849] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L850] 0 x$flush_delayed = weak$$choice2 [L851] 0 x$mem_tmp = x [L852] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L853] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L854] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L855] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L856] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L857] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L858] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L859] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L860] 0 x = x$flush_delayed ? x$mem_tmp : x [L861] 0 x$flush_delayed = (_Bool)0 [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 831]: 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: 835]: 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: 833]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 151 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 24.7s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1127 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 824 mSDsluCounter, 579 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 423 mSDsCounter, 275 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2544 IncrementalHoareTripleChecker+Invalid, 2819 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 275 mSolverCounterUnsat, 156 mSDtfsCounter, 2544 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1113occurred in iteration=14, InterpolantAutomatonStates: 101, 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, 8.6s InterpolantComputationTime, 272 NumberOfCodeBlocks, 272 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 231 ConstructedInterpolants, 0 QuantifiedInterpolants, 3356 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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:26:31,245 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/mix038_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 b1e6ad0aca14cacb1f3fe02bd616009a97ed12a62626693737be4e470d14e12e --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:26:33,067 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:26:33,069 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:26:33,116 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:26:33,118 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:26:33,121 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:26:33,123 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:26:33,125 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:26:33,127 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:26:33,131 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:26:33,132 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:26:33,135 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:26:33,135 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:26:33,137 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:26:33,138 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:26:33,142 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:26:33,143 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:26:33,143 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:26:33,144 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:26:33,146 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:26:33,154 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:26:33,155 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:26:33,156 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:26:33,156 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:26:33,159 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:26:33,160 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:26:33,160 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:26:33,161 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:26:33,161 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:26:33,162 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:26:33,162 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:26:33,163 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:26:33,163 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:26:33,164 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:26:33,165 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:26:33,165 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:26:33,166 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:26:33,166 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:26:33,166 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:26:33,167 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:26:33,168 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:26:33,171 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:26:33,196 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:26:33,197 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:26:33,198 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:26:33,198 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:26:33,199 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:26:33,199 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:26:33,200 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:26:33,200 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:26:33,200 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:26:33,201 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:26:33,201 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:26:33,201 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:26:33,202 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:26:33,202 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:26:33,202 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:26:33,202 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:26:33,202 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:26:33,203 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:26:33,203 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:26:33,203 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:26:33,203 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-29 20:26:33,203 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-29 20:26:33,203 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:26:33,204 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:26:33,204 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:26:33,204 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:26:33,204 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:26:33,204 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:26:33,205 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:26:33,205 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:26:33,205 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-29 20:26:33,205 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-29 20:26:33,206 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:26:33,206 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:26:33,206 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:26:33,206 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-29 20:26:33,206 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:26:33,207 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 -> b1e6ad0aca14cacb1f3fe02bd616009a97ed12a62626693737be4e470d14e12e 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:26:33,512 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:26:33,533 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:26:33,536 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:26:33,537 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:26:33,538 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:26:33,539 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i [2023-08-29 20:26:34,772 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:26:35,030 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:26:35,030 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i [2023-08-29 20:26:35,045 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01ea32d3d/b96291b5306d4615b0f0af33b7af4214/FLAG822799422 [2023-08-29 20:26:35,058 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01ea32d3d/b96291b5306d4615b0f0af33b7af4214 [2023-08-29 20:26:35,061 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:26:35,062 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:26:35,065 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:26:35,066 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:26:35,069 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:26:35,070 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:26:35" (1/1) ... [2023-08-29 20:26:35,073 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6995791 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:26:35, skipping insertion in model container [2023-08-29 20:26:35,074 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:26:35" (1/1) ... [2023-08-29 20:26:35,095 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:26:35,143 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:26:35,273 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/mix038_tso.oepc.i[949,962] [2023-08-29 20:26:35,478 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:26:35,502 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:26:35,514 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/mix038_tso.oepc.i[949,962] [2023-08-29 20:26:35,576 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:26:35,611 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:26:35,611 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:26:35,626 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:26:35,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:26:35 WrapperNode [2023-08-29 20:26:35,627 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:26:35,628 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:26:35,628 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:26:35,628 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:26:35,635 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:26:35" (1/1) ... [2023-08-29 20:26:35,670 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:26:35" (1/1) ... [2023-08-29 20:26:35,701 INFO L138 Inliner]: procedures = 179, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 148 [2023-08-29 20:26:35,702 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:26:35,703 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:26:35,703 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:26:35,703 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:26:35,710 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:26:35" (1/1) ... [2023-08-29 20:26:35,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:26:35" (1/1) ... [2023-08-29 20:26:35,714 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:26:35" (1/1) ... [2023-08-29 20:26:35,714 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:26:35" (1/1) ... [2023-08-29 20:26:35,730 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:26:35" (1/1) ... [2023-08-29 20:26:35,737 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:26:35" (1/1) ... [2023-08-29 20:26:35,739 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:26:35" (1/1) ... [2023-08-29 20:26:35,741 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:26:35" (1/1) ... [2023-08-29 20:26:35,745 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:26:35,746 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:26:35,746 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:26:35,746 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:26:35,747 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:26:35" (1/1) ... [2023-08-29 20:26:35,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:26:35,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:26:35,769 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:26:35,792 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:26:35,807 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:26:35,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:26:35,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:26:35,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:26:35,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-29 20:26:35,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-29 20:26:35,808 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:26:35,808 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:26:35,808 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:26:35,808 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:26:35,808 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:26:35,808 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:26:35,808 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:26:35,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:26:35,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:26:35,809 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:26:35,926 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:26:35,928 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:26:36,388 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:26:36,554 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:26:36,554 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:26:36,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:26:36 BoogieIcfgContainer [2023-08-29 20:26:36,556 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:26:36,560 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:26:36,560 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:26:36,563 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:26:36,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:26:35" (1/3) ... [2023-08-29 20:26:36,564 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4147b666 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:26:36, skipping insertion in model container [2023-08-29 20:26:36,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:26:35" (2/3) ... [2023-08-29 20:26:36,564 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4147b666 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:26:36, skipping insertion in model container [2023-08-29 20:26:36,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:26:36" (3/3) ... [2023-08-29 20:26:36,566 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038_tso.oepc.i [2023-08-29 20:26:36,580 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:26:36,581 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-29 20:26:36,582 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:26:36,648 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:26:36,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 123 transitions, 261 flow [2023-08-29 20:26:36,753 INFO L130 PetriNetUnfolder]: 2/120 cut-off events. [2023-08-29 20:26:36,754 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:26:36,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 120 events. 2/120 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 86 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2023-08-29 20:26:36,761 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 123 transitions, 261 flow [2023-08-29 20:26:36,767 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 120 transitions, 249 flow [2023-08-29 20:26:36,771 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:26:36,789 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 120 transitions, 249 flow [2023-08-29 20:26:36,792 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 120 transitions, 249 flow [2023-08-29 20:26:36,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 120 transitions, 249 flow [2023-08-29 20:26:36,819 INFO L130 PetriNetUnfolder]: 2/120 cut-off events. [2023-08-29 20:26:36,823 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:26:36,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 120 events. 2/120 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 86 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2023-08-29 20:26:36,828 INFO L119 LiptonReduction]: Number of co-enabled transitions 2314 [2023-08-29 20:26:43,618 INFO L134 LiptonReduction]: Checked pairs total: 6618 [2023-08-29 20:26:43,619 INFO L136 LiptonReduction]: Total number of compositions: 121 [2023-08-29 20:26:43,640 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:26:43,650 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;@e120dde, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:26:43,651 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-29 20:26:43,652 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:26:43,652 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:26:43,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:43,653 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:26:43,654 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:26:43,658 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:43,658 INFO L85 PathProgramCache]: Analyzing trace with hash 538, now seen corresponding path program 1 times [2023-08-29 20:26:43,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:26:43,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [779600081] [2023-08-29 20:26:43,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:43,672 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:26:43,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:26:43,675 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:26:43,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-29 20:26:43,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:43,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-29 20:26:43,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:26:43,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:26:43,762 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:26:43,763 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:26:43,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [779600081] [2023-08-29 20:26:43,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [779600081] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:43,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:43,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:26:43,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566109599] [2023-08-29 20:26:43,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:43,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:26:43,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:26:43,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:26:43,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:26:43,809 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 244 [2023-08-29 20:26:43,811 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 71 flow. Second operand has 2 states, 2 states have (on average 110.5) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:43,812 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:43,812 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 244 [2023-08-29 20:26:43,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:44,246 INFO L130 PetriNetUnfolder]: 1093/1691 cut-off events. [2023-08-29 20:26:44,246 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2023-08-29 20:26:44,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3368 conditions, 1691 events. 1093/1691 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 8298 event pairs, 1093 based on Foata normal form. 0/1347 useless extension candidates. Maximal degree in co-relation 3357. Up to 1623 conditions per place. [2023-08-29 20:26:44,258 INFO L137 encePairwiseOnDemand]: 238/244 looper letters, 21 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2023-08-29 20:26:44,259 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 101 flow [2023-08-29 20:26:44,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:26:44,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:26:44,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 247 transitions. [2023-08-29 20:26:44,271 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5061475409836066 [2023-08-29 20:26:44,271 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 247 transitions. [2023-08-29 20:26:44,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 247 transitions. [2023-08-29 20:26:44,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:44,275 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 247 transitions. [2023-08-29 20:26:44,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 123.5) internal successors, (247), 2 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:44,283 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 244.0) internal successors, (732), 3 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:44,284 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 244.0) internal successors, (732), 3 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:44,286 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 71 flow. Second operand 2 states and 247 transitions. [2023-08-29 20:26:44,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 101 flow [2023-08-29 20:26:44,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 98 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:26:44,291 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 56 flow [2023-08-29 20:26:44,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2023-08-29 20:26:44,296 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -8 predicate places. [2023-08-29 20:26:44,296 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 56 flow [2023-08-29 20:26:44,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 110.5) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:44,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:44,297 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 20:26:44,311 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:26:44,506 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:26:44,506 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:26:44,507 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:44,507 INFO L85 PathProgramCache]: Analyzing trace with hash 506920546, now seen corresponding path program 1 times [2023-08-29 20:26:44,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:26:44,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2050563673] [2023-08-29 20:26:44,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:44,508 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:26:44,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:26:44,509 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:26:44,512 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:26:44,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:44,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:26:44,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:26:44,623 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:26:44,624 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:26:44,624 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:26:44,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2050563673] [2023-08-29 20:26:44,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2050563673] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:44,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:44,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:26:44,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334342270] [2023-08-29 20:26:44,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:44,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:26:44,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:26:44,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:26:44,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:26:44,635 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 244 [2023-08-29 20:26:44,636 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:44,636 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:44,636 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 244 [2023-08-29 20:26:44,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:44,930 INFO L130 PetriNetUnfolder]: 855/1354 cut-off events. [2023-08-29 20:26:44,930 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:26:44,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2679 conditions, 1354 events. 855/1354 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 6611 event pairs, 237 based on Foata normal form. 0/1205 useless extension candidates. Maximal degree in co-relation 2676. Up to 1027 conditions per place. [2023-08-29 20:26:44,936 INFO L137 encePairwiseOnDemand]: 241/244 looper letters, 29 selfloop transitions, 2 changer transitions 2/37 dead transitions. [2023-08-29 20:26:44,936 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 37 transitions, 148 flow [2023-08-29 20:26:44,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:26:44,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:26:44,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2023-08-29 20:26:44,941 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4931693989071038 [2023-08-29 20:26:44,941 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 361 transitions. [2023-08-29 20:26:44,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 361 transitions. [2023-08-29 20:26:44,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:44,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 361 transitions. [2023-08-29 20:26:44,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:44,947 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:44,948 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 244.0) internal successors, (976), 4 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:44,949 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 56 flow. Second operand 3 states and 361 transitions. [2023-08-29 20:26:44,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 37 transitions, 148 flow [2023-08-29 20:26:44,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 37 transitions, 148 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:26:44,950 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 56 flow [2023-08-29 20:26:44,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2023-08-29 20:26:44,951 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2023-08-29 20:26:44,951 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 56 flow [2023-08-29 20:26:44,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:44,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:44,952 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:26:44,971 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:26:45,161 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:26:45,161 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:26:45,162 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:45,162 INFO L85 PathProgramCache]: Analyzing trace with hash 401680183, now seen corresponding path program 1 times [2023-08-29 20:26:45,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:26:45,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1079384545] [2023-08-29 20:26:45,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:45,163 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:26:45,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:26:45,164 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:26:45,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-29 20:26:45,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:45,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:26:45,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:26:45,282 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:26:45,282 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:26:45,282 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:26:45,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1079384545] [2023-08-29 20:26:45,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1079384545] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:45,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:45,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:26:45,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597289718] [2023-08-29 20:26:45,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:45,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:26:45,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:26:45,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:26:45,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:26:45,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 244 [2023-08-29 20:26:45,301 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:45,301 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:45,301 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 244 [2023-08-29 20:26:45,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:45,515 INFO L130 PetriNetUnfolder]: 494/834 cut-off events. [2023-08-29 20:26:45,516 INFO L131 PetriNetUnfolder]: For 65/65 co-relation queries the response was YES. [2023-08-29 20:26:45,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1760 conditions, 834 events. 494/834 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3969 event pairs, 102 based on Foata normal form. 64/848 useless extension candidates. Maximal degree in co-relation 1756. Up to 533 conditions per place. [2023-08-29 20:26:45,519 INFO L137 encePairwiseOnDemand]: 238/244 looper letters, 28 selfloop transitions, 4 changer transitions 19/55 dead transitions. [2023-08-29 20:26:45,520 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 55 transitions, 232 flow [2023-08-29 20:26:45,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:26:45,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:26:45,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 563 transitions. [2023-08-29 20:26:45,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46147540983606555 [2023-08-29 20:26:45,522 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 563 transitions. [2023-08-29 20:26:45,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 563 transitions. [2023-08-29 20:26:45,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:45,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 563 transitions. [2023-08-29 20:26:45,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:45,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:45,527 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:45,527 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 56 flow. Second operand 5 states and 563 transitions. [2023-08-29 20:26:45,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 55 transitions, 232 flow [2023-08-29 20:26:45,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 55 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:26:45,529 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 88 flow [2023-08-29 20:26:45,530 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=88, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2023-08-29 20:26:45,530 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2023-08-29 20:26:45,530 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 88 flow [2023-08-29 20:26:45,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:45,531 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:45,531 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:26:45,548 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:26:45,741 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:26:45,741 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:26:45,742 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:45,742 INFO L85 PathProgramCache]: Analyzing trace with hash 968068577, now seen corresponding path program 1 times [2023-08-29 20:26:45,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:26:45,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1618953677] [2023-08-29 20:26:45,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:45,743 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:26:45,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:26:45,744 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:26:45,747 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:26:45,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:45,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:26:45,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:26:45,900 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:26:45,901 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:26:45,901 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:26:45,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1618953677] [2023-08-29 20:26:45,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1618953677] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:45,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:45,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:26:45,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081162589] [2023-08-29 20:26:45,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:45,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:26:45,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:26:45,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:26:45,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:26:45,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 244 [2023-08-29 20:26:45,926 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:45,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:45,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 244 [2023-08-29 20:26:45,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:46,162 INFO L130 PetriNetUnfolder]: 224/429 cut-off events. [2023-08-29 20:26:46,163 INFO L131 PetriNetUnfolder]: For 138/138 co-relation queries the response was YES. [2023-08-29 20:26:46,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1140 conditions, 429 events. 224/429 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1850 event pairs, 60 based on Foata normal form. 37/450 useless extension candidates. Maximal degree in co-relation 1133. Up to 137 conditions per place. [2023-08-29 20:26:46,166 INFO L137 encePairwiseOnDemand]: 238/244 looper letters, 36 selfloop transitions, 7 changer transitions 19/66 dead transitions. [2023-08-29 20:26:46,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 66 transitions, 336 flow [2023-08-29 20:26:46,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:26:46,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:26:46,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 676 transitions. [2023-08-29 20:26:46,170 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46174863387978143 [2023-08-29 20:26:46,170 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 676 transitions. [2023-08-29 20:26:46,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 676 transitions. [2023-08-29 20:26:46,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:46,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 676 transitions. [2023-08-29 20:26:46,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 112.66666666666667) internal successors, (676), 6 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:46,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:46,176 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 244.0) internal successors, (1708), 7 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:46,177 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 88 flow. Second operand 6 states and 676 transitions. [2023-08-29 20:26:46,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 66 transitions, 336 flow [2023-08-29 20:26:46,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 66 transitions, 330 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-29 20:26:46,180 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 138 flow [2023-08-29 20:26:46,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=138, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-08-29 20:26:46,180 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2023-08-29 20:26:46,181 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 138 flow [2023-08-29 20:26:46,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:46,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:46,181 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:26:46,199 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:26:46,393 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:26:46,393 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:26:46,393 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:46,394 INFO L85 PathProgramCache]: Analyzing trace with hash 513188051, now seen corresponding path program 1 times [2023-08-29 20:26:46,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:26:46,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1668963182] [2023-08-29 20:26:46,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:46,394 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:26:46,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:26:46,396 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:26:46,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-29 20:26:46,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:46,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-29 20:26:46,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:26:46,552 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:26:46,552 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:26:46,552 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:26:46,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1668963182] [2023-08-29 20:26:46,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1668963182] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:46,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:46,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:26:46,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213666142] [2023-08-29 20:26:46,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:46,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:26:46,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:26:46,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:26:46,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:26:46,577 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 244 [2023-08-29 20:26:46,578 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 138 flow. Second operand has 6 states, 6 states have (on average 104.5) internal successors, (627), 6 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:46,578 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:46,579 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 244 [2023-08-29 20:26:46,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:46,813 INFO L130 PetriNetUnfolder]: 143/285 cut-off events. [2023-08-29 20:26:46,813 INFO L131 PetriNetUnfolder]: For 269/269 co-relation queries the response was YES. [2023-08-29 20:26:46,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 817 conditions, 285 events. 143/285 cut-off events. For 269/269 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1114 event pairs, 56 based on Foata normal form. 10/289 useless extension candidates. Maximal degree in co-relation 808. Up to 108 conditions per place. [2023-08-29 20:26:46,815 INFO L137 encePairwiseOnDemand]: 238/244 looper letters, 33 selfloop transitions, 10 changer transitions 10/57 dead transitions. [2023-08-29 20:26:46,815 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 57 transitions, 334 flow [2023-08-29 20:26:46,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:26:46,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:26:46,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 769 transitions. [2023-08-29 20:26:46,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4502341920374707 [2023-08-29 20:26:46,818 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 769 transitions. [2023-08-29 20:26:46,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 769 transitions. [2023-08-29 20:26:46,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:46,819 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 769 transitions. [2023-08-29 20:26:46,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 109.85714285714286) internal successors, (769), 7 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:46,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:46,824 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 244.0) internal successors, (1952), 8 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:46,824 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 138 flow. Second operand 7 states and 769 transitions. [2023-08-29 20:26:46,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 57 transitions, 334 flow [2023-08-29 20:26:46,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 57 transitions, 298 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-08-29 20:26:46,828 INFO L231 Difference]: Finished difference. Result has 45 places, 29 transitions, 140 flow [2023-08-29 20:26:46,828 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=140, PETRI_PLACES=45, PETRI_TRANSITIONS=29} [2023-08-29 20:26:46,829 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2023-08-29 20:26:46,829 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 29 transitions, 140 flow [2023-08-29 20:26:46,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.5) internal successors, (627), 6 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:46,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:46,830 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:26:46,843 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:26:47,040 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:26:47,040 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:26:47,041 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:47,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1870292670, now seen corresponding path program 1 times [2023-08-29 20:26:47,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:26:47,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2100281952] [2023-08-29 20:26:47,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:47,042 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:26:47,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:26:47,043 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:26:47,046 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:26:47,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:47,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:26:47,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:26:47,186 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:26:47,186 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:26:47,186 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:26:47,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2100281952] [2023-08-29 20:26:47,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2100281952] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:47,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:47,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:26:47,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868345547] [2023-08-29 20:26:47,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:47,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:26:47,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:26:47,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:26:47,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:26:47,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 244 [2023-08-29 20:26:47,194 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 29 transitions, 140 flow. Second operand has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:47,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:47,195 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 244 [2023-08-29 20:26:47,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:47,337 INFO L130 PetriNetUnfolder]: 198/382 cut-off events. [2023-08-29 20:26:47,337 INFO L131 PetriNetUnfolder]: For 397/397 co-relation queries the response was YES. [2023-08-29 20:26:47,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1105 conditions, 382 events. 198/382 cut-off events. For 397/397 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1575 event pairs, 38 based on Foata normal form. 0/379 useless extension candidates. Maximal degree in co-relation 1095. Up to 223 conditions per place. [2023-08-29 20:26:47,340 INFO L137 encePairwiseOnDemand]: 241/244 looper letters, 53 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-08-29 20:26:47,340 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 58 transitions, 406 flow [2023-08-29 20:26:47,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:26:47,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:26:47,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 466 transitions. [2023-08-29 20:26:47,342 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4774590163934426 [2023-08-29 20:26:47,342 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 466 transitions. [2023-08-29 20:26:47,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 466 transitions. [2023-08-29 20:26:47,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:47,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 466 transitions. [2023-08-29 20:26:47,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:47,346 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:47,346 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:47,346 INFO L175 Difference]: Start difference. First operand has 45 places, 29 transitions, 140 flow. Second operand 4 states and 466 transitions. [2023-08-29 20:26:47,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 58 transitions, 406 flow [2023-08-29 20:26:47,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 58 transitions, 326 flow, removed 24 selfloop flow, removed 6 redundant places. [2023-08-29 20:26:47,349 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 115 flow [2023-08-29 20:26:47,350 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=115, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2023-08-29 20:26:47,350 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2023-08-29 20:26:47,350 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 115 flow [2023-08-29 20:26:47,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:47,351 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:47,351 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:26:47,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-29 20:26:47,561 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:26:47,561 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:26:47,561 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:47,561 INFO L85 PathProgramCache]: Analyzing trace with hash 2014749524, now seen corresponding path program 1 times [2023-08-29 20:26:47,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:26:47,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [689535565] [2023-08-29 20:26:47,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:26:47,562 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:26:47,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:26:47,563 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:26:47,565 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:26:47,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:26:47,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-29 20:26:47,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:26:48,047 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:26:48,047 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:26:48,047 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:26:48,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [689535565] [2023-08-29 20:26:48,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [689535565] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:48,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:48,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:26:48,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486842911] [2023-08-29 20:26:48,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:48,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:26:48,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:26:48,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:26:48,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:26:48,221 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 244 [2023-08-29 20:26:48,221 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 115 flow. Second operand has 5 states, 5 states have (on average 97.6) internal successors, (488), 5 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:48,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:48,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 244 [2023-08-29 20:26:48,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:48,401 INFO L130 PetriNetUnfolder]: 178/363 cut-off events. [2023-08-29 20:26:48,401 INFO L131 PetriNetUnfolder]: For 283/283 co-relation queries the response was YES. [2023-08-29 20:26:48,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 996 conditions, 363 events. 178/363 cut-off events. For 283/283 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1618 event pairs, 27 based on Foata normal form. 2/365 useless extension candidates. Maximal degree in co-relation 987. Up to 284 conditions per place. [2023-08-29 20:26:48,403 INFO L137 encePairwiseOnDemand]: 240/244 looper letters, 24 selfloop transitions, 3 changer transitions 9/40 dead transitions. [2023-08-29 20:26:48,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 40 transitions, 231 flow [2023-08-29 20:26:48,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:26:48,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:26:48,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 498 transitions. [2023-08-29 20:26:48,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4081967213114754 [2023-08-29 20:26:48,406 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 498 transitions. [2023-08-29 20:26:48,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 498 transitions. [2023-08-29 20:26:48,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:48,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 498 transitions. [2023-08-29 20:26:48,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 99.6) internal successors, (498), 5 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:48,409 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:48,409 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:48,409 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 115 flow. Second operand 5 states and 498 transitions. [2023-08-29 20:26:48,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 40 transitions, 231 flow [2023-08-29 20:26:48,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 40 transitions, 228 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:26:48,412 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 112 flow [2023-08-29 20:26:48,412 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=112, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2023-08-29 20:26:48,412 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places. [2023-08-29 20:26:48,412 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 28 transitions, 112 flow [2023-08-29 20:26:48,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.6) internal successors, (488), 5 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:48,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:48,413 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:26:48,427 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:26:48,623 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:26:48,623 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:26:48,624 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:48,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1814797194, now seen corresponding path program 2 times [2023-08-29 20:26:48,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:26:48,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [636736169] [2023-08-29 20:26:48,624 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 20:26:48,624 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:26:48,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:26:48,626 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:26:48,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 (9)] Waiting until timeout for monitored process [2023-08-29 20:26:48,726 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 20:26:48,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:26:48,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-29 20:26:48,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:26:49,118 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:26:49,118 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:26:49,118 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:26:49,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [636736169] [2023-08-29 20:26:49,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [636736169] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:49,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:49,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-29 20:26:49,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560618403] [2023-08-29 20:26:49,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:49,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-29 20:26:49,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:26:49,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-29 20:26:49,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-08-29 20:26:49,183 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 244 [2023-08-29 20:26:49,184 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 28 transitions, 112 flow. Second operand has 9 states, 9 states have (on average 107.11111111111111) internal successors, (964), 9 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:49,184 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:49,184 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 244 [2023-08-29 20:26:49,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:49,350 INFO L130 PetriNetUnfolder]: 224/461 cut-off events. [2023-08-29 20:26:49,350 INFO L131 PetriNetUnfolder]: For 302/302 co-relation queries the response was YES. [2023-08-29 20:26:49,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1268 conditions, 461 events. 224/461 cut-off events. For 302/302 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2078 event pairs, 66 based on Foata normal form. 1/460 useless extension candidates. Maximal degree in co-relation 1259. Up to 188 conditions per place. [2023-08-29 20:26:49,352 INFO L137 encePairwiseOnDemand]: 239/244 looper letters, 38 selfloop transitions, 5 changer transitions 12/58 dead transitions. [2023-08-29 20:26:49,352 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 58 transitions, 348 flow [2023-08-29 20:26:49,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:26:49,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:26:49,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 567 transitions. [2023-08-29 20:26:49,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46475409836065573 [2023-08-29 20:26:49,357 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 567 transitions. [2023-08-29 20:26:49,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 567 transitions. [2023-08-29 20:26:49,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:49,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 567 transitions. [2023-08-29 20:26:49,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 113.4) internal successors, (567), 5 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:49,360 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:49,360 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:49,361 INFO L175 Difference]: Start difference. First operand has 44 places, 28 transitions, 112 flow. Second operand 5 states and 567 transitions. [2023-08-29 20:26:49,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 58 transitions, 348 flow [2023-08-29 20:26:49,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 58 transitions, 337 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-08-29 20:26:49,363 INFO L231 Difference]: Finished difference. Result has 45 places, 30 transitions, 129 flow [2023-08-29 20:26:49,363 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=129, PETRI_PLACES=45, PETRI_TRANSITIONS=30} [2023-08-29 20:26:49,364 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2023-08-29 20:26:49,364 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 30 transitions, 129 flow [2023-08-29 20:26:49,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 107.11111111111111) internal successors, (964), 9 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:49,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:49,365 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:26:49,378 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:26:49,574 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:26:49,575 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:26:49,575 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:49,575 INFO L85 PathProgramCache]: Analyzing trace with hash 496716072, now seen corresponding path program 3 times [2023-08-29 20:26:49,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:26:49,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [6051914] [2023-08-29 20:26:49,576 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 20:26:49,576 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:26:49,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:26:49,577 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:26:49,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-08-29 20:26:49,667 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-29 20:26:49,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:26:49,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:26:49,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:26:49,702 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:26:49,702 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:26:49,702 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:26:49,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [6051914] [2023-08-29 20:26:49,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [6051914] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:26:49,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:26:49,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:26:49,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967189567] [2023-08-29 20:26:49,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:26:49,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:26:49,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:26:49,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:26:49,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:26:49,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 244 [2023-08-29 20:26:49,709 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 30 transitions, 129 flow. Second operand has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:49,709 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:26:49,710 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 244 [2023-08-29 20:26:49,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:26:49,852 INFO L130 PetriNetUnfolder]: 305/630 cut-off events. [2023-08-29 20:26:49,852 INFO L131 PetriNetUnfolder]: For 518/519 co-relation queries the response was YES. [2023-08-29 20:26:49,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1905 conditions, 630 events. 305/630 cut-off events. For 518/519 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3090 event pairs, 150 based on Foata normal form. 1/626 useless extension candidates. Maximal degree in co-relation 1895. Up to 228 conditions per place. [2023-08-29 20:26:49,855 INFO L137 encePairwiseOnDemand]: 241/244 looper letters, 24 selfloop transitions, 1 changer transitions 27/55 dead transitions. [2023-08-29 20:26:49,855 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 55 transitions, 349 flow [2023-08-29 20:26:49,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:26:49,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:26:49,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 460 transitions. [2023-08-29 20:26:49,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4713114754098361 [2023-08-29 20:26:49,858 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 460 transitions. [2023-08-29 20:26:49,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 460 transitions. [2023-08-29 20:26:49,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:26:49,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 460 transitions. [2023-08-29 20:26:49,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:49,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:49,861 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 244.0) internal successors, (1220), 5 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:49,861 INFO L175 Difference]: Start difference. First operand has 45 places, 30 transitions, 129 flow. Second operand 4 states and 460 transitions. [2023-08-29 20:26:49,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 55 transitions, 349 flow [2023-08-29 20:26:49,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 55 transitions, 341 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:26:49,866 INFO L231 Difference]: Finished difference. Result has 48 places, 28 transitions, 122 flow [2023-08-29 20:26:49,866 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=244, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=48, PETRI_TRANSITIONS=28} [2023-08-29 20:26:49,867 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 7 predicate places. [2023-08-29 20:26:49,867 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 28 transitions, 122 flow [2023-08-29 20:26:49,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:26:49,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:26:49,868 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:26:49,883 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:26:50,077 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:26:50,078 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:26:50,078 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:26:50,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1577146704, now seen corresponding path program 4 times [2023-08-29 20:26:50,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:26:50,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [867123407] [2023-08-29 20:26:50,079 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-29 20:26:50,079 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:26:50,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:26:50,080 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:26:50,096 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:26:50,207 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-29 20:26:50,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-29 20:26:50,208 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:26:50,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:26:50,346 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-29 20:26:50,346 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:26:50,347 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-29 20:26:50,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-29 20:26:50,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-29 20:26:50,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-29 20:26:50,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-29 20:26:50,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-29 20:26:50,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-29 20:26:50,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-29 20:26:50,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-29 20:26:50,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-29 20:26:50,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-29 20:26:50,350 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-29 20:26:50,351 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-29 20:26:50,378 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:26:50,564 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:26:50,564 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2023-08-29 20:26:50,568 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:26:50,568 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:26:50,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:26:50 BasicIcfg [2023-08-29 20:26:50,629 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:26:50,630 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:26:50,630 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:26:50,630 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:26:50,631 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:26:36" (3/4) ... [2023-08-29 20:26:50,633 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:26:50,633 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:26:50,633 INFO L158 Benchmark]: Toolchain (without parser) took 15571.13ms. Allocated memory was 62.9MB in the beginning and 151.0MB in the end (delta: 88.1MB). Free memory was 27.9MB in the beginning and 38.9MB in the end (delta: -11.0MB). Peak memory consumption was 77.4MB. Max. memory is 16.1GB. [2023-08-29 20:26:50,634 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 62.9MB. Free memory is still 41.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:26:50,634 INFO L158 Benchmark]: CACSL2BoogieTranslator took 562.13ms. Allocated memory was 62.9MB in the beginning and 81.8MB in the end (delta: 18.9MB). Free memory was 27.7MB in the beginning and 60.3MB in the end (delta: -32.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-08-29 20:26:50,634 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.95ms. Allocated memory is still 81.8MB. Free memory was 60.3MB in the beginning and 57.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:26:50,634 INFO L158 Benchmark]: Boogie Preprocessor took 42.40ms. Allocated memory is still 81.8MB. Free memory was 57.5MB in the beginning and 55.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:26:50,635 INFO L158 Benchmark]: RCFGBuilder took 810.85ms. Allocated memory is still 81.8MB. Free memory was 55.4MB in the beginning and 56.4MB in the end (delta: -1.0MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. [2023-08-29 20:26:50,635 INFO L158 Benchmark]: TraceAbstraction took 14069.43ms. Allocated memory was 81.8MB in the beginning and 151.0MB in the end (delta: 69.2MB). Free memory was 55.9MB in the beginning and 38.9MB in the end (delta: 17.0MB). Peak memory consumption was 86.5MB. Max. memory is 16.1GB. [2023-08-29 20:26:50,635 INFO L158 Benchmark]: Witness Printer took 3.06ms. Allocated memory is still 151.0MB. Free memory is still 38.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:26:50,637 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 62.9MB. Free memory is still 41.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 562.13ms. Allocated memory was 62.9MB in the beginning and 81.8MB in the end (delta: 18.9MB). Free memory was 27.7MB in the beginning and 60.3MB in the end (delta: -32.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.95ms. Allocated memory is still 81.8MB. Free memory was 60.3MB in the beginning and 57.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.40ms. Allocated memory is still 81.8MB. Free memory was 57.5MB in the beginning and 55.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 810.85ms. Allocated memory is still 81.8MB. Free memory was 55.4MB in the beginning and 56.4MB in the end (delta: -1.0MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. * TraceAbstraction took 14069.43ms. Allocated memory was 81.8MB in the beginning and 151.0MB in the end (delta: 69.2MB). Free memory was 55.9MB in the beginning and 38.9MB in the end (delta: 17.0MB). Peak memory consumption was 86.5MB. Max. memory is 16.1GB. * Witness Printer took 3.06ms. Allocated memory is still 151.0MB. Free memory is still 38.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.8s, 128 PlacesBefore, 41 PlacesAfterwards, 120 TransitionsBefore, 31 TransitionsAfterwards, 2314 CoEnabledTransitionPairs, 7 FixpointIterations, 52 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 121 TotalNumberOfCompositions, 6618 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3260, independent: 3055, independent conditional: 0, independent unconditional: 3055, dependent: 205, dependent conditional: 0, dependent unconditional: 205, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1312, independent: 1271, independent conditional: 0, independent unconditional: 1271, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3260, independent: 1784, independent conditional: 0, independent unconditional: 1784, dependent: 164, dependent conditional: 0, dependent unconditional: 164, unknown: 1312, unknown conditional: 0, unknown unconditional: 1312] , Statistics on independence cache: Total cache size (in pairs): 121, Positive cache size: 107, Positive conditional cache size: 0, Positive unconditional cache size: 107, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L722] 0 _Bool x$flush_delayed; [L723] 0 int x$mem_tmp; [L724] 0 _Bool x$r_buff0_thd0; [L725] 0 _Bool x$r_buff0_thd1; [L726] 0 _Bool x$r_buff0_thd2; [L727] 0 _Bool x$r_buff0_thd3; [L728] 0 _Bool x$r_buff1_thd0; [L729] 0 _Bool x$r_buff1_thd1; [L730] 0 _Bool x$r_buff1_thd2; [L731] 0 _Bool x$r_buff1_thd3; [L732] 0 _Bool x$read_delayed; [L733] 0 int *x$read_delayed_var; [L734] 0 int x$w_buff0; [L735] 0 _Bool x$w_buff0_used; [L736] 0 int x$w_buff1; [L737] 0 _Bool x$w_buff1_used; [L739] 0 int y = 0; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L830] 0 pthread_t t1019; [L831] FCALL, FORK 0 pthread_create(&t1019, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1019, ((void *)0), P0, ((void *)0))=0, t1019={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L832] 0 pthread_t t1020; [L833] FCALL, FORK 0 pthread_create(&t1020, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1020, ((void *)0), P1, ((void *)0))=1, t1019={3:0}, t1020={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L767] 2 x$w_buff1 = x$w_buff0 [L768] 2 x$w_buff0 = 2 [L769] 2 x$w_buff1_used = x$w_buff0_used [L770] 2 x$w_buff0_used = (_Bool)1 [L771] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L771] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L772] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L773] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L774] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L775] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L776] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L834] 0 pthread_t t1021; [L779] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L835] FCALL, FORK 0 pthread_create(&t1021, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1021, ((void *)0), P2, ((void *)0))=2, t1019={3:0}, t1020={7:0}, t1021={11:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L796] 3 y = 1 [L799] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L802] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L805] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L747] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L750] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L753] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L754] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L755] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L756] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L757] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L782] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L783] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L784] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L785] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L786] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L808] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 2 return 0; [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L837] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L839] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L839] RET 0 assume_abort_if_not(main$tmp_guard0) [L841] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L842] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L843] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L844] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L845] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1019={3:0}, t1020={7:0}, t1021={11:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L848] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L849] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L850] 0 x$flush_delayed = weak$$choice2 [L851] 0 x$mem_tmp = x [L852] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L853] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L854] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L855] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L856] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L857] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L858] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L859] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L860] 0 x = x$flush_delayed ? x$mem_tmp : x [L861] 0 x$flush_delayed = (_Bool)0 [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 831]: 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: 835]: 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: 833]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 152 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.9s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 342 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 269 mSDsluCounter, 137 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 108 mSDsCounter, 82 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1044 IncrementalHoareTripleChecker+Invalid, 1126 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 82 mSolverCounterUnsat, 29 mSDtfsCounter, 1044 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=140occurred in iteration=5, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 155 NumberOfCodeBlocks, 155 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 124 ConstructedInterpolants, 16 QuantifiedInterpolants, 1292 SizeOfPredicates, 11 NumberOfNonLiveVariables, 1149 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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:26:50,658 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