./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix006.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --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/mix006.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 557c1f2fab4f7585e181c0a50145e0f2efcca52cad7f093489c012afed407365 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:09:02,329 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:09:02,331 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:09:02,373 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:09:02,374 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:09:02,377 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:09:02,379 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:09:02,381 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:09:02,383 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:09:02,387 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:09:02,388 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:09:02,391 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:09:02,391 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:09:02,393 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:09:02,394 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:09:02,402 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:09:02,403 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:09:02,405 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:09:02,407 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:09:02,410 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:09:02,423 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:09:02,424 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:09:02,424 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:09:02,425 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:09:02,430 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:09:02,432 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:09:02,432 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:09:02,433 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:09:02,434 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:09:02,434 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:09:02,434 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:09:02,435 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:09:02,435 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:09:02,436 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:09:02,437 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:09:02,437 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:09:02,437 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:09:02,437 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:09:02,437 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:09:02,438 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:09:02,438 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:09:02,439 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-31 23:09:02,465 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:09:02,465 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:09:02,467 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:09:02,467 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:09:02,468 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:09:02,468 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:09:02,468 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:09:02,468 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:09:02,469 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:09:02,469 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:09:02,470 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:09:02,470 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:09:02,470 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:09:02,470 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:09:02,470 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:09:02,470 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:09:02,470 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:09:02,470 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:09:02,470 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:09:02,470 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:09:02,471 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:09:02,471 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:09:02,471 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:09:02,471 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:09:02,471 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:09:02,471 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:09:02,471 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:09:02,471 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:09:02,471 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 23:09:02,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 23:09:02,472 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:09:02,472 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:09:02,472 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:09:02,472 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:09:02,472 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 -> 557c1f2fab4f7585e181c0a50145e0f2efcca52cad7f093489c012afed407365 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 -> BEFORE [2023-08-31 23:09:02,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:09:02,818 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:09:02,820 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:09:02,821 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:09:02,821 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:09:02,823 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix006.opt.i [2023-08-31 23:09:04,090 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:09:04,329 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:09:04,329 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix006.opt.i [2023-08-31 23:09:04,347 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f64f01ec/e9077a5a937d4a23814eb9659bd30403/FLAGc02b4f5e6 [2023-08-31 23:09:04,359 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f64f01ec/e9077a5a937d4a23814eb9659bd30403 [2023-08-31 23:09:04,361 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:09:04,363 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:09:04,364 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:09:04,364 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:09:04,368 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:09:04,369 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:09:04" (1/1) ... [2023-08-31 23:09:04,370 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cd2e7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:09:04, skipping insertion in model container [2023-08-31 23:09:04,372 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:09:04" (1/1) ... [2023-08-31 23:09:04,378 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:09:04,441 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:09:04,572 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/mix006.opt.i[944,957] [2023-08-31 23:09:04,793 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:09:04,804 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:09:04,817 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/mix006.opt.i[944,957] [2023-08-31 23:09:04,865 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:09:04,897 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:09:04,897 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:09:04,903 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:09:04,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:09:04 WrapperNode [2023-08-31 23:09:04,903 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:09:04,904 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:09:04,904 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:09:04,904 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:09:04,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:09:04" (1/1) ... [2023-08-31 23:09:04,922 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:09:04" (1/1) ... [2023-08-31 23:09:04,946 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 150 [2023-08-31 23:09:04,946 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:09:04,947 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:09:04,947 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:09:04,947 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:09:04,955 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:09:04" (1/1) ... [2023-08-31 23:09:04,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:09:04" (1/1) ... [2023-08-31 23:09:04,959 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:09:04" (1/1) ... [2023-08-31 23:09:04,959 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:09:04" (1/1) ... [2023-08-31 23:09:04,967 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:09:04" (1/1) ... [2023-08-31 23:09:04,969 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:09:04" (1/1) ... [2023-08-31 23:09:04,971 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:09:04" (1/1) ... [2023-08-31 23:09:04,972 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:09:04" (1/1) ... [2023-08-31 23:09:04,983 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:09:04,984 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:09:04,984 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:09:04,984 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:09:04,985 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:09:04" (1/1) ... [2023-08-31 23:09:04,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:09:05,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:09:05,020 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-31 23:09:05,022 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-31 23:09:05,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 23:09:05,044 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:09:05,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:09:05,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:09:05,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:09:05,044 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:09:05,044 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:09:05,044 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:09:05,045 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:09:05,045 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:09:05,045 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:09:05,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 23:09:05,045 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:09:05,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:09:05,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:09:05,047 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:09:05,164 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:09:05,166 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:09:05,574 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:09:05,724 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:09:05,725 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:09:05,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:09:05 BoogieIcfgContainer [2023-08-31 23:09:05,727 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:09:05,729 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:09:05,729 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:09:05,732 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:09:05,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:09:04" (1/3) ... [2023-08-31 23:09:05,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2005259c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:09:05, skipping insertion in model container [2023-08-31 23:09:05,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:09:04" (2/3) ... [2023-08-31 23:09:05,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2005259c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:09:05, skipping insertion in model container [2023-08-31 23:09:05,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:09:05" (3/3) ... [2023-08-31 23:09:05,735 INFO L112 eAbstractionObserver]: Analyzing ICFG mix006.opt.i [2023-08-31 23:09:05,750 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:09:05,750 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-31 23:09:05,751 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:09:05,805 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:09:05,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 120 transitions, 255 flow [2023-08-31 23:09:05,907 INFO L130 PetriNetUnfolder]: 2/117 cut-off events. [2023-08-31 23:09:05,908 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:09:05,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 117 events. 2/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-31 23:09:05,913 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 120 transitions, 255 flow [2023-08-31 23:09:05,918 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 117 transitions, 243 flow [2023-08-31 23:09:05,922 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:09:05,941 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 117 transitions, 243 flow [2023-08-31 23:09:05,946 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 117 transitions, 243 flow [2023-08-31 23:09:05,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 117 transitions, 243 flow [2023-08-31 23:09:05,986 INFO L130 PetriNetUnfolder]: 2/117 cut-off events. [2023-08-31 23:09:05,986 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:09:05,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 117 events. 2/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-31 23:09:05,998 INFO L119 LiptonReduction]: Number of co-enabled transitions 2068 [2023-08-31 23:09:09,772 INFO L134 LiptonReduction]: Checked pairs total: 5430 [2023-08-31 23:09:09,772 INFO L136 LiptonReduction]: Total number of compositions: 110 [2023-08-31 23:09:09,784 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:09:09,789 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;@2c470487, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:09:09,789 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-31 23:09:09,791 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:09:09,791 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:09:09,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:09:09,791 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:09:09,792 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:09:09,795 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:09:09,796 INFO L85 PathProgramCache]: Analyzing trace with hash 534, now seen corresponding path program 1 times [2023-08-31 23:09:09,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:09:09,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389308727] [2023-08-31 23:09:09,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:09:09,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:09:09,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:09:09,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:09:09,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:09:09,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389308727] [2023-08-31 23:09:09,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389308727] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:09:09,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:09:09,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:09:09,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318700745] [2023-08-31 23:09:09,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:09:09,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:09:09,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:09:10,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:09:10,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:09:10,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 230 [2023-08-31 23:09:10,011 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 73 flow. Second operand has 2 states, 2 states have (on average 108.5) internal successors, (217), 2 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:10,011 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:09:10,012 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 230 [2023-08-31 23:09:10,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:09:10,293 INFO L130 PetriNetUnfolder]: 1101/1677 cut-off events. [2023-08-31 23:09:10,294 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2023-08-31 23:09:10,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3350 conditions, 1677 events. 1101/1677 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 8063 event pairs, 1101 based on Foata normal form. 0/1433 useless extension candidates. Maximal degree in co-relation 3339. Up to 1637 conditions per place. [2023-08-31 23:09:10,308 INFO L137 encePairwiseOnDemand]: 223/230 looper letters, 22 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2023-08-31 23:09:10,308 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 103 flow [2023-08-31 23:09:10,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:09:10,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:09:10,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 245 transitions. [2023-08-31 23:09:10,320 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.532608695652174 [2023-08-31 23:09:10,320 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 245 transitions. [2023-08-31 23:09:10,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 245 transitions. [2023-08-31 23:09:10,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:09:10,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 245 transitions. [2023-08-31 23:09:10,326 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-31 23:09:10,330 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:10,330 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:10,332 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 73 flow. Second operand 2 states and 245 transitions. [2023-08-31 23:09:10,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 103 flow [2023-08-31 23:09:10,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 100 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:09:10,335 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 56 flow [2023-08-31 23:09:10,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, 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-31 23:09:10,340 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -8 predicate places. [2023-08-31 23:09:10,340 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 56 flow [2023-08-31 23:09:10,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 108.5) internal successors, (217), 2 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:10,341 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:09:10,341 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:09:10,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 23:09:10,342 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:09:10,342 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:09:10,342 INFO L85 PathProgramCache]: Analyzing trace with hash 2132809866, now seen corresponding path program 1 times [2023-08-31 23:09:10,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:09:10,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435785432] [2023-08-31 23:09:10,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:09:10,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:09:10,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:09:10,680 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-31 23:09:10,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:09:10,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435785432] [2023-08-31 23:09:10,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435785432] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:09:10,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:09:10,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:09:10,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890390384] [2023-08-31 23:09:10,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:09:10,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:09:10,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:09:10,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:09:10,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:09:10,687 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 230 [2023-08-31 23:09:10,688 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.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:10,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:09:10,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 230 [2023-08-31 23:09:10,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:09:10,891 INFO L130 PetriNetUnfolder]: 910/1450 cut-off events. [2023-08-31 23:09:10,892 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:09:10,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2846 conditions, 1450 events. 910/1450 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 7355 event pairs, 146 based on Foata normal form. 0/1326 useless extension candidates. Maximal degree in co-relation 2843. Up to 1101 conditions per place. [2023-08-31 23:09:10,900 INFO L137 encePairwiseOnDemand]: 227/230 looper letters, 28 selfloop transitions, 2 changer transitions 2/35 dead transitions. [2023-08-31 23:09:10,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 140 flow [2023-08-31 23:09:10,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:09:10,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:09:10,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 354 transitions. [2023-08-31 23:09:10,907 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5130434782608696 [2023-08-31 23:09:10,907 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 354 transitions. [2023-08-31 23:09:10,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 354 transitions. [2023-08-31 23:09:10,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:09:10,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 354 transitions. [2023-08-31 23:09:10,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:10,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:10,914 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:10,915 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 56 flow. Second operand 3 states and 354 transitions. [2023-08-31 23:09:10,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 140 flow [2023-08-31 23:09:10,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 35 transitions, 140 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:09:10,916 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 56 flow [2023-08-31 23:09:10,916 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, 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-31 23:09:10,917 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2023-08-31 23:09:10,917 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 56 flow [2023-08-31 23:09:10,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:10,918 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:09:10,918 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:09:10,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 23:09:10,918 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:09:10,920 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:09:10,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1206066059, now seen corresponding path program 1 times [2023-08-31 23:09:10,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:09:10,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795980941] [2023-08-31 23:09:10,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:09:10,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:09:11,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:09:11,406 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-31 23:09:11,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:09:11,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795980941] [2023-08-31 23:09:11,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795980941] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:09:11,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:09:11,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:09:11,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006347472] [2023-08-31 23:09:11,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:09:11,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:09:11,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:09:11,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:09:11,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:09:11,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 230 [2023-08-31 23:09:11,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 56 flow. Second operand has 5 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:11,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:09:11,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 230 [2023-08-31 23:09:11,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:09:11,697 INFO L130 PetriNetUnfolder]: 644/1015 cut-off events. [2023-08-31 23:09:11,697 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2023-08-31 23:09:11,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2087 conditions, 1015 events. 644/1015 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4592 event pairs, 192 based on Foata normal form. 0/1003 useless extension candidates. Maximal degree in co-relation 2083. Up to 946 conditions per place. [2023-08-31 23:09:11,702 INFO L137 encePairwiseOnDemand]: 226/230 looper letters, 23 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2023-08-31 23:09:11,703 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 29 transitions, 120 flow [2023-08-31 23:09:11,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:09:11,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:09:11,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 492 transitions. [2023-08-31 23:09:11,705 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42782608695652175 [2023-08-31 23:09:11,705 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 492 transitions. [2023-08-31 23:09:11,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 492 transitions. [2023-08-31 23:09:11,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:09:11,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 492 transitions. [2023-08-31 23:09:11,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:11,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:11,710 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:11,711 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 56 flow. Second operand 5 states and 492 transitions. [2023-08-31 23:09:11,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 29 transitions, 120 flow [2023-08-31 23:09:11,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 29 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:09:11,713 INFO L231 Difference]: Finished difference. Result has 34 places, 22 transitions, 56 flow [2023-08-31 23:09:11,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=56, PETRI_PLACES=34, PETRI_TRANSITIONS=22} [2023-08-31 23:09:11,715 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2023-08-31 23:09:11,717 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 22 transitions, 56 flow [2023-08-31 23:09:11,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:11,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:09:11,719 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:09:11,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 23:09:11,719 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:09:11,719 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:09:11,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1206066105, now seen corresponding path program 1 times [2023-08-31 23:09:11,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:09:11,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307826075] [2023-08-31 23:09:11,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:09:11,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:09:11,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:09:11,921 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-31 23:09:11,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:09:11,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307826075] [2023-08-31 23:09:11,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307826075] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:09:11,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:09:11,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:09:11,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339068612] [2023-08-31 23:09:11,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:09:11,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:09:11,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:09:11,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:09:11,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:09:11,941 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 230 [2023-08-31 23:09:11,942 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 22 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:11,942 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:09:11,942 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 230 [2023-08-31 23:09:11,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:09:12,344 INFO L130 PetriNetUnfolder]: 2125/3230 cut-off events. [2023-08-31 23:09:12,345 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2023-08-31 23:09:12,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6563 conditions, 3230 events. 2125/3230 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 16009 event pairs, 691 based on Foata normal form. 176/3406 useless extension candidates. Maximal degree in co-relation 6559. Up to 2003 conditions per place. [2023-08-31 23:09:12,362 INFO L137 encePairwiseOnDemand]: 221/230 looper letters, 32 selfloop transitions, 7 changer transitions 25/64 dead transitions. [2023-08-31 23:09:12,362 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 64 transitions, 272 flow [2023-08-31 23:09:12,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:09:12,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:09:12,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 556 transitions. [2023-08-31 23:09:12,364 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4834782608695652 [2023-08-31 23:09:12,365 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 556 transitions. [2023-08-31 23:09:12,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 556 transitions. [2023-08-31 23:09:12,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:09:12,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 556 transitions. [2023-08-31 23:09:12,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:12,369 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:12,370 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:12,370 INFO L175 Difference]: Start difference. First operand has 34 places, 22 transitions, 56 flow. Second operand 5 states and 556 transitions. [2023-08-31 23:09:12,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 64 transitions, 272 flow [2023-08-31 23:09:12,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 64 transitions, 266 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:09:12,371 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 121 flow [2023-08-31 23:09:12,372 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=51, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=121, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2023-08-31 23:09:12,372 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -2 predicate places. [2023-08-31 23:09:12,373 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 121 flow [2023-08-31 23:09:12,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:12,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:09:12,373 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:09:12,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 23:09:12,374 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:09:12,374 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:09:12,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1266632157, now seen corresponding path program 1 times [2023-08-31 23:09:12,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:09:12,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061492037] [2023-08-31 23:09:12,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:09:12,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:09:12,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:09:12,561 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-31 23:09:12,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:09:12,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061492037] [2023-08-31 23:09:12,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061492037] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:09:12,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:09:12,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:09:12,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154065856] [2023-08-31 23:09:12,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:09:12,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:09:12,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:09:12,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:09:12,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:09:12,589 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 230 [2023-08-31 23:09:12,590 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 121 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-31 23:09:12,590 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:09:12,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 230 [2023-08-31 23:09:12,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:09:12,957 INFO L130 PetriNetUnfolder]: 1829/2806 cut-off events. [2023-08-31 23:09:12,957 INFO L131 PetriNetUnfolder]: For 2214/2214 co-relation queries the response was YES. [2023-08-31 23:09:12,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8083 conditions, 2806 events. 1829/2806 cut-off events. For 2214/2214 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 13291 event pairs, 451 based on Foata normal form. 144/2950 useless extension candidates. Maximal degree in co-relation 8076. Up to 1395 conditions per place. [2023-08-31 23:09:12,972 INFO L137 encePairwiseOnDemand]: 221/230 looper letters, 38 selfloop transitions, 8 changer transitions 28/74 dead transitions. [2023-08-31 23:09:12,972 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 74 transitions, 447 flow [2023-08-31 23:09:12,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:09:12,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:09:12,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 756 transitions. [2023-08-31 23:09:12,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46956521739130436 [2023-08-31 23:09:12,975 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 756 transitions. [2023-08-31 23:09:12,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 756 transitions. [2023-08-31 23:09:12,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:09:12,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 756 transitions. [2023-08-31 23:09:12,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:12,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 230.0) internal successors, (1840), 8 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:12,981 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 230.0) internal successors, (1840), 8 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:12,981 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 121 flow. Second operand 7 states and 756 transitions. [2023-08-31 23:09:12,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 74 transitions, 447 flow [2023-08-31 23:09:12,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 74 transitions, 405 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-31 23:09:12,991 INFO L231 Difference]: Finished difference. Result has 47 places, 32 transitions, 175 flow [2023-08-31 23:09:12,991 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=175, PETRI_PLACES=47, PETRI_TRANSITIONS=32} [2023-08-31 23:09:12,992 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 6 predicate places. [2023-08-31 23:09:12,992 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 32 transitions, 175 flow [2023-08-31 23:09:12,992 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-31 23:09:12,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:09:12,993 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:09:12,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 23:09:12,993 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:09:12,993 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:09:12,993 INFO L85 PathProgramCache]: Analyzing trace with hash 572175169, now seen corresponding path program 1 times [2023-08-31 23:09:12,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:09:12,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556610413] [2023-08-31 23:09:12,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:09:12,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:09:13,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:09:13,169 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-31 23:09:13,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:09:13,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556610413] [2023-08-31 23:09:13,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556610413] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:09:13,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:09:13,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:09:13,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745075019] [2023-08-31 23:09:13,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:09:13,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:09:13,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:09:13,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:09:13,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:09:13,199 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 230 [2023-08-31 23:09:13,200 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 32 transitions, 175 flow. Second operand has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:13,200 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:09:13,200 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 230 [2023-08-31 23:09:13,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:09:13,548 INFO L130 PetriNetUnfolder]: 1696/2615 cut-off events. [2023-08-31 23:09:13,548 INFO L131 PetriNetUnfolder]: For 4207/4207 co-relation queries the response was YES. [2023-08-31 23:09:13,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8275 conditions, 2615 events. 1696/2615 cut-off events. For 4207/4207 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 12639 event pairs, 389 based on Foata normal form. 118/2733 useless extension candidates. Maximal degree in co-relation 8263. Up to 1639 conditions per place. [2023-08-31 23:09:13,579 INFO L137 encePairwiseOnDemand]: 221/230 looper letters, 42 selfloop transitions, 15 changer transitions 25/82 dead transitions. [2023-08-31 23:09:13,579 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 82 transitions, 543 flow [2023-08-31 23:09:13,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:09:13,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:09:13,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 765 transitions. [2023-08-31 23:09:13,582 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4751552795031056 [2023-08-31 23:09:13,582 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 765 transitions. [2023-08-31 23:09:13,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 765 transitions. [2023-08-31 23:09:13,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:09:13,583 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 765 transitions. [2023-08-31 23:09:13,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 109.28571428571429) internal successors, (765), 7 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:13,587 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 230.0) internal successors, (1840), 8 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:13,587 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 230.0) internal successors, (1840), 8 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:13,587 INFO L175 Difference]: Start difference. First operand has 47 places, 32 transitions, 175 flow. Second operand 7 states and 765 transitions. [2023-08-31 23:09:13,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 82 transitions, 543 flow [2023-08-31 23:09:13,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 82 transitions, 525 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-08-31 23:09:13,605 INFO L231 Difference]: Finished difference. Result has 52 places, 36 transitions, 252 flow [2023-08-31 23:09:13,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=252, PETRI_PLACES=52, PETRI_TRANSITIONS=36} [2023-08-31 23:09:13,606 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 11 predicate places. [2023-08-31 23:09:13,606 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 36 transitions, 252 flow [2023-08-31 23:09:13,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:13,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:09:13,607 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:09:13,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-31 23:09:13,607 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:09:13,607 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:09:13,608 INFO L85 PathProgramCache]: Analyzing trace with hash 558228723, now seen corresponding path program 1 times [2023-08-31 23:09:13,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:09:13,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632827448] [2023-08-31 23:09:13,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:09:13,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:09:13,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:09:13,853 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-31 23:09:13,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:09:13,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632827448] [2023-08-31 23:09:13,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632827448] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:09:13,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:09:13,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:09:13,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189224251] [2023-08-31 23:09:13,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:09:13,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:09:13,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:09:13,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:09:13,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:09:13,873 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 230 [2023-08-31 23:09:13,874 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 36 transitions, 252 flow. Second operand has 5 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:13,874 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:09:13,874 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 230 [2023-08-31 23:09:13,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:09:14,234 INFO L130 PetriNetUnfolder]: 1547/2388 cut-off events. [2023-08-31 23:09:14,234 INFO L131 PetriNetUnfolder]: For 5362/5362 co-relation queries the response was YES. [2023-08-31 23:09:14,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8263 conditions, 2388 events. 1547/2388 cut-off events. For 5362/5362 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 11291 event pairs, 337 based on Foata normal form. 104/2492 useless extension candidates. Maximal degree in co-relation 8247. Up to 1133 conditions per place. [2023-08-31 23:09:14,248 INFO L137 encePairwiseOnDemand]: 222/230 looper letters, 51 selfloop transitions, 10 changer transitions 25/86 dead transitions. [2023-08-31 23:09:14,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 86 transitions, 668 flow [2023-08-31 23:09:14,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:09:14,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:09:14,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 759 transitions. [2023-08-31 23:09:14,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4714285714285714 [2023-08-31 23:09:14,251 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 759 transitions. [2023-08-31 23:09:14,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 759 transitions. [2023-08-31 23:09:14,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:09:14,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 759 transitions. [2023-08-31 23:09:14,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 108.42857142857143) internal successors, (759), 7 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:14,255 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 230.0) internal successors, (1840), 8 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:14,256 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 230.0) internal successors, (1840), 8 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:14,256 INFO L175 Difference]: Start difference. First operand has 52 places, 36 transitions, 252 flow. Second operand 7 states and 759 transitions. [2023-08-31 23:09:14,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 86 transitions, 668 flow [2023-08-31 23:09:14,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 86 transitions, 642 flow, removed 13 selfloop flow, removed 5 redundant places. [2023-08-31 23:09:14,281 INFO L231 Difference]: Finished difference. Result has 56 places, 40 transitions, 337 flow [2023-08-31 23:09:14,281 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=337, PETRI_PLACES=56, PETRI_TRANSITIONS=40} [2023-08-31 23:09:14,282 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 15 predicate places. [2023-08-31 23:09:14,282 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 40 transitions, 337 flow [2023-08-31 23:09:14,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:14,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:09:14,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:09:14,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-31 23:09:14,283 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:09:14,283 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:09:14,283 INFO L85 PathProgramCache]: Analyzing trace with hash 174412391, now seen corresponding path program 1 times [2023-08-31 23:09:14,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:09:14,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147133660] [2023-08-31 23:09:14,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:09:14,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:09:14,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:09:14,470 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-31 23:09:14,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:09:14,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147133660] [2023-08-31 23:09:14,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147133660] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:09:14,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:09:14,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:09:14,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246599209] [2023-08-31 23:09:14,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:09:14,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:09:14,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:09:14,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:09:14,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:09:14,482 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 230 [2023-08-31 23:09:14,483 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 40 transitions, 337 flow. Second operand has 4 states, 4 states have (on average 106.25) internal successors, (425), 4 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:14,483 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:09:14,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 230 [2023-08-31 23:09:14,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:09:14,717 INFO L130 PetriNetUnfolder]: 807/1387 cut-off events. [2023-08-31 23:09:14,718 INFO L131 PetriNetUnfolder]: For 3281/3522 co-relation queries the response was YES. [2023-08-31 23:09:14,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4727 conditions, 1387 events. 807/1387 cut-off events. For 3281/3522 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 7391 event pairs, 152 based on Foata normal form. 176/1520 useless extension candidates. Maximal degree in co-relation 4710. Up to 830 conditions per place. [2023-08-31 23:09:14,727 INFO L137 encePairwiseOnDemand]: 224/230 looper letters, 68 selfloop transitions, 8 changer transitions 7/95 dead transitions. [2023-08-31 23:09:14,728 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 95 transitions, 888 flow [2023-08-31 23:09:14,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:09:14,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:09:14,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 568 transitions. [2023-08-31 23:09:14,730 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49391304347826087 [2023-08-31 23:09:14,730 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 568 transitions. [2023-08-31 23:09:14,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 568 transitions. [2023-08-31 23:09:14,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:09:14,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 568 transitions. [2023-08-31 23:09:14,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:14,733 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:14,734 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:14,734 INFO L175 Difference]: Start difference. First operand has 56 places, 40 transitions, 337 flow. Second operand 5 states and 568 transitions. [2023-08-31 23:09:14,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 95 transitions, 888 flow [2023-08-31 23:09:14,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 95 transitions, 876 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-31 23:09:14,743 INFO L231 Difference]: Finished difference. Result has 58 places, 47 transitions, 385 flow [2023-08-31 23:09:14,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=385, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2023-08-31 23:09:14,744 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 17 predicate places. [2023-08-31 23:09:14,744 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 47 transitions, 385 flow [2023-08-31 23:09:14,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.25) internal successors, (425), 4 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:14,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:09:14,744 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:09:14,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-31 23:09:14,745 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:09:14,745 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:09:14,745 INFO L85 PathProgramCache]: Analyzing trace with hash -481124797, now seen corresponding path program 1 times [2023-08-31 23:09:14,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:09:14,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575354673] [2023-08-31 23:09:14,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:09:14,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:09:14,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:09:14,965 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-31 23:09:14,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:09:14,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575354673] [2023-08-31 23:09:14,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575354673] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:09:14,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:09:14,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:09:14,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460647306] [2023-08-31 23:09:14,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:09:14,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:09:14,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:09:14,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:09:14,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:09:14,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 230 [2023-08-31 23:09:14,981 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 47 transitions, 385 flow. Second operand has 5 states, 5 states have (on average 106.0) internal successors, (530), 5 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:14,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:09:14,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 230 [2023-08-31 23:09:14,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:09:15,246 INFO L130 PetriNetUnfolder]: 599/1085 cut-off events. [2023-08-31 23:09:15,246 INFO L131 PetriNetUnfolder]: For 2821/3096 co-relation queries the response was YES. [2023-08-31 23:09:15,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4471 conditions, 1085 events. 599/1085 cut-off events. For 2821/3096 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 5906 event pairs, 62 based on Foata normal form. 157/1210 useless extension candidates. Maximal degree in co-relation 4451. Up to 365 conditions per place. [2023-08-31 23:09:15,254 INFO L137 encePairwiseOnDemand]: 224/230 looper letters, 78 selfloop transitions, 15 changer transitions 17/122 dead transitions. [2023-08-31 23:09:15,255 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 122 transitions, 1173 flow [2023-08-31 23:09:15,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:09:15,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:09:15,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 795 transitions. [2023-08-31 23:09:15,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4937888198757764 [2023-08-31 23:09:15,257 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 795 transitions. [2023-08-31 23:09:15,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 795 transitions. [2023-08-31 23:09:15,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:09:15,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 795 transitions. [2023-08-31 23:09:15,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 113.57142857142857) internal successors, (795), 7 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:15,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 230.0) internal successors, (1840), 8 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:15,263 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 230.0) internal successors, (1840), 8 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:15,263 INFO L175 Difference]: Start difference. First operand has 58 places, 47 transitions, 385 flow. Second operand 7 states and 795 transitions. [2023-08-31 23:09:15,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 122 transitions, 1173 flow [2023-08-31 23:09:15,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 122 transitions, 1165 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-31 23:09:15,271 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 476 flow [2023-08-31 23:09:15,271 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=476, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2023-08-31 23:09:15,272 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 23 predicate places. [2023-08-31 23:09:15,272 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 476 flow [2023-08-31 23:09:15,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.0) internal successors, (530), 5 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:15,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:09:15,273 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:09:15,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-31 23:09:15,273 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:09:15,274 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:09:15,274 INFO L85 PathProgramCache]: Analyzing trace with hash 738836616, now seen corresponding path program 1 times [2023-08-31 23:09:15,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:09:15,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783417236] [2023-08-31 23:09:15,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:09:15,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:09:15,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:09:15,548 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-31 23:09:15,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:09:15,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783417236] [2023-08-31 23:09:15,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783417236] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:09:15,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:09:15,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:09:15,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809028372] [2023-08-31 23:09:15,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:09:15,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:09:15,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:09:15,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:09:15,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:09:15,566 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 230 [2023-08-31 23:09:15,567 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 476 flow. Second operand has 6 states, 6 states have (on average 105.83333333333333) internal successors, (635), 6 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:15,568 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:09:15,568 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 230 [2023-08-31 23:09:15,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:09:15,816 INFO L130 PetriNetUnfolder]: 555/999 cut-off events. [2023-08-31 23:09:15,816 INFO L131 PetriNetUnfolder]: For 3651/3924 co-relation queries the response was YES. [2023-08-31 23:09:15,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4650 conditions, 999 events. 555/999 cut-off events. For 3651/3924 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 5438 event pairs, 53 based on Foata normal form. 89/1057 useless extension candidates. Maximal degree in co-relation 4629. Up to 339 conditions per place. [2023-08-31 23:09:15,824 INFO L137 encePairwiseOnDemand]: 224/230 looper letters, 74 selfloop transitions, 19 changer transitions 18/123 dead transitions. [2023-08-31 23:09:15,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 123 transitions, 1238 flow [2023-08-31 23:09:15,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 23:09:15,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 23:09:15,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1002 transitions. [2023-08-31 23:09:15,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48405797101449277 [2023-08-31 23:09:15,827 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1002 transitions. [2023-08-31 23:09:15,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1002 transitions. [2023-08-31 23:09:15,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:09:15,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1002 transitions. [2023-08-31 23:09:15,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 111.33333333333333) internal successors, (1002), 9 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:15,832 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 230.0) internal successors, (2300), 10 states have internal predecessors, (2300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:15,833 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 230.0) internal successors, (2300), 10 states have internal predecessors, (2300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:15,833 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 476 flow. Second operand 9 states and 1002 transitions. [2023-08-31 23:09:15,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 123 transitions, 1238 flow [2023-08-31 23:09:15,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 123 transitions, 1174 flow, removed 16 selfloop flow, removed 4 redundant places. [2023-08-31 23:09:15,851 INFO L231 Difference]: Finished difference. Result has 71 places, 55 transitions, 487 flow [2023-08-31 23:09:15,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=487, PETRI_PLACES=71, PETRI_TRANSITIONS=55} [2023-08-31 23:09:15,852 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 30 predicate places. [2023-08-31 23:09:15,852 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 55 transitions, 487 flow [2023-08-31 23:09:15,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.83333333333333) internal successors, (635), 6 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:15,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:09:15,853 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-31 23:09:15,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-31 23:09:15,853 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:09:15,854 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:09:15,854 INFO L85 PathProgramCache]: Analyzing trace with hash -167545917, now seen corresponding path program 1 times [2023-08-31 23:09:15,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:09:15,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593941153] [2023-08-31 23:09:15,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:09:15,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:09:15,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:09:16,092 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-31 23:09:16,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:09:16,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593941153] [2023-08-31 23:09:16,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593941153] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:09:16,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:09:16,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:09:16,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689364621] [2023-08-31 23:09:16,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:09:16,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:09:16,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:09:16,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:09:16,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:09:16,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 230 [2023-08-31 23:09:16,118 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 55 transitions, 487 flow. Second operand has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:16,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:09:16,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 230 [2023-08-31 23:09:16,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:09:16,393 INFO L130 PetriNetUnfolder]: 912/1562 cut-off events. [2023-08-31 23:09:16,393 INFO L131 PetriNetUnfolder]: For 7426/7426 co-relation queries the response was YES. [2023-08-31 23:09:16,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7698 conditions, 1562 events. 912/1562 cut-off events. For 7426/7426 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8030 event pairs, 123 based on Foata normal form. 1/1563 useless extension candidates. Maximal degree in co-relation 7675. Up to 749 conditions per place. [2023-08-31 23:09:16,402 INFO L137 encePairwiseOnDemand]: 220/230 looper letters, 53 selfloop transitions, 24 changer transitions 39/116 dead transitions. [2023-08-31 23:09:16,402 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 116 transitions, 1175 flow [2023-08-31 23:09:16,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:09:16,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:09:16,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 636 transitions. [2023-08-31 23:09:16,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4608695652173913 [2023-08-31 23:09:16,404 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 636 transitions. [2023-08-31 23:09:16,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 636 transitions. [2023-08-31 23:09:16,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:09:16,405 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 636 transitions. [2023-08-31 23:09:16,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 106.0) internal successors, (636), 6 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:16,408 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:16,408 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:16,408 INFO L175 Difference]: Start difference. First operand has 71 places, 55 transitions, 487 flow. Second operand 6 states and 636 transitions. [2023-08-31 23:09:16,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 116 transitions, 1175 flow [2023-08-31 23:09:16,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 116 transitions, 1002 flow, removed 43 selfloop flow, removed 9 redundant places. [2023-08-31 23:09:16,446 INFO L231 Difference]: Finished difference. Result has 69 places, 56 transitions, 531 flow [2023-08-31 23:09:16,446 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=531, PETRI_PLACES=69, PETRI_TRANSITIONS=56} [2023-08-31 23:09:16,447 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 28 predicate places. [2023-08-31 23:09:16,447 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 56 transitions, 531 flow [2023-08-31 23:09:16,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:16,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:09:16,447 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-31 23:09:16,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-31 23:09:16,448 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:09:16,448 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:09:16,448 INFO L85 PathProgramCache]: Analyzing trace with hash -2045639611, now seen corresponding path program 2 times [2023-08-31 23:09:16,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:09:16,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376825721] [2023-08-31 23:09:16,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:09:16,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:09:16,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:09:16,693 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-31 23:09:16,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:09:16,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376825721] [2023-08-31 23:09:16,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376825721] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:09:16,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:09:16,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:09:16,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225707953] [2023-08-31 23:09:16,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:09:16,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:09:16,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:09:16,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:09:16,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:09:16,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 230 [2023-08-31 23:09:16,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 56 transitions, 531 flow. Second operand has 5 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-31 23:09:16,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:09:16,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 230 [2023-08-31 23:09:16,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:09:16,870 INFO L130 PetriNetUnfolder]: 310/649 cut-off events. [2023-08-31 23:09:16,870 INFO L131 PetriNetUnfolder]: For 2568/2601 co-relation queries the response was YES. [2023-08-31 23:09:16,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3027 conditions, 649 events. 310/649 cut-off events. For 2568/2601 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3328 event pairs, 65 based on Foata normal form. 8/645 useless extension candidates. Maximal degree in co-relation 3005. Up to 308 conditions per place. [2023-08-31 23:09:16,875 INFO L137 encePairwiseOnDemand]: 226/230 looper letters, 32 selfloop transitions, 1 changer transitions 47/85 dead transitions. [2023-08-31 23:09:16,875 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 85 transitions, 851 flow [2023-08-31 23:09:16,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:09:16,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:09:16,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 557 transitions. [2023-08-31 23:09:16,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48434782608695653 [2023-08-31 23:09:16,877 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 557 transitions. [2023-08-31 23:09:16,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 557 transitions. [2023-08-31 23:09:16,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:09:16,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 557 transitions. [2023-08-31 23:09:16,879 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-31 23:09:16,881 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:16,881 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:16,881 INFO L175 Difference]: Start difference. First operand has 69 places, 56 transitions, 531 flow. Second operand 5 states and 557 transitions. [2023-08-31 23:09:16,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 85 transitions, 851 flow [2023-08-31 23:09:16,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 85 transitions, 831 flow, removed 10 selfloop flow, removed 5 redundant places. [2023-08-31 23:09:16,893 INFO L231 Difference]: Finished difference. Result has 64 places, 35 transitions, 268 flow [2023-08-31 23:09:16,897 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=268, PETRI_PLACES=64, PETRI_TRANSITIONS=35} [2023-08-31 23:09:16,898 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 23 predicate places. [2023-08-31 23:09:16,899 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 35 transitions, 268 flow [2023-08-31 23:09:16,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 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-31 23:09:16,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:09:16,899 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-31 23:09:16,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-31 23:09:16,900 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:09:16,901 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:09:16,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1839773125, now seen corresponding path program 3 times [2023-08-31 23:09:16,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:09:16,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141318888] [2023-08-31 23:09:16,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:09:16,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:09:16,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:09:17,185 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-31 23:09:17,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:09:17,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141318888] [2023-08-31 23:09:17,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141318888] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:09:17,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:09:17,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:09:17,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105563850] [2023-08-31 23:09:17,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:09:17,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:09:17,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:09:17,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:09:17,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:09:17,203 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 230 [2023-08-31 23:09:17,204 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 35 transitions, 268 flow. Second operand has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:17,204 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:09:17,204 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 230 [2023-08-31 23:09:17,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:09:17,300 INFO L130 PetriNetUnfolder]: 174/358 cut-off events. [2023-08-31 23:09:17,300 INFO L131 PetriNetUnfolder]: For 1579/1579 co-relation queries the response was YES. [2023-08-31 23:09:17,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1653 conditions, 358 events. 174/358 cut-off events. For 1579/1579 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1435 event pairs, 67 based on Foata normal form. 1/359 useless extension candidates. Maximal degree in co-relation 1633. Up to 223 conditions per place. [2023-08-31 23:09:17,303 INFO L137 encePairwiseOnDemand]: 224/230 looper letters, 29 selfloop transitions, 4 changer transitions 19/52 dead transitions. [2023-08-31 23:09:17,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 52 transitions, 455 flow [2023-08-31 23:09:17,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:09:17,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:09:17,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 528 transitions. [2023-08-31 23:09:17,306 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4591304347826087 [2023-08-31 23:09:17,306 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 528 transitions. [2023-08-31 23:09:17,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 528 transitions. [2023-08-31 23:09:17,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:09:17,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 528 transitions. [2023-08-31 23:09:17,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.6) internal successors, (528), 5 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:17,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:17,309 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:17,309 INFO L175 Difference]: Start difference. First operand has 64 places, 35 transitions, 268 flow. Second operand 5 states and 528 transitions. [2023-08-31 23:09:17,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 52 transitions, 455 flow [2023-08-31 23:09:17,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 52 transitions, 375 flow, removed 9 selfloop flow, removed 13 redundant places. [2023-08-31 23:09:17,315 INFO L231 Difference]: Finished difference. Result has 55 places, 28 transitions, 152 flow [2023-08-31 23:09:17,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=152, PETRI_PLACES=55, PETRI_TRANSITIONS=28} [2023-08-31 23:09:17,316 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places. [2023-08-31 23:09:17,317 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 28 transitions, 152 flow [2023-08-31 23:09:17,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:17,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:09:17,317 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-31 23:09:17,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-31 23:09:17,318 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:09:17,318 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:09:17,318 INFO L85 PathProgramCache]: Analyzing trace with hash 288134943, now seen corresponding path program 4 times [2023-08-31 23:09:17,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:09:17,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903240197] [2023-08-31 23:09:17,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:09:17,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:09:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:09:17,384 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:09:17,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:09:17,490 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-31 23:09:17,491 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:09:17,491 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-31 23:09:17,493 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-31 23:09:17,495 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-31 23:09:17,496 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-31 23:09:17,496 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-31 23:09:17,496 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-31 23:09:17,496 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-31 23:09:17,496 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-31 23:09:17,496 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-31 23:09:17,497 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-31 23:09:17,497 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-31 23:09:17,497 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-31 23:09:17,497 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-31 23:09:17,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-31 23:09:17,497 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:09:17,504 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:09:17,504 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:09:17,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:09:17 BasicIcfg [2023-08-31 23:09:17,571 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:09:17,572 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:09:17,572 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:09:17,572 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:09:17,572 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:09:05" (3/4) ... [2023-08-31 23:09:17,575 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:09:17,575 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:09:17,575 INFO L158 Benchmark]: Toolchain (without parser) took 13212.54ms. Allocated memory was 75.5MB in the beginning and 360.7MB in the end (delta: 285.2MB). Free memory was 49.1MB in the beginning and 303.5MB in the end (delta: -254.4MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. [2023-08-31 23:09:17,575 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 56.6MB. Free memory was 34.4MB in the beginning and 34.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:09:17,576 INFO L158 Benchmark]: CACSL2BoogieTranslator took 539.80ms. Allocated memory is still 75.5MB. Free memory was 49.1MB in the beginning and 43.7MB in the end (delta: 5.3MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2023-08-31 23:09:17,576 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.33ms. Allocated memory is still 75.5MB. Free memory was 43.7MB in the beginning and 41.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:09:17,576 INFO L158 Benchmark]: Boogie Preprocessor took 36.43ms. Allocated memory is still 75.5MB. Free memory was 41.1MB in the beginning and 39.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:09:17,577 INFO L158 Benchmark]: RCFGBuilder took 743.00ms. Allocated memory is still 75.5MB. Free memory was 38.8MB in the beginning and 50.0MB in the end (delta: -11.2MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. [2023-08-31 23:09:17,577 INFO L158 Benchmark]: TraceAbstraction took 11842.04ms. Allocated memory was 75.5MB in the beginning and 360.7MB in the end (delta: 285.2MB). Free memory was 49.0MB in the beginning and 304.5MB in the end (delta: -255.5MB). Peak memory consumption was 228.3MB. Max. memory is 16.1GB. [2023-08-31 23:09:17,577 INFO L158 Benchmark]: Witness Printer took 3.18ms. Allocated memory is still 360.7MB. Free memory was 304.5MB in the beginning and 303.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:09:17,579 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.18ms. Allocated memory is still 56.6MB. Free memory was 34.4MB in the beginning and 34.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 539.80ms. Allocated memory is still 75.5MB. Free memory was 49.1MB in the beginning and 43.7MB in the end (delta: 5.3MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.33ms. Allocated memory is still 75.5MB. Free memory was 43.7MB in the beginning and 41.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.43ms. Allocated memory is still 75.5MB. Free memory was 41.1MB in the beginning and 39.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 743.00ms. Allocated memory is still 75.5MB. Free memory was 38.8MB in the beginning and 50.0MB in the end (delta: -11.2MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. * TraceAbstraction took 11842.04ms. Allocated memory was 75.5MB in the beginning and 360.7MB in the end (delta: 285.2MB). Free memory was 49.0MB in the beginning and 304.5MB in the end (delta: -255.5MB). Peak memory consumption was 228.3MB. Max. memory is 16.1GB. * Witness Printer took 3.18ms. Allocated memory is still 360.7MB. Free memory was 304.5MB in the beginning and 303.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 125 PlacesBefore, 41 PlacesAfterwards, 117 TransitionsBefore, 32 TransitionsAfterwards, 2068 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 110 TotalNumberOfCompositions, 5430 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2467, independent: 2291, independent conditional: 0, independent unconditional: 2291, dependent: 176, dependent conditional: 0, dependent unconditional: 176, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1095, independent: 1067, independent conditional: 0, independent unconditional: 1067, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2467, independent: 1224, independent conditional: 0, independent unconditional: 1224, dependent: 148, dependent conditional: 0, dependent unconditional: 148, unknown: 1095, unknown conditional: 0, unknown unconditional: 1095] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 72, Positive conditional cache size: 0, Positive unconditional cache size: 72, 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_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff0_thd3; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L846] 0 pthread_t t156; [L847] FCALL, FORK 0 pthread_create(&t156, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t156, ((void *)0), P0, ((void *)0))=-3, t156={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L848] 0 pthread_t t157; [L849] FCALL, FORK 0 pthread_create(&t157, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t157, ((void *)0), P1, ((void *)0))=-2, t156={5:0}, t157={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L850] 0 pthread_t t158; [L851] FCALL, FORK 0 pthread_create(&t158, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t158, ((void *)0), P2, ((void *)0))=-1, t156={5:0}, t157={6:0}, t158={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L793] 3 y$w_buff1 = y$w_buff0 [L794] 3 y$w_buff0 = 1 [L795] 3 y$w_buff1_used = y$w_buff0_used [L796] 3 y$w_buff0_used = (_Bool)1 [L797] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L797] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L798] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L799] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L800] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L801] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L802] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 y$flush_delayed = weak$$choice2 [L808] 3 y$mem_tmp = y [L809] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L810] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L811] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L812] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L813] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L815] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EAX = y [L817] 3 y = y$flush_delayed ? y$mem_tmp : y [L818] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L821] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L747] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L750] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L762] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L765] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L768] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L769] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L770] 2 y$flush_delayed = weak$$choice2 [L771] 2 y$mem_tmp = y [L772] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L773] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L774] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L775] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L776] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L778] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 __unbuffered_p1_EBX = y [L780] 2 y = y$flush_delayed ? y$mem_tmp : y [L781] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L786] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 2 return 0; [L824] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L825] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L826] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L827] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L828] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L831] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 3 return 0; [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L861] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t156={5:0}, t157={6:0}, t158={3:0}, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L864] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L866] 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=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 844]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 147 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.7s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 639 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 493 mSDsluCounter, 231 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 151 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1457 IncrementalHoareTripleChecker+Invalid, 1516 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 80 mSDtfsCounter, 1457 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=531occurred in iteration=11, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 201 NumberOfCodeBlocks, 201 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 166 ConstructedInterpolants, 0 QuantifiedInterpolants, 1051 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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-31 23:09:17,606 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/mix006.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 557c1f2fab4f7585e181c0a50145e0f2efcca52cad7f093489c012afed407365 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:09:19,514 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:09:19,516 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:09:19,550 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:09:19,551 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:09:19,554 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:09:19,556 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:09:19,558 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:09:19,560 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:09:19,564 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:09:19,565 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:09:19,567 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:09:19,568 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:09:19,569 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:09:19,571 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:09:19,576 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:09:19,577 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:09:19,578 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:09:19,580 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:09:19,584 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:09:19,586 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:09:19,587 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:09:19,588 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:09:19,588 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:09:19,594 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:09:19,595 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:09:19,595 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:09:19,597 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:09:19,597 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:09:19,598 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:09:19,598 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:09:19,600 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:09:19,601 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:09:19,602 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:09:19,602 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:09:19,602 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:09:19,603 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:09:19,603 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:09:19,603 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:09:19,604 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:09:19,605 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:09:19,606 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-31 23:09:19,638 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:09:19,639 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:09:19,640 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:09:19,640 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:09:19,641 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:09:19,641 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:09:19,641 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:09:19,642 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:09:19,642 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:09:19,642 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:09:19,643 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:09:19,643 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:09:19,643 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:09:19,643 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:09:19,643 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:09:19,643 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:09:19,644 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:09:19,644 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:09:19,644 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:09:19,644 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:09:19,644 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-31 23:09:19,644 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-31 23:09:19,645 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:09:19,645 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:09:19,645 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:09:19,645 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:09:19,645 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:09:19,646 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:09:19,646 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:09:19,646 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:09:19,646 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-31 23:09:19,646 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-31 23:09:19,647 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:09:19,647 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:09:19,647 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:09:19,647 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-31 23:09:19,647 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:09:19,647 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 -> 557c1f2fab4f7585e181c0a50145e0f2efcca52cad7f093489c012afed407365 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 -> BEFORE [2023-08-31 23:09:19,965 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:09:19,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:09:19,987 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:09:19,988 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:09:19,988 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:09:19,989 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix006.opt.i [2023-08-31 23:09:21,178 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:09:21,461 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:09:21,462 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix006.opt.i [2023-08-31 23:09:21,474 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef5321236/94df8292aab44e14bb125efadc3a1c3b/FLAGedd91e930 [2023-08-31 23:09:21,489 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef5321236/94df8292aab44e14bb125efadc3a1c3b [2023-08-31 23:09:21,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:09:21,492 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:09:21,494 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:09:21,495 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:09:21,498 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:09:21,499 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:09:21" (1/1) ... [2023-08-31 23:09:21,501 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2492e44f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:09:21, skipping insertion in model container [2023-08-31 23:09:21,501 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:09:21" (1/1) ... [2023-08-31 23:09:21,506 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:09:21,558 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:09:21,690 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/mix006.opt.i[944,957] [2023-08-31 23:09:21,915 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:09:21,931 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:09:21,945 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/mix006.opt.i[944,957] [2023-08-31 23:09:21,992 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:09:22,023 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:09:22,023 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:09:22,029 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:09:22,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:09:22 WrapperNode [2023-08-31 23:09:22,030 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:09:22,031 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:09:22,031 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:09:22,031 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:09:22,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:09:22" (1/1) ... [2023-08-31 23:09:22,065 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:09:22" (1/1) ... [2023-08-31 23:09:22,106 INFO L138 Inliner]: procedures = 179, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 151 [2023-08-31 23:09:22,107 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:09:22,108 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:09:22,108 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:09:22,108 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:09:22,116 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:09:22" (1/1) ... [2023-08-31 23:09:22,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:09:22" (1/1) ... [2023-08-31 23:09:22,131 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:09:22" (1/1) ... [2023-08-31 23:09:22,132 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:09:22" (1/1) ... [2023-08-31 23:09:22,144 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:09:22" (1/1) ... [2023-08-31 23:09:22,160 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:09:22" (1/1) ... [2023-08-31 23:09:22,162 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:09:22" (1/1) ... [2023-08-31 23:09:22,164 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:09:22" (1/1) ... [2023-08-31 23:09:22,167 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:09:22,169 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:09:22,169 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:09:22,169 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:09:22,170 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:09:22" (1/1) ... [2023-08-31 23:09:22,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:09:22,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:09:22,206 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-31 23:09:22,230 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-31 23:09:22,244 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:09:22,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:09:22,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:09:22,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:09:22,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-31 23:09:22,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-31 23:09:22,245 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:09:22,245 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:09:22,246 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:09:22,246 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:09:22,246 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:09:22,246 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:09:22,246 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:09:22,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:09:22,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:09:22,248 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:09:22,451 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:09:22,454 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:09:22,809 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:09:22,908 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:09:22,911 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:09:22,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:09:22 BoogieIcfgContainer [2023-08-31 23:09:22,917 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:09:22,920 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:09:22,920 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:09:22,923 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:09:22,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:09:21" (1/3) ... [2023-08-31 23:09:22,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@230296b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:09:22, skipping insertion in model container [2023-08-31 23:09:22,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:09:22" (2/3) ... [2023-08-31 23:09:22,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@230296b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:09:22, skipping insertion in model container [2023-08-31 23:09:22,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:09:22" (3/3) ... [2023-08-31 23:09:22,926 INFO L112 eAbstractionObserver]: Analyzing ICFG mix006.opt.i [2023-08-31 23:09:22,940 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:09:22,941 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-31 23:09:22,941 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:09:23,029 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:09:23,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 121 transitions, 257 flow [2023-08-31 23:09:23,132 INFO L130 PetriNetUnfolder]: 2/118 cut-off events. [2023-08-31 23:09:23,133 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:09:23,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 118 events. 2/118 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-31 23:09:23,140 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 121 transitions, 257 flow [2023-08-31 23:09:23,147 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 118 transitions, 245 flow [2023-08-31 23:09:23,152 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:09:23,168 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 118 transitions, 245 flow [2023-08-31 23:09:23,170 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 118 transitions, 245 flow [2023-08-31 23:09:23,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 118 transitions, 245 flow [2023-08-31 23:09:23,194 INFO L130 PetriNetUnfolder]: 2/118 cut-off events. [2023-08-31 23:09:23,195 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:09:23,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 118 events. 2/118 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-31 23:09:23,197 INFO L119 LiptonReduction]: Number of co-enabled transitions 2068 [2023-08-31 23:09:28,746 INFO L134 LiptonReduction]: Checked pairs total: 5522 [2023-08-31 23:09:28,747 INFO L136 LiptonReduction]: Total number of compositions: 115 [2023-08-31 23:09:28,758 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:09:28,763 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;@2485c853, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:09:28,764 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-31 23:09:28,765 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:09:28,765 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:09:28,765 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:09:28,766 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:09:28,766 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:09:28,770 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:09:28,770 INFO L85 PathProgramCache]: Analyzing trace with hash 541, now seen corresponding path program 1 times [2023-08-31 23:09:28,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:09:28,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [425243716] [2023-08-31 23:09:28,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:09:28,785 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-31 23:09:28,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:09:28,788 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-31 23:09:28,789 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-31 23:09:28,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:09:28,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-31 23:09:28,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:09:28,853 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-31 23:09:28,853 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:09:28,854 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:09:28,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [425243716] [2023-08-31 23:09:28,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [425243716] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:09:28,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:09:28,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:09:28,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904207173] [2023-08-31 23:09:28,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:09:28,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:09:28,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:09:28,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:09:28,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:09:28,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 236 [2023-08-31 23:09:28,886 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 73 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-31 23:09:28,887 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:09:28,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 236 [2023-08-31 23:09:28,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:09:29,269 INFO L130 PetriNetUnfolder]: 1101/1677 cut-off events. [2023-08-31 23:09:29,269 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2023-08-31 23:09:29,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3350 conditions, 1677 events. 1101/1677 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 8083 event pairs, 1101 based on Foata normal form. 0/1421 useless extension candidates. Maximal degree in co-relation 3339. Up to 1637 conditions per place. [2023-08-31 23:09:29,286 INFO L137 encePairwiseOnDemand]: 229/236 looper letters, 22 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2023-08-31 23:09:29,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 103 flow [2023-08-31 23:09:29,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:09:29,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:09:29,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 247 transitions. [2023-08-31 23:09:29,302 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5233050847457628 [2023-08-31 23:09:29,302 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 247 transitions. [2023-08-31 23:09:29,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 247 transitions. [2023-08-31 23:09:29,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:09:29,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 247 transitions. [2023-08-31 23:09:29,311 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-31 23:09:29,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:29,317 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:29,319 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 73 flow. Second operand 2 states and 247 transitions. [2023-08-31 23:09:29,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 103 flow [2023-08-31 23:09:29,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 100 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:09:29,324 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 56 flow [2023-08-31 23:09:29,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, 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-31 23:09:29,329 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -8 predicate places. [2023-08-31 23:09:29,329 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 56 flow [2023-08-31 23:09:29,330 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-31 23:09:29,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:09:29,330 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:09:29,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-08-31 23:09:29,539 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-31 23:09:29,539 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:09:29,540 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:09:29,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1064623079, now seen corresponding path program 1 times [2023-08-31 23:09:29,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:09:29,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [227975848] [2023-08-31 23:09:29,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:09:29,542 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-31 23:09:29,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:09:29,543 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-31 23:09:29,546 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-31 23:09:29,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:09:29,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:09:29,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:09:29,674 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-31 23:09:29,674 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:09:29,674 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:09:29,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [227975848] [2023-08-31 23:09:29,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [227975848] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:09:29,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:09:29,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:09:29,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416616010] [2023-08-31 23:09:29,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:09:29,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:09:29,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:09:29,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:09:29,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:09:29,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 236 [2023-08-31 23:09:29,680 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.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:29,680 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:09:29,680 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 236 [2023-08-31 23:09:29,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:09:29,896 INFO L130 PetriNetUnfolder]: 910/1450 cut-off events. [2023-08-31 23:09:29,896 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:09:29,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2846 conditions, 1450 events. 910/1450 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 7357 event pairs, 146 based on Foata normal form. 0/1326 useless extension candidates. Maximal degree in co-relation 2843. Up to 1101 conditions per place. [2023-08-31 23:09:29,904 INFO L137 encePairwiseOnDemand]: 233/236 looper letters, 28 selfloop transitions, 2 changer transitions 2/35 dead transitions. [2023-08-31 23:09:29,904 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 140 flow [2023-08-31 23:09:29,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:09:29,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:09:29,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2023-08-31 23:09:29,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5042372881355932 [2023-08-31 23:09:29,913 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2023-08-31 23:09:29,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2023-08-31 23:09:29,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:09:29,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2023-08-31 23:09:29,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:29,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:29,920 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:29,920 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 56 flow. Second operand 3 states and 357 transitions. [2023-08-31 23:09:29,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 140 flow [2023-08-31 23:09:29,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 35 transitions, 140 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:09:29,922 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 56 flow [2023-08-31 23:09:29,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, 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-31 23:09:29,923 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2023-08-31 23:09:29,923 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 56 flow [2023-08-31 23:09:29,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:29,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:09:29,924 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:09:29,939 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-31 23:09:30,133 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-31 23:09:30,133 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:09:30,134 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:09:30,134 INFO L85 PathProgramCache]: Analyzing trace with hash -900502488, now seen corresponding path program 1 times [2023-08-31 23:09:30,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:09:30,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1280912992] [2023-08-31 23:09:30,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:09:30,135 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-31 23:09:30,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:09:30,139 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-31 23:09:30,140 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-31 23:09:30,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:09:30,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:09:30,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:09:30,280 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-31 23:09:30,281 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:09:30,281 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:09:30,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1280912992] [2023-08-31 23:09:30,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1280912992] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:09:30,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:09:30,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:09:30,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384994088] [2023-08-31 23:09:30,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:09:30,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:09:30,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:09:30,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:09:30,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:09:30,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 236 [2023-08-31 23:09:30,305 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 103.25) internal successors, (413), 4 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:30,305 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:09:30,305 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 236 [2023-08-31 23:09:30,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:09:30,522 INFO L130 PetriNetUnfolder]: 514/855 cut-off events. [2023-08-31 23:09:30,522 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2023-08-31 23:09:30,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1791 conditions, 855 events. 514/855 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4007 event pairs, 96 based on Foata normal form. 60/876 useless extension candidates. Maximal degree in co-relation 1787. Up to 609 conditions per place. [2023-08-31 23:09:30,526 INFO L137 encePairwiseOnDemand]: 230/236 looper letters, 29 selfloop transitions, 4 changer transitions 19/55 dead transitions. [2023-08-31 23:09:30,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 55 transitions, 234 flow [2023-08-31 23:09:30,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:09:30,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:09:30,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 559 transitions. [2023-08-31 23:09:30,529 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47372881355932206 [2023-08-31 23:09:30,529 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 559 transitions. [2023-08-31 23:09:30,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 559 transitions. [2023-08-31 23:09:30,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:09:30,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 559 transitions. [2023-08-31 23:09:30,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:30,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:30,535 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:30,535 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 56 flow. Second operand 5 states and 559 transitions. [2023-08-31 23:09:30,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 55 transitions, 234 flow [2023-08-31 23:09:30,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 55 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:09:30,538 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 88 flow [2023-08-31 23:09:30,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, 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-31 23:09:30,540 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2023-08-31 23:09:30,540 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 88 flow [2023-08-31 23:09:30,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.25) internal successors, (413), 4 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:30,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:09:30,541 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:09:30,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-08-31 23:09:30,749 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-31 23:09:30,750 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:09:30,752 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:09:30,752 INFO L85 PathProgramCache]: Analyzing trace with hash -402417035, now seen corresponding path program 1 times [2023-08-31 23:09:30,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:09:30,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1981335519] [2023-08-31 23:09:30,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:09:30,753 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:09:30,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:09:30,757 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-31 23:09:30,764 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-31 23:09:30,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:09:30,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:09:30,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:09:30,896 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-31 23:09:30,897 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:09:30,897 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:09:30,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1981335519] [2023-08-31 23:09:30,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1981335519] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:09:30,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:09:30,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:09:30,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437401564] [2023-08-31 23:09:30,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:09:30,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:09:30,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:09:30,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:09:30,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:09:30,921 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 236 [2023-08-31 23:09:30,922 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 103.2) internal successors, (516), 5 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:30,923 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:09:30,923 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 236 [2023-08-31 23:09:30,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:09:31,127 INFO L130 PetriNetUnfolder]: 208/395 cut-off events. [2023-08-31 23:09:31,128 INFO L131 PetriNetUnfolder]: For 149/149 co-relation queries the response was YES. [2023-08-31 23:09:31,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1074 conditions, 395 events. 208/395 cut-off events. For 149/149 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1626 event pairs, 44 based on Foata normal form. 36/418 useless extension candidates. Maximal degree in co-relation 1067. Up to 136 conditions per place. [2023-08-31 23:09:31,131 INFO L137 encePairwiseOnDemand]: 230/236 looper letters, 37 selfloop transitions, 7 changer transitions 19/66 dead transitions. [2023-08-31 23:09:31,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 66 transitions, 338 flow [2023-08-31 23:09:31,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:09:31,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:09:31,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 671 transitions. [2023-08-31 23:09:31,135 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4738700564971751 [2023-08-31 23:09:31,135 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 671 transitions. [2023-08-31 23:09:31,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 671 transitions. [2023-08-31 23:09:31,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:09:31,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 671 transitions. [2023-08-31 23:09:31,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 111.83333333333333) internal successors, (671), 6 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:31,139 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 236.0) internal successors, (1652), 7 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:31,140 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 236.0) internal successors, (1652), 7 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:31,140 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 88 flow. Second operand 6 states and 671 transitions. [2023-08-31 23:09:31,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 66 transitions, 338 flow [2023-08-31 23:09:31,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 66 transitions, 332 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-31 23:09:31,144 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 138 flow [2023-08-31 23:09:31,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, 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-31 23:09:31,144 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2023-08-31 23:09:31,145 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 138 flow [2023-08-31 23:09:31,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.2) internal successors, (516), 5 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:31,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:09:31,145 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:09:31,166 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-31 23:09:31,354 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-31 23:09:31,355 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:09:31,355 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:09:31,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1110781479, now seen corresponding path program 1 times [2023-08-31 23:09:31,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:09:31,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1057061769] [2023-08-31 23:09:31,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:09:31,356 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-31 23:09:31,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:09:31,357 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-31 23:09:31,360 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-31 23:09:31,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:09:31,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:09:31,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:09:31,500 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-31 23:09:31,500 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:09:31,501 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:09:31,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1057061769] [2023-08-31 23:09:31,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1057061769] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:09:31,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:09:31,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:09:31,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027118191] [2023-08-31 23:09:31,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:09:31,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:09:31,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:09:31,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:09:31,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:09:31,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 236 [2023-08-31 23:09:31,525 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 138 flow. Second operand has 6 states, 6 states have (on average 103.33333333333333) internal successors, (620), 6 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:31,525 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:09:31,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 236 [2023-08-31 23:09:31,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:09:31,743 INFO L130 PetriNetUnfolder]: 120/236 cut-off events. [2023-08-31 23:09:31,744 INFO L131 PetriNetUnfolder]: For 269/269 co-relation queries the response was YES. [2023-08-31 23:09:31,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 716 conditions, 236 events. 120/236 cut-off events. For 269/269 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 845 event pairs, 39 based on Foata normal form. 10/242 useless extension candidates. Maximal degree in co-relation 707. Up to 90 conditions per place. [2023-08-31 23:09:31,745 INFO L137 encePairwiseOnDemand]: 230/236 looper letters, 34 selfloop transitions, 10 changer transitions 10/57 dead transitions. [2023-08-31 23:09:31,745 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 57 transitions, 336 flow [2023-08-31 23:09:31,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:09:31,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:09:31,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 763 transitions. [2023-08-31 23:09:31,748 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.461864406779661 [2023-08-31 23:09:31,748 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 763 transitions. [2023-08-31 23:09:31,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 763 transitions. [2023-08-31 23:09:31,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:09:31,749 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 763 transitions. [2023-08-31 23:09:31,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 109.0) internal successors, (763), 7 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:31,753 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 236.0) internal successors, (1888), 8 states have internal predecessors, (1888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:31,753 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 236.0) internal successors, (1888), 8 states have internal predecessors, (1888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:31,754 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 138 flow. Second operand 7 states and 763 transitions. [2023-08-31 23:09:31,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 57 transitions, 336 flow [2023-08-31 23:09:31,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 57 transitions, 300 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-08-31 23:09:31,757 INFO L231 Difference]: Finished difference. Result has 45 places, 29 transitions, 140 flow [2023-08-31 23:09:31,758 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, 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-31 23:09:31,758 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2023-08-31 23:09:31,758 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 29 transitions, 140 flow [2023-08-31 23:09:31,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.33333333333333) internal successors, (620), 6 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:31,759 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:09:31,759 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:09:31,777 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-31 23:09:31,968 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-31 23:09:31,969 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:09:31,969 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:09:31,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1919695561, now seen corresponding path program 1 times [2023-08-31 23:09:31,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:09:31,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [567488729] [2023-08-31 23:09:31,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:09:31,970 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-31 23:09:31,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:09:31,971 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-31 23:09:31,974 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-31 23:09:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:09:32,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:09:32,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:09:32,125 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-31 23:09:32,125 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:09:32,126 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:09:32,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [567488729] [2023-08-31 23:09:32,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [567488729] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:09:32,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:09:32,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:09:32,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80996291] [2023-08-31 23:09:32,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:09:32,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:09:32,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:09:32,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:09:32,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:09:32,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 236 [2023-08-31 23:09:32,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 29 transitions, 140 flow. Second operand has 4 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-31 23:09:32,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:09:32,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 236 [2023-08-31 23:09:32,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:09:32,275 INFO L130 PetriNetUnfolder]: 151/321 cut-off events. [2023-08-31 23:09:32,276 INFO L131 PetriNetUnfolder]: For 456/456 co-relation queries the response was YES. [2023-08-31 23:09:32,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 928 conditions, 321 events. 151/321 cut-off events. For 456/456 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1418 event pairs, 20 based on Foata normal form. 0/319 useless extension candidates. Maximal degree in co-relation 918. Up to 173 conditions per place. [2023-08-31 23:09:32,278 INFO L137 encePairwiseOnDemand]: 233/236 looper letters, 55 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-08-31 23:09:32,278 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 59 transitions, 412 flow [2023-08-31 23:09:32,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:09:32,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:09:32,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 464 transitions. [2023-08-31 23:09:32,280 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4915254237288136 [2023-08-31 23:09:32,280 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 464 transitions. [2023-08-31 23:09:32,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 464 transitions. [2023-08-31 23:09:32,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:09:32,281 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 464 transitions. [2023-08-31 23:09:32,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:32,283 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:32,283 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:32,283 INFO L175 Difference]: Start difference. First operand has 45 places, 29 transitions, 140 flow. Second operand 4 states and 464 transitions. [2023-08-31 23:09:32,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 59 transitions, 412 flow [2023-08-31 23:09:32,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 59 transitions, 332 flow, removed 24 selfloop flow, removed 6 redundant places. [2023-08-31 23:09:32,286 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 115 flow [2023-08-31 23:09:32,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, 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-31 23:09:32,287 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2023-08-31 23:09:32,287 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 115 flow [2023-08-31 23:09:32,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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-31 23:09:32,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:09:32,288 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:09:32,306 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-31 23:09:32,503 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-31 23:09:32,504 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:09:32,504 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:09:32,504 INFO L85 PathProgramCache]: Analyzing trace with hash 2051879625, now seen corresponding path program 2 times [2023-08-31 23:09:32,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:09:32,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [59964435] [2023-08-31 23:09:32,504 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 23:09:32,504 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-31 23:09:32,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:09:32,506 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-31 23:09:32,506 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-31 23:09:32,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:09:32,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:09:32,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:09:32,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:09:32,629 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-31 23:09:32,629 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:09:32,629 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:09:32,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [59964435] [2023-08-31 23:09:32,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [59964435] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:09:32,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:09:32,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:09:32,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285257805] [2023-08-31 23:09:32,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:09:32,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:09:32,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:09:32,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:09:32,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:09:32,646 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 236 [2023-08-31 23:09:32,647 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 115 flow. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:32,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:09:32,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 236 [2023-08-31 23:09:32,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:09:32,774 INFO L130 PetriNetUnfolder]: 260/515 cut-off events. [2023-08-31 23:09:32,775 INFO L131 PetriNetUnfolder]: For 400/400 co-relation queries the response was YES. [2023-08-31 23:09:32,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1468 conditions, 515 events. 260/515 cut-off events. For 400/400 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2498 event pairs, 111 based on Foata normal form. 1/512 useless extension candidates. Maximal degree in co-relation 1459. Up to 295 conditions per place. [2023-08-31 23:09:32,778 INFO L137 encePairwiseOnDemand]: 233/236 looper letters, 47 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-08-31 23:09:32,778 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 52 transitions, 297 flow [2023-08-31 23:09:32,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:09:32,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:09:32,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2023-08-31 23:09:32,780 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5028248587570622 [2023-08-31 23:09:32,780 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 356 transitions. [2023-08-31 23:09:32,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 356 transitions. [2023-08-31 23:09:32,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:09:32,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 356 transitions. [2023-08-31 23:09:32,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:32,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:32,782 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:32,783 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 115 flow. Second operand 3 states and 356 transitions. [2023-08-31 23:09:32,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 52 transitions, 297 flow [2023-08-31 23:09:32,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 52 transitions, 296 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:09:32,786 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 126 flow [2023-08-31 23:09:32,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2023-08-31 23:09:32,786 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places. [2023-08-31 23:09:32,786 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 126 flow [2023-08-31 23:09:32,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:09:32,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:09:32,787 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:09:32,799 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-31 23:09:32,996 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-31 23:09:32,997 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:09:32,997 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:09:32,997 INFO L85 PathProgramCache]: Analyzing trace with hash 729544729, now seen corresponding path program 3 times [2023-08-31 23:09:32,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:09:32,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [21889852] [2023-08-31 23:09:32,998 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 23:09:32,998 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-31 23:09:32,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:09:32,999 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-31 23:09:33,002 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-31 23:09:33,100 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-31 23:09:33,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-31 23:09:33,101 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:09:33,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:09:33,247 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-31 23:09:33,248 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:09:33,249 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-31 23:09:33,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-31 23:09:33,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-31 23:09:33,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-31 23:09:33,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-31 23:09:33,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-31 23:09:33,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-31 23:09:33,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-31 23:09:33,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-31 23:09:33,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-31 23:09:33,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-31 23:09:33,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-31 23:09:33,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-31 23:09:33,266 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-31 23:09:33,463 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-31 23:09:33,463 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2023-08-31 23:09:33,467 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:09:33,467 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:09:33,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:09:33 BasicIcfg [2023-08-31 23:09:33,540 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:09:33,541 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:09:33,541 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:09:33,542 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:09:33,542 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:09:22" (3/4) ... [2023-08-31 23:09:33,547 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:09:33,547 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:09:33,548 INFO L158 Benchmark]: Toolchain (without parser) took 12055.64ms. Allocated memory was 65.0MB in the beginning and 132.1MB in the end (delta: 67.1MB). Free memory was 41.2MB in the beginning and 66.7MB in the end (delta: -25.5MB). Peak memory consumption was 42.6MB. Max. memory is 16.1GB. [2023-08-31 23:09:33,548 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 65.0MB. Free memory was 42.4MB in the beginning and 42.3MB in the end (delta: 49.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:09:33,549 INFO L158 Benchmark]: CACSL2BoogieTranslator took 535.89ms. Allocated memory was 65.0MB in the beginning and 88.1MB in the end (delta: 23.1MB). Free memory was 40.9MB in the beginning and 55.4MB in the end (delta: -14.5MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. [2023-08-31 23:09:33,549 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.00ms. Allocated memory is still 88.1MB. Free memory was 55.4MB in the beginning and 52.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:09:33,549 INFO L158 Benchmark]: Boogie Preprocessor took 60.45ms. Allocated memory is still 88.1MB. Free memory was 52.5MB in the beginning and 50.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:09:33,550 INFO L158 Benchmark]: RCFGBuilder took 748.10ms. Allocated memory is still 88.1MB. Free memory was 50.5MB in the beginning and 33.5MB in the end (delta: 17.0MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2023-08-31 23:09:33,550 INFO L158 Benchmark]: TraceAbstraction took 10620.45ms. Allocated memory was 88.1MB in the beginning and 132.1MB in the end (delta: 44.0MB). Free memory was 33.0MB in the beginning and 67.7MB in the end (delta: -34.7MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2023-08-31 23:09:33,550 INFO L158 Benchmark]: Witness Printer took 6.45ms. Allocated memory is still 132.1MB. Free memory was 67.7MB in the beginning and 66.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:09:33,552 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.10ms. Allocated memory is still 65.0MB. Free memory was 42.4MB in the beginning and 42.3MB in the end (delta: 49.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 535.89ms. Allocated memory was 65.0MB in the beginning and 88.1MB in the end (delta: 23.1MB). Free memory was 40.9MB in the beginning and 55.4MB in the end (delta: -14.5MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.00ms. Allocated memory is still 88.1MB. Free memory was 55.4MB in the beginning and 52.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.45ms. Allocated memory is still 88.1MB. Free memory was 52.5MB in the beginning and 50.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 748.10ms. Allocated memory is still 88.1MB. Free memory was 50.5MB in the beginning and 33.5MB in the end (delta: 17.0MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. * TraceAbstraction took 10620.45ms. Allocated memory was 88.1MB in the beginning and 132.1MB in the end (delta: 44.0MB). Free memory was 33.0MB in the beginning and 67.7MB in the end (delta: -34.7MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. * Witness Printer took 6.45ms. Allocated memory is still 132.1MB. Free memory was 67.7MB in the beginning and 66.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.6s, 126 PlacesBefore, 41 PlacesAfterwards, 118 TransitionsBefore, 32 TransitionsAfterwards, 2068 CoEnabledTransitionPairs, 7 FixpointIterations, 50 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 115 TotalNumberOfCompositions, 5522 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2685, independent: 2501, independent conditional: 0, independent unconditional: 2501, dependent: 184, dependent conditional: 0, dependent unconditional: 184, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1131, independent: 1096, independent conditional: 0, independent unconditional: 1096, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2685, independent: 1405, independent conditional: 0, independent unconditional: 1405, dependent: 149, dependent conditional: 0, dependent unconditional: 149, unknown: 1131, unknown conditional: 0, unknown unconditional: 1131] , Statistics on independence cache: Total cache size (in pairs): 102, Positive cache size: 87, Positive conditional cache size: 0, Positive unconditional cache size: 87, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff0_thd3; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L846] 0 pthread_t t156; [L847] FCALL, FORK 0 pthread_create(&t156, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t156, ((void *)0), P0, ((void *)0))=1024, t156={-8198:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L848] 0 pthread_t t157; [L849] FCALL, FORK 0 pthread_create(&t157, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t157, ((void *)0), P1, ((void *)0))=1025, t156={-8198:0}, t157={-8202:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L850] 0 pthread_t t158; [L851] FCALL, FORK 0 pthread_create(&t158, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t158, ((void *)0), P2, ((void *)0))=1026, t156={-8198:0}, t157={-8202:0}, t158={-8194:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L793] 3 y$w_buff1 = y$w_buff0 [L794] 3 y$w_buff0 = 1 [L795] 3 y$w_buff1_used = y$w_buff0_used [L796] 3 y$w_buff0_used = (_Bool)1 [L797] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L797] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L798] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L799] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L800] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L801] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L802] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 y$flush_delayed = weak$$choice2 [L808] 3 y$mem_tmp = y [L809] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L810] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L811] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L812] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L813] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L815] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EAX = y [L817] 3 y = y$flush_delayed ? y$mem_tmp : y [L818] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L821] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L747] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L750] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L762] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L765] 2 __unbuffered_p1_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L768] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L769] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L770] 2 y$flush_delayed = weak$$choice2 [L771] 2 y$mem_tmp = y [L772] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L773] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L774] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L775] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L776] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L778] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 __unbuffered_p1_EBX = y [L780] 2 y = y$flush_delayed ? y$mem_tmp : y [L781] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L824] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L825] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L826] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L827] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L828] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L786] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 2 return 0; [L831] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 3 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L861] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t156={-8198:0}, t157={-8202:0}, t158={-8194:0}, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L864] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L866] 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=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 844]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 148 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: 10.4s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 180 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 160 mSDsluCounter, 20 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 689 IncrementalHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 2 mSDtfsCounter, 689 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=140occurred in iteration=5, InterpolantAutomatonStates: 30, 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.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 108 NumberOfCodeBlocks, 108 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 80 ConstructedInterpolants, 0 QuantifiedInterpolants, 200 SizeOfPredicates, 10 NumberOfNonLiveVariables, 786 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-31 23:09:33,581 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