./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe030_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/safe030_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 bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6 --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:50:40,825 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:50:40,828 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:50:40,868 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:50:40,871 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:50:40,873 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:50:40,875 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:50:40,878 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:50:40,881 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:50:40,885 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:50:40,886 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:50:40,887 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:50:40,887 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:50:40,889 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:50:40,890 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:50:40,891 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:50:40,893 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:50:40,894 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:50:40,895 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:50:40,898 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:50:40,907 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:50:40,910 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:50:40,911 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:50:40,912 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:50:40,916 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:50:40,920 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:50:40,920 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:50:40,921 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:50:40,922 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:50:40,923 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:50:40,923 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:50:40,926 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:50:40,927 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:50:40,928 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:50:40,929 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:50:40,930 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:50:40,930 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:50:40,931 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:50:40,931 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:50:40,931 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:50:40,932 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:50:40,933 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:50:40,961 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:50:40,961 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:50:40,962 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:50:40,962 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:50:40,963 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:50:40,963 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:50:40,964 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:50:40,964 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:50:40,965 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:50:40,965 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:50:40,966 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:50:40,966 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:50:40,966 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:50:40,966 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:50:40,966 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:50:40,967 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:50:40,967 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:50:40,967 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:50:40,967 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:50:40,967 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:50:40,968 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:50:40,968 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:50:40,968 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:50:40,968 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:50:40,968 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:50:40,969 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:50:40,969 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:50:40,969 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:50:40,969 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 20:50:40,969 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 20:50:40,970 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:50:40,970 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:50:40,970 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:50:40,970 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:50:40,970 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 -> bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6 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:50:41,283 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:50:41,302 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:50:41,304 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:50:41,305 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:50:41,305 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:50:41,306 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2023-08-29 20:50:42,489 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:50:42,795 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:50:42,795 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2023-08-29 20:50:42,804 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32032b615/9ceeba2aca9e4ea9a33d103d545952c5/FLAG50cb853ca [2023-08-29 20:50:42,818 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32032b615/9ceeba2aca9e4ea9a33d103d545952c5 [2023-08-29 20:50:42,821 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:50:42,822 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:50:42,823 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:50:42,823 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:50:42,827 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:50:42,827 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:50:42" (1/1) ... [2023-08-29 20:50:42,828 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5327a9c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:42, skipping insertion in model container [2023-08-29 20:50:42,830 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:50:42" (1/1) ... [2023-08-29 20:50:42,836 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:50:42,887 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:50:43,001 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/safe030_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2023-08-29 20:50:43,188 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:50:43,205 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:50:43,218 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/safe030_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2023-08-29 20:50:43,299 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:50:43,330 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:50:43,331 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:50:43,336 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:50:43,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:43 WrapperNode [2023-08-29 20:50:43,336 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:50:43,337 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:50:43,337 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:50:43,337 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:50:43,342 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:50:43" (1/1) ... [2023-08-29 20:50:43,359 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:50:43" (1/1) ... [2023-08-29 20:50:43,383 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2023-08-29 20:50:43,383 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:50:43,384 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:50:43,384 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:50:43,384 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:50:43,393 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:43" (1/1) ... [2023-08-29 20:50:43,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:43" (1/1) ... [2023-08-29 20:50:43,397 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:43" (1/1) ... [2023-08-29 20:50:43,404 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:43" (1/1) ... [2023-08-29 20:50:43,410 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:43" (1/1) ... [2023-08-29 20:50:43,412 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:43" (1/1) ... [2023-08-29 20:50:43,414 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:43" (1/1) ... [2023-08-29 20:50:43,415 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:43" (1/1) ... [2023-08-29 20:50:43,418 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:50:43,419 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:50:43,419 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:50:43,419 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:50:43,419 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:43" (1/1) ... [2023-08-29 20:50:43,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:50:43,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:50:43,458 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:50:43,477 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:50:43,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 20:50:43,491 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:50:43,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:50:43,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:50:43,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:50:43,492 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:50:43,492 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:50:43,492 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:50:43,492 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:50:43,493 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:50:43,493 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:50:43,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 20:50:43,493 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:50:43,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:50:43,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:50:43,494 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:50:43,632 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:50:43,634 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:50:43,968 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:50:44,099 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:50:44,100 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:50:44,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:50:44 BoogieIcfgContainer [2023-08-29 20:50:44,104 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:50:44,107 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:50:44,107 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:50:44,110 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:50:44,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:50:42" (1/3) ... [2023-08-29 20:50:44,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15b5579a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:50:44, skipping insertion in model container [2023-08-29 20:50:44,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:50:43" (2/3) ... [2023-08-29 20:50:44,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15b5579a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:50:44, skipping insertion in model container [2023-08-29 20:50:44,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:50:44" (3/3) ... [2023-08-29 20:50:44,113 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.oepc_pso.oepc_rmo.oepc.i [2023-08-29 20:50:44,128 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:50:44,128 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-29 20:50:44,128 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:50:44,183 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:50:44,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 116 transitions, 247 flow [2023-08-29 20:50:44,282 INFO L130 PetriNetUnfolder]: 2/113 cut-off events. [2023-08-29 20:50:44,282 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:50:44,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-29 20:50:44,287 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 116 transitions, 247 flow [2023-08-29 20:50:44,292 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 113 transitions, 235 flow [2023-08-29 20:50:44,295 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:50:44,312 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 113 transitions, 235 flow [2023-08-29 20:50:44,317 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 113 transitions, 235 flow [2023-08-29 20:50:44,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 113 transitions, 235 flow [2023-08-29 20:50:44,362 INFO L130 PetriNetUnfolder]: 2/113 cut-off events. [2023-08-29 20:50:44,363 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:50:44,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-29 20:50:44,366 INFO L119 LiptonReduction]: Number of co-enabled transitions 2144 [2023-08-29 20:50:48,125 INFO L134 LiptonReduction]: Checked pairs total: 5476 [2023-08-29 20:50:48,125 INFO L136 LiptonReduction]: Total number of compositions: 105 [2023-08-29 20:50:48,138 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:50:48,144 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;@53c7df5d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:50:48,144 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-29 20:50:48,146 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:50:48,146 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:50:48,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:48,147 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:50:48,147 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:50:48,151 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:48,151 INFO L85 PathProgramCache]: Analyzing trace with hash 505, now seen corresponding path program 1 times [2023-08-29 20:50:48,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:50:48,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679024426] [2023-08-29 20:50:48,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:50:48,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:50:48,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:50:48,251 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:50:48,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:50:48,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679024426] [2023-08-29 20:50:48,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679024426] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:50:48,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:50:48,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:50:48,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354154591] [2023-08-29 20:50:48,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:50:48,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:50:48,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:50:48,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:50:48,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:50:48,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 221 [2023-08-29 20:50:48,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 75 flow. Second operand has 2 states, 2 states have (on average 103.5) internal successors, (207), 2 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:48,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:50:48,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 221 [2023-08-29 20:50:48,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:50:48,666 INFO L130 PetriNetUnfolder]: 1463/2209 cut-off events. [2023-08-29 20:50:48,666 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2023-08-29 20:50:48,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4420 conditions, 2209 events. 1463/2209 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 10892 event pairs, 1463 based on Foata normal form. 80/1891 useless extension candidates. Maximal degree in co-relation 4409. Up to 2155 conditions per place. [2023-08-29 20:50:48,685 INFO L137 encePairwiseOnDemand]: 214/221 looper letters, 23 selfloop transitions, 0 changer transitions 0/26 dead transitions. [2023-08-29 20:50:48,685 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 107 flow [2023-08-29 20:50:48,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:50:48,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:50:48,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 236 transitions. [2023-08-29 20:50:48,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5339366515837104 [2023-08-29 20:50:48,698 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 236 transitions. [2023-08-29 20:50:48,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 236 transitions. [2023-08-29 20:50:48,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:50:48,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 236 transitions. [2023-08-29 20:50:48,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 118.0) internal successors, (236), 2 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:48,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:48,708 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:48,709 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 75 flow. Second operand 2 states and 236 transitions. [2023-08-29 20:50:48,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 107 flow [2023-08-29 20:50:48,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 26 transitions, 104 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:50:48,714 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 58 flow [2023-08-29 20:50:48,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=58, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2023-08-29 20:50:48,719 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -8 predicate places. [2023-08-29 20:50:48,719 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 58 flow [2023-08-29 20:50:48,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 103.5) internal successors, (207), 2 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:48,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:48,720 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 20:50:48,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 20:50:48,721 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:50:48,721 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:48,721 INFO L85 PathProgramCache]: Analyzing trace with hash 496101, now seen corresponding path program 1 times [2023-08-29 20:50:48,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:50:48,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658309006] [2023-08-29 20:50:48,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:50:48,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:50:48,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:50:48,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:50:48,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:50:48,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658309006] [2023-08-29 20:50:48,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658309006] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:50:48,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:50:48,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:50:48,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040561189] [2023-08-29 20:50:48,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:50:49,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:50:49,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:50:49,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:50:49,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:50:49,004 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 221 [2023-08-29 20:50:49,005 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:49,005 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:50:49,005 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 221 [2023-08-29 20:50:49,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:50:49,266 INFO L130 PetriNetUnfolder]: 1143/1745 cut-off events. [2023-08-29 20:50:49,266 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:50:49,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3486 conditions, 1745 events. 1143/1745 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 8257 event pairs, 479 based on Foata normal form. 0/1549 useless extension candidates. Maximal degree in co-relation 3483. Up to 1375 conditions per place. [2023-08-29 20:50:49,274 INFO L137 encePairwiseOnDemand]: 218/221 looper letters, 33 selfloop transitions, 2 changer transitions 4/42 dead transitions. [2023-08-29 20:50:49,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 42 transitions, 172 flow [2023-08-29 20:50:49,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:50:49,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:50:49,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2023-08-29 20:50:49,280 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.521870286576169 [2023-08-29 20:50:49,280 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 346 transitions. [2023-08-29 20:50:49,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 346 transitions. [2023-08-29 20:50:49,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:50:49,281 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 346 transitions. [2023-08-29 20:50:49,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:49,286 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:49,286 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:49,286 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 58 flow. Second operand 3 states and 346 transitions. [2023-08-29 20:50:49,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 42 transitions, 172 flow [2023-08-29 20:50:49,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 42 transitions, 172 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:50:49,288 INFO L231 Difference]: Finished difference. Result has 35 places, 23 transitions, 56 flow [2023-08-29 20:50:49,288 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2023-08-29 20:50:49,289 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -7 predicate places. [2023-08-29 20:50:49,289 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 56 flow [2023-08-29 20:50:49,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:49,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:49,289 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:50:49,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 20:50:49,290 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:50:49,292 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:49,292 INFO L85 PathProgramCache]: Analyzing trace with hash -317024778, now seen corresponding path program 1 times [2023-08-29 20:50:49,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:50:49,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318371344] [2023-08-29 20:50:49,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:50:49,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:50:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:50:50,224 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:50:50,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:50:50,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318371344] [2023-08-29 20:50:50,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318371344] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:50:50,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:50:50,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:50:50,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780821752] [2023-08-29 20:50:50,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:50:50,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:50:50,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:50:50,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:50:50,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:50:50,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 221 [2023-08-29 20:50:50,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 23 transitions, 56 flow. Second operand has 5 states, 5 states have (on average 91.0) internal successors, (455), 5 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:50,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:50:50,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 221 [2023-08-29 20:50:50,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:50:50,836 INFO L130 PetriNetUnfolder]: 2162/3172 cut-off events. [2023-08-29 20:50:50,836 INFO L131 PetriNetUnfolder]: For 168/168 co-relation queries the response was YES. [2023-08-29 20:50:50,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6574 conditions, 3172 events. 2162/3172 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 15369 event pairs, 231 based on Foata normal form. 0/3046 useless extension candidates. Maximal degree in co-relation 6570. Up to 1718 conditions per place. [2023-08-29 20:50:50,854 INFO L137 encePairwiseOnDemand]: 208/221 looper letters, 60 selfloop transitions, 26 changer transitions 0/87 dead transitions. [2023-08-29 20:50:50,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 87 transitions, 374 flow [2023-08-29 20:50:50,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:50:50,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:50:50,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 712 transitions. [2023-08-29 20:50:50,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4602456367162249 [2023-08-29 20:50:50,857 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 712 transitions. [2023-08-29 20:50:50,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 712 transitions. [2023-08-29 20:50:50,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:50:50,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 712 transitions. [2023-08-29 20:50:50,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 101.71428571428571) internal successors, (712), 7 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:50,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:50,865 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:50,865 INFO L175 Difference]: Start difference. First operand has 35 places, 23 transitions, 56 flow. Second operand 7 states and 712 transitions. [2023-08-29 20:50:50,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 87 transitions, 374 flow [2023-08-29 20:50:50,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 87 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:50:50,868 INFO L231 Difference]: Finished difference. Result has 42 places, 50 transitions, 252 flow [2023-08-29 20:50:50,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=252, PETRI_PLACES=42, PETRI_TRANSITIONS=50} [2023-08-29 20:50:50,870 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2023-08-29 20:50:50,872 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 50 transitions, 252 flow [2023-08-29 20:50:50,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.0) internal successors, (455), 5 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:50,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:50,873 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:50:50,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 20:50:50,874 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:50:50,874 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:50,875 INFO L85 PathProgramCache]: Analyzing trace with hash -317024704, now seen corresponding path program 1 times [2023-08-29 20:50:50,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:50:50,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93873283] [2023-08-29 20:50:50,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:50:50,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:50:50,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:50:51,307 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:50:51,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:50:51,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93873283] [2023-08-29 20:50:51,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93873283] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:50:51,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:50:51,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:50:51,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659008077] [2023-08-29 20:50:51,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:50:51,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:50:51,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:50:51,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:50:51,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:50:51,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 221 [2023-08-29 20:50:51,434 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 50 transitions, 252 flow. Second operand has 5 states, 5 states have (on average 90.0) internal successors, (450), 5 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:51,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:50:51,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 221 [2023-08-29 20:50:51,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:50:51,800 INFO L130 PetriNetUnfolder]: 1508/2280 cut-off events. [2023-08-29 20:50:51,800 INFO L131 PetriNetUnfolder]: For 3525/3733 co-relation queries the response was YES. [2023-08-29 20:50:51,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7587 conditions, 2280 events. 1508/2280 cut-off events. For 3525/3733 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 11378 event pairs, 552 based on Foata normal form. 391/2645 useless extension candidates. Maximal degree in co-relation 7579. Up to 2061 conditions per place. [2023-08-29 20:50:51,847 INFO L137 encePairwiseOnDemand]: 217/221 looper letters, 41 selfloop transitions, 3 changer transitions 9/61 dead transitions. [2023-08-29 20:50:51,847 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 61 transitions, 405 flow [2023-08-29 20:50:51,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:50:51,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:50:51,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 469 transitions. [2023-08-29 20:50:51,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4244343891402715 [2023-08-29 20:50:51,849 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 469 transitions. [2023-08-29 20:50:51,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 469 transitions. [2023-08-29 20:50:51,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:50:51,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 469 transitions. [2023-08-29 20:50:51,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 93.8) internal successors, (469), 5 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:51,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:51,854 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:51,854 INFO L175 Difference]: Start difference. First operand has 42 places, 50 transitions, 252 flow. Second operand 5 states and 469 transitions. [2023-08-29 20:50:51,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 61 transitions, 405 flow [2023-08-29 20:50:51,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 61 transitions, 405 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:50:51,860 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 190 flow [2023-08-29 20:50:51,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=190, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2023-08-29 20:50:51,862 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2023-08-29 20:50:51,862 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 190 flow [2023-08-29 20:50:51,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.0) internal successors, (450), 5 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:51,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:51,862 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:50:51,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 20:50:51,863 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:50:51,863 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:51,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1778325454, now seen corresponding path program 1 times [2023-08-29 20:50:51,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:50:51,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660305590] [2023-08-29 20:50:51,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:50:51,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:50:51,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:50:52,557 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:50:52,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:50:52,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660305590] [2023-08-29 20:50:52,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660305590] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:50:52,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:50:52,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:50:52,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094405523] [2023-08-29 20:50:52,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:50:52,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:50:52,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:50:52,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:50:52,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:50:52,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 221 [2023-08-29 20:50:52,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 190 flow. Second operand has 5 states, 5 states have (on average 91.2) internal successors, (456), 5 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:52,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:50:52,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 221 [2023-08-29 20:50:52,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:50:53,115 INFO L130 PetriNetUnfolder]: 1658/2645 cut-off events. [2023-08-29 20:50:53,116 INFO L131 PetriNetUnfolder]: For 3207/3225 co-relation queries the response was YES. [2023-08-29 20:50:53,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8726 conditions, 2645 events. 1658/2645 cut-off events. For 3207/3225 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 13833 event pairs, 281 based on Foata normal form. 140/2785 useless extension candidates. Maximal degree in co-relation 8717. Up to 1618 conditions per place. [2023-08-29 20:50:53,136 INFO L137 encePairwiseOnDemand]: 209/221 looper letters, 42 selfloop transitions, 15 changer transitions 45/103 dead transitions. [2023-08-29 20:50:53,136 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 103 transitions, 711 flow [2023-08-29 20:50:53,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:50:53,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:50:53,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 704 transitions. [2023-08-29 20:50:53,139 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4550743374272786 [2023-08-29 20:50:53,139 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 704 transitions. [2023-08-29 20:50:53,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 704 transitions. [2023-08-29 20:50:53,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:50:53,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 704 transitions. [2023-08-29 20:50:53,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 100.57142857142857) internal successors, (704), 7 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:53,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:53,147 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:53,147 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 190 flow. Second operand 7 states and 704 transitions. [2023-08-29 20:50:53,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 103 transitions, 711 flow [2023-08-29 20:50:53,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 103 transitions, 704 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:50:53,155 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 299 flow [2023-08-29 20:50:53,156 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=299, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2023-08-29 20:50:53,157 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2023-08-29 20:50:53,158 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 299 flow [2023-08-29 20:50:53,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.2) internal successors, (456), 5 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:53,158 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:53,158 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:50:53,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 20:50:53,159 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:50:53,159 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:53,159 INFO L85 PathProgramCache]: Analyzing trace with hash -708531811, now seen corresponding path program 1 times [2023-08-29 20:50:53,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:50:53,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653818942] [2023-08-29 20:50:53,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:50:53,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:50:53,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:50:53,380 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:50:53,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:50:53,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653818942] [2023-08-29 20:50:53,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653818942] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:50:53,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:50:53,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:50:53,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994256666] [2023-08-29 20:50:53,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:50:53,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:50:53,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:50:53,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:50:53,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:50:53,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 221 [2023-08-29 20:50:53,393 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 299 flow. Second operand has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:53,393 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:50:53,393 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 221 [2023-08-29 20:50:53,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:50:53,844 INFO L130 PetriNetUnfolder]: 1862/2912 cut-off events. [2023-08-29 20:50:53,844 INFO L131 PetriNetUnfolder]: For 8482/8591 co-relation queries the response was YES. [2023-08-29 20:50:53,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11458 conditions, 2912 events. 1862/2912 cut-off events. For 8482/8591 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 15860 event pairs, 480 based on Foata normal form. 191/3038 useless extension candidates. Maximal degree in co-relation 11444. Up to 1402 conditions per place. [2023-08-29 20:50:53,867 INFO L137 encePairwiseOnDemand]: 217/221 looper letters, 46 selfloop transitions, 6 changer transitions 23/81 dead transitions. [2023-08-29 20:50:53,867 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 81 transitions, 692 flow [2023-08-29 20:50:53,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:50:53,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:50:53,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 531 transitions. [2023-08-29 20:50:53,869 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4805429864253394 [2023-08-29 20:50:53,869 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 531 transitions. [2023-08-29 20:50:53,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 531 transitions. [2023-08-29 20:50:53,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:50:53,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 531 transitions. [2023-08-29 20:50:53,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.2) internal successors, (531), 5 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:53,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:53,873 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:53,874 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 299 flow. Second operand 5 states and 531 transitions. [2023-08-29 20:50:53,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 81 transitions, 692 flow [2023-08-29 20:50:53,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 81 transitions, 674 flow, removed 9 selfloop flow, removed 1 redundant places. [2023-08-29 20:50:53,896 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 313 flow [2023-08-29 20:50:53,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=313, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2023-08-29 20:50:53,897 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2023-08-29 20:50:53,897 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 313 flow [2023-08-29 20:50:53,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:53,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:53,898 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:50:53,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 20:50:53,898 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:50:53,898 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:53,898 INFO L85 PathProgramCache]: Analyzing trace with hash -707101843, now seen corresponding path program 1 times [2023-08-29 20:50:53,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:50:53,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426951639] [2023-08-29 20:50:53,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:50:53,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:50:53,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:50:54,606 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:50:54,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:50:54,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426951639] [2023-08-29 20:50:54,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426951639] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:50:54,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:50:54,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:50:54,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515703345] [2023-08-29 20:50:54,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:50:54,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:50:54,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:50:54,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:50:54,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:50:54,651 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 221 [2023-08-29 20:50:54,652 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 313 flow. Second operand has 5 states, 5 states have (on average 90.4) internal successors, (452), 5 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:54,652 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:50:54,652 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 221 [2023-08-29 20:50:54,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:50:55,351 INFO L130 PetriNetUnfolder]: 2585/3936 cut-off events. [2023-08-29 20:50:55,351 INFO L131 PetriNetUnfolder]: For 11690/11690 co-relation queries the response was YES. [2023-08-29 20:50:55,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15550 conditions, 3936 events. 2585/3936 cut-off events. For 11690/11690 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 20211 event pairs, 628 based on Foata normal form. 180/4116 useless extension candidates. Maximal degree in co-relation 15533. Up to 2741 conditions per place. [2023-08-29 20:50:55,379 INFO L137 encePairwiseOnDemand]: 208/221 looper letters, 49 selfloop transitions, 26 changer transitions 35/110 dead transitions. [2023-08-29 20:50:55,379 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 110 transitions, 954 flow [2023-08-29 20:50:55,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:50:55,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:50:55,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 700 transitions. [2023-08-29 20:50:55,382 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45248868778280543 [2023-08-29 20:50:55,382 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 700 transitions. [2023-08-29 20:50:55,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 700 transitions. [2023-08-29 20:50:55,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:50:55,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 700 transitions. [2023-08-29 20:50:55,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 100.0) internal successors, (700), 7 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:55,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:55,387 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:55,387 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 313 flow. Second operand 7 states and 700 transitions. [2023-08-29 20:50:55,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 110 transitions, 954 flow [2023-08-29 20:50:55,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 110 transitions, 915 flow, removed 12 selfloop flow, removed 6 redundant places. [2023-08-29 20:50:55,473 INFO L231 Difference]: Finished difference. Result has 58 places, 54 transitions, 524 flow [2023-08-29 20:50:55,473 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=524, PETRI_PLACES=58, PETRI_TRANSITIONS=54} [2023-08-29 20:50:55,474 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 16 predicate places. [2023-08-29 20:50:55,474 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 54 transitions, 524 flow [2023-08-29 20:50:55,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.4) internal successors, (452), 5 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:55,474 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:55,475 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:50:55,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 20:50:55,475 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:50:55,475 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:55,475 INFO L85 PathProgramCache]: Analyzing trace with hash -199130405, now seen corresponding path program 1 times [2023-08-29 20:50:55,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:50:55,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460494579] [2023-08-29 20:50:55,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:50:55,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:50:55,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:50:56,020 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:50:56,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:50:56,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460494579] [2023-08-29 20:50:56,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460494579] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:50:56,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:50:56,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:50:56,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064562644] [2023-08-29 20:50:56,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:50:56,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:50:56,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:50:56,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:50:56,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:50:56,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 221 [2023-08-29 20:50:56,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 54 transitions, 524 flow. Second operand has 5 states, 5 states have (on average 91.6) internal successors, (458), 5 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:56,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:50:56,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 221 [2023-08-29 20:50:56,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:50:56,812 INFO L130 PetriNetUnfolder]: 3017/4772 cut-off events. [2023-08-29 20:50:56,812 INFO L131 PetriNetUnfolder]: For 22207/22331 co-relation queries the response was YES. [2023-08-29 20:50:56,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22987 conditions, 4772 events. 3017/4772 cut-off events. For 22207/22331 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 27811 event pairs, 708 based on Foata normal form. 224/4954 useless extension candidates. Maximal degree in co-relation 22970. Up to 2128 conditions per place. [2023-08-29 20:50:56,850 INFO L137 encePairwiseOnDemand]: 209/221 looper letters, 56 selfloop transitions, 25 changer transitions 29/112 dead transitions. [2023-08-29 20:50:56,850 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 112 transitions, 1195 flow [2023-08-29 20:50:56,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:50:56,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:50:56,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 700 transitions. [2023-08-29 20:50:56,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45248868778280543 [2023-08-29 20:50:56,853 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 700 transitions. [2023-08-29 20:50:56,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 700 transitions. [2023-08-29 20:50:56,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:50:56,853 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 700 transitions. [2023-08-29 20:50:56,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 100.0) internal successors, (700), 7 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:56,857 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:56,858 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:56,858 INFO L175 Difference]: Start difference. First operand has 58 places, 54 transitions, 524 flow. Second operand 7 states and 700 transitions. [2023-08-29 20:50:56,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 112 transitions, 1195 flow [2023-08-29 20:50:56,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 112 transitions, 1189 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-29 20:50:56,945 INFO L231 Difference]: Finished difference. Result has 66 places, 61 transitions, 739 flow [2023-08-29 20:50:56,945 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=739, PETRI_PLACES=66, PETRI_TRANSITIONS=61} [2023-08-29 20:50:56,946 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places. [2023-08-29 20:50:56,946 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 61 transitions, 739 flow [2023-08-29 20:50:56,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.6) internal successors, (458), 5 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:56,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:56,947 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:50:56,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 20:50:56,947 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:50:56,947 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:56,948 INFO L85 PathProgramCache]: Analyzing trace with hash -135060535, now seen corresponding path program 1 times [2023-08-29 20:50:56,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:50:56,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373983301] [2023-08-29 20:50:56,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:50:56,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:50:56,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:50:57,763 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:50:57,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:50:57,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373983301] [2023-08-29 20:50:57,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373983301] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:50:57,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:50:57,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:50:57,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934357925] [2023-08-29 20:50:57,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:50:57,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:50:57,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:50:57,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:50:57,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:50:57,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 221 [2023-08-29 20:50:57,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 61 transitions, 739 flow. Second operand has 6 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:57,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:50:57,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 221 [2023-08-29 20:50:57,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:50:58,765 INFO L130 PetriNetUnfolder]: 2977/4688 cut-off events. [2023-08-29 20:50:58,765 INFO L131 PetriNetUnfolder]: For 37304/38231 co-relation queries the response was YES. [2023-08-29 20:50:58,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25031 conditions, 4688 events. 2977/4688 cut-off events. For 37304/38231 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 27350 event pairs, 950 based on Foata normal form. 779/5424 useless extension candidates. Maximal degree in co-relation 25009. Up to 3655 conditions per place. [2023-08-29 20:50:58,801 INFO L137 encePairwiseOnDemand]: 211/221 looper letters, 70 selfloop transitions, 27 changer transitions 38/144 dead transitions. [2023-08-29 20:50:58,801 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 144 transitions, 1922 flow [2023-08-29 20:50:58,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:50:58,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:50:58,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 816 transitions. [2023-08-29 20:50:58,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2023-08-29 20:50:58,804 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 816 transitions. [2023-08-29 20:50:58,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 816 transitions. [2023-08-29 20:50:58,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:50:58,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 816 transitions. [2023-08-29 20:50:58,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 102.0) internal successors, (816), 8 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:58,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 221.0) internal successors, (1989), 9 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:58,809 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 221.0) internal successors, (1989), 9 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:58,809 INFO L175 Difference]: Start difference. First operand has 66 places, 61 transitions, 739 flow. Second operand 8 states and 816 transitions. [2023-08-29 20:50:58,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 144 transitions, 1922 flow [2023-08-29 20:50:58,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 144 transitions, 1920 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-29 20:50:58,844 INFO L231 Difference]: Finished difference. Result has 74 places, 78 transitions, 1107 flow [2023-08-29 20:50:58,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=737, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1107, PETRI_PLACES=74, PETRI_TRANSITIONS=78} [2023-08-29 20:50:58,845 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 32 predicate places. [2023-08-29 20:50:58,845 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 78 transitions, 1107 flow [2023-08-29 20:50:58,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:58,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:50:58,846 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:50:58,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 20:50:58,846 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:50:58,846 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:50:58,847 INFO L85 PathProgramCache]: Analyzing trace with hash -447158153, now seen corresponding path program 1 times [2023-08-29 20:50:58,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:50:58,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706946776] [2023-08-29 20:50:58,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:50:58,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:50:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:50:59,161 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:50:59,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:50:59,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706946776] [2023-08-29 20:50:59,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706946776] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:50:59,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:50:59,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:50:59,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073010157] [2023-08-29 20:50:59,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:50:59,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:50:59,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:50:59,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:50:59,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:50:59,179 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 221 [2023-08-29 20:50:59,180 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 78 transitions, 1107 flow. Second operand has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:59,180 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:50:59,180 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 221 [2023-08-29 20:50:59,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:50:59,906 INFO L130 PetriNetUnfolder]: 2697/4251 cut-off events. [2023-08-29 20:50:59,906 INFO L131 PetriNetUnfolder]: For 51265/51900 co-relation queries the response was YES. [2023-08-29 20:50:59,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27584 conditions, 4251 events. 2697/4251 cut-off events. For 51265/51900 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 24228 event pairs, 995 based on Foata normal form. 450/4660 useless extension candidates. Maximal degree in co-relation 27557. Up to 3477 conditions per place. [2023-08-29 20:50:59,948 INFO L137 encePairwiseOnDemand]: 216/221 looper letters, 80 selfloop transitions, 8 changer transitions 22/119 dead transitions. [2023-08-29 20:50:59,948 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 119 transitions, 1820 flow [2023-08-29 20:50:59,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:50:59,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:50:59,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 635 transitions. [2023-08-29 20:50:59,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47888386123680243 [2023-08-29 20:50:59,951 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 635 transitions. [2023-08-29 20:50:59,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 635 transitions. [2023-08-29 20:50:59,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:50:59,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 635 transitions. [2023-08-29 20:50:59,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 105.83333333333333) internal successors, (635), 6 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:59,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 221.0) internal successors, (1547), 7 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:59,955 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 221.0) internal successors, (1547), 7 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:50:59,955 INFO L175 Difference]: Start difference. First operand has 74 places, 78 transitions, 1107 flow. Second operand 6 states and 635 transitions. [2023-08-29 20:50:59,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 119 transitions, 1820 flow [2023-08-29 20:51:00,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 119 transitions, 1797 flow, removed 9 selfloop flow, removed 2 redundant places. [2023-08-29 20:51:00,015 INFO L231 Difference]: Finished difference. Result has 77 places, 78 transitions, 1110 flow [2023-08-29 20:51:00,016 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=1084, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1110, PETRI_PLACES=77, PETRI_TRANSITIONS=78} [2023-08-29 20:51:00,017 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 35 predicate places. [2023-08-29 20:51:00,017 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 78 transitions, 1110 flow [2023-08-29 20:51:00,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:00,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:00,018 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:00,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 20:51:00,018 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:00,019 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:00,019 INFO L85 PathProgramCache]: Analyzing trace with hash 106253211, now seen corresponding path program 1 times [2023-08-29 20:51:00,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:51:00,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176060023] [2023-08-29 20:51:00,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:00,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:51:00,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:00,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:51:00,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:51:00,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176060023] [2023-08-29 20:51:00,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176060023] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:00,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:00,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:51:00,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193795217] [2023-08-29 20:51:00,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:00,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:51:00,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:51:00,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:51:00,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:51:00,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 221 [2023-08-29 20:51:00,904 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 78 transitions, 1110 flow. Second operand has 7 states, 7 states have (on average 88.0) internal successors, (616), 7 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:00,904 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:00,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 221 [2023-08-29 20:51:00,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:01,996 INFO L130 PetriNetUnfolder]: 3753/5831 cut-off events. [2023-08-29 20:51:01,997 INFO L131 PetriNetUnfolder]: For 65376/65376 co-relation queries the response was YES. [2023-08-29 20:51:02,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38356 conditions, 5831 events. 3753/5831 cut-off events. For 65376/65376 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 33402 event pairs, 736 based on Foata normal form. 197/6028 useless extension candidates. Maximal degree in co-relation 38326. Up to 3620 conditions per place. [2023-08-29 20:51:02,098 INFO L137 encePairwiseOnDemand]: 208/221 looper letters, 79 selfloop transitions, 61 changer transitions 53/193 dead transitions. [2023-08-29 20:51:02,098 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 193 transitions, 2978 flow [2023-08-29 20:51:02,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-29 20:51:02,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-29 20:51:02,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 962 transitions. [2023-08-29 20:51:02,102 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43529411764705883 [2023-08-29 20:51:02,102 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 962 transitions. [2023-08-29 20:51:02,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 962 transitions. [2023-08-29 20:51:02,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:02,103 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 962 transitions. [2023-08-29 20:51:02,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 96.2) internal successors, (962), 10 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:02,108 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 221.0) internal successors, (2431), 11 states have internal predecessors, (2431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:02,108 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 221.0) internal successors, (2431), 11 states have internal predecessors, (2431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:02,109 INFO L175 Difference]: Start difference. First operand has 77 places, 78 transitions, 1110 flow. Second operand 10 states and 962 transitions. [2023-08-29 20:51:02,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 193 transitions, 2978 flow [2023-08-29 20:51:02,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 193 transitions, 2944 flow, removed 11 selfloop flow, removed 5 redundant places. [2023-08-29 20:51:02,197 INFO L231 Difference]: Finished difference. Result has 87 places, 104 transitions, 1766 flow [2023-08-29 20:51:02,197 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=1090, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1766, PETRI_PLACES=87, PETRI_TRANSITIONS=104} [2023-08-29 20:51:02,198 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 45 predicate places. [2023-08-29 20:51:02,198 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 104 transitions, 1766 flow [2023-08-29 20:51:02,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 88.0) internal successors, (616), 7 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:02,198 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:02,198 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:02,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 20:51:02,199 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:02,199 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:02,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1104451855, now seen corresponding path program 2 times [2023-08-29 20:51:02,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:51:02,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836889588] [2023-08-29 20:51:02,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:02,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:51:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:02,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:51:02,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:51:02,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836889588] [2023-08-29 20:51:02,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836889588] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:02,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:02,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:51:02,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013281896] [2023-08-29 20:51:02,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:02,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:51:02,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:51:02,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:51:02,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:51:02,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 221 [2023-08-29 20:51:02,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 104 transitions, 1766 flow. Second operand has 7 states, 7 states have (on average 87.0) internal successors, (609), 7 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:02,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:02,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 221 [2023-08-29 20:51:02,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:04,119 INFO L130 PetriNetUnfolder]: 3673/5743 cut-off events. [2023-08-29 20:51:04,119 INFO L131 PetriNetUnfolder]: For 90217/90217 co-relation queries the response was YES. [2023-08-29 20:51:04,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43674 conditions, 5743 events. 3673/5743 cut-off events. For 90217/90217 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 33187 event pairs, 1079 based on Foata normal form. 158/5901 useless extension candidates. Maximal degree in co-relation 43639. Up to 3997 conditions per place. [2023-08-29 20:51:04,158 INFO L137 encePairwiseOnDemand]: 208/221 looper letters, 71 selfloop transitions, 83 changer transitions 58/212 dead transitions. [2023-08-29 20:51:04,158 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 212 transitions, 3911 flow [2023-08-29 20:51:04,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-29 20:51:04,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-29 20:51:04,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 949 transitions. [2023-08-29 20:51:04,161 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4294117647058823 [2023-08-29 20:51:04,161 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 949 transitions. [2023-08-29 20:51:04,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 949 transitions. [2023-08-29 20:51:04,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:04,161 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 949 transitions. [2023-08-29 20:51:04,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 94.9) internal successors, (949), 10 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:04,166 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 221.0) internal successors, (2431), 11 states have internal predecessors, (2431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:04,166 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 221.0) internal successors, (2431), 11 states have internal predecessors, (2431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:04,167 INFO L175 Difference]: Start difference. First operand has 87 places, 104 transitions, 1766 flow. Second operand 10 states and 949 transitions. [2023-08-29 20:51:04,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 212 transitions, 3911 flow [2023-08-29 20:51:04,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 212 transitions, 3832 flow, removed 34 selfloop flow, removed 4 redundant places. [2023-08-29 20:51:04,308 INFO L231 Difference]: Finished difference. Result has 97 places, 130 transitions, 2549 flow [2023-08-29 20:51:04,308 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=1723, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2549, PETRI_PLACES=97, PETRI_TRANSITIONS=130} [2023-08-29 20:51:04,309 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 55 predicate places. [2023-08-29 20:51:04,309 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 130 transitions, 2549 flow [2023-08-29 20:51:04,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 87.0) internal successors, (609), 7 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:04,310 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:04,310 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:04,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 20:51:04,310 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:04,310 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:04,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1104192385, now seen corresponding path program 3 times [2023-08-29 20:51:04,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:51:04,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670767418] [2023-08-29 20:51:04,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:04,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:51:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:05,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:51:05,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:51:05,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670767418] [2023-08-29 20:51:05,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670767418] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:05,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:05,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:51:05,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667190196] [2023-08-29 20:51:05,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:05,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-29 20:51:05,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:51:05,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-29 20:51:05,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-29 20:51:05,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 221 [2023-08-29 20:51:05,248 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 130 transitions, 2549 flow. Second operand has 7 states, 7 states have (on average 88.0) internal successors, (616), 7 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:05,248 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:05,248 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 221 [2023-08-29 20:51:05,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:06,095 INFO L130 PetriNetUnfolder]: 3309/5238 cut-off events. [2023-08-29 20:51:06,095 INFO L131 PetriNetUnfolder]: For 100892/100892 co-relation queries the response was YES. [2023-08-29 20:51:06,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43320 conditions, 5238 events. 3309/5238 cut-off events. For 100892/100892 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 30301 event pairs, 985 based on Foata normal form. 158/5396 useless extension candidates. Maximal degree in co-relation 43280. Up to 3422 conditions per place. [2023-08-29 20:51:06,130 INFO L137 encePairwiseOnDemand]: 210/221 looper letters, 77 selfloop transitions, 84 changer transitions 44/205 dead transitions. [2023-08-29 20:51:06,130 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 205 transitions, 4308 flow [2023-08-29 20:51:06,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:51:06,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:51:06,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 767 transitions. [2023-08-29 20:51:06,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4338235294117647 [2023-08-29 20:51:06,137 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 767 transitions. [2023-08-29 20:51:06,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 767 transitions. [2023-08-29 20:51:06,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:06,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 767 transitions. [2023-08-29 20:51:06,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 95.875) internal successors, (767), 8 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:06,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 221.0) internal successors, (1989), 9 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:06,142 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 221.0) internal successors, (1989), 9 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:06,142 INFO L175 Difference]: Start difference. First operand has 97 places, 130 transitions, 2549 flow. Second operand 8 states and 767 transitions. [2023-08-29 20:51:06,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 205 transitions, 4308 flow [2023-08-29 20:51:06,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 205 transitions, 4099 flow, removed 104 selfloop flow, removed 5 redundant places. [2023-08-29 20:51:06,376 INFO L231 Difference]: Finished difference. Result has 102 places, 143 transitions, 3028 flow [2023-08-29 20:51:06,377 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=2416, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3028, PETRI_PLACES=102, PETRI_TRANSITIONS=143} [2023-08-29 20:51:06,378 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 60 predicate places. [2023-08-29 20:51:06,378 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 143 transitions, 3028 flow [2023-08-29 20:51:06,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 88.0) internal successors, (616), 7 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:06,378 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:06,378 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:06,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 20:51:06,379 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:06,379 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:06,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1287512872, now seen corresponding path program 1 times [2023-08-29 20:51:06,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:51:06,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563167421] [2023-08-29 20:51:06,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:06,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:51:06,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:06,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:51:06,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:51:06,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563167421] [2023-08-29 20:51:06,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563167421] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:06,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:06,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:51:06,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023748555] [2023-08-29 20:51:06,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:06,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:51:06,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:51:06,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:51:06,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:51:06,566 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 221 [2023-08-29 20:51:06,567 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 143 transitions, 3028 flow. Second operand has 4 states, 4 states have (on average 98.5) internal successors, (394), 4 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:51:06,567 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:06,567 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 221 [2023-08-29 20:51:06,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:07,087 INFO L130 PetriNetUnfolder]: 1855/3126 cut-off events. [2023-08-29 20:51:07,087 INFO L131 PetriNetUnfolder]: For 93058/94617 co-relation queries the response was YES. [2023-08-29 20:51:07,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27771 conditions, 3126 events. 1855/3126 cut-off events. For 93058/94617 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 19243 event pairs, 264 based on Foata normal form. 1307/4401 useless extension candidates. Maximal degree in co-relation 27729. Up to 1853 conditions per place. [2023-08-29 20:51:07,159 INFO L137 encePairwiseOnDemand]: 215/221 looper letters, 118 selfloop transitions, 5 changer transitions 112/253 dead transitions. [2023-08-29 20:51:07,160 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 253 transitions, 5908 flow [2023-08-29 20:51:07,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:51:07,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:51:07,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 528 transitions. [2023-08-29 20:51:07,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47782805429864256 [2023-08-29 20:51:07,163 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 528 transitions. [2023-08-29 20:51:07,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 528 transitions. [2023-08-29 20:51:07,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:07,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 528 transitions. [2023-08-29 20:51:07,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.6) internal successors, (528), 5 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:07,167 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:07,167 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:07,167 INFO L175 Difference]: Start difference. First operand has 102 places, 143 transitions, 3028 flow. Second operand 5 states and 528 transitions. [2023-08-29 20:51:07,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 253 transitions, 5908 flow [2023-08-29 20:51:07,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 253 transitions, 5697 flow, removed 15 selfloop flow, removed 6 redundant places. [2023-08-29 20:51:07,277 INFO L231 Difference]: Finished difference. Result has 100 places, 112 transitions, 2230 flow [2023-08-29 20:51:07,277 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=2220, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2230, PETRI_PLACES=100, PETRI_TRANSITIONS=112} [2023-08-29 20:51:07,278 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 58 predicate places. [2023-08-29 20:51:07,278 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 112 transitions, 2230 flow [2023-08-29 20:51:07,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.5) internal successors, (394), 4 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:51:07,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:07,279 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:51:07,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-29 20:51:07,279 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:07,279 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:07,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1681267990, now seen corresponding path program 1 times [2023-08-29 20:51:07,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:51:07,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540606513] [2023-08-29 20:51:07,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:07,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:51:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:07,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:51:07,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:51:07,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540606513] [2023-08-29 20:51:07,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540606513] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:07,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:07,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:51:07,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005298494] [2023-08-29 20:51:07,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:07,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:51:07,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:51:07,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:51:07,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:51:07,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 221 [2023-08-29 20:51:07,506 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 112 transitions, 2230 flow. Second operand has 5 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:07,506 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:07,506 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 221 [2023-08-29 20:51:07,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:07,946 INFO L130 PetriNetUnfolder]: 1059/1851 cut-off events. [2023-08-29 20:51:07,947 INFO L131 PetriNetUnfolder]: For 48077/48773 co-relation queries the response was YES. [2023-08-29 20:51:07,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16960 conditions, 1851 events. 1059/1851 cut-off events. For 48077/48773 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 10736 event pairs, 57 based on Foata normal form. 638/2479 useless extension candidates. Maximal degree in co-relation 16920. Up to 801 conditions per place. [2023-08-29 20:51:07,963 INFO L137 encePairwiseOnDemand]: 215/221 looper letters, 102 selfloop transitions, 8 changer transitions 142/265 dead transitions. [2023-08-29 20:51:07,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 265 transitions, 6028 flow [2023-08-29 20:51:07,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:51:07,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:51:07,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 736 transitions. [2023-08-29 20:51:07,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47575953458306397 [2023-08-29 20:51:07,967 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 736 transitions. [2023-08-29 20:51:07,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 736 transitions. [2023-08-29 20:51:07,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:07,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 736 transitions. [2023-08-29 20:51:07,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 105.14285714285714) internal successors, (736), 7 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:07,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:07,972 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:07,972 INFO L175 Difference]: Start difference. First operand has 100 places, 112 transitions, 2230 flow. Second operand 7 states and 736 transitions. [2023-08-29 20:51:07,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 265 transitions, 6028 flow [2023-08-29 20:51:08,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 265 transitions, 5886 flow, removed 32 selfloop flow, removed 3 redundant places. [2023-08-29 20:51:08,046 INFO L231 Difference]: Finished difference. Result has 105 places, 85 transitions, 1581 flow [2023-08-29 20:51:08,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=2027, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1581, PETRI_PLACES=105, PETRI_TRANSITIONS=85} [2023-08-29 20:51:08,046 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 63 predicate places. [2023-08-29 20:51:08,047 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 85 transitions, 1581 flow [2023-08-29 20:51:08,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.0) internal successors, (490), 5 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:08,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:08,047 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:51:08,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-29 20:51:08,048 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:08,048 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:08,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1274552174, now seen corresponding path program 1 times [2023-08-29 20:51:08,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:51:08,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261256645] [2023-08-29 20:51:08,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:08,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:51:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:08,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:51:08,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:51:08,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261256645] [2023-08-29 20:51:08,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261256645] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:08,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:08,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:51:08,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642424327] [2023-08-29 20:51:08,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:08,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:51:08,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:51:08,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:51:08,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:51:08,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 221 [2023-08-29 20:51:08,312 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 85 transitions, 1581 flow. Second operand has 6 states, 6 states have (on average 97.83333333333333) internal successors, (587), 6 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:08,312 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:08,312 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 221 [2023-08-29 20:51:08,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:08,653 INFO L130 PetriNetUnfolder]: 634/1168 cut-off events. [2023-08-29 20:51:08,654 INFO L131 PetriNetUnfolder]: For 22427/22602 co-relation queries the response was YES. [2023-08-29 20:51:08,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10784 conditions, 1168 events. 634/1168 cut-off events. For 22427/22602 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 6515 event pairs, 45 based on Foata normal form. 150/1309 useless extension candidates. Maximal degree in co-relation 10742. Up to 484 conditions per place. [2023-08-29 20:51:08,663 INFO L137 encePairwiseOnDemand]: 215/221 looper letters, 50 selfloop transitions, 10 changer transitions 119/183 dead transitions. [2023-08-29 20:51:08,663 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 183 transitions, 3848 flow [2023-08-29 20:51:08,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-29 20:51:08,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-29 20:51:08,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 822 transitions. [2023-08-29 20:51:08,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4649321266968326 [2023-08-29 20:51:08,668 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 822 transitions. [2023-08-29 20:51:08,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 822 transitions. [2023-08-29 20:51:08,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:08,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 822 transitions. [2023-08-29 20:51:08,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 102.75) internal successors, (822), 8 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:08,674 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 221.0) internal successors, (1989), 9 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:08,675 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 221.0) internal successors, (1989), 9 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:08,675 INFO L175 Difference]: Start difference. First operand has 105 places, 85 transitions, 1581 flow. Second operand 8 states and 822 transitions. [2023-08-29 20:51:08,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 183 transitions, 3848 flow [2023-08-29 20:51:08,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 183 transitions, 3513 flow, removed 89 selfloop flow, removed 10 redundant places. [2023-08-29 20:51:08,726 INFO L231 Difference]: Finished difference. Result has 103 places, 43 transitions, 621 flow [2023-08-29 20:51:08,726 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=1377, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=621, PETRI_PLACES=103, PETRI_TRANSITIONS=43} [2023-08-29 20:51:08,727 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 61 predicate places. [2023-08-29 20:51:08,727 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 43 transitions, 621 flow [2023-08-29 20:51:08,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.83333333333333) internal successors, (587), 6 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:08,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:08,728 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:08,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-29 20:51:08,728 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:08,728 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:08,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1999981732, now seen corresponding path program 1 times [2023-08-29 20:51:08,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:51:08,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119262355] [2023-08-29 20:51:08,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:08,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:51:08,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:09,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:51:09,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:51:09,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119262355] [2023-08-29 20:51:09,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119262355] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:09,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:09,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 20:51:09,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583087236] [2023-08-29 20:51:09,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:09,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-29 20:51:09,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:51:09,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-29 20:51:09,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-08-29 20:51:09,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 221 [2023-08-29 20:51:09,701 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 43 transitions, 621 flow. Second operand has 10 states, 10 states have (on average 94.0) internal successors, (940), 10 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:09,701 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:09,701 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 221 [2023-08-29 20:51:09,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:09,940 INFO L130 PetriNetUnfolder]: 126/257 cut-off events. [2023-08-29 20:51:09,940 INFO L131 PetriNetUnfolder]: For 3062/3062 co-relation queries the response was YES. [2023-08-29 20:51:09,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2029 conditions, 257 events. 126/257 cut-off events. For 3062/3062 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 826 event pairs, 39 based on Foata normal form. 1/258 useless extension candidates. Maximal degree in co-relation 1990. Up to 160 conditions per place. [2023-08-29 20:51:09,942 INFO L137 encePairwiseOnDemand]: 214/221 looper letters, 48 selfloop transitions, 11 changer transitions 9/70 dead transitions. [2023-08-29 20:51:09,942 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 70 transitions, 1055 flow [2023-08-29 20:51:09,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:51:09,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:51:09,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 592 transitions. [2023-08-29 20:51:09,944 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4464555052790347 [2023-08-29 20:51:09,944 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 592 transitions. [2023-08-29 20:51:09,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 592 transitions. [2023-08-29 20:51:09,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:09,945 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 592 transitions. [2023-08-29 20:51:09,946 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:09,947 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 221.0) internal successors, (1547), 7 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:09,948 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 221.0) internal successors, (1547), 7 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:09,948 INFO L175 Difference]: Start difference. First operand has 103 places, 43 transitions, 621 flow. Second operand 6 states and 592 transitions. [2023-08-29 20:51:09,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 70 transitions, 1055 flow [2023-08-29 20:51:09,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 70 transitions, 691 flow, removed 76 selfloop flow, removed 33 redundant places. [2023-08-29 20:51:09,957 INFO L231 Difference]: Finished difference. Result has 69 places, 44 transitions, 422 flow [2023-08-29 20:51:09,957 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=422, PETRI_PLACES=69, PETRI_TRANSITIONS=44} [2023-08-29 20:51:09,958 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 27 predicate places. [2023-08-29 20:51:09,958 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 44 transitions, 422 flow [2023-08-29 20:51:09,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 94.0) internal successors, (940), 10 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:09,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:09,959 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:09,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-29 20:51:09,959 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:09,959 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:09,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1514924334, now seen corresponding path program 2 times [2023-08-29 20:51:09,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:51:09,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852702250] [2023-08-29 20:51:09,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:09,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:51:10,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:10,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:51:10,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 20:51:10,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852702250] [2023-08-29 20:51:10,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852702250] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:10,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:10,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 20:51:10,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320870510] [2023-08-29 20:51:10,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:10,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-29 20:51:10,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 20:51:10,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-29 20:51:10,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-29 20:51:10,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 221 [2023-08-29 20:51:10,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 44 transitions, 422 flow. Second operand has 10 states, 10 states have (on average 95.0) internal successors, (950), 10 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:10,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:10,965 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 221 [2023-08-29 20:51:10,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:11,164 INFO L130 PetriNetUnfolder]: 128/273 cut-off events. [2023-08-29 20:51:11,164 INFO L131 PetriNetUnfolder]: For 1626/1626 co-relation queries the response was YES. [2023-08-29 20:51:11,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1568 conditions, 273 events. 128/273 cut-off events. For 1626/1626 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 933 event pairs, 13 based on Foata normal form. 1/274 useless extension candidates. Maximal degree in co-relation 1544. Up to 142 conditions per place. [2023-08-29 20:51:11,166 INFO L137 encePairwiseOnDemand]: 215/221 looper letters, 40 selfloop transitions, 5 changer transitions 27/74 dead transitions. [2023-08-29 20:51:11,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 74 transitions, 761 flow [2023-08-29 20:51:11,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:51:11,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:51:11,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 695 transitions. [2023-08-29 20:51:11,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.449256625727214 [2023-08-29 20:51:11,167 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 695 transitions. [2023-08-29 20:51:11,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 695 transitions. [2023-08-29 20:51:11,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:11,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 695 transitions. [2023-08-29 20:51:11,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 99.28571428571429) internal successors, (695), 7 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:51:11,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:11,171 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:11,171 INFO L175 Difference]: Start difference. First operand has 69 places, 44 transitions, 422 flow. Second operand 7 states and 695 transitions. [2023-08-29 20:51:11,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 74 transitions, 761 flow [2023-08-29 20:51:11,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 74 transitions, 711 flow, removed 17 selfloop flow, removed 4 redundant places. [2023-08-29 20:51:11,176 INFO L231 Difference]: Finished difference. Result has 72 places, 37 transitions, 309 flow [2023-08-29 20:51:11,176 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=309, PETRI_PLACES=72, PETRI_TRANSITIONS=37} [2023-08-29 20:51:11,177 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 30 predicate places. [2023-08-29 20:51:11,177 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 37 transitions, 309 flow [2023-08-29 20:51:11,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 95.0) internal successors, (950), 10 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:11,178 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:11,178 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:11,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-29 20:51:11,178 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:11,178 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:11,178 INFO L85 PathProgramCache]: Analyzing trace with hash 2048187942, now seen corresponding path program 3 times [2023-08-29 20:51:11,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 20:51:11,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972793259] [2023-08-29 20:51:11,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:11,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 20:51:11,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:51:11,214 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:51:11,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:51:11,278 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 20:51:11,279 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:51:11,280 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-29 20:51:11,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-29 20:51:11,281 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-29 20:51:11,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-29 20:51:11,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-29 20:51:11,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-29 20:51:11,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-29 20:51:11,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-29 20:51:11,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-29 20:51:11,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-29 20:51:11,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-29 20:51:11,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-29 20:51:11,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-29 20:51:11,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-29 20:51:11,283 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:11,288 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:51:11,288 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:51:11,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:51:11 BasicIcfg [2023-08-29 20:51:11,362 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:51:11,363 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:51:11,363 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:51:11,363 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:51:11,363 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:50:44" (3/4) ... [2023-08-29 20:51:11,367 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:51:11,367 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:51:11,368 INFO L158 Benchmark]: Toolchain (without parser) took 28545.71ms. Allocated memory was 71.3MB in the beginning and 1.6GB in the end (delta: 1.6GB). Free memory was 48.0MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 558.0MB. Max. memory is 16.1GB. [2023-08-29 20:51:11,368 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 58.7MB. Free memory was 36.7MB in the beginning and 36.6MB in the end (delta: 58.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:51:11,368 INFO L158 Benchmark]: CACSL2BoogieTranslator took 513.53ms. Allocated memory is still 71.3MB. Free memory was 47.8MB in the beginning and 43.1MB in the end (delta: 4.7MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2023-08-29 20:51:11,368 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.50ms. Allocated memory is still 71.3MB. Free memory was 43.1MB in the beginning and 40.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:51:11,369 INFO L158 Benchmark]: Boogie Preprocessor took 34.09ms. Allocated memory is still 71.3MB. Free memory was 40.5MB in the beginning and 38.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:51:11,369 INFO L158 Benchmark]: RCFGBuilder took 685.54ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 38.6MB in the beginning and 55.7MB in the end (delta: -17.1MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2023-08-29 20:51:11,369 INFO L158 Benchmark]: TraceAbstraction took 27254.94ms. Allocated memory was 86.0MB in the beginning and 1.6GB in the end (delta: 1.6GB). Free memory was 55.2MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 549.2MB. Max. memory is 16.1GB. [2023-08-29 20:51:11,369 INFO L158 Benchmark]: Witness Printer took 4.60ms. Allocated memory is still 1.6GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:51:11,371 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 58.7MB. Free memory was 36.7MB in the beginning and 36.6MB in the end (delta: 58.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 513.53ms. Allocated memory is still 71.3MB. Free memory was 47.8MB in the beginning and 43.1MB in the end (delta: 4.7MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.50ms. Allocated memory is still 71.3MB. Free memory was 43.1MB in the beginning and 40.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.09ms. Allocated memory is still 71.3MB. Free memory was 40.5MB in the beginning and 38.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 685.54ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 38.6MB in the beginning and 55.7MB in the end (delta: -17.1MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. * TraceAbstraction took 27254.94ms. Allocated memory was 86.0MB in the beginning and 1.6GB in the end (delta: 1.6GB). Free memory was 55.2MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 549.2MB. Max. memory is 16.1GB. * Witness Printer took 4.60ms. Allocated memory is still 1.6GB. Free memory was 1.1GB in the beginning and 1.1GB 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: 3.8s, 121 PlacesBefore, 42 PlacesAfterwards, 113 TransitionsBefore, 33 TransitionsAfterwards, 2144 CoEnabledTransitionPairs, 6 FixpointIterations, 41 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 105 TotalNumberOfCompositions, 5476 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2477, independent: 2315, independent conditional: 0, independent unconditional: 2315, dependent: 162, dependent conditional: 0, dependent unconditional: 162, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1107, independent: 1075, independent conditional: 0, independent unconditional: 1075, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2477, independent: 1240, independent conditional: 0, independent unconditional: 1240, dependent: 130, dependent conditional: 0, dependent unconditional: 130, unknown: 1107, unknown conditional: 0, unknown unconditional: 1107] , Statistics on independence cache: Total cache size (in pairs): 112, Positive cache size: 96, Positive conditional cache size: 0, Positive unconditional cache size: 96, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L717] 0 int z = 0; [L718] 0 _Bool z$flush_delayed; [L719] 0 int z$mem_tmp; [L720] 0 _Bool z$r_buff0_thd0; [L721] 0 _Bool z$r_buff0_thd1; [L722] 0 _Bool z$r_buff0_thd2; [L723] 0 _Bool z$r_buff0_thd3; [L724] 0 _Bool z$r_buff1_thd0; [L725] 0 _Bool z$r_buff1_thd1; [L726] 0 _Bool z$r_buff1_thd2; [L727] 0 _Bool z$r_buff1_thd3; [L728] 0 _Bool z$read_delayed; [L729] 0 int *z$read_delayed_var; [L730] 0 int z$w_buff0; [L731] 0 _Bool z$w_buff0_used; [L732] 0 int z$w_buff1; [L733] 0 _Bool z$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L816] 0 pthread_t t2489; [L817] FCALL, FORK 0 pthread_create(&t2489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2489, ((void *)0), P0, ((void *)0))=-2, t2489={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L818] 0 pthread_t t2490; [L819] FCALL, FORK 0 pthread_create(&t2490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2490, ((void *)0), P1, ((void *)0))=-1, t2489={5:0}, t2490={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L820] 0 pthread_t t2491; [L821] FCALL, FORK 0 pthread_create(&t2491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2491, ((void *)0), P2, ((void *)0))=0, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L739] 1 z$w_buff1 = z$w_buff0 [L740] 1 z$w_buff0 = 2 [L741] 1 z$w_buff1_used = z$w_buff0_used [L742] 1 z$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L744] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L745] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L746] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L747] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L748] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 y = 1 VAL [__unbuffered_cnt=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L775] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L776] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L777] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L778] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L788] 3 y = 2 VAL [__unbuffered_cnt=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=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L791] 3 z = 1 VAL [__unbuffered_cnt=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=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L794] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L795] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L796] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L797] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=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=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=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=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L783] 2 return 0; [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 3 return 0; [L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L825] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L825] RET 0 assume_abort_if_not(main$tmp_guard0) [L827] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L828] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L829] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L830] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L831] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L834] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 0 z$flush_delayed = weak$$choice2 [L837] 0 z$mem_tmp = z [L838] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L839] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L840] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L841] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L842] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L844] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L846] 0 z = z$flush_delayed ? z$mem_tmp : z [L847] 0 z$flush_delayed = (_Bool)0 [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, 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=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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: 814]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 821]: 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: 817]: 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: 819]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 143 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 27.1s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 13.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1242 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 974 mSDsluCounter, 949 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 765 mSDsCounter, 319 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2773 IncrementalHoareTripleChecker+Invalid, 3092 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 319 mSolverCounterUnsat, 184 mSDtfsCounter, 2773 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3028occurred in iteration=13, InterpolantAutomatonStates: 118, 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.5s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 256 NumberOfCodeBlocks, 256 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 216 ConstructedInterpolants, 0 QuantifiedInterpolants, 2775 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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:51:11,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_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 bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 20:51:13,405 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 20:51:13,408 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 20:51:13,440 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 20:51:13,441 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 20:51:13,444 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 20:51:13,456 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 20:51:13,459 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 20:51:13,462 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 20:51:13,466 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 20:51:13,467 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 20:51:13,470 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 20:51:13,470 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 20:51:13,472 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 20:51:13,473 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 20:51:13,478 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 20:51:13,479 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 20:51:13,481 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 20:51:13,482 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 20:51:13,487 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 20:51:13,488 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 20:51:13,489 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 20:51:13,490 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 20:51:13,491 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 20:51:13,497 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 20:51:13,497 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 20:51:13,497 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 20:51:13,499 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 20:51:13,499 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 20:51:13,500 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 20:51:13,500 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 20:51:13,501 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 20:51:13,503 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 20:51:13,504 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 20:51:13,504 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 20:51:13,504 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 20:51:13,505 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 20:51:13,505 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 20:51:13,505 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 20:51:13,506 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 20:51:13,506 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 20:51:13,508 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:51:13,546 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 20:51:13,546 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 20:51:13,547 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 20:51:13,547 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 20:51:13,548 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 20:51:13,548 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 20:51:13,549 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 20:51:13,549 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 20:51:13,549 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 20:51:13,549 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 20:51:13,550 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 20:51:13,550 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 20:51:13,550 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 20:51:13,550 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 20:51:13,550 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 20:51:13,551 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 20:51:13,551 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 20:51:13,551 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 20:51:13,551 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 20:51:13,551 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 20:51:13,551 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-29 20:51:13,551 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-29 20:51:13,551 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 20:51:13,552 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 20:51:13,552 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 20:51:13,552 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 20:51:13,552 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 20:51:13,552 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:51:13,552 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 20:51:13,552 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 20:51:13,553 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-29 20:51:13,553 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-29 20:51:13,553 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 20:51:13,553 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 20:51:13,553 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 20:51:13,553 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-29 20:51:13,553 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 20:51:13,554 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 -> bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-29 20:51:13,875 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 20:51:13,893 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 20:51:13,895 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 20:51:13,896 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 20:51:13,897 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 20:51:13,898 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2023-08-29 20:51:14,993 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 20:51:15,249 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 20:51:15,261 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2023-08-29 20:51:15,278 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c97de3fe9/924e622b4a384d3d8d8e0cdc464ad114/FLAGd1508b188 [2023-08-29 20:51:15,297 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c97de3fe9/924e622b4a384d3d8d8e0cdc464ad114 [2023-08-29 20:51:15,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 20:51:15,300 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 20:51:15,303 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 20:51:15,304 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 20:51:15,306 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 20:51:15,307 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:51:15" (1/1) ... [2023-08-29 20:51:15,308 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50d9c75c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:15, skipping insertion in model container [2023-08-29 20:51:15,308 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 08:51:15" (1/1) ... [2023-08-29 20:51:15,314 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 20:51:15,366 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 20:51:15,527 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/safe030_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2023-08-29 20:51:15,701 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:51:15,714 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 20:51:15,732 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/safe030_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2023-08-29 20:51:15,835 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 20:51:15,865 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:51:15,866 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-29 20:51:15,872 INFO L208 MainTranslator]: Completed translation [2023-08-29 20:51:15,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:15 WrapperNode [2023-08-29 20:51:15,872 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 20:51:15,873 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 20:51:15,873 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 20:51:15,873 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 20:51:15,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:15" (1/1) ... [2023-08-29 20:51:15,894 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:15" (1/1) ... [2023-08-29 20:51:15,917 INFO L138 Inliner]: procedures = 179, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-08-29 20:51:15,917 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 20:51:15,918 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 20:51:15,918 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 20:51:15,918 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 20:51:15,926 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:15" (1/1) ... [2023-08-29 20:51:15,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:15" (1/1) ... [2023-08-29 20:51:15,930 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:15" (1/1) ... [2023-08-29 20:51:15,930 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:15" (1/1) ... [2023-08-29 20:51:15,941 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:15" (1/1) ... [2023-08-29 20:51:15,942 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:15" (1/1) ... [2023-08-29 20:51:15,945 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:15" (1/1) ... [2023-08-29 20:51:15,946 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:15" (1/1) ... [2023-08-29 20:51:15,949 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 20:51:15,950 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 20:51:15,950 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 20:51:15,950 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 20:51:15,951 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:15" (1/1) ... [2023-08-29 20:51:15,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 20:51:15,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 20:51:15,993 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-29 20:51:16,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-29 20:51:16,032 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-29 20:51:16,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 20:51:16,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 20:51:16,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 20:51:16,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-29 20:51:16,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-29 20:51:16,033 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-29 20:51:16,034 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-29 20:51:16,034 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-29 20:51:16,034 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-29 20:51:16,034 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-29 20:51:16,034 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-29 20:51:16,034 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-29 20:51:16,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 20:51:16,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 20:51:16,036 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 20:51:16,200 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 20:51:16,202 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 20:51:16,610 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 20:51:16,744 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 20:51:16,744 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-29 20:51:16,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:51:16 BoogieIcfgContainer [2023-08-29 20:51:16,746 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 20:51:16,749 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 20:51:16,749 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 20:51:16,752 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 20:51:16,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 08:51:15" (1/3) ... [2023-08-29 20:51:16,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ba5107a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:51:16, skipping insertion in model container [2023-08-29 20:51:16,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 08:51:15" (2/3) ... [2023-08-29 20:51:16,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ba5107a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 08:51:16, skipping insertion in model container [2023-08-29 20:51:16,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:51:16" (3/3) ... [2023-08-29 20:51:16,755 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.oepc_pso.oepc_rmo.oepc.i [2023-08-29 20:51:16,770 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 20:51:16,770 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-29 20:51:16,771 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 20:51:16,831 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 20:51:16,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 117 transitions, 249 flow [2023-08-29 20:51:16,933 INFO L130 PetriNetUnfolder]: 2/114 cut-off events. [2023-08-29 20:51:16,933 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:51:16,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-29 20:51:16,938 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 117 transitions, 249 flow [2023-08-29 20:51:16,942 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 114 transitions, 237 flow [2023-08-29 20:51:16,946 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 20:51:16,960 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 114 transitions, 237 flow [2023-08-29 20:51:16,962 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 114 transitions, 237 flow [2023-08-29 20:51:16,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 237 flow [2023-08-29 20:51:16,996 INFO L130 PetriNetUnfolder]: 2/114 cut-off events. [2023-08-29 20:51:16,996 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:51:16,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2023-08-29 20:51:17,000 INFO L119 LiptonReduction]: Number of co-enabled transitions 2144 [2023-08-29 20:51:22,896 INFO L134 LiptonReduction]: Checked pairs total: 5468 [2023-08-29 20:51:22,896 INFO L136 LiptonReduction]: Total number of compositions: 112 [2023-08-29 20:51:22,908 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 20:51:22,913 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;@f0f491f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 20:51:22,913 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-29 20:51:22,915 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-29 20:51:22,915 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:51:22,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:22,915 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-29 20:51:22,916 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:22,922 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:22,922 INFO L85 PathProgramCache]: Analyzing trace with hash 515, now seen corresponding path program 1 times [2023-08-29 20:51:22,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:51:22,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [198896391] [2023-08-29 20:51:22,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:22,940 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:51:22,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:51:22,944 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:51:22,995 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:51:23,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:23,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-29 20:51:23,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:51:23,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:51:23,039 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:51:23,040 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:51:23,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [198896391] [2023-08-29 20:51:23,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [198896391] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:23,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:23,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-29 20:51:23,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114211205] [2023-08-29 20:51:23,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:23,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-29 20:51:23,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:51:23,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-29 20:51:23,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-29 20:51:23,078 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 229 [2023-08-29 20:51:23,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 75 flow. Second operand has 2 states, 2 states have (on average 104.5) internal successors, (209), 2 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:23,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:23,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 229 [2023-08-29 20:51:23,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:23,521 INFO L130 PetriNetUnfolder]: 1463/2208 cut-off events. [2023-08-29 20:51:23,522 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2023-08-29 20:51:23,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4419 conditions, 2208 events. 1463/2208 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 10851 event pairs, 1463 based on Foata normal form. 80/1888 useless extension candidates. Maximal degree in co-relation 4408. Up to 2155 conditions per place. [2023-08-29 20:51:23,536 INFO L137 encePairwiseOnDemand]: 222/229 looper letters, 23 selfloop transitions, 0 changer transitions 0/26 dead transitions. [2023-08-29 20:51:23,537 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 107 flow [2023-08-29 20:51:23,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-29 20:51:23,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-29 20:51:23,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 238 transitions. [2023-08-29 20:51:23,548 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.519650655021834 [2023-08-29 20:51:23,549 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 238 transitions. [2023-08-29 20:51:23,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 238 transitions. [2023-08-29 20:51:23,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:23,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 238 transitions. [2023-08-29 20:51:23,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 119.0) internal successors, (238), 2 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:23,558 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:23,559 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:23,560 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 75 flow. Second operand 2 states and 238 transitions. [2023-08-29 20:51:23,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 107 flow [2023-08-29 20:51:23,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 26 transitions, 104 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-29 20:51:23,564 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 58 flow [2023-08-29 20:51:23,566 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=58, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2023-08-29 20:51:23,569 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -8 predicate places. [2023-08-29 20:51:23,569 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 58 flow [2023-08-29 20:51:23,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 104.5) internal successors, (209), 2 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:23,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:23,569 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-29 20:51:23,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-08-29 20:51:23,783 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:51:23,783 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:23,784 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:23,784 INFO L85 PathProgramCache]: Analyzing trace with hash 505775, now seen corresponding path program 1 times [2023-08-29 20:51:23,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:51:23,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1309595667] [2023-08-29 20:51:23,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:23,785 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-29 20:51:23,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:51:23,787 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:51:23,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-29 20:51:23,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:23,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:51:23,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:51:23,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:51:23,866 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:51:23,866 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:51:23,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1309595667] [2023-08-29 20:51:23,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1309595667] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:23,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:23,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 20:51:23,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850700198] [2023-08-29 20:51:23,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:23,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 20:51:23,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:51:23,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 20:51:23,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 20:51:23,873 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 229 [2023-08-29 20:51:23,873 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:23,873 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:23,874 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 229 [2023-08-29 20:51:23,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:24,201 INFO L130 PetriNetUnfolder]: 1143/1845 cut-off events. [2023-08-29 20:51:24,202 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 20:51:24,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3586 conditions, 1845 events. 1143/1845 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 10369 event pairs, 183 based on Foata normal form. 0/1649 useless extension candidates. Maximal degree in co-relation 3583. Up to 1375 conditions per place. [2023-08-29 20:51:24,211 INFO L137 encePairwiseOnDemand]: 226/229 looper letters, 33 selfloop transitions, 2 changer transitions 4/42 dead transitions. [2023-08-29 20:51:24,211 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 42 transitions, 172 flow [2023-08-29 20:51:24,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 20:51:24,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 20:51:24,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 349 transitions. [2023-08-29 20:51:24,217 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5080058224163028 [2023-08-29 20:51:24,218 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 349 transitions. [2023-08-29 20:51:24,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 349 transitions. [2023-08-29 20:51:24,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:24,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 349 transitions. [2023-08-29 20:51:24,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:24,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:24,225 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:24,225 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 58 flow. Second operand 3 states and 349 transitions. [2023-08-29 20:51:24,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 42 transitions, 172 flow [2023-08-29 20:51:24,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 42 transitions, 172 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 20:51:24,227 INFO L231 Difference]: Finished difference. Result has 35 places, 23 transitions, 56 flow [2023-08-29 20:51:24,227 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2023-08-29 20:51:24,228 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -7 predicate places. [2023-08-29 20:51:24,228 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 56 flow [2023-08-29 20:51:24,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:24,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:24,228 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:24,240 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:51:24,437 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:51:24,437 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:24,438 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:24,438 INFO L85 PathProgramCache]: Analyzing trace with hash -2024101978, now seen corresponding path program 1 times [2023-08-29 20:51:24,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:51:24,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [154042970] [2023-08-29 20:51:24,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:24,439 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:51:24,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:51:24,443 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:51:24,446 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:51:24,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:24,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:51:24,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:51:24,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:51:24,623 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:51:24,623 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:51:24,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [154042970] [2023-08-29 20:51:24,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [154042970] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:24,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:24,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:51:24,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972324082] [2023-08-29 20:51:24,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:24,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:51:24,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:51:24,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:51:24,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:51:24,651 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 229 [2023-08-29 20:51:24,652 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 23 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 98.5) internal successors, (394), 4 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:51:24,652 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:24,652 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 229 [2023-08-29 20:51:24,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:24,876 INFO L130 PetriNetUnfolder]: 557/928 cut-off events. [2023-08-29 20:51:24,876 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2023-08-29 20:51:24,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1963 conditions, 928 events. 557/928 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4414 event pairs, 113 based on Foata normal form. 64/951 useless extension candidates. Maximal degree in co-relation 1959. Up to 633 conditions per place. [2023-08-29 20:51:24,882 INFO L137 encePairwiseOnDemand]: 223/229 looper letters, 29 selfloop transitions, 4 changer transitions 19/55 dead transitions. [2023-08-29 20:51:24,882 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 55 transitions, 234 flow [2023-08-29 20:51:24,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:51:24,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:51:24,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 534 transitions. [2023-08-29 20:51:24,884 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4663755458515284 [2023-08-29 20:51:24,884 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 534 transitions. [2023-08-29 20:51:24,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 534 transitions. [2023-08-29 20:51:24,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:24,885 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 534 transitions. [2023-08-29 20:51:24,886 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.8) internal successors, (534), 5 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:24,888 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:24,889 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:24,889 INFO L175 Difference]: Start difference. First operand has 35 places, 23 transitions, 56 flow. Second operand 5 states and 534 transitions. [2023-08-29 20:51:24,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 55 transitions, 234 flow [2023-08-29 20:51:24,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 55 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 20:51:24,891 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 88 flow [2023-08-29 20:51:24,891 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=88, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2023-08-29 20:51:24,892 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -4 predicate places. [2023-08-29 20:51:24,892 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 88 flow [2023-08-29 20:51:24,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.5) internal successors, (394), 4 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:51:24,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:24,893 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:24,908 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:51:25,105 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:51:25,106 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:25,106 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:25,106 INFO L85 PathProgramCache]: Analyzing trace with hash 554545124, now seen corresponding path program 1 times [2023-08-29 20:51:25,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:51:25,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [226598295] [2023-08-29 20:51:25,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:25,108 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:51:25,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:51:25,109 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:51:25,112 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:51:25,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:25,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 20:51:25,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:51:25,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:51:25,244 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:51:25,244 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:51:25,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [226598295] [2023-08-29 20:51:25,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [226598295] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:25,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:25,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 20:51:25,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402448787] [2023-08-29 20:51:25,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:25,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:51:25,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:51:25,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:51:25,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:51:25,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 229 [2023-08-29 20:51:25,267 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 98.6) internal successors, (493), 5 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:25,267 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:25,267 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 229 [2023-08-29 20:51:25,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:25,473 INFO L130 PetriNetUnfolder]: 233/441 cut-off events. [2023-08-29 20:51:25,474 INFO L131 PetriNetUnfolder]: For 145/145 co-relation queries the response was YES. [2023-08-29 20:51:25,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1177 conditions, 441 events. 233/441 cut-off events. For 145/145 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1890 event pairs, 61 based on Foata normal form. 37/464 useless extension candidates. Maximal degree in co-relation 1170. Up to 140 conditions per place. [2023-08-29 20:51:25,477 INFO L137 encePairwiseOnDemand]: 223/229 looper letters, 37 selfloop transitions, 7 changer transitions 19/66 dead transitions. [2023-08-29 20:51:25,477 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 66 transitions, 338 flow [2023-08-29 20:51:25,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 20:51:25,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 20:51:25,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 641 transitions. [2023-08-29 20:51:25,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46652110625909754 [2023-08-29 20:51:25,480 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 641 transitions. [2023-08-29 20:51:25,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 641 transitions. [2023-08-29 20:51:25,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:25,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 641 transitions. [2023-08-29 20:51:25,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 106.83333333333333) internal successors, (641), 6 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:25,484 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 229.0) internal successors, (1603), 7 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:25,485 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 229.0) internal successors, (1603), 7 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:25,485 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 88 flow. Second operand 6 states and 641 transitions. [2023-08-29 20:51:25,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 66 transitions, 338 flow [2023-08-29 20:51:25,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 66 transitions, 332 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-29 20:51:25,488 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 138 flow [2023-08-29 20:51:25,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=138, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-08-29 20:51:25,489 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2023-08-29 20:51:25,489 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 138 flow [2023-08-29 20:51:25,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.6) internal successors, (493), 5 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:25,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:25,490 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:25,502 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:51:25,699 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:51:25,700 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:25,700 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:25,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1044811710, now seen corresponding path program 1 times [2023-08-29 20:51:25,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:51:25,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1222228681] [2023-08-29 20:51:25,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:25,701 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:51:25,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:51:25,703 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:51:25,705 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:51:25,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:25,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-29 20:51:25,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:51:25,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:51:25,855 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:51:25,855 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:51:25,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1222228681] [2023-08-29 20:51:25,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1222228681] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:25,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:25,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 20:51:25,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815605742] [2023-08-29 20:51:25,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:25,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 20:51:25,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:51:25,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 20:51:25,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 20:51:25,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 229 [2023-08-29 20:51:25,883 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 138 flow. Second operand has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:25,884 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:25,884 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 229 [2023-08-29 20:51:25,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:26,113 INFO L130 PetriNetUnfolder]: 143/279 cut-off events. [2023-08-29 20:51:26,113 INFO L131 PetriNetUnfolder]: For 263/263 co-relation queries the response was YES. [2023-08-29 20:51:26,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 812 conditions, 279 events. 143/279 cut-off events. For 263/263 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1085 event pairs, 56 based on Foata normal form. 10/284 useless extension candidates. Maximal degree in co-relation 803. Up to 108 conditions per place. [2023-08-29 20:51:26,115 INFO L137 encePairwiseOnDemand]: 223/229 looper letters, 34 selfloop transitions, 10 changer transitions 10/57 dead transitions. [2023-08-29 20:51:26,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 57 transitions, 336 flow [2023-08-29 20:51:26,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 20:51:26,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 20:51:26,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 728 transitions. [2023-08-29 20:51:26,118 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45414847161572053 [2023-08-29 20:51:26,118 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 728 transitions. [2023-08-29 20:51:26,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 728 transitions. [2023-08-29 20:51:26,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:26,119 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 728 transitions. [2023-08-29 20:51:26,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 104.0) internal successors, (728), 7 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:26,123 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 229.0) internal successors, (1832), 8 states have internal predecessors, (1832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:26,124 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 229.0) internal successors, (1832), 8 states have internal predecessors, (1832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:26,124 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 138 flow. Second operand 7 states and 728 transitions. [2023-08-29 20:51:26,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 57 transitions, 336 flow [2023-08-29 20:51:26,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 57 transitions, 300 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-08-29 20:51:26,128 INFO L231 Difference]: Finished difference. Result has 45 places, 29 transitions, 140 flow [2023-08-29 20:51:26,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=140, PETRI_PLACES=45, PETRI_TRANSITIONS=29} [2023-08-29 20:51:26,129 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2023-08-29 20:51:26,129 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 29 transitions, 140 flow [2023-08-29 20:51:26,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:26,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:26,130 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:26,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-08-29 20:51:26,340 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:51:26,341 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:26,341 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:26,341 INFO L85 PathProgramCache]: Analyzing trace with hash 907167875, now seen corresponding path program 1 times [2023-08-29 20:51:26,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:51:26,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2122956426] [2023-08-29 20:51:26,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:26,342 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:51:26,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:51:26,343 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:51:26,346 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:51:26,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:26,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-29 20:51:26,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:51:26,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:51:26,963 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:51:26,964 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:51:26,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2122956426] [2023-08-29 20:51:26,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2122956426] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:26,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:26,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-29 20:51:26,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813550567] [2023-08-29 20:51:26,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:26,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-29 20:51:26,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:51:26,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-29 20:51:26,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-08-29 20:51:27,071 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 229 [2023-08-29 20:51:27,072 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 29 transitions, 140 flow. Second operand has 10 states, 10 states have (on average 98.0) internal successors, (980), 10 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:27,072 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:27,072 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 229 [2023-08-29 20:51:27,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:27,371 INFO L130 PetriNetUnfolder]: 181/355 cut-off events. [2023-08-29 20:51:27,372 INFO L131 PetriNetUnfolder]: For 378/378 co-relation queries the response was YES. [2023-08-29 20:51:27,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1032 conditions, 355 events. 181/355 cut-off events. For 378/378 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1478 event pairs, 9 based on Foata normal form. 0/353 useless extension candidates. Maximal degree in co-relation 1022. Up to 151 conditions per place. [2023-08-29 20:51:27,374 INFO L137 encePairwiseOnDemand]: 223/229 looper letters, 68 selfloop transitions, 9 changer transitions 0/79 dead transitions. [2023-08-29 20:51:27,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 79 transitions, 530 flow [2023-08-29 20:51:27,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-29 20:51:27,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-29 20:51:27,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 926 transitions. [2023-08-29 20:51:27,378 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4492964580300825 [2023-08-29 20:51:27,378 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 926 transitions. [2023-08-29 20:51:27,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 926 transitions. [2023-08-29 20:51:27,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:27,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 926 transitions. [2023-08-29 20:51:27,381 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 102.88888888888889) internal successors, (926), 9 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:27,383 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 229.0) internal successors, (2290), 10 states have internal predecessors, (2290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:27,384 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 229.0) internal successors, (2290), 10 states have internal predecessors, (2290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:27,384 INFO L175 Difference]: Start difference. First operand has 45 places, 29 transitions, 140 flow. Second operand 9 states and 926 transitions. [2023-08-29 20:51:27,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 79 transitions, 530 flow [2023-08-29 20:51:27,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 79 transitions, 440 flow, removed 24 selfloop flow, removed 6 redundant places. [2023-08-29 20:51:27,388 INFO L231 Difference]: Finished difference. Result has 47 places, 34 transitions, 137 flow [2023-08-29 20:51:27,388 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=137, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2023-08-29 20:51:27,389 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 5 predicate places. [2023-08-29 20:51:27,389 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 137 flow [2023-08-29 20:51:27,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 98.0) internal successors, (980), 10 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:27,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:27,390 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:27,402 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:51:27,599 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:51:27,600 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:27,600 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:27,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1421158699, now seen corresponding path program 1 times [2023-08-29 20:51:27,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:51:27,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [276467866] [2023-08-29 20:51:27,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 20:51:27,601 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:51:27,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:51:27,602 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:51:27,603 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:51:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 20:51:27,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-29 20:51:27,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:51:28,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:51:28,100 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:51:28,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:51:28,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [276467866] [2023-08-29 20:51:28,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [276467866] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:28,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:28,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:51:28,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749579954] [2023-08-29 20:51:28,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:28,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 20:51:28,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:51:28,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 20:51:28,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 20:51:28,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 229 [2023-08-29 20:51:28,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 91.8) internal successors, (459), 5 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:28,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:28,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 229 [2023-08-29 20:51:28,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:28,467 INFO L130 PetriNetUnfolder]: 168/321 cut-off events. [2023-08-29 20:51:28,468 INFO L131 PetriNetUnfolder]: For 213/213 co-relation queries the response was YES. [2023-08-29 20:51:28,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 940 conditions, 321 events. 168/321 cut-off events. For 213/213 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1261 event pairs, 49 based on Foata normal form. 2/323 useless extension candidates. Maximal degree in co-relation 931. Up to 266 conditions per place. [2023-08-29 20:51:28,470 INFO L137 encePairwiseOnDemand]: 225/229 looper letters, 28 selfloop transitions, 3 changer transitions 9/44 dead transitions. [2023-08-29 20:51:28,470 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 44 transitions, 263 flow [2023-08-29 20:51:28,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-29 20:51:28,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-29 20:51:28,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 469 transitions. [2023-08-29 20:51:28,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4096069868995633 [2023-08-29 20:51:28,472 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 469 transitions. [2023-08-29 20:51:28,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 469 transitions. [2023-08-29 20:51:28,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:28,473 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 469 transitions. [2023-08-29 20:51:28,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 93.8) internal successors, (469), 5 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:28,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:28,476 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:28,476 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 137 flow. Second operand 5 states and 469 transitions. [2023-08-29 20:51:28,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 44 transitions, 263 flow [2023-08-29 20:51:28,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 44 transitions, 262 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 20:51:28,478 INFO L231 Difference]: Finished difference. Result has 49 places, 30 transitions, 125 flow [2023-08-29 20:51:28,478 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=125, PETRI_PLACES=49, PETRI_TRANSITIONS=30} [2023-08-29 20:51:28,479 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 7 predicate places. [2023-08-29 20:51:28,479 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 30 transitions, 125 flow [2023-08-29 20:51:28,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.8) internal successors, (459), 5 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:28,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:28,480 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:28,498 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:51:28,690 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:51:28,691 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:28,691 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:28,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1512587955, now seen corresponding path program 2 times [2023-08-29 20:51:28,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:51:28,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [335734645] [2023-08-29 20:51:28,692 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-29 20:51:28,692 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:51:28,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:51:28,693 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:51:28,696 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:51:28,789 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-29 20:51:28,789 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:51:28,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:51:28,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:51:28,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:51:28,840 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:51:28,840 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:51:28,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [335734645] [2023-08-29 20:51:28,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [335734645] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:28,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:28,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:51:28,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252459218] [2023-08-29 20:51:28,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:28,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:51:28,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:51:28,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:51:28,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:51:28,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 229 [2023-08-29 20:51:28,854 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 30 transitions, 125 flow. Second operand has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 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:51:28,854 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:28,855 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 229 [2023-08-29 20:51:28,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:28,977 INFO L130 PetriNetUnfolder]: 167/323 cut-off events. [2023-08-29 20:51:28,978 INFO L131 PetriNetUnfolder]: For 223/223 co-relation queries the response was YES. [2023-08-29 20:51:28,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 944 conditions, 323 events. 167/323 cut-off events. For 223/223 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1240 event pairs, 45 based on Foata normal form. 1/324 useless extension candidates. Maximal degree in co-relation 935. Up to 169 conditions per place. [2023-08-29 20:51:28,979 INFO L137 encePairwiseOnDemand]: 225/229 looper letters, 30 selfloop transitions, 2 changer transitions 15/50 dead transitions. [2023-08-29 20:51:28,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 50 transitions, 307 flow [2023-08-29 20:51:28,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:51:28,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:51:28,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 426 transitions. [2023-08-29 20:51:28,981 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4650655021834061 [2023-08-29 20:51:28,981 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 426 transitions. [2023-08-29 20:51:28,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 426 transitions. [2023-08-29 20:51:28,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:28,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 426 transitions. [2023-08-29 20:51:28,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:28,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 229.0) internal successors, (1145), 5 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:28,986 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 229.0) internal successors, (1145), 5 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:28,986 INFO L175 Difference]: Start difference. First operand has 49 places, 30 transitions, 125 flow. Second operand 4 states and 426 transitions. [2023-08-29 20:51:28,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 50 transitions, 307 flow [2023-08-29 20:51:28,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 50 transitions, 295 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-08-29 20:51:28,990 INFO L231 Difference]: Finished difference. Result has 47 places, 30 transitions, 126 flow [2023-08-29 20:51:28,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=42, 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=4, PETRI_FLOW=126, PETRI_PLACES=47, PETRI_TRANSITIONS=30} [2023-08-29 20:51:28,992 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 5 predicate places. [2023-08-29 20:51:28,992 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 30 transitions, 126 flow [2023-08-29 20:51:28,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 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:51:28,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:28,993 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:29,006 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:51:29,205 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:51:29,206 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:29,206 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:29,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1744401845, now seen corresponding path program 3 times [2023-08-29 20:51:29,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:51:29,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [755149865] [2023-08-29 20:51:29,207 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-29 20:51:29,207 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:51:29,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:51:29,208 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:51:29,211 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:51:29,303 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-29 20:51:29,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-29 20:51:29,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 20:51:29,308 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 20:51:29,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 20:51:29,555 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 20:51:29,555 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 20:51:29,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [755149865] [2023-08-29 20:51:29,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [755149865] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 20:51:29,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 20:51:29,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 20:51:29,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299453421] [2023-08-29 20:51:29,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 20:51:29,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 20:51:29,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 20:51:29,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 20:51:29,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 20:51:29,565 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 229 [2023-08-29 20:51:29,566 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 30 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 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:51:29,566 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 20:51:29,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 229 [2023-08-29 20:51:29,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 20:51:29,690 INFO L130 PetriNetUnfolder]: 142/286 cut-off events. [2023-08-29 20:51:29,691 INFO L131 PetriNetUnfolder]: For 189/195 co-relation queries the response was YES. [2023-08-29 20:51:29,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 864 conditions, 286 events. 142/286 cut-off events. For 189/195 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1069 event pairs, 66 based on Foata normal form. 4/282 useless extension candidates. Maximal degree in co-relation 855. Up to 174 conditions per place. [2023-08-29 20:51:29,692 INFO L137 encePairwiseOnDemand]: 225/229 looper letters, 28 selfloop transitions, 2 changer transitions 19/51 dead transitions. [2023-08-29 20:51:29,692 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 51 transitions, 312 flow [2023-08-29 20:51:29,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 20:51:29,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 20:51:29,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 428 transitions. [2023-08-29 20:51:29,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4672489082969432 [2023-08-29 20:51:29,694 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 428 transitions. [2023-08-29 20:51:29,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 428 transitions. [2023-08-29 20:51:29,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 20:51:29,695 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 428 transitions. [2023-08-29 20:51:29,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:29,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 229.0) internal successors, (1145), 5 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:29,698 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 229.0) internal successors, (1145), 5 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 20:51:29,698 INFO L175 Difference]: Start difference. First operand has 47 places, 30 transitions, 126 flow. Second operand 4 states and 428 transitions. [2023-08-29 20:51:29,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 51 transitions, 312 flow [2023-08-29 20:51:29,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 51 transitions, 300 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-29 20:51:29,700 INFO L231 Difference]: Finished difference. Result has 48 places, 28 transitions, 120 flow [2023-08-29 20:51:29,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=43, 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=4, PETRI_FLOW=120, PETRI_PLACES=48, PETRI_TRANSITIONS=28} [2023-08-29 20:51:29,701 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places. [2023-08-29 20:51:29,702 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 28 transitions, 120 flow [2023-08-29 20:51:29,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 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:51:29,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 20:51:29,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:29,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-08-29 20:51:29,912 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:51:29,912 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-29 20:51:29,912 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 20:51:29,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1566434221, now seen corresponding path program 4 times [2023-08-29 20:51:29,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 20:51:29,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1251062697] [2023-08-29 20:51:29,914 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-29 20:51:29,914 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:51:29,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 20:51:29,915 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:51:29,918 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:51:30,021 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-29 20:51:30,021 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-29 20:51:30,021 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 20:51:30,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 20:51:30,137 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-29 20:51:30,137 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 20:51:30,138 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-29 20:51:30,139 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-29 20:51:30,139 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-29 20:51:30,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-29 20:51:30,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-29 20:51:30,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-29 20:51:30,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-29 20:51:30,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-29 20:51:30,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-29 20:51:30,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-29 20:51:30,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-29 20:51:30,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-29 20:51:30,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-29 20:51:30,154 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:51:30,351 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:51:30,352 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2023-08-29 20:51:30,356 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 20:51:30,356 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 20:51:30,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 08:51:30 BasicIcfg [2023-08-29 20:51:30,412 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 20:51:30,412 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 20:51:30,412 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 20:51:30,413 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 20:51:30,413 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 08:51:16" (3/4) ... [2023-08-29 20:51:30,415 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 20:51:30,415 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 20:51:30,416 INFO L158 Benchmark]: Toolchain (without parser) took 15115.84ms. Allocated memory was 75.5MB in the beginning and 161.5MB in the end (delta: 86.0MB). Free memory was 50.9MB in the beginning and 83.8MB in the end (delta: -32.9MB). Peak memory consumption was 56.0MB. Max. memory is 16.1GB. [2023-08-29 20:51:30,416 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 75.5MB. Free memory was 52.6MB in the beginning and 52.5MB in the end (delta: 54.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:51:30,416 INFO L158 Benchmark]: CACSL2BoogieTranslator took 569.24ms. Allocated memory is still 75.5MB. Free memory was 50.8MB in the beginning and 47.0MB in the end (delta: 3.7MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2023-08-29 20:51:30,416 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.27ms. Allocated memory is still 75.5MB. Free memory was 47.0MB in the beginning and 44.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:51:30,416 INFO L158 Benchmark]: Boogie Preprocessor took 31.22ms. Allocated memory is still 75.5MB. Free memory was 44.2MB in the beginning and 42.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 20:51:30,417 INFO L158 Benchmark]: RCFGBuilder took 796.60ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 42.1MB in the beginning and 64.8MB in the end (delta: -22.7MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB. [2023-08-29 20:51:30,417 INFO L158 Benchmark]: TraceAbstraction took 13662.93ms. Allocated memory was 92.3MB in the beginning and 161.5MB in the end (delta: 69.2MB). Free memory was 63.7MB in the beginning and 83.8MB in the end (delta: -20.1MB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB. [2023-08-29 20:51:30,417 INFO L158 Benchmark]: Witness Printer took 2.93ms. Allocated memory is still 161.5MB. Free memory is still 83.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 20:51:30,418 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 75.5MB. Free memory was 52.6MB in the beginning and 52.5MB in the end (delta: 54.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 569.24ms. Allocated memory is still 75.5MB. Free memory was 50.8MB in the beginning and 47.0MB in the end (delta: 3.7MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.27ms. Allocated memory is still 75.5MB. Free memory was 47.0MB in the beginning and 44.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.22ms. Allocated memory is still 75.5MB. Free memory was 44.2MB in the beginning and 42.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 796.60ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 42.1MB in the beginning and 64.8MB in the end (delta: -22.7MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB. * TraceAbstraction took 13662.93ms. Allocated memory was 92.3MB in the beginning and 161.5MB in the end (delta: 69.2MB). Free memory was 63.7MB in the beginning and 83.8MB in the end (delta: -20.1MB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB. * Witness Printer took 2.93ms. Allocated memory is still 161.5MB. Free memory is still 83.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.9s, 122 PlacesBefore, 42 PlacesAfterwards, 114 TransitionsBefore, 33 TransitionsAfterwards, 2144 CoEnabledTransitionPairs, 6 FixpointIterations, 46 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 112 TotalNumberOfCompositions, 5468 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2501, independent: 2339, independent conditional: 0, independent unconditional: 2339, dependent: 162, dependent conditional: 0, dependent unconditional: 162, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1122, independent: 1089, independent conditional: 0, independent unconditional: 1089, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2501, independent: 1250, independent conditional: 0, independent unconditional: 1250, dependent: 129, dependent conditional: 0, dependent unconditional: 129, unknown: 1122, unknown conditional: 0, unknown unconditional: 1122] , Statistics on independence cache: Total cache size (in pairs): 109, Positive cache size: 92, Positive conditional cache size: 0, Positive unconditional cache size: 92, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L717] 0 int z = 0; [L718] 0 _Bool z$flush_delayed; [L719] 0 int z$mem_tmp; [L720] 0 _Bool z$r_buff0_thd0; [L721] 0 _Bool z$r_buff0_thd1; [L722] 0 _Bool z$r_buff0_thd2; [L723] 0 _Bool z$r_buff0_thd3; [L724] 0 _Bool z$r_buff1_thd0; [L725] 0 _Bool z$r_buff1_thd1; [L726] 0 _Bool z$r_buff1_thd2; [L727] 0 _Bool z$r_buff1_thd3; [L728] 0 _Bool z$read_delayed; [L729] 0 int *z$read_delayed_var; [L730] 0 int z$w_buff0; [L731] 0 _Bool z$w_buff0_used; [L732] 0 int z$w_buff1; [L733] 0 _Bool z$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L816] 0 pthread_t t2489; [L817] FCALL, FORK 0 pthread_create(&t2489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2489, ((void *)0), P0, ((void *)0))=-1, t2489={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L818] 0 pthread_t t2490; [L739] 1 z$w_buff1 = z$w_buff0 [L740] 1 z$w_buff0 = 2 [L741] 1 z$w_buff1_used = z$w_buff0_used [L742] 1 z$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L744] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L745] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L746] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L747] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L748] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L819] FCALL, FORK 0 pthread_create(&t2490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2490, ((void *)0), P1, ((void *)0))=0, t2489={3:0}, t2490={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 y = 1 VAL [__unbuffered_cnt=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L775] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L776] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L777] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L778] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L820] 0 pthread_t t2491; [L821] FCALL, FORK 0 pthread_create(&t2491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2491, ((void *)0), P2, ((void *)0))=1, t2489={3:0}, t2490={7:0}, t2491={15:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L788] 3 y = 2 VAL [__unbuffered_cnt=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=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L791] 3 z = 1 VAL [__unbuffered_cnt=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=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L794] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L795] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L796] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L797] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=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=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L783] 2 return 0; [L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 3 return 0; [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L825] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L825] RET 0 assume_abort_if_not(main$tmp_guard0) [L827] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L828] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L829] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L830] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L831] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489={3:0}, t2490={7:0}, t2491={15:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L834] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 0 z$flush_delayed = weak$$choice2 [L837] 0 z$mem_tmp = z [L838] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L839] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L840] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L841] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L842] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L844] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L846] 0 z = z$flush_delayed ? z$mem_tmp : z [L847] 0 z$flush_delayed = (_Bool)0 [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, 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=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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: 814]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 821]: 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: 817]: 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: 819]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 144 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.5s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 418 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 338 mSDsluCounter, 248 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 236 mSDsCounter, 102 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1153 IncrementalHoareTripleChecker+Invalid, 1255 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 102 mSolverCounterUnsat, 12 mSDtfsCounter, 1153 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=140occurred in iteration=5, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 125 ConstructedInterpolants, 17 QuantifiedInterpolants, 1276 SizeOfPredicates, 18 NumberOfNonLiveVariables, 1110 ConjunctsInSsa, 73 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-29 20:51:30,446 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