./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix055_power.oepc_pso.oepc_rmo.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix055_power.oepc_pso.oepc_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b8efebf87dc67f98045ac231dc43d6a61f436e058244f16134f1d46d3b696c80 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 20:30:25,327 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:30:25,329 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:30:25,374 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:30:25,376 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:30:25,379 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:30:25,380 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:30:25,383 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:30:25,385 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:30:25,389 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:30:25,390 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:30:25,392 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:30:25,392 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:30:25,394 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:30:25,395 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:30:25,399 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:30:25,401 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:30:25,403 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:30:25,405 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:30:25,409 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:30:25,411 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:30:25,413 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:30:25,414 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:30:25,415 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:30:25,421 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:30:25,422 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:30:25,422 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:30:25,423 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:30:25,424 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:30:25,425 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:30:25,425 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:30:25,431 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:30:25,432 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:30:25,433 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:30:25,434 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:30:25,434 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:30:25,435 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:30:25,435 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:30:25,435 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:30:25,443 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:30:25,444 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:30:25,445 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-29 20:30:25,476 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:30:25,477 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:30:25,478 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:30:25,478 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:30:25,479 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:30:25,479 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:30:25,479 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:30:25,479 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:30:25,480 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:30:25,480 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:30:25,481 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:30:25,481 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:30:25,481 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:30:25,481 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:30:25,481 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:30:25,481 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:30:25,482 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:30:25,482 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:30:25,482 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:30:25,482 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:30:25,482 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:30:25,482 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:30:25,483 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:30:25,483 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:30:25,483 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:30:25,483 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:30:25,483 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:30:25,483 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:30:25,484 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 20:30:25,484 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 20:30:25,484 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:30:25,484 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:30:25,484 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:30:25,485 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:30:25,485 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 -> b8efebf87dc67f98045ac231dc43d6a61f436e058244f16134f1d46d3b696c80 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-29 20:30:25,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:30:25,792 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:30:25,794 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:30:25,794 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:30:25,795 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:30:25,796 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_power.oepc_pso.oepc_rmo.oepc.i [2023-08-29 20:30:26,911 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:30:27,148 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:30:27,161 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_power.oepc_pso.oepc_rmo.oepc.i [2023-08-29 20:30:27,179 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08c7624be/bf0d3f5e6438430abd0d5fe06d3853fa/FLAG3e0b0ac36 [2023-08-29 20:30:27,191 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08c7624be/bf0d3f5e6438430abd0d5fe06d3853fa [2023-08-29 20:30:27,192 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:30:27,193 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:30:27,194 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:30:27,194 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:30:27,198 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:30:27,199 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:30:27" (1/1) ... [2023-08-29 20:30:27,200 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10a6a14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:27, skipping insertion in model container [2023-08-29 20:30:27,200 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:30:27" (1/1) ... [2023-08-29 20:30:27,205 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:30:27,249 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:30:27,399 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/mix055_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-29 20:30:27,622 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:30:27,636 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:30:27,649 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/mix055_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-29 20:30:27,713 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:30:27,748 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:30:27,751 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:30:27,757 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:30:27,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:27 WrapperNode [2023-08-29 20:30:27,758 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:30:27,759 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:30:27,759 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:30:27,760 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:30:27,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:27" (1/1) ... [2023-08-29 20:30:27,796 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:27" (1/1) ... [2023-08-29 20:30:27,841 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2023-08-29 20:30:27,841 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:30:27,842 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:30:27,842 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:30:27,843 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:30:27,851 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:27" (1/1) ... [2023-08-29 20:30:27,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:27" (1/1) ... [2023-08-29 20:30:27,866 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:27" (1/1) ... [2023-08-29 20:30:27,867 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:27" (1/1) ... [2023-08-29 20:30:27,890 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:27" (1/1) ... [2023-08-29 20:30:27,892 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:27" (1/1) ... [2023-08-29 20:30:27,893 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:27" (1/1) ... [2023-08-29 20:30:27,906 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:27" (1/1) ... [2023-08-29 20:30:27,909 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:30:27,910 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:30:27,910 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:30:27,910 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:30:27,911 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:27" (1/1) ... [2023-08-29 20:30:27,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:30:27,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:30:27,946 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-29 20:30:27,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-29 20:30:27,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 20:30:27,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:30:27,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:30:27,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:30:27,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:30:27,988 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:30:27,988 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:30:27,988 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:30:27,988 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:30:27,988 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:30:27,989 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:30:27,989 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-29 20:30:27,989 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-29 20:30:27,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 20:30:27,989 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:30:27,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:30:27,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:30:27,991 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 20:30:28,177 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:30:28,179 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:30:28,604 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:30:28,703 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:30:28,703 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:30:28,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:30:28 BoogieIcfgContainer [2023-08-29 20:30:28,706 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:30:28,707 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:30:28,707 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:30:28,710 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:30:28,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:30:27" (1/3) ... [2023-08-29 20:30:28,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11e77e4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:30:28, skipping insertion in model container [2023-08-29 20:30:28,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:30:27" (2/3) ... [2023-08-29 20:30:28,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11e77e4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:30:28, skipping insertion in model container [2023-08-29 20:30:28,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:30:28" (3/3) ... [2023-08-29 20:30:28,712 INFO L112 eAbstractionObserver]: Analyzing ICFG mix055_power.oepc_pso.oepc_rmo.oepc.i [2023-08-29 20:30:28,732 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:30:28,733 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-29 20:30:28,733 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:30:28,781 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:30:28,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 140 transitions, 300 flow [2023-08-29 20:30:28,938 INFO L130 PetriNetUnfolder]: 2/136 cut-off events. [2023-08-29 20:30:28,939 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:30:28,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 136 events. 2/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-29 20:30:28,945 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 140 transitions, 300 flow [2023-08-29 20:30:28,950 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 136 transitions, 284 flow [2023-08-29 20:30:28,954 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:30:28,966 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 136 transitions, 284 flow [2023-08-29 20:30:28,972 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 136 transitions, 284 flow [2023-08-29 20:30:28,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 136 transitions, 284 flow [2023-08-29 20:30:28,997 INFO L130 PetriNetUnfolder]: 2/136 cut-off events. [2023-08-29 20:30:28,998 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:30:28,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 136 events. 2/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 102 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-29 20:30:29,004 INFO L119 LiptonReduction]: Number of co-enabled transitions 3412 [2023-08-29 20:30:33,721 INFO L134 LiptonReduction]: Checked pairs total: 9977 [2023-08-29 20:30:33,721 INFO L136 LiptonReduction]: Total number of compositions: 131 [2023-08-29 20:30:33,733 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:30:33,738 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;@33c2a788, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:30:33,738 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-29 20:30:33,740 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:30:33,740 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:30:33,740 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:33,740 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:30:33,741 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:30:33,744 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:33,744 INFO L85 PathProgramCache]: Analyzing trace with hash 597, now seen corresponding path program 1 times [2023-08-29 20:30:33,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:33,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096037096] [2023-08-29 20:30:33,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:33,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:33,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:33,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:33,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:30:33,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096037096] [2023-08-29 20:30:33,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096037096] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:33,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:33,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:30:33,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846490015] [2023-08-29 20:30:33,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:33,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:30:33,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:30:33,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:30:33,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:30:33,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 271 [2023-08-29 20:30:33,879 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 92 flow. Second operand has 2 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:33,880 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:33,880 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 271 [2023-08-29 20:30:33,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:35,336 INFO L130 PetriNetUnfolder]: 8719/11751 cut-off events. [2023-08-29 20:30:35,336 INFO L131 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2023-08-29 20:30:35,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23699 conditions, 11751 events. 8719/11751 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 59618 event pairs, 8719 based on Foata normal form. 0/10324 useless extension candidates. Maximal degree in co-relation 23687. Up to 11731 conditions per place. [2023-08-29 20:30:35,407 INFO L137 encePairwiseOnDemand]: 262/271 looper letters, 28 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2023-08-29 20:30:35,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 130 flow [2023-08-29 20:30:35,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:30:35,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:30:35,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 287 transitions. [2023-08-29 20:30:35,416 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5295202952029521 [2023-08-29 20:30:35,417 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 287 transitions. [2023-08-29 20:30:35,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 287 transitions. [2023-08-29 20:30:35,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:35,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 287 transitions. [2023-08-29 20:30:35,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 143.5) internal successors, (287), 2 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:35,425 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 271.0) internal successors, (813), 3 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:35,426 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 271.0) internal successors, (813), 3 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:35,427 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 92 flow. Second operand 2 states and 287 transitions. [2023-08-29 20:30:35,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 130 flow [2023-08-29 20:30:35,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 126 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 20:30:35,436 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 70 flow [2023-08-29 20:30:35,437 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2023-08-29 20:30:35,440 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2023-08-29 20:30:35,440 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 70 flow [2023-08-29 20:30:35,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:35,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:35,441 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 20:30:35,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 20:30:35,442 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:30:35,442 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:35,443 INFO L85 PathProgramCache]: Analyzing trace with hash 585579, now seen corresponding path program 1 times [2023-08-29 20:30:35,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:35,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412421520] [2023-08-29 20:30:35,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:35,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:35,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:35,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:35,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:30:35,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412421520] [2023-08-29 20:30:35,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412421520] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:35,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:35,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:30:35,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539612107] [2023-08-29 20:30:35,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:35,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:30:35,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:30:35,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:30:35,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:30:35,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 271 [2023-08-29 20:30:35,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:35,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:35,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 271 [2023-08-29 20:30:35,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:36,871 INFO L130 PetriNetUnfolder]: 6855/9422 cut-off events. [2023-08-29 20:30:36,871 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:30:36,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18859 conditions, 9422 events. 6855/9422 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 48209 event pairs, 2603 based on Foata normal form. 0/8777 useless extension candidates. Maximal degree in co-relation 18856. Up to 7399 conditions per place. [2023-08-29 20:30:36,916 INFO L137 encePairwiseOnDemand]: 268/271 looper letters, 45 selfloop transitions, 2 changer transitions 2/52 dead transitions. [2023-08-29 20:30:36,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 52 transitions, 216 flow [2023-08-29 20:30:36,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:30:36,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:30:36,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2023-08-29 20:30:36,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5190651906519065 [2023-08-29 20:30:36,919 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 422 transitions. [2023-08-29 20:30:36,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 422 transitions. [2023-08-29 20:30:36,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:36,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 422 transitions. [2023-08-29 20:30:36,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:36,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:36,924 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:36,924 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 70 flow. Second operand 3 states and 422 transitions. [2023-08-29 20:30:36,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 52 transitions, 216 flow [2023-08-29 20:30:36,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 52 transitions, 216 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:30:36,926 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 70 flow [2023-08-29 20:30:36,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-08-29 20:30:36,926 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2023-08-29 20:30:36,927 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 70 flow [2023-08-29 20:30:36,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:36,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:36,927 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:30:36,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 20:30:36,928 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:30:36,928 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:36,928 INFO L85 PathProgramCache]: Analyzing trace with hash -131906618, now seen corresponding path program 1 times [2023-08-29 20:30:36,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:36,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469572784] [2023-08-29 20:30:36,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:36,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:37,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:37,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:37,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:30:37,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469572784] [2023-08-29 20:30:37,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469572784] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:37,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:37,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:30:37,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343574402] [2023-08-29 20:30:37,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:37,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:30:37,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:30:37,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:30:37,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:30:37,356 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 271 [2023-08-29 20:30:37,357 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:37,357 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:37,358 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 271 [2023-08-29 20:30:37,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:39,938 INFO L130 PetriNetUnfolder]: 21370/28814 cut-off events. [2023-08-29 20:30:39,938 INFO L131 PetriNetUnfolder]: For 1358/1358 co-relation queries the response was YES. [2023-08-29 20:30:39,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59496 conditions, 28814 events. 21370/28814 cut-off events. For 1358/1358 co-relation queries the response was YES. Maximal size of possible extension queue 974. Compared 155174 event pairs, 7502 based on Foata normal form. 0/28214 useless extension candidates. Maximal degree in co-relation 59492. Up to 15875 conditions per place. [2023-08-29 20:30:40,079 INFO L137 encePairwiseOnDemand]: 262/271 looper letters, 45 selfloop transitions, 8 changer transitions 0/53 dead transitions. [2023-08-29 20:30:40,080 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 53 transitions, 230 flow [2023-08-29 20:30:40,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:30:40,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:30:40,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 402 transitions. [2023-08-29 20:30:40,082 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4944649446494465 [2023-08-29 20:30:40,082 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 402 transitions. [2023-08-29 20:30:40,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 402 transitions. [2023-08-29 20:30:40,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:40,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 402 transitions. [2023-08-29 20:30:40,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.0) internal successors, (402), 3 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-29 20:30:40,085 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:40,086 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:40,086 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 3 states and 402 transitions. [2023-08-29 20:30:40,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 53 transitions, 230 flow [2023-08-29 20:30:40,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 53 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:30:40,089 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 128 flow [2023-08-29 20:30:40,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2023-08-29 20:30:40,090 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -9 predicate places. [2023-08-29 20:30:40,094 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 128 flow [2023-08-29 20:30:40,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:40,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:40,095 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:30:40,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 20:30:40,095 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:30:40,095 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:40,096 INFO L85 PathProgramCache]: Analyzing trace with hash 205860737, now seen corresponding path program 1 times [2023-08-29 20:30:40,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:40,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419905454] [2023-08-29 20:30:40,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:40,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:40,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:40,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:40,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:30:40,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419905454] [2023-08-29 20:30:40,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419905454] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:40,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:40,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:30:40,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559019536] [2023-08-29 20:30:40,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:40,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:30:40,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:30:40,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:30:40,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:30:40,369 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 271 [2023-08-29 20:30:40,370 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:40,370 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:40,372 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 271 [2023-08-29 20:30:40,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:42,564 INFO L130 PetriNetUnfolder]: 21112/28468 cut-off events. [2023-08-29 20:30:42,564 INFO L131 PetriNetUnfolder]: For 11405/11405 co-relation queries the response was YES. [2023-08-29 20:30:42,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72020 conditions, 28468 events. 21112/28468 cut-off events. For 11405/11405 co-relation queries the response was YES. Maximal size of possible extension queue 959. Compared 152166 event pairs, 1907 based on Foata normal form. 40/28508 useless extension candidates. Maximal degree in co-relation 72015. Up to 14713 conditions per place. [2023-08-29 20:30:42,747 INFO L137 encePairwiseOnDemand]: 262/271 looper letters, 61 selfloop transitions, 12 changer transitions 0/73 dead transitions. [2023-08-29 20:30:42,748 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 73 transitions, 386 flow [2023-08-29 20:30:42,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:30:42,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:30:42,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 533 transitions. [2023-08-29 20:30:42,754 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49169741697416974 [2023-08-29 20:30:42,755 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 533 transitions. [2023-08-29 20:30:42,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 533 transitions. [2023-08-29 20:30:42,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:42,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 533 transitions. [2023-08-29 20:30:42,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:42,759 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 271.0) internal successors, (1355), 5 states have internal predecessors, (1355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:42,759 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 271.0) internal successors, (1355), 5 states have internal predecessors, (1355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:42,760 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 128 flow. Second operand 4 states and 533 transitions. [2023-08-29 20:30:42,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 73 transitions, 386 flow [2023-08-29 20:30:42,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 73 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:30:42,799 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 206 flow [2023-08-29 20:30:42,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=206, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2023-08-29 20:30:42,801 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2023-08-29 20:30:42,801 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 206 flow [2023-08-29 20:30:42,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:42,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:42,802 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:30:42,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 20:30:42,802 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:30:42,803 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:42,803 INFO L85 PathProgramCache]: Analyzing trace with hash 205860706, now seen corresponding path program 1 times [2023-08-29 20:30:42,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:42,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319582179] [2023-08-29 20:30:42,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:42,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:42,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:42,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:42,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:30:42,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319582179] [2023-08-29 20:30:42,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319582179] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:42,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:42,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:30:42,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045497900] [2023-08-29 20:30:42,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:42,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:30:43,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:30:43,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:30:43,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:30:43,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 271 [2023-08-29 20:30:43,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 206 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:43,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:43,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 271 [2023-08-29 20:30:43,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:45,311 INFO L130 PetriNetUnfolder]: 18664/25815 cut-off events. [2023-08-29 20:30:45,311 INFO L131 PetriNetUnfolder]: For 20314/20562 co-relation queries the response was YES. [2023-08-29 20:30:45,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68215 conditions, 25815 events. 18664/25815 cut-off events. For 20314/20562 co-relation queries the response was YES. Maximal size of possible extension queue 1002. Compared 147104 event pairs, 8546 based on Foata normal form. 190/25817 useless extension candidates. Maximal degree in co-relation 68208. Up to 23515 conditions per place. [2023-08-29 20:30:45,528 INFO L137 encePairwiseOnDemand]: 267/271 looper letters, 57 selfloop transitions, 6 changer transitions 0/70 dead transitions. [2023-08-29 20:30:45,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 70 transitions, 438 flow [2023-08-29 20:30:45,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:30:45,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:30:45,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 414 transitions. [2023-08-29 20:30:45,531 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5092250922509225 [2023-08-29 20:30:45,531 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 414 transitions. [2023-08-29 20:30:45,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 414 transitions. [2023-08-29 20:30:45,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:45,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 414 transitions. [2023-08-29 20:30:45,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:45,535 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:45,536 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:45,536 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 206 flow. Second operand 3 states and 414 transitions. [2023-08-29 20:30:45,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 70 transitions, 438 flow [2023-08-29 20:30:45,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 70 transitions, 438 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:30:45,604 INFO L231 Difference]: Finished difference. Result has 50 places, 49 transitions, 266 flow [2023-08-29 20:30:45,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=266, PETRI_PLACES=50, PETRI_TRANSITIONS=49} [2023-08-29 20:30:45,607 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2023-08-29 20:30:45,607 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 49 transitions, 266 flow [2023-08-29 20:30:45,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:45,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:45,608 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:30:45,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 20:30:45,608 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:30:45,609 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:45,609 INFO L85 PathProgramCache]: Analyzing trace with hash 205862943, now seen corresponding path program 1 times [2023-08-29 20:30:45,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:45,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152244826] [2023-08-29 20:30:45,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:45,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:45,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:46,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:46,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:30:46,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152244826] [2023-08-29 20:30:46,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152244826] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:46,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:46,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:30:46,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935540658] [2023-08-29 20:30:46,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:46,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:30:46,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:30:46,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:30:46,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:30:46,466 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 271 [2023-08-29 20:30:46,467 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 49 transitions, 266 flow. Second operand has 7 states, 7 states have (on average 108.71428571428571) internal successors, (761), 7 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:46,467 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:46,467 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 271 [2023-08-29 20:30:46,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:48,521 INFO L130 PetriNetUnfolder]: 14128/19697 cut-off events. [2023-08-29 20:30:48,521 INFO L131 PetriNetUnfolder]: For 20545/21630 co-relation queries the response was YES. [2023-08-29 20:30:48,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54808 conditions, 19697 events. 14128/19697 cut-off events. For 20545/21630 co-relation queries the response was YES. Maximal size of possible extension queue 873. Compared 112810 event pairs, 4109 based on Foata normal form. 1413/20639 useless extension candidates. Maximal degree in co-relation 54799. Up to 13550 conditions per place. [2023-08-29 20:30:48,678 INFO L137 encePairwiseOnDemand]: 265/271 looper letters, 51 selfloop transitions, 4 changer transitions 25/92 dead transitions. [2023-08-29 20:30:48,678 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 92 transitions, 624 flow [2023-08-29 20:30:48,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:30:48,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:30:48,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 806 transitions. [2023-08-29 20:30:48,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4248813916710596 [2023-08-29 20:30:48,682 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 806 transitions. [2023-08-29 20:30:48,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 806 transitions. [2023-08-29 20:30:48,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:48,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 806 transitions. [2023-08-29 20:30:48,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.14285714285714) internal successors, (806), 7 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:48,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 271.0) internal successors, (2168), 8 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:48,689 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 271.0) internal successors, (2168), 8 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:48,689 INFO L175 Difference]: Start difference. First operand has 50 places, 49 transitions, 266 flow. Second operand 7 states and 806 transitions. [2023-08-29 20:30:48,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 92 transitions, 624 flow [2023-08-29 20:30:48,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 92 transitions, 612 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:30:48,739 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 248 flow [2023-08-29 20:30:48,739 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=248, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2023-08-29 20:30:48,739 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 2 predicate places. [2023-08-29 20:30:48,740 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 248 flow [2023-08-29 20:30:48,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.71428571428571) internal successors, (761), 7 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:48,740 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:48,741 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:30:48,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 20:30:48,741 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:30:48,741 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:48,741 INFO L85 PathProgramCache]: Analyzing trace with hash 87252896, now seen corresponding path program 1 times [2023-08-29 20:30:48,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:48,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322229691] [2023-08-29 20:30:48,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:48,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:48,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:48,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:48,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:30:48,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322229691] [2023-08-29 20:30:48,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322229691] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:48,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:48,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:30:48,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450006341] [2023-08-29 20:30:48,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:48,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:30:48,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:30:48,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:30:48,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:30:48,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 271 [2023-08-29 20:30:48,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 248 flow. Second operand has 4 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:48,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:48,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 271 [2023-08-29 20:30:48,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:49,989 INFO L130 PetriNetUnfolder]: 8683/12753 cut-off events. [2023-08-29 20:30:49,989 INFO L131 PetriNetUnfolder]: For 13018/13772 co-relation queries the response was YES. [2023-08-29 20:30:50,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33529 conditions, 12753 events. 8683/12753 cut-off events. For 13018/13772 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 77698 event pairs, 1433 based on Foata normal form. 1143/13653 useless extension candidates. Maximal degree in co-relation 33520. Up to 8038 conditions per place. [2023-08-29 20:30:50,063 INFO L137 encePairwiseOnDemand]: 264/271 looper letters, 94 selfloop transitions, 10 changer transitions 0/116 dead transitions. [2023-08-29 20:30:50,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 116 transitions, 796 flow [2023-08-29 20:30:50,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:30:50,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:30:50,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 667 transitions. [2023-08-29 20:30:50,066 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4922509225092251 [2023-08-29 20:30:50,066 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 667 transitions. [2023-08-29 20:30:50,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 667 transitions. [2023-08-29 20:30:50,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:50,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 667 transitions. [2023-08-29 20:30:50,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.4) internal successors, (667), 5 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:50,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 271.0) internal successors, (1626), 6 states have internal predecessors, (1626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:50,071 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 271.0) internal successors, (1626), 6 states have internal predecessors, (1626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:50,071 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 248 flow. Second operand 5 states and 667 transitions. [2023-08-29 20:30:50,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 116 transitions, 796 flow [2023-08-29 20:30:50,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 116 transitions, 784 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 20:30:50,086 INFO L231 Difference]: Finished difference. Result has 55 places, 54 transitions, 316 flow [2023-08-29 20:30:50,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=316, PETRI_PLACES=55, PETRI_TRANSITIONS=54} [2023-08-29 20:30:50,087 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2023-08-29 20:30:50,087 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 54 transitions, 316 flow [2023-08-29 20:30:50,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:50,088 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:50,088 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:30:50,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 20:30:50,088 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:30:50,089 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:50,089 INFO L85 PathProgramCache]: Analyzing trace with hash -2038249608, now seen corresponding path program 1 times [2023-08-29 20:30:50,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:50,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970386716] [2023-08-29 20:30:50,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:50,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:50,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:50,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:50,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:30:50,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970386716] [2023-08-29 20:30:50,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970386716] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:50,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:50,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:30:50,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755344665] [2023-08-29 20:30:50,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:50,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:30:50,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:30:50,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:30:50,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:30:50,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 271 [2023-08-29 20:30:50,278 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 54 transitions, 316 flow. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:50,278 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:50,278 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 271 [2023-08-29 20:30:50,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:51,774 INFO L130 PetriNetUnfolder]: 12942/19032 cut-off events. [2023-08-29 20:30:51,774 INFO L131 PetriNetUnfolder]: For 27272/27568 co-relation queries the response was YES. [2023-08-29 20:30:51,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63334 conditions, 19032 events. 12942/19032 cut-off events. For 27272/27568 co-relation queries the response was YES. Maximal size of possible extension queue 899. Compared 121582 event pairs, 6200 based on Foata normal form. 364/19120 useless extension candidates. Maximal degree in co-relation 63322. Up to 9855 conditions per place. [2023-08-29 20:30:51,887 INFO L137 encePairwiseOnDemand]: 268/271 looper letters, 64 selfloop transitions, 7 changer transitions 9/86 dead transitions. [2023-08-29 20:30:51,887 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 86 transitions, 629 flow [2023-08-29 20:30:51,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:30:51,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:30:51,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2023-08-29 20:30:51,889 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5067650676506765 [2023-08-29 20:30:51,889 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 412 transitions. [2023-08-29 20:30:51,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 412 transitions. [2023-08-29 20:30:51,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:51,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 412 transitions. [2023-08-29 20:30:51,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:51,892 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:51,893 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:51,893 INFO L175 Difference]: Start difference. First operand has 55 places, 54 transitions, 316 flow. Second operand 3 states and 412 transitions. [2023-08-29 20:30:51,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 86 transitions, 629 flow [2023-08-29 20:30:51,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 86 transitions, 620 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:30:51,961 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 310 flow [2023-08-29 20:30:51,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=310, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2023-08-29 20:30:51,963 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2023-08-29 20:30:51,963 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 310 flow [2023-08-29 20:30:51,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:51,964 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:51,964 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:30:51,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 20:30:51,964 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:30:51,965 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:51,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1080191955, now seen corresponding path program 1 times [2023-08-29 20:30:51,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:51,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806047491] [2023-08-29 20:30:51,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:51,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:51,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:52,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:52,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:30:52,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806047491] [2023-08-29 20:30:52,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806047491] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:52,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:52,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:30:52,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316573025] [2023-08-29 20:30:52,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:52,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:30:52,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:30:52,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:30:52,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:30:52,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 271 [2023-08-29 20:30:52,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 310 flow. Second operand has 5 states, 5 states have (on average 122.0) internal successors, (610), 5 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:52,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:52,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 271 [2023-08-29 20:30:52,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:53,391 INFO L130 PetriNetUnfolder]: 8501/12977 cut-off events. [2023-08-29 20:30:53,392 INFO L131 PetriNetUnfolder]: For 18544/19084 co-relation queries the response was YES. [2023-08-29 20:30:53,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42317 conditions, 12977 events. 8501/12977 cut-off events. For 18544/19084 co-relation queries the response was YES. Maximal size of possible extension queue 658. Compared 85798 event pairs, 954 based on Foata normal form. 1033/13733 useless extension candidates. Maximal degree in co-relation 42304. Up to 4410 conditions per place. [2023-08-29 20:30:53,464 INFO L137 encePairwiseOnDemand]: 264/271 looper letters, 127 selfloop transitions, 17 changer transitions 1/155 dead transitions. [2023-08-29 20:30:53,464 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 155 transitions, 1193 flow [2023-08-29 20:30:53,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:30:53,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:30:53,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 934 transitions. [2023-08-29 20:30:53,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49235635213494994 [2023-08-29 20:30:53,467 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 934 transitions. [2023-08-29 20:30:53,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 934 transitions. [2023-08-29 20:30:53,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:53,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 934 transitions. [2023-08-29 20:30:53,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 133.42857142857142) internal successors, (934), 7 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:53,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 271.0) internal successors, (2168), 8 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:53,473 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 271.0) internal successors, (2168), 8 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:53,473 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 310 flow. Second operand 7 states and 934 transitions. [2023-08-29 20:30:53,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 155 transitions, 1193 flow [2023-08-29 20:30:53,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 155 transitions, 1102 flow, removed 16 selfloop flow, removed 2 redundant places. [2023-08-29 20:30:53,550 INFO L231 Difference]: Finished difference. Result has 64 places, 59 transitions, 414 flow [2023-08-29 20:30:53,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=414, PETRI_PLACES=64, PETRI_TRANSITIONS=59} [2023-08-29 20:30:53,551 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 12 predicate places. [2023-08-29 20:30:53,551 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 59 transitions, 414 flow [2023-08-29 20:30:53,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.0) internal successors, (610), 5 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:53,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:53,551 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:30:53,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 20:30:53,552 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:30:53,552 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:53,552 INFO L85 PathProgramCache]: Analyzing trace with hash -662842324, now seen corresponding path program 1 times [2023-08-29 20:30:53,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:53,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26145007] [2023-08-29 20:30:53,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:53,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:53,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:53,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:53,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:30:53,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26145007] [2023-08-29 20:30:53,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26145007] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:53,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:53,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:30:53,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966062413] [2023-08-29 20:30:53,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:53,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:30:53,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:30:53,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:30:53,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:30:53,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 271 [2023-08-29 20:30:53,760 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 59 transitions, 414 flow. Second operand has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:53,760 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:53,760 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 271 [2023-08-29 20:30:53,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:55,303 INFO L130 PetriNetUnfolder]: 12560/19107 cut-off events. [2023-08-29 20:30:55,303 INFO L131 PetriNetUnfolder]: For 43912/44174 co-relation queries the response was YES. [2023-08-29 20:30:55,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73479 conditions, 19107 events. 12560/19107 cut-off events. For 43912/44174 co-relation queries the response was YES. Maximal size of possible extension queue 936. Compared 130384 event pairs, 4529 based on Foata normal form. 238/18977 useless extension candidates. Maximal degree in co-relation 73463. Up to 9533 conditions per place. [2023-08-29 20:30:55,424 INFO L137 encePairwiseOnDemand]: 268/271 looper letters, 69 selfloop transitions, 6 changer transitions 12/93 dead transitions. [2023-08-29 20:30:55,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 93 transitions, 831 flow [2023-08-29 20:30:55,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:30:55,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:30:55,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 408 transitions. [2023-08-29 20:30:55,425 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5018450184501845 [2023-08-29 20:30:55,426 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 408 transitions. [2023-08-29 20:30:55,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 408 transitions. [2023-08-29 20:30:55,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:55,426 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 408 transitions. [2023-08-29 20:30:55,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:55,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:55,429 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:55,429 INFO L175 Difference]: Start difference. First operand has 64 places, 59 transitions, 414 flow. Second operand 3 states and 408 transitions. [2023-08-29 20:30:55,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 93 transitions, 831 flow [2023-08-29 20:30:56,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 93 transitions, 737 flow, removed 34 selfloop flow, removed 3 redundant places. [2023-08-29 20:30:56,365 INFO L231 Difference]: Finished difference. Result has 64 places, 57 transitions, 370 flow [2023-08-29 20:30:56,365 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=370, PETRI_PLACES=64, PETRI_TRANSITIONS=57} [2023-08-29 20:30:56,366 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 12 predicate places. [2023-08-29 20:30:56,366 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 370 flow [2023-08-29 20:30:56,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:56,366 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:56,366 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:30:56,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 20:30:56,367 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:30:56,367 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:56,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1305346602, now seen corresponding path program 1 times [2023-08-29 20:30:56,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:56,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722586710] [2023-08-29 20:30:56,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:56,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:56,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:56,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:56,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:30:56,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722586710] [2023-08-29 20:30:56,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722586710] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:56,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:56,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:30:56,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652273799] [2023-08-29 20:30:56,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:56,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:30:56,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:30:56,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:30:56,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:30:56,647 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 271 [2023-08-29 20:30:56,648 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 57 transitions, 370 flow. Second operand has 6 states, 6 states have (on average 122.0) internal successors, (732), 6 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:56,648 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:56,648 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 271 [2023-08-29 20:30:56,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:30:57,967 INFO L130 PetriNetUnfolder]: 9145/13955 cut-off events. [2023-08-29 20:30:57,968 INFO L131 PetriNetUnfolder]: For 21816/22345 co-relation queries the response was YES. [2023-08-29 20:30:58,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47446 conditions, 13955 events. 9145/13955 cut-off events. For 21816/22345 co-relation queries the response was YES. Maximal size of possible extension queue 760. Compared 93923 event pairs, 980 based on Foata normal form. 678/14328 useless extension candidates. Maximal degree in co-relation 47429. Up to 3117 conditions per place. [2023-08-29 20:30:58,059 INFO L137 encePairwiseOnDemand]: 264/271 looper letters, 135 selfloop transitions, 23 changer transitions 20/188 dead transitions. [2023-08-29 20:30:58,059 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 188 transitions, 1453 flow [2023-08-29 20:30:58,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 20:30:58,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 20:30:58,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1199 transitions. [2023-08-29 20:30:58,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4915949159491595 [2023-08-29 20:30:58,063 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1199 transitions. [2023-08-29 20:30:58,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1199 transitions. [2023-08-29 20:30:58,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:30:58,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1199 transitions. [2023-08-29 20:30:58,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 133.22222222222223) internal successors, (1199), 9 states have internal predecessors, (1199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:58,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 271.0) internal successors, (2710), 10 states have internal predecessors, (2710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:58,070 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 271.0) internal successors, (2710), 10 states have internal predecessors, (2710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:58,070 INFO L175 Difference]: Start difference. First operand has 64 places, 57 transitions, 370 flow. Second operand 9 states and 1199 transitions. [2023-08-29 20:30:58,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 188 transitions, 1453 flow [2023-08-29 20:30:58,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 188 transitions, 1415 flow, removed 9 selfloop flow, removed 2 redundant places. [2023-08-29 20:30:58,427 INFO L231 Difference]: Finished difference. Result has 72 places, 65 transitions, 518 flow [2023-08-29 20:30:58,427 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=518, PETRI_PLACES=72, PETRI_TRANSITIONS=65} [2023-08-29 20:30:58,427 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 20 predicate places. [2023-08-29 20:30:58,427 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 65 transitions, 518 flow [2023-08-29 20:30:58,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.0) internal successors, (732), 6 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:58,428 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:30:58,428 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:30:58,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 20:30:58,428 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:30:58,428 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:30:58,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1784574930, now seen corresponding path program 1 times [2023-08-29 20:30:58,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:30:58,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821922578] [2023-08-29 20:30:58,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:30:58,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:30:58,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:30:59,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:30:59,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:30:59,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821922578] [2023-08-29 20:30:59,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821922578] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:30:59,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:30:59,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:30:59,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645276470] [2023-08-29 20:30:59,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:30:59,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:30:59,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:30:59,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:30:59,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:30:59,226 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 271 [2023-08-29 20:30:59,227 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 65 transitions, 518 flow. Second operand has 7 states, 7 states have (on average 115.28571428571429) internal successors, (807), 7 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:30:59,227 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:30:59,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 271 [2023-08-29 20:30:59,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:31:01,617 INFO L130 PetriNetUnfolder]: 18236/27829 cut-off events. [2023-08-29 20:31:01,617 INFO L131 PetriNetUnfolder]: For 89700/89700 co-relation queries the response was YES. [2023-08-29 20:31:01,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113256 conditions, 27829 events. 18236/27829 cut-off events. For 89700/89700 co-relation queries the response was YES. Maximal size of possible extension queue 1290. Compared 197674 event pairs, 883 based on Foata normal form. 11/27840 useless extension candidates. Maximal degree in co-relation 113237. Up to 6622 conditions per place. [2023-08-29 20:31:01,836 INFO L137 encePairwiseOnDemand]: 259/271 looper letters, 186 selfloop transitions, 48 changer transitions 104/338 dead transitions. [2023-08-29 20:31:01,836 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 338 transitions, 3345 flow [2023-08-29 20:31:01,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 20:31:01,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 20:31:01,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1174 transitions. [2023-08-29 20:31:01,839 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48134481344813446 [2023-08-29 20:31:01,839 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1174 transitions. [2023-08-29 20:31:01,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1174 transitions. [2023-08-29 20:31:01,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:31:01,840 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1174 transitions. [2023-08-29 20:31:01,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 130.44444444444446) internal successors, (1174), 9 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:01,845 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 271.0) internal successors, (2710), 10 states have internal predecessors, (2710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:01,846 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 271.0) internal successors, (2710), 10 states have internal predecessors, (2710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:01,846 INFO L175 Difference]: Start difference. First operand has 72 places, 65 transitions, 518 flow. Second operand 9 states and 1174 transitions. [2023-08-29 20:31:01,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 338 transitions, 3345 flow [2023-08-29 20:31:05,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 338 transitions, 2792 flow, removed 208 selfloop flow, removed 3 redundant places. [2023-08-29 20:31:05,064 INFO L231 Difference]: Finished difference. Result has 82 places, 88 transitions, 793 flow [2023-08-29 20:31:05,064 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=793, PETRI_PLACES=82, PETRI_TRANSITIONS=88} [2023-08-29 20:31:05,064 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 30 predicate places. [2023-08-29 20:31:05,064 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 88 transitions, 793 flow [2023-08-29 20:31:05,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.28571428571429) internal successors, (807), 7 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:05,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:05,065 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:31:05,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 20:31:05,065 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:31:05,065 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:05,066 INFO L85 PathProgramCache]: Analyzing trace with hash -289105474, now seen corresponding path program 2 times [2023-08-29 20:31:05,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:31:05,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133502548] [2023-08-29 20:31:05,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:31:05,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:31:05,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:31:05,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:31:05,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:31:05,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133502548] [2023-08-29 20:31:05,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133502548] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:31:05,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:31:05,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:31:05,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754405976] [2023-08-29 20:31:05,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:31:05,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:31:05,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:31:05,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:31:05,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:31:05,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 271 [2023-08-29 20:31:05,535 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 88 transitions, 793 flow. Second operand has 6 states, 6 states have (on average 115.83333333333333) internal successors, (695), 6 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:05,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:31:05,536 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 271 [2023-08-29 20:31:05,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:31:06,885 INFO L130 PetriNetUnfolder]: 7519/11823 cut-off events. [2023-08-29 20:31:06,885 INFO L131 PetriNetUnfolder]: For 34403/34403 co-relation queries the response was YES. [2023-08-29 20:31:06,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49506 conditions, 11823 events. 7519/11823 cut-off events. For 34403/34403 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 75837 event pairs, 1133 based on Foata normal form. 11/11834 useless extension candidates. Maximal degree in co-relation 49481. Up to 4983 conditions per place. [2023-08-29 20:31:06,973 INFO L137 encePairwiseOnDemand]: 257/271 looper letters, 146 selfloop transitions, 58 changer transitions 78/282 dead transitions. [2023-08-29 20:31:06,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 282 transitions, 2666 flow [2023-08-29 20:31:06,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 20:31:06,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 20:31:06,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1164 transitions. [2023-08-29 20:31:06,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47724477244772445 [2023-08-29 20:31:06,977 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1164 transitions. [2023-08-29 20:31:06,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1164 transitions. [2023-08-29 20:31:06,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:31:06,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1164 transitions. [2023-08-29 20:31:06,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 129.33333333333334) internal successors, (1164), 9 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:06,982 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 271.0) internal successors, (2710), 10 states have internal predecessors, (2710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:06,983 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 271.0) internal successors, (2710), 10 states have internal predecessors, (2710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:06,983 INFO L175 Difference]: Start difference. First operand has 82 places, 88 transitions, 793 flow. Second operand 9 states and 1164 transitions. [2023-08-29 20:31:06,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 282 transitions, 2666 flow [2023-08-29 20:31:07,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 282 transitions, 2499 flow, removed 76 selfloop flow, removed 5 redundant places. [2023-08-29 20:31:07,301 INFO L231 Difference]: Finished difference. Result has 85 places, 108 transitions, 1055 flow [2023-08-29 20:31:07,301 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1055, PETRI_PLACES=85, PETRI_TRANSITIONS=108} [2023-08-29 20:31:07,302 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 33 predicate places. [2023-08-29 20:31:07,302 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 108 transitions, 1055 flow [2023-08-29 20:31:07,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.83333333333333) internal successors, (695), 6 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:07,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:07,302 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:31:07,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 20:31:07,302 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:31:07,303 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:07,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1994241572, now seen corresponding path program 3 times [2023-08-29 20:31:07,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:31:07,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278080568] [2023-08-29 20:31:07,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:31:07,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:31:07,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:31:07,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:31:07,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:31:07,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278080568] [2023-08-29 20:31:07,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278080568] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:31:07,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:31:07,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:31:07,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167348029] [2023-08-29 20:31:07,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:31:07,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:31:07,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:31:07,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:31:07,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:31:07,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 271 [2023-08-29 20:31:07,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 108 transitions, 1055 flow. Second operand has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:07,755 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:31:07,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 271 [2023-08-29 20:31:07,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:31:08,735 INFO L130 PetriNetUnfolder]: 4881/7818 cut-off events. [2023-08-29 20:31:08,735 INFO L131 PetriNetUnfolder]: For 28230/28699 co-relation queries the response was YES. [2023-08-29 20:31:08,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35307 conditions, 7818 events. 4881/7818 cut-off events. For 28230/28699 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 51379 event pairs, 509 based on Foata normal form. 409/8075 useless extension candidates. Maximal degree in co-relation 35280. Up to 3159 conditions per place. [2023-08-29 20:31:08,778 INFO L137 encePairwiseOnDemand]: 264/271 looper letters, 164 selfloop transitions, 18 changer transitions 78/273 dead transitions. [2023-08-29 20:31:08,778 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 273 transitions, 3001 flow [2023-08-29 20:31:08,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:31:08,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:31:08,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1043 transitions. [2023-08-29 20:31:08,780 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48108856088560886 [2023-08-29 20:31:08,781 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1043 transitions. [2023-08-29 20:31:08,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1043 transitions. [2023-08-29 20:31:08,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:31:08,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1043 transitions. [2023-08-29 20:31:08,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 130.375) internal successors, (1043), 8 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:08,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 271.0) internal successors, (2439), 9 states have internal predecessors, (2439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:08,786 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 271.0) internal successors, (2439), 9 states have internal predecessors, (2439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:08,786 INFO L175 Difference]: Start difference. First operand has 85 places, 108 transitions, 1055 flow. Second operand 8 states and 1043 transitions. [2023-08-29 20:31:08,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 273 transitions, 3001 flow [2023-08-29 20:31:09,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 273 transitions, 2864 flow, removed 32 selfloop flow, removed 4 redundant places. [2023-08-29 20:31:09,075 INFO L231 Difference]: Finished difference. Result has 89 places, 90 transitions, 843 flow [2023-08-29 20:31:09,075 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=962, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=843, PETRI_PLACES=89, PETRI_TRANSITIONS=90} [2023-08-29 20:31:09,076 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 37 predicate places. [2023-08-29 20:31:09,076 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 90 transitions, 843 flow [2023-08-29 20:31:09,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:09,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:09,077 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:31:09,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-29 20:31:09,077 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:31:09,077 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:09,077 INFO L85 PathProgramCache]: Analyzing trace with hash -2083845180, now seen corresponding path program 1 times [2023-08-29 20:31:09,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:31:09,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833403406] [2023-08-29 20:31:09,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:31:09,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:31:09,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:31:09,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:31:09,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:31:09,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833403406] [2023-08-29 20:31:09,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833403406] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:31:09,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:31:09,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:31:09,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299739414] [2023-08-29 20:31:09,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:31:09,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:31:09,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:31:09,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:31:09,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:31:09,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 271 [2023-08-29 20:31:09,344 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 90 transitions, 843 flow. Second operand has 5 states, 5 states have (on average 119.4) internal successors, (597), 5 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:09,345 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:31:09,345 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 271 [2023-08-29 20:31:09,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:31:09,762 INFO L130 PetriNetUnfolder]: 2272/3519 cut-off events. [2023-08-29 20:31:09,762 INFO L131 PetriNetUnfolder]: For 13814/13814 co-relation queries the response was YES. [2023-08-29 20:31:09,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17320 conditions, 3519 events. 2272/3519 cut-off events. For 13814/13814 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 17456 event pairs, 129 based on Foata normal form. 1/3520 useless extension candidates. Maximal degree in co-relation 17293. Up to 1474 conditions per place. [2023-08-29 20:31:09,785 INFO L137 encePairwiseOnDemand]: 262/271 looper letters, 79 selfloop transitions, 13 changer transitions 92/184 dead transitions. [2023-08-29 20:31:09,786 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 184 transitions, 1977 flow [2023-08-29 20:31:09,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:31:09,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:31:09,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 762 transitions. [2023-08-29 20:31:09,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46863468634686345 [2023-08-29 20:31:09,791 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 762 transitions. [2023-08-29 20:31:09,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 762 transitions. [2023-08-29 20:31:09,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:31:09,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 762 transitions. [2023-08-29 20:31:09,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.0) internal successors, (762), 6 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:09,795 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 271.0) internal successors, (1897), 7 states have internal predecessors, (1897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:09,795 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 271.0) internal successors, (1897), 7 states have internal predecessors, (1897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:09,795 INFO L175 Difference]: Start difference. First operand has 89 places, 90 transitions, 843 flow. Second operand 6 states and 762 transitions. [2023-08-29 20:31:09,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 184 transitions, 1977 flow [2023-08-29 20:31:09,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 184 transitions, 1765 flow, removed 41 selfloop flow, removed 11 redundant places. [2023-08-29 20:31:09,842 INFO L231 Difference]: Finished difference. Result has 84 places, 64 transitions, 514 flow [2023-08-29 20:31:09,843 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=514, PETRI_PLACES=84, PETRI_TRANSITIONS=64} [2023-08-29 20:31:09,843 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 32 predicate places. [2023-08-29 20:31:09,843 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 64 transitions, 514 flow [2023-08-29 20:31:09,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.4) internal successors, (597), 5 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:09,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:09,844 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:31:09,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-29 20:31:09,844 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:31:09,844 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:09,845 INFO L85 PathProgramCache]: Analyzing trace with hash -645371094, now seen corresponding path program 2 times [2023-08-29 20:31:09,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:31:09,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789659314] [2023-08-29 20:31:09,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:31:09,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:31:09,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:31:10,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:31:10,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:31:10,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789659314] [2023-08-29 20:31:10,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789659314] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:31:10,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:31:10,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:31:10,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446838949] [2023-08-29 20:31:10,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:31:10,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 20:31:10,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:31:10,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 20:31:10,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-08-29 20:31:10,721 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 271 [2023-08-29 20:31:10,723 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 64 transitions, 514 flow. Second operand has 8 states, 8 states have (on average 122.0) internal successors, (976), 8 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:10,723 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:31:10,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 271 [2023-08-29 20:31:10,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:31:11,021 INFO L130 PetriNetUnfolder]: 643/1077 cut-off events. [2023-08-29 20:31:11,022 INFO L131 PetriNetUnfolder]: For 3331/3331 co-relation queries the response was YES. [2023-08-29 20:31:11,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4701 conditions, 1077 events. 643/1077 cut-off events. For 3331/3331 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4449 event pairs, 104 based on Foata normal form. 1/1071 useless extension candidates. Maximal degree in co-relation 4677. Up to 671 conditions per place. [2023-08-29 20:31:11,028 INFO L137 encePairwiseOnDemand]: 265/271 looper letters, 59 selfloop transitions, 5 changer transitions 43/111 dead transitions. [2023-08-29 20:31:11,028 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 111 transitions, 974 flow [2023-08-29 20:31:11,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:31:11,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:31:11,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 888 transitions. [2023-08-29 20:31:11,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4681075382182393 [2023-08-29 20:31:11,031 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 888 transitions. [2023-08-29 20:31:11,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 888 transitions. [2023-08-29 20:31:11,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:31:11,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 888 transitions. [2023-08-29 20:31:11,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.85714285714286) internal successors, (888), 7 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:11,036 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 271.0) internal successors, (2168), 8 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:11,049 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 271.0) internal successors, (2168), 8 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:11,049 INFO L175 Difference]: Start difference. First operand has 84 places, 64 transitions, 514 flow. Second operand 7 states and 888 transitions. [2023-08-29 20:31:11,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 111 transitions, 974 flow [2023-08-29 20:31:11,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 111 transitions, 866 flow, removed 17 selfloop flow, removed 11 redundant places. [2023-08-29 20:31:11,060 INFO L231 Difference]: Finished difference. Result has 78 places, 51 transitions, 322 flow [2023-08-29 20:31:11,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=322, PETRI_PLACES=78, PETRI_TRANSITIONS=51} [2023-08-29 20:31:11,062 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 26 predicate places. [2023-08-29 20:31:11,062 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 51 transitions, 322 flow [2023-08-29 20:31:11,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 122.0) internal successors, (976), 8 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:11,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:11,063 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:31:11,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-29 20:31:11,064 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:31:11,064 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:11,064 INFO L85 PathProgramCache]: Analyzing trace with hash 230194992, now seen corresponding path program 3 times [2023-08-29 20:31:11,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:31:11,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192870269] [2023-08-29 20:31:11,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:31:11,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:31:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:31:11,126 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:31:11,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:31:11,224 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 20:31:11,224 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:31:11,225 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-29 20:31:11,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-29 20:31:11,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-29 20:31:11,228 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-29 20:31:11,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-29 20:31:11,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-29 20:31:11,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-29 20:31:11,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-29 20:31:11,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-29 20:31:11,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-29 20:31:11,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-29 20:31:11,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-29 20:31:11,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-29 20:31:11,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-29 20:31:11,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-29 20:31:11,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-29 20:31:11,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-29 20:31:11,233 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:31:11,238 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:31:11,239 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:31:11,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:31:11 BasicIcfg [2023-08-29 20:31:11,332 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:31:11,332 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:31:11,333 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:31:11,333 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:31:11,333 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:30:28" (3/4) ... [2023-08-29 20:31:11,335 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:31:11,336 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:31:11,336 INFO L158 Benchmark]: Toolchain (without parser) took 44143.02ms. Allocated memory was 58.7MB in the beginning and 6.0GB in the end (delta: 6.0GB). Free memory was 39.0MB in the beginning and 4.0GB in the end (delta: -3.9GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2023-08-29 20:31:11,337 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 48.2MB. Free memory was 26.5MB in the beginning and 26.5MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:31:11,337 INFO L158 Benchmark]: CACSL2BoogieTranslator took 564.48ms. Allocated memory is still 58.7MB. Free memory was 38.9MB in the beginning and 28.2MB in the end (delta: 10.7MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. [2023-08-29 20:31:11,337 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.16ms. Allocated memory is still 58.7MB. Free memory was 28.0MB in the beginning and 25.5MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-29 20:31:11,338 INFO L158 Benchmark]: Boogie Preprocessor took 67.15ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 25.5MB in the beginning and 50.5MB in the end (delta: -24.9MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. [2023-08-29 20:31:11,338 INFO L158 Benchmark]: RCFGBuilder took 795.84ms. Allocated memory is still 71.3MB. Free memory was 50.1MB in the beginning and 29.4MB in the end (delta: 20.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-08-29 20:31:11,338 INFO L158 Benchmark]: TraceAbstraction took 42624.93ms. Allocated memory was 71.3MB in the beginning and 6.0GB in the end (delta: 5.9GB). Free memory was 28.7MB in the beginning and 4.0GB in the end (delta: -3.9GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2023-08-29 20:31:11,338 INFO L158 Benchmark]: Witness Printer took 3.26ms. Allocated memory is still 6.0GB. Free memory was 4.0GB in the beginning and 4.0GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:31:11,340 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 48.2MB. Free memory was 26.5MB in the beginning and 26.5MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 564.48ms. Allocated memory is still 58.7MB. Free memory was 38.9MB in the beginning and 28.2MB in the end (delta: 10.7MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.16ms. Allocated memory is still 58.7MB. Free memory was 28.0MB in the beginning and 25.5MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.15ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 25.5MB in the beginning and 50.5MB in the end (delta: -24.9MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. * RCFGBuilder took 795.84ms. Allocated memory is still 71.3MB. Free memory was 50.1MB in the beginning and 29.4MB in the end (delta: 20.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 42624.93ms. Allocated memory was 71.3MB in the beginning and 6.0GB in the end (delta: 5.9GB). Free memory was 28.7MB in the beginning and 4.0GB in the end (delta: -3.9GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. * Witness Printer took 3.26ms. Allocated memory is still 6.0GB. Free memory was 4.0GB in the beginning and 4.0GB 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: 4.7s, 147 PlacesBefore, 52 PlacesAfterwards, 136 TransitionsBefore, 40 TransitionsAfterwards, 3412 CoEnabledTransitionPairs, 7 FixpointIterations, 48 TrivialSequentialCompositions, 75 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 131 TotalNumberOfCompositions, 9977 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4488, independent: 4252, independent conditional: 0, independent unconditional: 4252, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1828, independent: 1780, independent conditional: 0, independent unconditional: 1780, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4488, independent: 2472, independent conditional: 0, independent unconditional: 2472, dependent: 188, dependent conditional: 0, dependent unconditional: 188, unknown: 1828, unknown conditional: 0, unknown unconditional: 1828] , Statistics on independence cache: Total cache size (in pairs): 207, Positive cache size: 186, Positive conditional cache size: 0, Positive unconditional cache size: 186, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool a$flush_delayed; [L718] 0 int a$mem_tmp; [L719] 0 _Bool a$r_buff0_thd0; [L720] 0 _Bool a$r_buff0_thd1; [L721] 0 _Bool a$r_buff0_thd2; [L722] 0 _Bool a$r_buff0_thd3; [L723] 0 _Bool a$r_buff0_thd4; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$r_buff1_thd4; [L729] 0 _Bool a$read_delayed; [L730] 0 int *a$read_delayed_var; [L731] 0 int a$w_buff0; [L732] 0 _Bool a$w_buff0_used; [L733] 0 int a$w_buff1; [L734] 0 _Bool a$w_buff1_used; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L859] 0 pthread_t t1457; [L860] FCALL, FORK 0 pthread_create(&t1457, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1457, ((void *)0), P0, ((void *)0))=-3, t1457={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L861] 0 pthread_t t1458; [L862] FCALL, FORK 0 pthread_create(&t1458, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1458, ((void *)0), P1, ((void *)0))=-2, t1457={5:0}, t1458={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L863] 0 pthread_t t1459; [L864] FCALL, FORK 0 pthread_create(&t1459, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1459, ((void *)0), P2, ((void *)0))=-1, t1457={5:0}, t1458={6:0}, t1459={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L865] 0 pthread_t t1460; [L866] FCALL, FORK 0 pthread_create(&t1460, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1460, ((void *)0), P3, ((void *)0))=0, t1457={5:0}, t1458={6:0}, t1459={7:0}, t1460={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L748] 1 a$w_buff1 = a$w_buff0 [L749] 1 a$w_buff0 = 1 [L750] 1 a$w_buff1_used = a$w_buff0_used [L751] 1 a$w_buff0_used = (_Bool)1 [L752] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L752] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L753] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L754] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L755] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L756] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L757] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L778] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L781] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L798] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L801] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L818] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L784] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L785] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L786] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L787] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L788] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L821] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L822] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L823] 4 a$flush_delayed = weak$$choice2 [L824] 4 a$mem_tmp = a [L825] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L826] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L827] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L828] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L829] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L830] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L831] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 __unbuffered_p3_EAX = a [L833] 4 a = a$flush_delayed ? a$mem_tmp : a [L834] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, z=2] [L837] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L839] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L840] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L841] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, z=2] [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L804] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L805] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L806] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L807] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L808] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 3 return 0; [L844] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 4 return 0; [L868] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L870] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L870] RET 0 assume_abort_if_not(main$tmp_guard0) [L872] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L873] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L874] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L875] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L876] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1457={5:0}, t1458={6:0}, t1459={7:0}, t1460={3:0}, weak$$choice2=1, x=2, y=1, z=2] [L879] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 860]: 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: 864]: 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: 866]: 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: 862]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 176 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 42.4s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 31.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1067 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 919 mSDsluCounter, 353 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 284 mSDsCounter, 152 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2790 IncrementalHoareTripleChecker+Invalid, 2942 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 152 mSolverCounterUnsat, 69 mSDtfsCounter, 2790 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1055occurred in iteration=13, InterpolantAutomatonStates: 88, 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.6s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 287 NumberOfCodeBlocks, 287 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 244 ConstructedInterpolants, 0 QuantifiedInterpolants, 2015 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-29 20:31:11,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix055_power.oepc_pso.oepc_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b8efebf87dc67f98045ac231dc43d6a61f436e058244f16134f1d46d3b696c80 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 20:31:13,626 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:31:13,629 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:31:13,671 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:31:13,673 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:31:13,676 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:31:13,678 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:31:13,681 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:31:13,683 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:31:13,687 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:31:13,688 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:31:13,690 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:31:13,691 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:31:13,692 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:31:13,694 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:31:13,700 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:31:13,700 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:31:13,702 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:31:13,703 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:31:13,707 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:31:13,717 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:31:13,719 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:31:13,719 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:31:13,720 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:31:13,727 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:31:13,728 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:31:13,728 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:31:13,729 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:31:13,730 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:31:13,731 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:31:13,731 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:31:13,736 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:31:13,737 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:31:13,738 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:31:13,738 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:31:13,739 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:31:13,739 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:31:13,739 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:31:13,740 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:31:13,740 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:31:13,741 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:31:13,743 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-29 20:31:13,770 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:31:13,771 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:31:13,771 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:31:13,771 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:31:13,772 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:31:13,772 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:31:13,773 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:31:13,773 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:31:13,773 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:31:13,773 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:31:13,773 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:31:13,774 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:31:13,774 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:31:13,774 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:31:13,774 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:31:13,774 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:31:13,774 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:31:13,775 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:31:13,775 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:31:13,775 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:31:13,775 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-29 20:31:13,775 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-29 20:31:13,776 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:31:13,776 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:31:13,776 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:31:13,776 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:31:13,776 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:31:13,777 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:31:13,777 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:31:13,777 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:31:13,777 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-29 20:31:13,777 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-29 20:31:13,778 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:31:13,778 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:31:13,778 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:31:13,778 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-29 20:31:13,778 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:31:13,778 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 -> b8efebf87dc67f98045ac231dc43d6a61f436e058244f16134f1d46d3b696c80 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-29 20:31:14,080 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:31:14,100 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:31:14,104 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:31:14,105 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:31:14,105 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:31:14,106 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_power.oepc_pso.oepc_rmo.oepc.i [2023-08-29 20:31:15,392 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:31:15,619 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:31:15,620 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_power.oepc_pso.oepc_rmo.oepc.i [2023-08-29 20:31:15,638 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50c47babc/7d9042e085d6423c9eb2b78f71dc8b94/FLAGf21107b79 [2023-08-29 20:31:15,654 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50c47babc/7d9042e085d6423c9eb2b78f71dc8b94 [2023-08-29 20:31:15,656 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:31:15,657 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:31:15,658 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:31:15,658 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:31:15,660 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:31:15,661 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:31:15" (1/1) ... [2023-08-29 20:31:15,662 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f5b0a8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:31:15, skipping insertion in model container [2023-08-29 20:31:15,662 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:31:15" (1/1) ... [2023-08-29 20:31:15,667 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:31:15,711 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:31:15,834 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/mix055_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-29 20:31:16,069 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:31:16,086 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:31:16,097 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/mix055_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-29 20:31:16,158 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:31:16,200 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:31:16,200 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:31:16,225 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:31:16,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:31:16 WrapperNode [2023-08-29 20:31:16,226 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:31:16,227 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:31:16,227 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:31:16,228 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:31:16,234 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:31:16" (1/1) ... [2023-08-29 20:31:16,258 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:31:16" (1/1) ... [2023-08-29 20:31:16,291 INFO L138 Inliner]: procedures = 180, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-08-29 20:31:16,292 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:31:16,296 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:31:16,296 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:31:16,296 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:31:16,304 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:31:16" (1/1) ... [2023-08-29 20:31:16,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:31:16" (1/1) ... [2023-08-29 20:31:16,320 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:31:16" (1/1) ... [2023-08-29 20:31:16,321 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:31:16" (1/1) ... [2023-08-29 20:31:16,331 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:31:16" (1/1) ... [2023-08-29 20:31:16,346 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:31:16" (1/1) ... [2023-08-29 20:31:16,348 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:31:16" (1/1) ... [2023-08-29 20:31:16,359 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:31:16" (1/1) ... [2023-08-29 20:31:16,362 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:31:16,363 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:31:16,365 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:31:16,365 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:31:16,366 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:31:16" (1/1) ... [2023-08-29 20:31:16,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:31:16,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:31:16,393 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-29 20:31:16,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-29 20:31:16,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:31:16,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:31:16,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:31:16,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:31:16,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-29 20:31:16,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-29 20:31:16,431 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:31:16,431 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:31:16,432 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:31:16,432 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:31:16,432 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:31:16,432 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:31:16,432 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-29 20:31:16,432 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-29 20:31:16,433 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:31:16,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:31:16,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:31:16,434 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 20:31:16,586 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:31:16,587 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:31:16,942 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:31:17,071 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:31:17,071 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:31:17,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:31:17 BoogieIcfgContainer [2023-08-29 20:31:17,074 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:31:17,075 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:31:17,076 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:31:17,078 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:31:17,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:31:15" (1/3) ... [2023-08-29 20:31:17,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b987f72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:31:17, skipping insertion in model container [2023-08-29 20:31:17,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:31:16" (2/3) ... [2023-08-29 20:31:17,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b987f72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:31:17, skipping insertion in model container [2023-08-29 20:31:17,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:31:17" (3/3) ... [2023-08-29 20:31:17,081 INFO L112 eAbstractionObserver]: Analyzing ICFG mix055_power.oepc_pso.oepc_rmo.oepc.i [2023-08-29 20:31:17,096 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:31:17,097 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-29 20:31:17,097 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:31:17,185 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:31:17,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 141 transitions, 302 flow [2023-08-29 20:31:17,289 INFO L130 PetriNetUnfolder]: 2/137 cut-off events. [2023-08-29 20:31:17,289 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:31:17,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 137 events. 2/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-29 20:31:17,295 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 141 transitions, 302 flow [2023-08-29 20:31:17,299 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 137 transitions, 286 flow [2023-08-29 20:31:17,302 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:31:17,311 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 137 transitions, 286 flow [2023-08-29 20:31:17,313 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 137 transitions, 286 flow [2023-08-29 20:31:17,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 137 transitions, 286 flow [2023-08-29 20:31:17,336 INFO L130 PetriNetUnfolder]: 2/137 cut-off events. [2023-08-29 20:31:17,336 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:31:17,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 137 events. 2/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 102 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-29 20:31:17,340 INFO L119 LiptonReduction]: Number of co-enabled transitions 3412 [2023-08-29 20:31:23,972 INFO L134 LiptonReduction]: Checked pairs total: 9228 [2023-08-29 20:31:23,972 INFO L136 LiptonReduction]: Total number of compositions: 134 [2023-08-29 20:31:23,985 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:31:23,990 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;@71e8ed2a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:31:23,991 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-29 20:31:23,992 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:31:23,992 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:31:23,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:23,993 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:31:23,994 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:31:23,998 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:23,998 INFO L85 PathProgramCache]: Analyzing trace with hash 600, now seen corresponding path program 1 times [2023-08-29 20:31:24,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:31:24,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [209421688] [2023-08-29 20:31:24,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:31:24,009 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:24,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:31:24,012 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:31:24,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-29 20:31:24,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:31:24,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-29 20:31:24,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:31:24,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:31:24,100 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:31:24,101 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:31:24,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [209421688] [2023-08-29 20:31:24,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [209421688] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:31:24,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:31:24,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:31:24,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531207243] [2023-08-29 20:31:24,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:31:24,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:31:24,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:31:24,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:31:24,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:31:24,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 275 [2023-08-29 20:31:24,176 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 92 flow. Second operand has 2 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:24,176 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:31:24,176 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 275 [2023-08-29 20:31:24,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:31:25,657 INFO L130 PetriNetUnfolder]: 8719/11751 cut-off events. [2023-08-29 20:31:25,659 INFO L131 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2023-08-29 20:31:25,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23699 conditions, 11751 events. 8719/11751 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 59448 event pairs, 8719 based on Foata normal form. 0/10324 useless extension candidates. Maximal degree in co-relation 23687. Up to 11731 conditions per place. [2023-08-29 20:31:25,734 INFO L137 encePairwiseOnDemand]: 266/275 looper letters, 28 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2023-08-29 20:31:25,734 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 130 flow [2023-08-29 20:31:25,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:31:25,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:31:25,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 289 transitions. [2023-08-29 20:31:25,748 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5254545454545455 [2023-08-29 20:31:25,748 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 289 transitions. [2023-08-29 20:31:25,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 289 transitions. [2023-08-29 20:31:25,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:31:25,755 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 289 transitions. [2023-08-29 20:31:25,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 144.5) internal successors, (289), 2 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:25,760 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 275.0) internal successors, (825), 3 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:25,761 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 275.0) internal successors, (825), 3 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:25,762 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 92 flow. Second operand 2 states and 289 transitions. [2023-08-29 20:31:25,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 130 flow [2023-08-29 20:31:25,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 126 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-29 20:31:25,775 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 70 flow [2023-08-29 20:31:25,776 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2023-08-29 20:31:25,779 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2023-08-29 20:31:25,779 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 70 flow [2023-08-29 20:31:25,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:25,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:25,780 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 20:31:25,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-08-29 20:31:25,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:25,992 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:31:25,993 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:25,993 INFO L85 PathProgramCache]: Analyzing trace with hash 591409, now seen corresponding path program 1 times [2023-08-29 20:31:25,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:31:25,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1578693678] [2023-08-29 20:31:25,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:31:25,994 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:25,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:31:25,995 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:31:25,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-29 20:31:26,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:31:26,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:31:26,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:31:26,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:31:26,107 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:31:26,107 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:31:26,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1578693678] [2023-08-29 20:31:26,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1578693678] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:31:26,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:31:26,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:31:26,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575929443] [2023-08-29 20:31:26,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:31:26,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:31:26,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:31:26,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:31:26,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:31:26,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 275 [2023-08-29 20:31:26,118 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:26,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:31:26,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 275 [2023-08-29 20:31:26,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:31:27,196 INFO L130 PetriNetUnfolder]: 6855/9870 cut-off events. [2023-08-29 20:31:27,196 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:31:27,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19307 conditions, 9870 events. 6855/9870 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 477. Compared 59449 event pairs, 1263 based on Foata normal form. 0/9225 useless extension candidates. Maximal degree in co-relation 19304. Up to 7399 conditions per place. [2023-08-29 20:31:27,249 INFO L137 encePairwiseOnDemand]: 272/275 looper letters, 45 selfloop transitions, 2 changer transitions 2/52 dead transitions. [2023-08-29 20:31:27,249 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 52 transitions, 216 flow [2023-08-29 20:31:27,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:31:27,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:31:27,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2023-08-29 20:31:27,252 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2023-08-29 20:31:27,252 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 425 transitions. [2023-08-29 20:31:27,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 425 transitions. [2023-08-29 20:31:27,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:31:27,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 425 transitions. [2023-08-29 20:31:27,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:27,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:27,257 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:27,257 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 70 flow. Second operand 3 states and 425 transitions. [2023-08-29 20:31:27,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 52 transitions, 216 flow [2023-08-29 20:31:27,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 52 transitions, 216 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:31:27,258 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 70 flow [2023-08-29 20:31:27,259 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-08-29 20:31:27,259 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2023-08-29 20:31:27,260 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 70 flow [2023-08-29 20:31:27,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:27,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:27,260 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:31:27,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-08-29 20:31:27,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:27,471 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:31:27,472 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:27,472 INFO L85 PathProgramCache]: Analyzing trace with hash -800685654, now seen corresponding path program 1 times [2023-08-29 20:31:27,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:31:27,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1967980566] [2023-08-29 20:31:27,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:31:27,473 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:27,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:31:27,474 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:31:27,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-29 20:31:27,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:31:27,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:31:27,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:31:27,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:31:27,617 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:31:27,617 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:31:27,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1967980566] [2023-08-29 20:31:27,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1967980566] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:31:27,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:31:27,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:31:27,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645957383] [2023-08-29 20:31:27,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:31:27,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:31:27,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:31:27,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:31:27,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:31:27,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 275 [2023-08-29 20:31:27,649 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:27,650 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:31:27,650 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 275 [2023-08-29 20:31:27,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:31:28,471 INFO L130 PetriNetUnfolder]: 4483/6366 cut-off events. [2023-08-29 20:31:28,471 INFO L131 PetriNetUnfolder]: For 421/421 co-relation queries the response was YES. [2023-08-29 20:31:28,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13315 conditions, 6366 events. 4483/6366 cut-off events. For 421/421 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 33592 event pairs, 818 based on Foata normal form. 320/6460 useless extension candidates. Maximal degree in co-relation 13311. Up to 4756 conditions per place. [2023-08-29 20:31:28,500 INFO L137 encePairwiseOnDemand]: 268/275 looper letters, 40 selfloop transitions, 5 changer transitions 27/75 dead transitions. [2023-08-29 20:31:28,500 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 75 transitions, 318 flow [2023-08-29 20:31:28,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:31:28,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:31:28,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 674 transitions. [2023-08-29 20:31:28,503 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49018181818181816 [2023-08-29 20:31:28,503 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 674 transitions. [2023-08-29 20:31:28,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 674 transitions. [2023-08-29 20:31:28,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:31:28,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 674 transitions. [2023-08-29 20:31:28,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.8) internal successors, (674), 5 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:28,508 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 275.0) internal successors, (1650), 6 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:28,509 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 275.0) internal successors, (1650), 6 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:28,509 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 5 states and 674 transitions. [2023-08-29 20:31:28,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 75 transitions, 318 flow [2023-08-29 20:31:28,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 75 transitions, 308 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:31:28,511 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 111 flow [2023-08-29 20:31:28,511 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=111, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2023-08-29 20:31:28,512 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -6 predicate places. [2023-08-29 20:31:28,512 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 111 flow [2023-08-29 20:31:28,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:28,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:28,513 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:31:28,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-29 20:31:28,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:28,722 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:31:28,723 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:28,723 INFO L85 PathProgramCache]: Analyzing trace with hash 2122229227, now seen corresponding path program 1 times [2023-08-29 20:31:28,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:31:28,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1083959566] [2023-08-29 20:31:28,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:31:28,724 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:28,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:31:28,727 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:31:28,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-29 20:31:28,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:31:28,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:31:28,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:31:28,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:31:28,878 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:31:28,878 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:31:28,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1083959566] [2023-08-29 20:31:28,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1083959566] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:31:28,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:31:28,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:31:28,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668061356] [2023-08-29 20:31:28,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:31:28,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:31:28,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:31:28,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:31:28,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:31:28,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 275 [2023-08-29 20:31:28,906 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 111 flow. Second operand has 5 states, 5 states have (on average 122.8) internal successors, (614), 5 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:28,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:31:28,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 275 [2023-08-29 20:31:28,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:31:29,463 INFO L130 PetriNetUnfolder]: 2161/3261 cut-off events. [2023-08-29 20:31:29,464 INFO L131 PetriNetUnfolder]: For 1191/1191 co-relation queries the response was YES. [2023-08-29 20:31:29,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8656 conditions, 3261 events. 2161/3261 cut-off events. For 1191/1191 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 16680 event pairs, 403 based on Foata normal form. 212/3382 useless extension candidates. Maximal degree in co-relation 8649. Up to 1426 conditions per place. [2023-08-29 20:31:29,481 INFO L137 encePairwiseOnDemand]: 268/275 looper letters, 53 selfloop transitions, 9 changer transitions 27/92 dead transitions. [2023-08-29 20:31:29,481 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 92 transitions, 467 flow [2023-08-29 20:31:29,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:31:29,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:31:29,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 811 transitions. [2023-08-29 20:31:29,484 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4915151515151515 [2023-08-29 20:31:29,484 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 811 transitions. [2023-08-29 20:31:29,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 811 transitions. [2023-08-29 20:31:29,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:31:29,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 811 transitions. [2023-08-29 20:31:29,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 135.16666666666666) internal successors, (811), 6 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:29,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 275.0) internal successors, (1925), 7 states have internal predecessors, (1925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:29,491 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 275.0) internal successors, (1925), 7 states have internal predecessors, (1925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:29,491 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 111 flow. Second operand 6 states and 811 transitions. [2023-08-29 20:31:29,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 92 transitions, 467 flow [2023-08-29 20:31:29,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 92 transitions, 460 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-29 20:31:29,501 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 176 flow [2023-08-29 20:31:29,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=176, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2023-08-29 20:31:29,502 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2023-08-29 20:31:29,503 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 176 flow [2023-08-29 20:31:29,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.8) internal successors, (614), 5 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:29,503 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:29,503 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:31:29,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-29 20:31:29,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:29,713 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:31:29,713 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:29,713 INFO L85 PathProgramCache]: Analyzing trace with hash 2117794971, now seen corresponding path program 1 times [2023-08-29 20:31:29,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:31:29,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [358280176] [2023-08-29 20:31:29,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:31:29,714 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:29,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:31:29,715 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:31:29,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-29 20:31:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:31:29,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-29 20:31:29,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:31:29,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:31:29,888 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:31:29,888 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:31:29,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [358280176] [2023-08-29 20:31:29,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [358280176] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:31:29,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:31:29,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:31:29,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30199715] [2023-08-29 20:31:29,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:31:29,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:31:29,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:31:29,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:31:29,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:31:29,917 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 275 [2023-08-29 20:31:29,918 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 176 flow. Second operand has 6 states, 6 states have (on average 122.83333333333333) internal successors, (737), 6 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:29,918 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:31:29,918 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 275 [2023-08-29 20:31:29,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:31:30,379 INFO L130 PetriNetUnfolder]: 1189/1839 cut-off events. [2023-08-29 20:31:30,380 INFO L131 PetriNetUnfolder]: For 1810/1810 co-relation queries the response was YES. [2023-08-29 20:31:30,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5559 conditions, 1839 events. 1189/1839 cut-off events. For 1810/1810 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 8758 event pairs, 331 based on Foata normal form. 77/1888 useless extension candidates. Maximal degree in co-relation 5550. Up to 630 conditions per place. [2023-08-29 20:31:30,391 INFO L137 encePairwiseOnDemand]: 268/275 looper letters, 64 selfloop transitions, 13 changer transitions 27/107 dead transitions. [2023-08-29 20:31:30,391 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 107 transitions, 636 flow [2023-08-29 20:31:30,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:31:30,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:31:30,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 946 transitions. [2023-08-29 20:31:30,397 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49142857142857144 [2023-08-29 20:31:30,397 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 946 transitions. [2023-08-29 20:31:30,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 946 transitions. [2023-08-29 20:31:30,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:31:30,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 946 transitions. [2023-08-29 20:31:30,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 135.14285714285714) internal successors, (946), 7 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:30,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 275.0) internal successors, (2200), 8 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:30,404 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 275.0) internal successors, (2200), 8 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:30,404 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 176 flow. Second operand 7 states and 946 transitions. [2023-08-29 20:31:30,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 107 transitions, 636 flow [2023-08-29 20:31:30,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 107 transitions, 574 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-08-29 20:31:30,418 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 226 flow [2023-08-29 20:31:30,419 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=226, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2023-08-29 20:31:30,420 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2023-08-29 20:31:30,421 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 226 flow [2023-08-29 20:31:30,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.83333333333333) internal successors, (737), 6 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:30,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:30,423 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:31:30,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-29 20:31:30,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:30,634 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:31:30,634 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:30,634 INFO L85 PathProgramCache]: Analyzing trace with hash 11072410, now seen corresponding path program 1 times [2023-08-29 20:31:30,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:31:30,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [350947904] [2023-08-29 20:31:30,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:31:30,635 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:30,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:31:30,636 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:31:30,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-29 20:31:30,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:31:30,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-29 20:31:30,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:31:30,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:31:30,833 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:31:30,833 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:31:30,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [350947904] [2023-08-29 20:31:30,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [350947904] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:31:30,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:31:30,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:31:30,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977200515] [2023-08-29 20:31:30,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:31:30,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:31:30,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:31:30,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:31:30,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:31:30,870 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 275 [2023-08-29 20:31:30,872 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 226 flow. Second operand has 7 states, 7 states have (on average 122.85714285714286) internal successors, (860), 7 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:30,872 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:31:30,872 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 275 [2023-08-29 20:31:30,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:31:31,381 INFO L130 PetriNetUnfolder]: 1011/1533 cut-off events. [2023-08-29 20:31:31,381 INFO L131 PetriNetUnfolder]: For 1455/1455 co-relation queries the response was YES. [2023-08-29 20:31:31,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4485 conditions, 1533 events. 1011/1533 cut-off events. For 1455/1455 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7116 event pairs, 326 based on Foata normal form. 14/1532 useless extension candidates. Maximal degree in co-relation 4475. Up to 630 conditions per place. [2023-08-29 20:31:31,391 INFO L137 encePairwiseOnDemand]: 268/275 looper letters, 60 selfloop transitions, 17 changer transitions 14/94 dead transitions. [2023-08-29 20:31:31,391 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 94 transitions, 572 flow [2023-08-29 20:31:31,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:31:31,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:31:31,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1053 transitions. [2023-08-29 20:31:31,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47863636363636364 [2023-08-29 20:31:31,395 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1053 transitions. [2023-08-29 20:31:31,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1053 transitions. [2023-08-29 20:31:31,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:31:31,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1053 transitions. [2023-08-29 20:31:31,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 131.625) internal successors, (1053), 8 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:31,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 275.0) internal successors, (2475), 9 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:31,402 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 275.0) internal successors, (2475), 9 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:31,402 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 226 flow. Second operand 8 states and 1053 transitions. [2023-08-29 20:31:31,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 94 transitions, 572 flow [2023-08-29 20:31:31,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 94 transitions, 510 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-08-29 20:31:31,417 INFO L231 Difference]: Finished difference. Result has 56 places, 41 transitions, 220 flow [2023-08-29 20:31:31,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=220, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2023-08-29 20:31:31,418 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 4 predicate places. [2023-08-29 20:31:31,418 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 220 flow [2023-08-29 20:31:31,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 122.85714285714286) internal successors, (860), 7 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:31,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:31,419 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:31:31,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-29 20:31:31,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:31,629 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:31:31,629 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:31,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1831735470, now seen corresponding path program 1 times [2023-08-29 20:31:31,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:31:31,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1304287159] [2023-08-29 20:31:31,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:31:31,630 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:31,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:31:31,631 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:31:31,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-29 20:31:31,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:31:31,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-29 20:31:31,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:31:32,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:31:32,184 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:31:32,184 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:31:32,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1304287159] [2023-08-29 20:31:32,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1304287159] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:31:32,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:31:32,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-29 20:31:32,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284765408] [2023-08-29 20:31:32,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:31:32,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-29 20:31:32,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:31:32,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-29 20:31:32,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-08-29 20:31:32,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 275 [2023-08-29 20:31:32,258 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 41 transitions, 220 flow. Second operand has 8 states, 8 states have (on average 123.0) internal successors, (984), 8 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:32,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:31:32,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 275 [2023-08-29 20:31:32,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:31:32,677 INFO L130 PetriNetUnfolder]: 1159/1879 cut-off events. [2023-08-29 20:31:32,677 INFO L131 PetriNetUnfolder]: For 2159/2159 co-relation queries the response was YES. [2023-08-29 20:31:32,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5419 conditions, 1879 events. 1159/1879 cut-off events. For 2159/2159 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 10102 event pairs, 145 based on Foata normal form. 0/1873 useless extension candidates. Maximal degree in co-relation 5408. Up to 773 conditions per place. [2023-08-29 20:31:32,689 INFO L137 encePairwiseOnDemand]: 269/275 looper letters, 101 selfloop transitions, 6 changer transitions 0/110 dead transitions. [2023-08-29 20:31:32,689 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 110 transitions, 812 flow [2023-08-29 20:31:32,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:31:32,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:31:32,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 912 transitions. [2023-08-29 20:31:32,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4737662337662338 [2023-08-29 20:31:32,692 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 912 transitions. [2023-08-29 20:31:32,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 912 transitions. [2023-08-29 20:31:32,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:31:32,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 912 transitions. [2023-08-29 20:31:32,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 130.28571428571428) internal successors, (912), 7 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:32,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 275.0) internal successors, (2200), 8 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:32,699 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 275.0) internal successors, (2200), 8 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:32,700 INFO L175 Difference]: Start difference. First operand has 56 places, 41 transitions, 220 flow. Second operand 7 states and 912 transitions. [2023-08-29 20:31:32,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 110 transitions, 812 flow [2023-08-29 20:31:32,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 110 transitions, 656 flow, removed 38 selfloop flow, removed 7 redundant places. [2023-08-29 20:31:32,712 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 180 flow [2023-08-29 20:31:32,712 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=180, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2023-08-29 20:31:32,713 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2023-08-29 20:31:32,713 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 180 flow [2023-08-29 20:31:32,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 123.0) internal successors, (984), 8 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:32,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:32,714 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:31:32,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-08-29 20:31:32,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:32,924 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:31:32,925 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:32,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1848342838, now seen corresponding path program 2 times [2023-08-29 20:31:32,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:31:32,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [227990133] [2023-08-29 20:31:32,925 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 20:31:32,925 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:32,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:31:32,927 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:31:32,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-29 20:31:33,048 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 20:31:33,049 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:31:33,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:31:33,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:31:33,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:31:33,071 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:31:33,071 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:31:33,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [227990133] [2023-08-29 20:31:33,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [227990133] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:31:33,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:31:33,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:31:33,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635994471] [2023-08-29 20:31:33,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:31:33,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:31:33,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:31:33,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:31:33,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:31:33,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 275 [2023-08-29 20:31:33,083 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 180 flow. Second operand has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:33,083 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:31:33,083 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 275 [2023-08-29 20:31:33,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:31:33,446 INFO L130 PetriNetUnfolder]: 2066/3171 cut-off events. [2023-08-29 20:31:33,447 INFO L131 PetriNetUnfolder]: For 2515/2515 co-relation queries the response was YES. [2023-08-29 20:31:33,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9132 conditions, 3171 events. 2066/3171 cut-off events. For 2515/2515 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 17395 event pairs, 858 based on Foata normal form. 1/3151 useless extension candidates. Maximal degree in co-relation 9122. Up to 1777 conditions per place. [2023-08-29 20:31:33,465 INFO L137 encePairwiseOnDemand]: 272/275 looper letters, 75 selfloop transitions, 2 changer transitions 0/79 dead transitions. [2023-08-29 20:31:33,466 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 79 transitions, 490 flow [2023-08-29 20:31:33,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:31:33,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:31:33,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2023-08-29 20:31:33,468 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5078787878787879 [2023-08-29 20:31:33,468 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 419 transitions. [2023-08-29 20:31:33,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 419 transitions. [2023-08-29 20:31:33,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:31:33,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 419 transitions. [2023-08-29 20:31:33,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:33,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:33,471 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:33,471 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 180 flow. Second operand 3 states and 419 transitions. [2023-08-29 20:31:33,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 79 transitions, 490 flow [2023-08-29 20:31:33,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 79 transitions, 482 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:31:33,498 INFO L231 Difference]: Finished difference. Result has 55 places, 44 transitions, 186 flow [2023-08-29 20:31:33,498 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=186, PETRI_PLACES=55, PETRI_TRANSITIONS=44} [2023-08-29 20:31:33,499 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2023-08-29 20:31:33,499 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 186 flow [2023-08-29 20:31:33,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:33,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:33,499 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:31:33,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-08-29 20:31:33,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:33,709 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:31:33,710 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:33,710 INFO L85 PathProgramCache]: Analyzing trace with hash -98062826, now seen corresponding path program 3 times [2023-08-29 20:31:33,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:31:33,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1902290114] [2023-08-29 20:31:33,711 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 20:31:33,711 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:33,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:31:33,716 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:31:33,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-08-29 20:31:33,839 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-29 20:31:33,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:31:33,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:31:33,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:31:33,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:31:33,886 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:31:33,886 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:31:33,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1902290114] [2023-08-29 20:31:33,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1902290114] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:31:33,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:31:33,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:31:33,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46057907] [2023-08-29 20:31:33,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:31:33,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:31:33,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:31:33,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:31:33,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:31:33,896 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 275 [2023-08-29 20:31:33,896 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 44 transitions, 186 flow. Second operand has 4 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:33,896 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:31:33,897 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 275 [2023-08-29 20:31:33,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:31:34,499 INFO L130 PetriNetUnfolder]: 3389/5437 cut-off events. [2023-08-29 20:31:34,499 INFO L131 PetriNetUnfolder]: For 4153/4154 co-relation queries the response was YES. [2023-08-29 20:31:34,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15581 conditions, 5437 events. 3389/5437 cut-off events. For 4153/4154 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 33621 event pairs, 418 based on Foata normal form. 1/5437 useless extension candidates. Maximal degree in co-relation 15570. Up to 2588 conditions per place. [2023-08-29 20:31:34,537 INFO L137 encePairwiseOnDemand]: 272/275 looper letters, 92 selfloop transitions, 2 changer transitions 0/96 dead transitions. [2023-08-29 20:31:34,537 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 96 transitions, 606 flow [2023-08-29 20:31:34,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:31:34,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:31:34,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 546 transitions. [2023-08-29 20:31:34,539 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49636363636363634 [2023-08-29 20:31:34,539 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 546 transitions. [2023-08-29 20:31:34,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 546 transitions. [2023-08-29 20:31:34,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:31:34,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 546 transitions. [2023-08-29 20:31:34,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 136.5) internal successors, (546), 4 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:34,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 275.0) internal successors, (1375), 5 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:34,543 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 275.0) internal successors, (1375), 5 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:34,544 INFO L175 Difference]: Start difference. First operand has 55 places, 44 transitions, 186 flow. Second operand 4 states and 546 transitions. [2023-08-29 20:31:34,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 96 transitions, 606 flow [2023-08-29 20:31:34,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 96 transitions, 603 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:31:34,606 INFO L231 Difference]: Finished difference. Result has 59 places, 45 transitions, 197 flow [2023-08-29 20:31:34,606 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=197, PETRI_PLACES=59, PETRI_TRANSITIONS=45} [2023-08-29 20:31:34,606 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 7 predicate places. [2023-08-29 20:31:34,607 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 45 transitions, 197 flow [2023-08-29 20:31:34,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:34,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:34,607 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:31:34,620 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 (10)] Ended with exit code 0 [2023-08-29 20:31:34,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:34,821 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:31:34,821 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:34,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1140525922, now seen corresponding path program 4 times [2023-08-29 20:31:34,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:31:34,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [676255922] [2023-08-29 20:31:34,822 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-29 20:31:34,822 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:34,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:31:34,824 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:31:34,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-08-29 20:31:34,951 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-29 20:31:34,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:31:34,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:31:34,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:31:34,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:31:34,971 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:31:34,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:31:34,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [676255922] [2023-08-29 20:31:34,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [676255922] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:31:34,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:31:34,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 20:31:34,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964241452] [2023-08-29 20:31:34,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:31:34,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:31:34,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:31:34,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:31:34,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:31:34,977 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 275 [2023-08-29 20:31:34,978 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 45 transitions, 197 flow. Second operand has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:34,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:31:34,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 275 [2023-08-29 20:31:34,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:31:35,618 INFO L130 PetriNetUnfolder]: 5141/7891 cut-off events. [2023-08-29 20:31:35,618 INFO L131 PetriNetUnfolder]: For 7509/7510 co-relation queries the response was YES. [2023-08-29 20:31:35,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23780 conditions, 7891 events. 5141/7891 cut-off events. For 7509/7510 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 48665 event pairs, 1700 based on Foata normal form. 1/7821 useless extension candidates. Maximal degree in co-relation 23767. Up to 4126 conditions per place. [2023-08-29 20:31:35,672 INFO L137 encePairwiseOnDemand]: 272/275 looper letters, 73 selfloop transitions, 2 changer transitions 0/78 dead transitions. [2023-08-29 20:31:35,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 78 transitions, 495 flow [2023-08-29 20:31:35,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:31:35,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:31:35,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions. [2023-08-29 20:31:35,675 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.503030303030303 [2023-08-29 20:31:35,675 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 415 transitions. [2023-08-29 20:31:35,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 415 transitions. [2023-08-29 20:31:35,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:31:35,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 415 transitions. [2023-08-29 20:31:35,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:35,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:35,678 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 275.0) internal successors, (1100), 4 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:35,678 INFO L175 Difference]: Start difference. First operand has 59 places, 45 transitions, 197 flow. Second operand 3 states and 415 transitions. [2023-08-29 20:31:35,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 78 transitions, 495 flow [2023-08-29 20:31:35,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 78 transitions, 494 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:31:35,815 INFO L231 Difference]: Finished difference. Result has 61 places, 46 transitions, 208 flow [2023-08-29 20:31:35,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=275, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=208, PETRI_PLACES=61, PETRI_TRANSITIONS=46} [2023-08-29 20:31:35,816 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2023-08-29 20:31:35,816 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 46 transitions, 208 flow [2023-08-29 20:31:35,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:31:35,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:31:35,816 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:31:35,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-08-29 20:31:36,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:36,027 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-29 20:31:36,027 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:31:36,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1902682054, now seen corresponding path program 5 times [2023-08-29 20:31:36,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:31:36,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1360491925] [2023-08-29 20:31:36,028 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-29 20:31:36,028 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:36,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:31:36,029 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-29 20:31:36,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-08-29 20:31:36,179 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 20:31:36,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-29 20:31:36,180 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:31:36,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:31:36,344 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-29 20:31:36,344 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:31:36,345 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-29 20:31:36,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-29 20:31:36,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-29 20:31:36,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-29 20:31:36,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-29 20:31:36,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-29 20:31:36,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-29 20:31:36,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-29 20:31:36,347 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-29 20:31:36,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-29 20:31:36,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-29 20:31:36,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-29 20:31:36,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-29 20:31:36,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-29 20:31:36,348 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-29 20:31:36,349 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-29 20:31:36,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-08-29 20:31:36,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:31:36,559 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2023-08-29 20:31:36,564 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:31:36,565 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:31:36,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:31:36 BasicIcfg [2023-08-29 20:31:36,651 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:31:36,651 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:31:36,652 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:31:36,652 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:31:36,652 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:31:17" (3/4) ... [2023-08-29 20:31:36,664 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:31:36,664 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:31:36,665 INFO L158 Benchmark]: Toolchain (without parser) took 21007.79ms. Allocated memory was 96.5MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 75.6MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 540.0MB. Max. memory is 16.1GB. [2023-08-29 20:31:36,665 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 62.9MB. Free memory is still 40.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:31:36,665 INFO L158 Benchmark]: CACSL2BoogieTranslator took 568.61ms. Allocated memory is still 96.5MB. Free memory was 75.3MB in the beginning and 74.5MB in the end (delta: 800.4kB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. [2023-08-29 20:31:36,665 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.35ms. Allocated memory is still 96.5MB. Free memory was 74.5MB in the beginning and 71.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:31:36,666 INFO L158 Benchmark]: Boogie Preprocessor took 66.40ms. Allocated memory is still 96.5MB. Free memory was 71.9MB in the beginning and 69.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:31:36,666 INFO L158 Benchmark]: RCFGBuilder took 711.02ms. Allocated memory is still 96.5MB. Free memory was 69.8MB in the beginning and 52.1MB in the end (delta: 17.8MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. [2023-08-29 20:31:36,668 INFO L158 Benchmark]: TraceAbstraction took 19575.58ms. Allocated memory was 96.5MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 51.5MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 516.4MB. Max. memory is 16.1GB. [2023-08-29 20:31:36,669 INFO L158 Benchmark]: Witness Printer took 12.72ms. Allocated memory is still 1.8GB. Free memory is still 1.2GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:31:36,670 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 62.9MB. Free memory is still 40.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 568.61ms. Allocated memory is still 96.5MB. Free memory was 75.3MB in the beginning and 74.5MB in the end (delta: 800.4kB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.35ms. Allocated memory is still 96.5MB. Free memory was 74.5MB in the beginning and 71.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.40ms. Allocated memory is still 96.5MB. Free memory was 71.9MB in the beginning and 69.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 711.02ms. Allocated memory is still 96.5MB. Free memory was 69.8MB in the beginning and 52.1MB in the end (delta: 17.8MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. * TraceAbstraction took 19575.58ms. Allocated memory was 96.5MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 51.5MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 516.4MB. Max. memory is 16.1GB. * Witness Printer took 12.72ms. Allocated memory is still 1.8GB. Free memory is still 1.2GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.7s, 148 PlacesBefore, 52 PlacesAfterwards, 137 TransitionsBefore, 40 TransitionsAfterwards, 3412 CoEnabledTransitionPairs, 6 FixpointIterations, 53 TrivialSequentialCompositions, 73 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 134 TotalNumberOfCompositions, 9228 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4199, independent: 3995, independent conditional: 0, independent unconditional: 3995, dependent: 204, dependent conditional: 0, dependent unconditional: 204, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1813, independent: 1765, independent conditional: 0, independent unconditional: 1765, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4199, independent: 2230, independent conditional: 0, independent unconditional: 2230, dependent: 156, dependent conditional: 0, dependent unconditional: 156, unknown: 1813, unknown conditional: 0, unknown unconditional: 1813] , Statistics on independence cache: Total cache size (in pairs): 208, Positive cache size: 187, Positive conditional cache size: 0, Positive unconditional cache size: 187, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool a$flush_delayed; [L718] 0 int a$mem_tmp; [L719] 0 _Bool a$r_buff0_thd0; [L720] 0 _Bool a$r_buff0_thd1; [L721] 0 _Bool a$r_buff0_thd2; [L722] 0 _Bool a$r_buff0_thd3; [L723] 0 _Bool a$r_buff0_thd4; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$r_buff1_thd4; [L729] 0 _Bool a$read_delayed; [L730] 0 int *a$read_delayed_var; [L731] 0 int a$w_buff0; [L732] 0 _Bool a$w_buff0_used; [L733] 0 int a$w_buff1; [L734] 0 _Bool a$w_buff1_used; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L859] 0 pthread_t t1457; [L860] FCALL, FORK 0 pthread_create(&t1457, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1457, ((void *)0), P0, ((void *)0))=-1, t1457={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L861] 0 pthread_t t1458; [L748] 1 a$w_buff1 = a$w_buff0 [L749] 1 a$w_buff0 = 1 [L750] 1 a$w_buff1_used = a$w_buff0_used [L751] 1 a$w_buff0_used = (_Bool)1 [L752] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L752] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L753] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L754] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L755] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L756] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L757] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L862] FCALL, FORK 0 pthread_create(&t1458, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1458, ((void *)0), P1, ((void *)0))=0, t1457={11:0}, t1458={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L863] 0 pthread_t t1459; [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L778] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L781] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L784] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L785] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L786] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L787] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L788] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L864] FCALL, FORK 0 pthread_create(&t1459, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1459, ((void *)0), P2, ((void *)0))=1, t1457={11:0}, t1458={15:0}, t1459={7:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L865] 0 pthread_t t1460; [L798] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L866] FCALL, FORK 0 pthread_create(&t1460, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1460, ((void *)0), P3, ((void *)0))=2, t1457={11:0}, t1458={15:0}, t1459={7:0}, t1460={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L801] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L804] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L805] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L806] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L807] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L808] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L818] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L821] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L822] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L823] 4 a$flush_delayed = weak$$choice2 [L824] 4 a$mem_tmp = a [L825] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L826] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L827] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L828] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L829] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L830] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L831] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 __unbuffered_p3_EAX = a [L833] 4 a = a$flush_delayed ? a$mem_tmp : a [L834] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, z=2] [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=2] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L837] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L839] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L840] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L841] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=2] [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L844] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 4 return 0; [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 3 return 0; [L868] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L870] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L870] RET 0 assume_abort_if_not(main$tmp_guard0) [L872] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L873] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L874] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L875] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L876] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1457={11:0}, t1458={15:0}, t1459={7:0}, t1460={-2147483637:0}, weak$$choice2=0, x=2, y=1, z=2] [L879] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 860]: 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: 864]: 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: 866]: 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: 862]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 177 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 19.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 465 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 391 mSDsluCounter, 178 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 142 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1872 IncrementalHoareTripleChecker+Invalid, 1937 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 36 mSDtfsCounter, 1872 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 178 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=226occurred in iteration=5, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 207 NumberOfCodeBlocks, 207 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 170 ConstructedInterpolants, 0 QuantifiedInterpolants, 691 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1488 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-29 20:31:36,690 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