./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0917507184a262ba6442de2995b8b922c1a1388e63695c7a63bfd1ed6f65ad74 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:41:46,487 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:41:46,489 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:41:46,529 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:41:46,530 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:41:46,533 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:41:46,542 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:41:46,545 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:41:46,547 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:41:46,551 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:41:46,552 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:41:46,554 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:41:46,554 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:41:46,556 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:41:46,557 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:41:46,560 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:41:46,561 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:41:46,561 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:41:46,562 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:41:46,569 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:41:46,573 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:41:46,574 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:41:46,575 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:41:46,576 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:41:46,578 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:41:46,582 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:41:46,582 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:41:46,583 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:41:46,584 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:41:46,585 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:41:46,585 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:41:46,586 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:41:46,587 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:41:46,588 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:41:46,589 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:41:46,589 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:41:46,590 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:41:46,590 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:41:46,590 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:41:46,591 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:41:46,591 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:41:46,593 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-31 23:41:46,613 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:41:46,613 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:41:46,614 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:41:46,614 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:41:46,615 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:41:46,615 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:41:46,616 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:41:46,616 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:41:46,616 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:41:46,616 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:41:46,617 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:41:46,617 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:41:46,617 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:41:46,617 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:41:46,617 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:41:46,618 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:41:46,618 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:41:46,618 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:41:46,618 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:41:46,618 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:41:46,618 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:41:46,619 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:41:46,619 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:41:46,619 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:41:46,619 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:41:46,619 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:41:46,620 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:41:46,620 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:41:46,620 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 23:41:46,620 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 23:41:46,620 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:41:46,620 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:41:46,621 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:41:46,621 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:41:46,621 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 -> 0917507184a262ba6442de2995b8b922c1a1388e63695c7a63bfd1ed6f65ad74 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-08-31 23:41:46,920 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:41:46,934 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:41:46,937 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:41:46,938 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:41:46,938 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:41:46,939 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-31 23:41:48,144 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:41:48,405 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:41:48,405 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-31 23:41:48,424 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b15a41b63/065acfebd3e645b691a7ed385206ae64/FLAG5b9a005f1 [2023-08-31 23:41:48,436 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b15a41b63/065acfebd3e645b691a7ed385206ae64 [2023-08-31 23:41:48,438 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:41:48,440 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:41:48,441 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:41:48,441 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:41:48,446 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:41:48,447 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:41:48" (1/1) ... [2023-08-31 23:41:48,450 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47c55dbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:41:48, skipping insertion in model container [2023-08-31 23:41:48,450 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:41:48" (1/1) ... [2023-08-31 23:41:48,456 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:41:48,497 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:41:48,643 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/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-08-31 23:41:48,856 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:41:48,867 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:41:48,879 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/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-08-31 23:41:48,947 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:41:48,982 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:41:48,982 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:41:48,988 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:41:48,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:41:48 WrapperNode [2023-08-31 23:41:48,989 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:41:48,990 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:41:48,990 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:41:48,990 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:41:48,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:41:48" (1/1) ... [2023-08-31 23:41:49,026 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:41:48" (1/1) ... [2023-08-31 23:41:49,061 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2023-08-31 23:41:49,062 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:41:49,063 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:41:49,063 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:41:49,063 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:41:49,071 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:41:48" (1/1) ... [2023-08-31 23:41:49,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:41:48" (1/1) ... [2023-08-31 23:41:49,087 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:41:48" (1/1) ... [2023-08-31 23:41:49,088 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:41:48" (1/1) ... [2023-08-31 23:41:49,106 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:41:48" (1/1) ... [2023-08-31 23:41:49,107 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:41:48" (1/1) ... [2023-08-31 23:41:49,109 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:41:48" (1/1) ... [2023-08-31 23:41:49,120 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:41:48" (1/1) ... [2023-08-31 23:41:49,127 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:41:49,128 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:41:49,128 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:41:49,128 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:41:49,129 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:41:48" (1/1) ... [2023-08-31 23:41:49,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:41:49,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:41:49,166 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-31 23:41:49,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-31 23:41:49,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 23:41:49,201 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:41:49,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:41:49,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:41:49,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:41:49,202 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:41:49,202 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:41:49,202 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:41:49,202 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:41:49,203 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:41:49,203 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:41:49,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 23:41:49,203 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:41:49,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:41:49,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:41:49,205 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:41:49,379 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:41:49,381 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:41:49,733 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:41:49,853 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:41:49,853 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:41:49,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:41:49 BoogieIcfgContainer [2023-08-31 23:41:49,855 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:41:49,857 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:41:49,858 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:41:49,860 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:41:49,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:41:48" (1/3) ... [2023-08-31 23:41:49,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d9e7379 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:41:49, skipping insertion in model container [2023-08-31 23:41:49,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:41:48" (2/3) ... [2023-08-31 23:41:49,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d9e7379 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:41:49, skipping insertion in model container [2023-08-31 23:41:49,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:41:49" (3/3) ... [2023-08-31 23:41:49,863 INFO L112 eAbstractionObserver]: Analyzing ICFG safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-31 23:41:49,878 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:41:49,879 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-31 23:41:49,880 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:41:49,929 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:41:49,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 118 transitions, 251 flow [2023-08-31 23:41:50,002 INFO L130 PetriNetUnfolder]: 2/115 cut-off events. [2023-08-31 23:41:50,002 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:41:50,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-08-31 23:41:50,008 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 118 transitions, 251 flow [2023-08-31 23:41:50,012 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 115 transitions, 239 flow [2023-08-31 23:41:50,015 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:41:50,024 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 115 transitions, 239 flow [2023-08-31 23:41:50,026 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 115 transitions, 239 flow [2023-08-31 23:41:50,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 239 flow [2023-08-31 23:41:50,049 INFO L130 PetriNetUnfolder]: 2/115 cut-off events. [2023-08-31 23:41:50,049 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:41:50,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-08-31 23:41:50,052 INFO L119 LiptonReduction]: Number of co-enabled transitions 1996 [2023-08-31 23:41:54,249 INFO L134 LiptonReduction]: Checked pairs total: 5157 [2023-08-31 23:41:54,250 INFO L136 LiptonReduction]: Total number of compositions: 111 [2023-08-31 23:41:54,261 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:41:54,267 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;@73bf9f2e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:41:54,267 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-31 23:41:54,269 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:41:54,269 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:41:54,269 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:41:54,270 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:41:54,270 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:41:54,274 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:41:54,274 INFO L85 PathProgramCache]: Analyzing trace with hash 505, now seen corresponding path program 1 times [2023-08-31 23:41:54,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:41:54,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925519476] [2023-08-31 23:41:54,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:41:54,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:41:54,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:41:54,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:41:54,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:41:54,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925519476] [2023-08-31 23:41:54,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925519476] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:41:54,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:41:54,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:41:54,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073380932] [2023-08-31 23:41:54,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:41:54,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:41:54,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:41:54,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:41:54,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:41:54,416 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 229 [2023-08-31 23:41:54,418 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 71 flow. Second operand has 2 states, 2 states have (on average 106.5) internal successors, (213), 2 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:41:54,418 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:41:54,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 229 [2023-08-31 23:41:54,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:41:54,758 INFO L130 PetriNetUnfolder]: 1277/1906 cut-off events. [2023-08-31 23:41:54,758 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-08-31 23:41:54,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3847 conditions, 1906 events. 1277/1906 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 8737 event pairs, 1277 based on Foata normal form. 0/1602 useless extension candidates. Maximal degree in co-relation 3836. Up to 1887 conditions per place. [2023-08-31 23:41:54,772 INFO L137 encePairwiseOnDemand]: 222/229 looper letters, 22 selfloop transitions, 0 changer transitions 0/24 dead transitions. [2023-08-31 23:41:54,773 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 24 transitions, 101 flow [2023-08-31 23:41:54,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:41:54,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:41:54,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 241 transitions. [2023-08-31 23:41:54,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5262008733624454 [2023-08-31 23:41:54,785 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 241 transitions. [2023-08-31 23:41:54,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 241 transitions. [2023-08-31 23:41:54,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:41:54,789 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 241 transitions. [2023-08-31 23:41:54,791 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 120.5) internal successors, (241), 2 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:41:54,795 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-31 23:41:54,795 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-31 23:41:54,797 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 71 flow. Second operand 2 states and 241 transitions. [2023-08-31 23:41:54,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 24 transitions, 101 flow [2023-08-31 23:41:54,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 24 transitions, 98 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:41:54,801 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 54 flow [2023-08-31 23:41:54,803 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2023-08-31 23:41:54,805 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -8 predicate places. [2023-08-31 23:41:54,806 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 54 flow [2023-08-31 23:41:54,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 106.5) internal successors, (213), 2 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:41:54,806 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:41:54,806 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-31 23:41:54,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 23:41:54,807 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:41:54,807 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:41:54,808 INFO L85 PathProgramCache]: Analyzing trace with hash 478592479, now seen corresponding path program 1 times [2023-08-31 23:41:54,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:41:54,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426842758] [2023-08-31 23:41:54,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:41:54,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:41:54,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:41:55,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-31 23:41:55,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:41:55,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426842758] [2023-08-31 23:41:55,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426842758] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:41:55,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:41:55,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:41:55,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152570537] [2023-08-31 23:41:55,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:41:55,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:41:55,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:41:55,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:41:55,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:41:55,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 229 [2023-08-31 23:41:55,194 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:41:55,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:41:55,195 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 229 [2023-08-31 23:41:55,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:41:55,460 INFO L130 PetriNetUnfolder]: 999/1556 cut-off events. [2023-08-31 23:41:55,460 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:41:55,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3089 conditions, 1556 events. 999/1556 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 7297 event pairs, 277 based on Foata normal form. 0/1424 useless extension candidates. Maximal degree in co-relation 3086. Up to 1195 conditions per place. [2023-08-31 23:41:55,468 INFO L137 encePairwiseOnDemand]: 226/229 looper letters, 31 selfloop transitions, 2 changer transitions 2/37 dead transitions. [2023-08-31 23:41:55,469 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 37 transitions, 152 flow [2023-08-31 23:41:55,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:41:55,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:41:55,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions. [2023-08-31 23:41:55,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5109170305676856 [2023-08-31 23:41:55,475 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 351 transitions. [2023-08-31 23:41:55,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 351 transitions. [2023-08-31 23:41:55,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:41:55,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 351 transitions. [2023-08-31 23:41:55,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:41:55,480 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-31 23:41:55,480 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-31 23:41:55,480 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 54 flow. Second operand 3 states and 351 transitions. [2023-08-31 23:41:55,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 37 transitions, 152 flow [2023-08-31 23:41:55,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 37 transitions, 152 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:41:55,482 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 54 flow [2023-08-31 23:41:55,482 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=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2023-08-31 23:41:55,483 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -7 predicate places. [2023-08-31 23:41:55,483 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 54 flow [2023-08-31 23:41:55,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:41:55,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:41:55,484 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:41:55,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 23:41:55,484 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:41:55,485 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:41:55,485 INFO L85 PathProgramCache]: Analyzing trace with hash -497767733, now seen corresponding path program 1 times [2023-08-31 23:41:55,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:41:55,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349416701] [2023-08-31 23:41:55,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:41:55,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:41:55,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:41:55,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:41:55,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:41:55,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349416701] [2023-08-31 23:41:55,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349416701] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:41:55,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:41:55,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:41:55,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293405819] [2023-08-31 23:41:55,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:41:55,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:41:55,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:41:55,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:41:55,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:41:55,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 229 [2023-08-31 23:41:55,699 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:41:55,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:41:55,699 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 229 [2023-08-31 23:41:55,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:41:55,875 INFO L130 PetriNetUnfolder]: 815/1308 cut-off events. [2023-08-31 23:41:55,876 INFO L131 PetriNetUnfolder]: For 97/97 co-relation queries the response was YES. [2023-08-31 23:41:55,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2679 conditions, 1308 events. 815/1308 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6265 event pairs, 191 based on Foata normal form. 0/1256 useless extension candidates. Maximal degree in co-relation 2675. Up to 945 conditions per place. [2023-08-31 23:41:55,882 INFO L137 encePairwiseOnDemand]: 226/229 looper letters, 28 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2023-08-31 23:41:55,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 32 transitions, 136 flow [2023-08-31 23:41:55,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:41:55,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:41:55,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 343 transitions. [2023-08-31 23:41:55,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4992721979621543 [2023-08-31 23:41:55,885 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 343 transitions. [2023-08-31 23:41:55,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 343 transitions. [2023-08-31 23:41:55,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:41:55,885 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 343 transitions. [2023-08-31 23:41:55,886 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:41:55,888 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-31 23:41:55,889 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-31 23:41:55,889 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 54 flow. Second operand 3 states and 343 transitions. [2023-08-31 23:41:55,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 32 transitions, 136 flow [2023-08-31 23:41:55,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 32 transitions, 130 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:41:55,890 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 58 flow [2023-08-31 23:41:55,891 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2023-08-31 23:41:55,891 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -7 predicate places. [2023-08-31 23:41:55,891 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 58 flow [2023-08-31 23:41:55,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:41:55,892 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:41:55,892 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:41:55,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 23:41:55,893 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:41:55,893 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:41:55,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1749068126, now seen corresponding path program 1 times [2023-08-31 23:41:55,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:41:55,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406807207] [2023-08-31 23:41:55,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:41:55,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:41:55,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:41:56,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:41:56,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:41:56,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406807207] [2023-08-31 23:41:56,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406807207] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:41:56,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:41:56,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:41:56,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909750403] [2023-08-31 23:41:56,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:41:56,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:41:56,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:41:56,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:41:56,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:41:56,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 229 [2023-08-31 23:41:56,118 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 101.5) internal successors, (406), 4 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:41:56,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:41:56,118 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 229 [2023-08-31 23:41:56,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:41:56,475 INFO L130 PetriNetUnfolder]: 1737/2582 cut-off events. [2023-08-31 23:41:56,475 INFO L131 PetriNetUnfolder]: For 198/198 co-relation queries the response was YES. [2023-08-31 23:41:56,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5536 conditions, 2582 events. 1737/2582 cut-off events. For 198/198 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 11887 event pairs, 223 based on Foata normal form. 20/2602 useless extension candidates. Maximal degree in co-relation 5531. Up to 1180 conditions per place. [2023-08-31 23:41:56,488 INFO L137 encePairwiseOnDemand]: 222/229 looper letters, 57 selfloop transitions, 11 changer transitions 0/68 dead transitions. [2023-08-31 23:41:56,489 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 68 transitions, 305 flow [2023-08-31 23:41:56,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:41:56,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:41:56,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 565 transitions. [2023-08-31 23:41:56,491 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49344978165938863 [2023-08-31 23:41:56,491 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 565 transitions. [2023-08-31 23:41:56,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 565 transitions. [2023-08-31 23:41:56,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:41:56,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 565 transitions. [2023-08-31 23:41:56,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:41:56,499 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-31 23:41:56,500 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-31 23:41:56,500 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 58 flow. Second operand 5 states and 565 transitions. [2023-08-31 23:41:56,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 68 transitions, 305 flow [2023-08-31 23:41:56,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 68 transitions, 295 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:41:56,503 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 138 flow [2023-08-31 23:41:56,503 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=138, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2023-08-31 23:41:56,505 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places. [2023-08-31 23:41:56,505 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 138 flow [2023-08-31 23:41:56,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.5) internal successors, (406), 4 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:41:56,505 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:41:56,506 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:41:56,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 23:41:56,506 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:41:56,506 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:41:56,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1749070010, now seen corresponding path program 1 times [2023-08-31 23:41:56,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:41:56,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407281286] [2023-08-31 23:41:56,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:41:56,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:41:56,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:41:56,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:41:56,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:41:56,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407281286] [2023-08-31 23:41:56,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407281286] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:41:56,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:41:56,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:41:56,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403778475] [2023-08-31 23:41:56,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:41:56,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:41:56,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:41:56,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:41:56,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:41:57,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 229 [2023-08-31 23:41:57,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 138 flow. Second operand has 6 states, 6 states have (on average 93.66666666666667) internal successors, (562), 6 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:41:57,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:41:57,022 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 229 [2023-08-31 23:41:57,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:41:57,392 INFO L130 PetriNetUnfolder]: 1442/2309 cut-off events. [2023-08-31 23:41:57,392 INFO L131 PetriNetUnfolder]: For 1483/1494 co-relation queries the response was YES. [2023-08-31 23:41:57,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6098 conditions, 2309 events. 1442/2309 cut-off events. For 1483/1494 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 12015 event pairs, 276 based on Foata normal form. 112/2416 useless extension candidates. Maximal degree in co-relation 6090. Up to 1644 conditions per place. [2023-08-31 23:41:57,408 INFO L137 encePairwiseOnDemand]: 223/229 looper letters, 39 selfloop transitions, 6 changer transitions 16/66 dead transitions. [2023-08-31 23:41:57,408 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 66 transitions, 389 flow [2023-08-31 23:41:57,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:41:57,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:41:57,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 600 transitions. [2023-08-31 23:41:57,411 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4366812227074236 [2023-08-31 23:41:57,411 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 600 transitions. [2023-08-31 23:41:57,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 600 transitions. [2023-08-31 23:41:57,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:41:57,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 600 transitions. [2023-08-31 23:41:57,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 100.0) internal successors, (600), 6 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:41:57,416 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-31 23:41:57,417 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-31 23:41:57,417 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 138 flow. Second operand 6 states and 600 transitions. [2023-08-31 23:41:57,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 66 transitions, 389 flow [2023-08-31 23:41:57,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 66 transitions, 389 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:41:57,422 INFO L231 Difference]: Finished difference. Result has 46 places, 31 transitions, 162 flow [2023-08-31 23:41:57,423 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=162, PETRI_PLACES=46, PETRI_TRANSITIONS=31} [2023-08-31 23:41:57,423 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2023-08-31 23:41:57,424 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 31 transitions, 162 flow [2023-08-31 23:41:57,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.66666666666667) internal successors, (562), 6 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:41:57,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:41:57,424 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:41:57,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 23:41:57,425 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:41:57,425 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:41:57,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1613465858, now seen corresponding path program 1 times [2023-08-31 23:41:57,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:41:57,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60057373] [2023-08-31 23:41:57,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:41:57,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:41:57,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:41:57,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:41:57,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:41:57,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60057373] [2023-08-31 23:41:57,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60057373] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:41:57,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:41:57,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:41:57,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119484177] [2023-08-31 23:41:57,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:41:57,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:41:57,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:41:57,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:41:57,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:41:57,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 229 [2023-08-31 23:41:57,570 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 31 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 104.5) internal successors, (418), 4 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:41:57,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:41:57,571 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 229 [2023-08-31 23:41:57,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:41:57,954 INFO L130 PetriNetUnfolder]: 1821/2834 cut-off events. [2023-08-31 23:41:57,955 INFO L131 PetriNetUnfolder]: For 2837/2857 co-relation queries the response was YES. [2023-08-31 23:41:57,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7746 conditions, 2834 events. 1821/2834 cut-off events. For 2837/2857 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 14757 event pairs, 558 based on Foata normal form. 70/2853 useless extension candidates. Maximal degree in co-relation 7735. Up to 1139 conditions per place. [2023-08-31 23:41:57,972 INFO L137 encePairwiseOnDemand]: 225/229 looper letters, 47 selfloop transitions, 5 changer transitions 0/55 dead transitions. [2023-08-31 23:41:57,972 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 55 transitions, 355 flow [2023-08-31 23:41:57,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:41:57,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:41:57,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 454 transitions. [2023-08-31 23:41:57,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49563318777292575 [2023-08-31 23:41:57,975 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 454 transitions. [2023-08-31 23:41:57,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 454 transitions. [2023-08-31 23:41:57,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:41:57,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 454 transitions. [2023-08-31 23:41:57,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 113.5) internal successors, (454), 4 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:41:57,978 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-31 23:41:57,978 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-31 23:41:57,979 INFO L175 Difference]: Start difference. First operand has 46 places, 31 transitions, 162 flow. Second operand 4 states and 454 transitions. [2023-08-31 23:41:57,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 55 transitions, 355 flow [2023-08-31 23:41:57,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 55 transitions, 333 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-08-31 23:41:57,989 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 179 flow [2023-08-31 23:41:57,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2023-08-31 23:41:57,990 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places. [2023-08-31 23:41:57,990 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 179 flow [2023-08-31 23:41:57,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.5) internal successors, (418), 4 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:41:57,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:41:57,991 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:41:57,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-31 23:41:57,993 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:41:57,993 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:41:57,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1652584703, now seen corresponding path program 1 times [2023-08-31 23:41:57,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:41:57,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980392398] [2023-08-31 23:41:57,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:41:57,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:41:58,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:41:58,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:41:58,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:41:58,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980392398] [2023-08-31 23:41:58,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980392398] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:41:58,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:41:58,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:41:58,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933353880] [2023-08-31 23:41:58,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:41:58,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:41:58,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:41:58,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:41:58,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:41:58,577 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 229 [2023-08-31 23:41:58,578 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 179 flow. Second operand has 7 states, 7 states have (on average 88.57142857142857) internal successors, (620), 7 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:41:58,578 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:41:58,579 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 229 [2023-08-31 23:41:58,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:41:59,042 INFO L130 PetriNetUnfolder]: 1514/2409 cut-off events. [2023-08-31 23:41:59,042 INFO L131 PetriNetUnfolder]: For 2823/2823 co-relation queries the response was YES. [2023-08-31 23:41:59,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6831 conditions, 2409 events. 1514/2409 cut-off events. For 2823/2823 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 11967 event pairs, 350 based on Foata normal form. 142/2551 useless extension candidates. Maximal degree in co-relation 6819. Up to 1095 conditions per place. [2023-08-31 23:41:59,054 INFO L137 encePairwiseOnDemand]: 222/229 looper letters, 33 selfloop transitions, 7 changer transitions 40/82 dead transitions. [2023-08-31 23:41:59,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 82 transitions, 536 flow [2023-08-31 23:41:59,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:41:59,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:41:59,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 763 transitions. [2023-08-31 23:41:59,057 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4164847161572052 [2023-08-31 23:41:59,057 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 763 transitions. [2023-08-31 23:41:59,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 763 transitions. [2023-08-31 23:41:59,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:41:59,058 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 763 transitions. [2023-08-31 23:41:59,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 95.375) internal successors, (763), 8 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:41:59,063 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 229.0) internal successors, (2061), 9 states have internal predecessors, (2061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:41:59,063 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 229.0) internal successors, (2061), 9 states have internal predecessors, (2061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:41:59,063 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 179 flow. Second operand 8 states and 763 transitions. [2023-08-31 23:41:59,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 82 transitions, 536 flow [2023-08-31 23:41:59,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 82 transitions, 524 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:41:59,071 INFO L231 Difference]: Finished difference. Result has 53 places, 30 transitions, 178 flow [2023-08-31 23:41:59,071 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=178, PETRI_PLACES=53, PETRI_TRANSITIONS=30} [2023-08-31 23:41:59,072 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 13 predicate places. [2023-08-31 23:41:59,072 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 30 transitions, 178 flow [2023-08-31 23:41:59,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 88.57142857142857) internal successors, (620), 7 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:41:59,073 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:41:59,073 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:41:59,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-31 23:41:59,073 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:41:59,074 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:41:59,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1111654424, now seen corresponding path program 1 times [2023-08-31 23:41:59,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:41:59,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218948276] [2023-08-31 23:41:59,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:41:59,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:41:59,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:41:59,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:41:59,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:41:59,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218948276] [2023-08-31 23:41:59,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218948276] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:41:59,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:41:59,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:41:59,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60541843] [2023-08-31 23:41:59,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:41:59,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:41:59,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:41:59,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:41:59,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:41:59,243 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 229 [2023-08-31 23:41:59,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 30 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:41:59,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:41:59,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 229 [2023-08-31 23:41:59,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:41:59,412 INFO L130 PetriNetUnfolder]: 518/886 cut-off events. [2023-08-31 23:41:59,412 INFO L131 PetriNetUnfolder]: For 1179/1204 co-relation queries the response was YES. [2023-08-31 23:41:59,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2624 conditions, 886 events. 518/886 cut-off events. For 1179/1204 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4003 event pairs, 117 based on Foata normal form. 64/930 useless extension candidates. Maximal degree in co-relation 2609. Up to 605 conditions per place. [2023-08-31 23:41:59,418 INFO L137 encePairwiseOnDemand]: 223/229 looper letters, 36 selfloop transitions, 4 changer transitions 24/70 dead transitions. [2023-08-31 23:41:59,418 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 70 transitions, 476 flow [2023-08-31 23:41:59,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:41:59,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:41:59,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 544 transitions. [2023-08-31 23:41:59,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47510917030567684 [2023-08-31 23:41:59,421 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 544 transitions. [2023-08-31 23:41:59,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 544 transitions. [2023-08-31 23:41:59,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:41:59,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 544 transitions. [2023-08-31 23:41:59,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:41:59,424 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-31 23:41:59,425 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-31 23:41:59,425 INFO L175 Difference]: Start difference. First operand has 53 places, 30 transitions, 178 flow. Second operand 5 states and 544 transitions. [2023-08-31 23:41:59,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 70 transitions, 476 flow [2023-08-31 23:41:59,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 70 transitions, 418 flow, removed 8 selfloop flow, removed 8 redundant places. [2023-08-31 23:41:59,429 INFO L231 Difference]: Finished difference. Result has 49 places, 33 transitions, 176 flow [2023-08-31 23:41:59,429 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=176, PETRI_PLACES=49, PETRI_TRANSITIONS=33} [2023-08-31 23:41:59,429 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 9 predicate places. [2023-08-31 23:41:59,429 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 33 transitions, 176 flow [2023-08-31 23:41:59,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:41:59,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:41:59,430 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:41:59,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-31 23:41:59,430 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:41:59,431 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:41:59,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1125327911, now seen corresponding path program 1 times [2023-08-31 23:41:59,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:41:59,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526639257] [2023-08-31 23:41:59,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:41:59,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:41:59,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:41:59,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:41:59,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:41:59,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526639257] [2023-08-31 23:41:59,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526639257] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:41:59,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:41:59,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:41:59,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127748467] [2023-08-31 23:41:59,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:41:59,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:41:59,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:41:59,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:41:59,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:41:59,649 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 229 [2023-08-31 23:41:59,650 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 33 transitions, 176 flow. Second operand has 5 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:41:59,650 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:41:59,650 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 229 [2023-08-31 23:41:59,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:41:59,790 INFO L130 PetriNetUnfolder]: 221/419 cut-off events. [2023-08-31 23:41:59,791 INFO L131 PetriNetUnfolder]: For 406/414 co-relation queries the response was YES. [2023-08-31 23:41:59,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1413 conditions, 419 events. 221/419 cut-off events. For 406/414 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1607 event pairs, 45 based on Foata normal form. 35/445 useless extension candidates. Maximal degree in co-relation 1400. Up to 135 conditions per place. [2023-08-31 23:41:59,794 INFO L137 encePairwiseOnDemand]: 223/229 looper letters, 44 selfloop transitions, 7 changer transitions 20/77 dead transitions. [2023-08-31 23:41:59,794 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 77 transitions, 519 flow [2023-08-31 23:41:59,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:41:59,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:41:59,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 651 transitions. [2023-08-31 23:41:59,796 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4737991266375546 [2023-08-31 23:41:59,797 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 651 transitions. [2023-08-31 23:41:59,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 651 transitions. [2023-08-31 23:41:59,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:41:59,797 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 651 transitions. [2023-08-31 23:41:59,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:41:59,801 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-31 23:41:59,801 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-31 23:41:59,801 INFO L175 Difference]: Start difference. First operand has 49 places, 33 transitions, 176 flow. Second operand 6 states and 651 transitions. [2023-08-31 23:41:59,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 77 transitions, 519 flow [2023-08-31 23:41:59,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 77 transitions, 501 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-31 23:41:59,804 INFO L231 Difference]: Finished difference. Result has 52 places, 36 transitions, 219 flow [2023-08-31 23:41:59,804 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=219, PETRI_PLACES=52, PETRI_TRANSITIONS=36} [2023-08-31 23:41:59,805 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 12 predicate places. [2023-08-31 23:41:59,805 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 36 transitions, 219 flow [2023-08-31 23:41:59,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:41:59,806 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:41:59,806 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:41:59,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-31 23:41:59,806 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:41:59,806 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:41:59,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1151783571, now seen corresponding path program 1 times [2023-08-31 23:41:59,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:41:59,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133550214] [2023-08-31 23:41:59,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:41:59,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:41:59,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:42:00,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:42:00,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:42:00,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133550214] [2023-08-31 23:42:00,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133550214] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:42:00,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:42:00,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:42:00,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634113950] [2023-08-31 23:42:00,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:42:00,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:42:00,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:42:00,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:42:00,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:42:00,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 229 [2023-08-31 23:42:00,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 36 transitions, 219 flow. Second operand has 6 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:42:00,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:42:00,056 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 229 [2023-08-31 23:42:00,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:42:00,188 INFO L130 PetriNetUnfolder]: 137/262 cut-off events. [2023-08-31 23:42:00,188 INFO L131 PetriNetUnfolder]: For 394/398 co-relation queries the response was YES. [2023-08-31 23:42:00,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 940 conditions, 262 events. 137/262 cut-off events. For 394/398 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 867 event pairs, 36 based on Foata normal form. 11/268 useless extension candidates. Maximal degree in co-relation 926. Up to 102 conditions per place. [2023-08-31 23:42:00,191 INFO L137 encePairwiseOnDemand]: 223/229 looper letters, 40 selfloop transitions, 10 changer transitions 9/64 dead transitions. [2023-08-31 23:42:00,191 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 64 transitions, 471 flow [2023-08-31 23:42:00,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:42:00,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:42:00,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 740 transitions. [2023-08-31 23:42:00,194 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4616344354335621 [2023-08-31 23:42:00,194 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 740 transitions. [2023-08-31 23:42:00,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 740 transitions. [2023-08-31 23:42:00,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:42:00,195 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 740 transitions. [2023-08-31 23:42:00,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 105.71428571428571) internal successors, (740), 7 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:42:00,199 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-31 23:42:00,200 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-31 23:42:00,200 INFO L175 Difference]: Start difference. First operand has 52 places, 36 transitions, 219 flow. Second operand 7 states and 740 transitions. [2023-08-31 23:42:00,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 64 transitions, 471 flow [2023-08-31 23:42:00,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 64 transitions, 409 flow, removed 18 selfloop flow, removed 6 redundant places. [2023-08-31 23:42:00,203 INFO L231 Difference]: Finished difference. Result has 53 places, 35 transitions, 202 flow [2023-08-31 23:42:00,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=202, PETRI_PLACES=53, PETRI_TRANSITIONS=35} [2023-08-31 23:42:00,204 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 13 predicate places. [2023-08-31 23:42:00,204 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 35 transitions, 202 flow [2023-08-31 23:42:00,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:42:00,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:42:00,205 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] [2023-08-31 23:42:00,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-31 23:42:00,205 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:42:00,206 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:42:00,206 INFO L85 PathProgramCache]: Analyzing trace with hash 2021699173, now seen corresponding path program 1 times [2023-08-31 23:42:00,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:42:00,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809417063] [2023-08-31 23:42:00,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:42:00,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:42:00,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:42:00,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:42:00,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:42:00,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809417063] [2023-08-31 23:42:00,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809417063] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:42:00,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:42:00,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:42:00,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921507149] [2023-08-31 23:42:00,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:42:00,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:42:00,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:42:00,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:42:00,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:42:00,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 229 [2023-08-31 23:42:00,458 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 35 transitions, 202 flow. Second operand has 4 states, 4 states have (on average 103.75) internal successors, (415), 4 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:42:00,458 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:42:00,458 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 229 [2023-08-31 23:42:00,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:42:00,570 INFO L130 PetriNetUnfolder]: 172/320 cut-off events. [2023-08-31 23:42:00,571 INFO L131 PetriNetUnfolder]: For 471/478 co-relation queries the response was YES. [2023-08-31 23:42:00,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1118 conditions, 320 events. 172/320 cut-off events. For 471/478 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1141 event pairs, 24 based on Foata normal form. 6/320 useless extension candidates. Maximal degree in co-relation 1105. Up to 177 conditions per place. [2023-08-31 23:42:00,573 INFO L137 encePairwiseOnDemand]: 222/229 looper letters, 59 selfloop transitions, 10 changer transitions 0/73 dead transitions. [2023-08-31 23:42:00,573 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 73 transitions, 551 flow [2023-08-31 23:42:00,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:42:00,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:42:00,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 546 transitions. [2023-08-31 23:42:00,575 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47685589519650656 [2023-08-31 23:42:00,575 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 546 transitions. [2023-08-31 23:42:00,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 546 transitions. [2023-08-31 23:42:00,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:42:00,576 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 546 transitions. [2023-08-31 23:42:00,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.2) internal successors, (546), 5 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:42:00,579 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-31 23:42:00,579 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-31 23:42:00,579 INFO L175 Difference]: Start difference. First operand has 53 places, 35 transitions, 202 flow. Second operand 5 states and 546 transitions. [2023-08-31 23:42:00,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 73 transitions, 551 flow [2023-08-31 23:42:00,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 73 transitions, 469 flow, removed 24 selfloop flow, removed 6 redundant places. [2023-08-31 23:42:00,583 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 229 flow [2023-08-31 23:42:00,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=229, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2023-08-31 23:42:00,583 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2023-08-31 23:42:00,584 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 229 flow [2023-08-31 23:42:00,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.75) internal successors, (415), 4 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:42:00,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:42:00,584 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] [2023-08-31 23:42:00,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-31 23:42:00,584 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:42:00,585 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:42:00,585 INFO L85 PathProgramCache]: Analyzing trace with hash 2036599687, now seen corresponding path program 2 times [2023-08-31 23:42:00,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:42:00,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374060009] [2023-08-31 23:42:00,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:42:00,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:42:00,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:42:01,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:42:01,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:42:01,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374060009] [2023-08-31 23:42:01,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374060009] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:42:01,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:42:01,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:42:01,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421514752] [2023-08-31 23:42:01,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:42:01,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:42:01,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:42:01,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:42:01,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:42:01,030 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 229 [2023-08-31 23:42:01,031 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 229 flow. Second operand has 6 states, 6 states have (on average 103.16666666666667) internal successors, (619), 6 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:42:01,031 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:42:01,031 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 229 [2023-08-31 23:42:01,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:42:01,229 INFO L130 PetriNetUnfolder]: 218/414 cut-off events. [2023-08-31 23:42:01,230 INFO L131 PetriNetUnfolder]: For 654/659 co-relation queries the response was YES. [2023-08-31 23:42:01,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1480 conditions, 414 events. 218/414 cut-off events. For 654/659 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1592 event pairs, 16 based on Foata normal form. 6/417 useless extension candidates. Maximal degree in co-relation 1468. Up to 207 conditions per place. [2023-08-31 23:42:01,233 INFO L137 encePairwiseOnDemand]: 222/229 looper letters, 74 selfloop transitions, 26 changer transitions 0/104 dead transitions. [2023-08-31 23:42:01,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 104 transitions, 759 flow [2023-08-31 23:42:01,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 23:42:01,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 23:42:01,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 971 transitions. [2023-08-31 23:42:01,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4711305191654537 [2023-08-31 23:42:01,236 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 971 transitions. [2023-08-31 23:42:01,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 971 transitions. [2023-08-31 23:42:01,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:42:01,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 971 transitions. [2023-08-31 23:42:01,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 107.88888888888889) internal successors, (971), 9 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:42:01,242 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-31 23:42:01,242 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-31 23:42:01,242 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 229 flow. Second operand 9 states and 971 transitions. [2023-08-31 23:42:01,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 104 transitions, 759 flow [2023-08-31 23:42:01,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 104 transitions, 759 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:42:01,246 INFO L231 Difference]: Finished difference. Result has 60 places, 66 transitions, 438 flow [2023-08-31 23:42:01,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=438, PETRI_PLACES=60, PETRI_TRANSITIONS=66} [2023-08-31 23:42:01,247 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 20 predicate places. [2023-08-31 23:42:01,247 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 66 transitions, 438 flow [2023-08-31 23:42:01,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.16666666666667) internal successors, (619), 6 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:42:01,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:42:01,248 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] [2023-08-31 23:42:01,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-31 23:42:01,248 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:42:01,248 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:42:01,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1681208893, now seen corresponding path program 3 times [2023-08-31 23:42:01,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:42:01,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184759577] [2023-08-31 23:42:01,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:42:01,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:42:01,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:42:01,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:42:01,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:42:01,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184759577] [2023-08-31 23:42:01,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184759577] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:42:01,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:42:01,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:42:01,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844854870] [2023-08-31 23:42:01,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:42:01,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:42:01,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:42:01,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:42:01,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:42:01,881 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 229 [2023-08-31 23:42:01,882 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 66 transitions, 438 flow. Second operand has 7 states, 7 states have (on average 98.71428571428571) internal successors, (691), 7 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:42:01,882 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:42:01,882 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 229 [2023-08-31 23:42:01,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:42:02,111 INFO L130 PetriNetUnfolder]: 252/492 cut-off events. [2023-08-31 23:42:02,112 INFO L131 PetriNetUnfolder]: For 1108/1116 co-relation queries the response was YES. [2023-08-31 23:42:02,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1975 conditions, 492 events. 252/492 cut-off events. For 1108/1116 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2032 event pairs, 24 based on Foata normal form. 1/490 useless extension candidates. Maximal degree in co-relation 1961. Up to 193 conditions per place. [2023-08-31 23:42:02,117 INFO L137 encePairwiseOnDemand]: 220/229 looper letters, 79 selfloop transitions, 32 changer transitions 0/115 dead transitions. [2023-08-31 23:42:02,117 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 115 transitions, 939 flow [2023-08-31 23:42:02,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:42:02,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:42:02,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 828 transitions. [2023-08-31 23:42:02,120 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4519650655021834 [2023-08-31 23:42:02,120 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 828 transitions. [2023-08-31 23:42:02,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 828 transitions. [2023-08-31 23:42:02,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:42:02,134 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 828 transitions. [2023-08-31 23:42:02,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 103.5) internal successors, (828), 8 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:42:02,138 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 229.0) internal successors, (2061), 9 states have internal predecessors, (2061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:42:02,139 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 229.0) internal successors, (2061), 9 states have internal predecessors, (2061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:42:02,139 INFO L175 Difference]: Start difference. First operand has 60 places, 66 transitions, 438 flow. Second operand 8 states and 828 transitions. [2023-08-31 23:42:02,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 115 transitions, 939 flow [2023-08-31 23:42:02,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 115 transitions, 927 flow, removed 6 selfloop flow, removed 0 redundant places. [2023-08-31 23:42:02,144 INFO L231 Difference]: Finished difference. Result has 71 places, 78 transitions, 621 flow [2023-08-31 23:42:02,145 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=621, PETRI_PLACES=71, PETRI_TRANSITIONS=78} [2023-08-31 23:42:02,146 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 31 predicate places. [2023-08-31 23:42:02,146 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 78 transitions, 621 flow [2023-08-31 23:42:02,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.71428571428571) internal successors, (691), 7 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:42:02,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:42:02,147 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] [2023-08-31 23:42:02,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-31 23:42:02,147 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:42:02,148 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:42:02,148 INFO L85 PathProgramCache]: Analyzing trace with hash 573727607, now seen corresponding path program 4 times [2023-08-31 23:42:02,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:42:02,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127593674] [2023-08-31 23:42:02,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:42:02,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:42:02,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:42:02,204 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:42:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:42:02,293 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-31 23:42:02,294 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:42:02,294 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-31 23:42:02,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-31 23:42:02,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-31 23:42:02,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-31 23:42:02,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-31 23:42:02,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-31 23:42:02,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-31 23:42:02,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-31 23:42:02,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-31 23:42:02,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-31 23:42:02,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-31 23:42:02,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-31 23:42:02,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-31 23:42:02,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-31 23:42:02,302 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:42:02,312 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:42:02,312 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:42:02,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:42:02 BasicIcfg [2023-08-31 23:42:02,390 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:42:02,391 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:42:02,391 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:42:02,391 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:42:02,391 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:41:49" (3/4) ... [2023-08-31 23:42:02,394 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:42:02,394 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:42:02,394 INFO L158 Benchmark]: Toolchain (without parser) took 13954.69ms. Allocated memory was 77.6MB in the beginning and 356.5MB in the end (delta: 278.9MB). Free memory was 49.1MB in the beginning and 285.8MB in the end (delta: -236.8MB). Peak memory consumption was 42.8MB. Max. memory is 16.1GB. [2023-08-31 23:42:02,395 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 77.6MB. Free memory was 54.7MB in the beginning and 54.6MB in the end (delta: 94.5kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:42:02,395 INFO L158 Benchmark]: CACSL2BoogieTranslator took 548.59ms. Allocated memory is still 77.6MB. Free memory was 48.8MB in the beginning and 48.4MB in the end (delta: 478.1kB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2023-08-31 23:42:02,395 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.12ms. Allocated memory is still 77.6MB. Free memory was 48.4MB in the beginning and 46.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:42:02,396 INFO L158 Benchmark]: Boogie Preprocessor took 64.46ms. Allocated memory is still 77.6MB. Free memory was 46.1MB in the beginning and 44.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:42:02,396 INFO L158 Benchmark]: RCFGBuilder took 727.84ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 44.0MB in the beginning and 50.5MB in the end (delta: -6.5MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2023-08-31 23:42:02,396 INFO L158 Benchmark]: TraceAbstraction took 12532.78ms. Allocated memory was 94.4MB in the beginning and 356.5MB in the end (delta: 262.1MB). Free memory was 50.0MB in the beginning and 285.8MB in the end (delta: -235.9MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. [2023-08-31 23:42:02,397 INFO L158 Benchmark]: Witness Printer took 3.23ms. Allocated memory is still 356.5MB. Free memory is still 285.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:42:02,399 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 77.6MB. Free memory was 54.7MB in the beginning and 54.6MB in the end (delta: 94.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 548.59ms. Allocated memory is still 77.6MB. Free memory was 48.8MB in the beginning and 48.4MB in the end (delta: 478.1kB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.12ms. Allocated memory is still 77.6MB. Free memory was 48.4MB in the beginning and 46.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.46ms. Allocated memory is still 77.6MB. Free memory was 46.1MB in the beginning and 44.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 727.84ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 44.0MB in the beginning and 50.5MB in the end (delta: -6.5MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. * TraceAbstraction took 12532.78ms. Allocated memory was 94.4MB in the beginning and 356.5MB in the end (delta: 262.1MB). Free memory was 50.0MB in the beginning and 285.8MB in the end (delta: -235.9MB). Peak memory consumption was 26.2MB. Max. memory is 16.1GB. * Witness Printer took 3.23ms. Allocated memory is still 356.5MB. Free memory is still 285.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: 4.2s, 123 PlacesBefore, 40 PlacesAfterwards, 115 TransitionsBefore, 31 TransitionsAfterwards, 1996 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 111 TotalNumberOfCompositions, 5157 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2621, independent: 2453, independent conditional: 0, independent unconditional: 2453, dependent: 168, dependent conditional: 0, dependent unconditional: 168, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1137, independent: 1096, independent conditional: 0, independent unconditional: 1096, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2621, independent: 1357, independent conditional: 0, independent unconditional: 1357, dependent: 127, dependent conditional: 0, dependent unconditional: 127, unknown: 1137, unknown conditional: 0, unknown unconditional: 1137] , Statistics on independence cache: Total cache size (in pairs): 116, Positive cache size: 102, Positive conditional cache size: 0, Positive unconditional cache size: 102, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L833] 0 pthread_t t2345; [L834] FCALL, FORK 0 pthread_create(&t2345, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2345, ((void *)0), P0, ((void *)0))=-2, t2345={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L835] 0 pthread_t t2346; [L836] FCALL, FORK 0 pthread_create(&t2346, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2346, ((void *)0), P1, ((void *)0))=-1, t2345={5:0}, t2346={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L837] 0 pthread_t t2347; [L838] FCALL, FORK 0 pthread_create(&t2347, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2347, ((void *)0), P2, ((void *)0))=0, t2345={5:0}, t2346={6:0}, t2347={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L776] 2 x$w_buff1 = x$w_buff0 [L777] 2 x$w_buff0 = 1 [L778] 2 x$w_buff1_used = x$w_buff0_used [L779] 2 x$w_buff0_used = (_Bool)1 [L780] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L780] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L781] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L782] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L783] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L784] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L785] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L788] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L805] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L808] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L746] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L751] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 1 x$flush_delayed = weak$$choice2 [L754] 1 x$mem_tmp = x [L755] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L756] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L757] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L758] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L759] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L761] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 __unbuffered_p0_EAX = x [L763] 1 x = x$flush_delayed ? x$mem_tmp : x [L764] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L811] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L812] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L813] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L814] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L815] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L842] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L842] RET 0 assume_abort_if_not(main$tmp_guard0) [L844] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L845] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L846] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L847] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L848] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2345={5:0}, t2346={6:0}, t2347={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L851] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] - UnprovableResult [Line: 19]: 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: 831]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 838]: 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: 834]: 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: 836]: 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: 12.3s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 771 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 593 mSDsluCounter, 281 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 193 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1999 IncrementalHoareTripleChecker+Invalid, 2077 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 88 mSDtfsCounter, 1999 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=621occurred in iteration=13, InterpolantAutomatonStates: 71, 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.3s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 180 NumberOfCodeBlocks, 180 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 147 ConstructedInterpolants, 0 QuantifiedInterpolants, 1106 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-31 23:42:02,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0917507184a262ba6442de2995b8b922c1a1388e63695c7a63bfd1ed6f65ad74 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:42:04,315 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:42:04,318 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:42:04,359 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:42:04,360 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:42:04,362 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:42:04,364 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:42:04,367 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:42:04,369 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:42:04,373 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:42:04,374 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:42:04,376 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:42:04,377 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:42:04,379 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:42:04,380 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:42:04,386 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:42:04,387 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:42:04,388 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:42:04,390 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:42:04,394 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:42:04,395 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:42:04,396 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:42:04,397 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:42:04,398 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:42:04,405 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:42:04,405 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:42:04,406 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:42:04,407 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:42:04,408 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:42:04,409 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:42:04,409 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:42:04,410 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:42:04,411 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:42:04,412 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:42:04,413 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:42:04,413 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:42:04,413 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:42:04,414 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:42:04,414 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:42:04,414 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:42:04,415 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:42:04,417 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-31 23:42:04,456 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:42:04,456 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:42:04,457 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:42:04,458 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:42:04,459 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:42:04,459 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:42:04,459 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:42:04,459 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:42:04,460 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:42:04,460 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:42:04,461 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:42:04,461 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:42:04,461 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:42:04,461 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:42:04,462 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:42:04,462 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:42:04,462 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:42:04,462 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:42:04,462 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:42:04,463 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:42:04,463 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-31 23:42:04,463 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-31 23:42:04,463 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:42:04,463 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:42:04,463 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:42:04,464 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:42:04,464 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:42:04,464 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:42:04,464 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:42:04,464 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:42:04,465 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-31 23:42:04,465 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-31 23:42:04,465 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:42:04,465 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:42:04,466 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:42:04,466 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-31 23:42:04,466 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:42:04,466 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 -> 0917507184a262ba6442de2995b8b922c1a1388e63695c7a63bfd1ed6f65ad74 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-08-31 23:42:04,792 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:42:04,816 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:42:04,819 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:42:04,820 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:42:04,820 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:42:04,822 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-31 23:42:06,023 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:42:06,251 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:42:06,251 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-31 23:42:06,281 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/273f1c76f/9a9e9d76ac904f6cb88948b4daffb9a7/FLAG79e22c97e [2023-08-31 23:42:06,301 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/273f1c76f/9a9e9d76ac904f6cb88948b4daffb9a7 [2023-08-31 23:42:06,304 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:42:06,305 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:42:06,308 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:42:06,308 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:42:06,311 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:42:06,311 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:42:06" (1/1) ... [2023-08-31 23:42:06,313 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d9552d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:42:06, skipping insertion in model container [2023-08-31 23:42:06,313 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:42:06" (1/1) ... [2023-08-31 23:42:06,318 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:42:06,375 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:42:06,545 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/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-08-31 23:42:06,744 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:42:06,760 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:42:06,774 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/safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-08-31 23:42:06,821 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:42:06,862 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:42:06,863 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:42:06,868 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:42:06,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:42:06 WrapperNode [2023-08-31 23:42:06,869 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:42:06,869 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:42:06,870 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:42:06,870 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:42:06,874 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:42:06" (1/1) ... [2023-08-31 23:42:06,894 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:42:06" (1/1) ... [2023-08-31 23:42:06,920 INFO L138 Inliner]: procedures = 179, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2023-08-31 23:42:06,920 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:42:06,921 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:42:06,921 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:42:06,921 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:42:06,929 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:42:06" (1/1) ... [2023-08-31 23:42:06,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:42:06" (1/1) ... [2023-08-31 23:42:06,933 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:42:06" (1/1) ... [2023-08-31 23:42:06,933 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:42:06" (1/1) ... [2023-08-31 23:42:06,942 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:42:06" (1/1) ... [2023-08-31 23:42:06,944 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:42:06" (1/1) ... [2023-08-31 23:42:06,947 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:42:06" (1/1) ... [2023-08-31 23:42:06,948 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:42:06" (1/1) ... [2023-08-31 23:42:06,952 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:42:06,953 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:42:06,953 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:42:06,953 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:42:06,954 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:42:06" (1/1) ... [2023-08-31 23:42:06,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:42:06,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:42:06,994 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-31 23:42:07,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-31 23:42:07,037 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:42:07,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:42:07,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:42:07,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:42:07,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-31 23:42:07,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-31 23:42:07,038 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:42:07,038 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:42:07,038 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:42:07,038 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:42:07,038 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:42:07,038 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:42:07,039 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:42:07,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:42:07,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:42:07,041 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:42:07,207 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:42:07,209 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:42:07,521 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:42:07,646 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:42:07,647 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:42:07,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:42:07 BoogieIcfgContainer [2023-08-31 23:42:07,649 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:42:07,651 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:42:07,651 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:42:07,654 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:42:07,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:42:06" (1/3) ... [2023-08-31 23:42:07,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45e34365 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:42:07, skipping insertion in model container [2023-08-31 23:42:07,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:42:06" (2/3) ... [2023-08-31 23:42:07,656 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45e34365 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:42:07, skipping insertion in model container [2023-08-31 23:42:07,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:42:07" (3/3) ... [2023-08-31 23:42:07,657 INFO L112 eAbstractionObserver]: Analyzing ICFG safe024_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-31 23:42:07,672 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:42:07,673 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-31 23:42:07,673 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:42:07,749 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:42:07,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 119 transitions, 253 flow [2023-08-31 23:42:07,853 INFO L130 PetriNetUnfolder]: 2/116 cut-off events. [2023-08-31 23:42:07,854 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:42:07,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 116 events. 2/116 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/105 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-08-31 23:42:07,859 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 119 transitions, 253 flow [2023-08-31 23:42:07,864 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 116 transitions, 241 flow [2023-08-31 23:42:07,868 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:42:07,881 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 116 transitions, 241 flow [2023-08-31 23:42:07,885 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 116 transitions, 241 flow [2023-08-31 23:42:07,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 116 transitions, 241 flow [2023-08-31 23:42:07,925 INFO L130 PetriNetUnfolder]: 2/116 cut-off events. [2023-08-31 23:42:07,925 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:42:07,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 116 events. 2/116 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/105 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-08-31 23:42:07,929 INFO L119 LiptonReduction]: Number of co-enabled transitions 1996 [2023-08-31 23:42:14,125 INFO L134 LiptonReduction]: Checked pairs total: 5360 [2023-08-31 23:42:14,125 INFO L136 LiptonReduction]: Total number of compositions: 116 [2023-08-31 23:42:14,137 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:42:14,143 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;@5138bec0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:42:14,143 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-31 23:42:14,145 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-31 23:42:14,145 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:42:14,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:42:14,146 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:42:14,146 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:42:14,151 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:42:14,151 INFO L85 PathProgramCache]: Analyzing trace with hash 512, now seen corresponding path program 1 times [2023-08-31 23:42:14,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:42:14,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [897025245] [2023-08-31 23:42:14,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:42:14,166 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:42:14,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:42:14,170 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:42:14,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-31 23:42:14,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:42:14,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-31 23:42:14,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:42:14,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-31 23:42:14,243 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:42:14,243 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:42:14,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [897025245] [2023-08-31 23:42:14,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [897025245] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:42:14,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:42:14,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:42:14,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402218210] [2023-08-31 23:42:14,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:42:14,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:42:14,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:42:14,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:42:14,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:42:14,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 235 [2023-08-31 23:42:14,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 71 flow. Second operand has 2 states, 2 states have (on average 107.5) internal successors, (215), 2 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:42:14,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:42:14,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 235 [2023-08-31 23:42:14,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:42:14,710 INFO L130 PetriNetUnfolder]: 1277/1906 cut-off events. [2023-08-31 23:42:14,711 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-08-31 23:42:14,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3847 conditions, 1906 events. 1277/1906 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 8721 event pairs, 1277 based on Foata normal form. 0/1602 useless extension candidates. Maximal degree in co-relation 3836. Up to 1887 conditions per place. [2023-08-31 23:42:14,727 INFO L137 encePairwiseOnDemand]: 228/235 looper letters, 22 selfloop transitions, 0 changer transitions 0/24 dead transitions. [2023-08-31 23:42:14,727 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 24 transitions, 101 flow [2023-08-31 23:42:14,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:42:14,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:42:14,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 243 transitions. [2023-08-31 23:42:14,742 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5170212765957447 [2023-08-31 23:42:14,743 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 243 transitions. [2023-08-31 23:42:14,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 243 transitions. [2023-08-31 23:42:14,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:42:14,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 243 transitions. [2023-08-31 23:42:14,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 121.5) internal successors, (243), 2 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:42:14,758 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:42:14,759 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:42:14,761 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 71 flow. Second operand 2 states and 243 transitions. [2023-08-31 23:42:14,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 24 transitions, 101 flow [2023-08-31 23:42:14,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 24 transitions, 98 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:42:14,769 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 54 flow [2023-08-31 23:42:14,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2023-08-31 23:42:14,777 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -8 predicate places. [2023-08-31 23:42:14,777 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 54 flow [2023-08-31 23:42:14,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 107.5) internal successors, (215), 2 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:42:14,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:42:14,778 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-31 23:42:14,787 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-31 23:42:14,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:42:14,985 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:42:14,986 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:42:14,986 INFO L85 PathProgramCache]: Analyzing trace with hash 483152588, now seen corresponding path program 1 times [2023-08-31 23:42:14,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:42:14,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1793611500] [2023-08-31 23:42:14,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:42:14,987 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:42:14,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:42:14,989 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:42:14,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-31 23:42:15,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:42:15,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:42:15,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:42:15,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:42:15,085 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:42:15,085 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:42:15,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1793611500] [2023-08-31 23:42:15,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1793611500] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:42:15,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:42:15,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:42:15,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038927042] [2023-08-31 23:42:15,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:42:15,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:42:15,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:42:15,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:42:15,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:42:15,092 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 235 [2023-08-31 23:42:15,092 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:42:15,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:42:15,093 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 235 [2023-08-31 23:42:15,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:42:15,360 INFO L130 PetriNetUnfolder]: 999/1612 cut-off events. [2023-08-31 23:42:15,361 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:42:15,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3145 conditions, 1612 events. 999/1612 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8349 event pairs, 165 based on Foata normal form. 0/1480 useless extension candidates. Maximal degree in co-relation 3142. Up to 1195 conditions per place. [2023-08-31 23:42:15,369 INFO L137 encePairwiseOnDemand]: 232/235 looper letters, 31 selfloop transitions, 2 changer transitions 2/37 dead transitions. [2023-08-31 23:42:15,369 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 37 transitions, 152 flow [2023-08-31 23:42:15,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:42:15,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:42:15,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 354 transitions. [2023-08-31 23:42:15,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.502127659574468 [2023-08-31 23:42:15,372 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 354 transitions. [2023-08-31 23:42:15,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 354 transitions. [2023-08-31 23:42:15,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:42:15,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 354 transitions. [2023-08-31 23:42:15,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:42:15,376 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 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-31 23:42:15,376 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 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-31 23:42:15,376 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 54 flow. Second operand 3 states and 354 transitions. [2023-08-31 23:42:15,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 37 transitions, 152 flow [2023-08-31 23:42:15,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 37 transitions, 152 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:42:15,378 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 54 flow [2023-08-31 23:42:15,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2023-08-31 23:42:15,379 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -7 predicate places. [2023-08-31 23:42:15,379 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 54 flow [2023-08-31 23:42:15,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:42:15,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:42:15,380 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:42:15,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-08-31 23:42:15,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:42:15,589 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:42:15,589 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:42:15,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1758504980, now seen corresponding path program 1 times [2023-08-31 23:42:15,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:42:15,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1492737347] [2023-08-31 23:42:15,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:42:15,591 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:42:15,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:42:15,592 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:42:15,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-31 23:42:15,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:42:15,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:42:15,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:42:15,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:42:15,741 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:42:15,742 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:42:15,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1492737347] [2023-08-31 23:42:15,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1492737347] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:42:15,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:42:15,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:42:15,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741141014] [2023-08-31 23:42:15,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:42:15,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:42:15,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:42:15,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:42:15,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:42:15,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 235 [2023-08-31 23:42:15,760 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 101.25) internal successors, (405), 4 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:42:15,760 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:42:15,760 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 235 [2023-08-31 23:42:15,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:42:16,008 INFO L130 PetriNetUnfolder]: 557/923 cut-off events. [2023-08-31 23:42:16,008 INFO L131 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2023-08-31 23:42:16,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1956 conditions, 923 events. 557/923 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4252 event pairs, 113 based on Foata normal form. 64/946 useless extension candidates. Maximal degree in co-relation 1952. Up to 633 conditions per place. [2023-08-31 23:42:16,012 INFO L137 encePairwiseOnDemand]: 229/235 looper letters, 29 selfloop transitions, 4 changer transitions 19/54 dead transitions. [2023-08-31 23:42:16,013 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 54 transitions, 232 flow [2023-08-31 23:42:16,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:42:16,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:42:16,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 549 transitions. [2023-08-31 23:42:16,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4672340425531915 [2023-08-31 23:42:16,015 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 549 transitions. [2023-08-31 23:42:16,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 549 transitions. [2023-08-31 23:42:16,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:42:16,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 549 transitions. [2023-08-31 23:42:16,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:42:16,019 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:42:16,020 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:42:16,020 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 54 flow. Second operand 5 states and 549 transitions. [2023-08-31 23:42:16,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 54 transitions, 232 flow [2023-08-31 23:42:16,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 54 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:42:16,022 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 86 flow [2023-08-31 23:42:16,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=86, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2023-08-31 23:42:16,023 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2023-08-31 23:42:16,023 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 86 flow [2023-08-31 23:42:16,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.25) internal successors, (405), 4 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:42:16,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:42:16,024 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:42:16,039 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-31 23:42:16,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:42:16,236 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:42:16,236 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:42:16,236 INFO L85 PathProgramCache]: Analyzing trace with hash 968429441, now seen corresponding path program 1 times [2023-08-31 23:42:16,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:42:16,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2114559888] [2023-08-31 23:42:16,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:42:16,238 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:42:16,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:42:16,239 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:42:16,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-31 23:42:16,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:42:16,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:42:16,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:42:16,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:42:16,379 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:42:16,379 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:42:16,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2114559888] [2023-08-31 23:42:16,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2114559888] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:42:16,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:42:16,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:42:16,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589478754] [2023-08-31 23:42:16,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:42:16,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:42:16,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:42:16,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:42:16,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:42:16,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 235 [2023-08-31 23:42:16,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:42:16,407 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:42:16,407 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 235 [2023-08-31 23:42:16,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:42:16,604 INFO L130 PetriNetUnfolder]: 233/437 cut-off events. [2023-08-31 23:42:16,605 INFO L131 PetriNetUnfolder]: For 147/147 co-relation queries the response was YES. [2023-08-31 23:42:16,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1173 conditions, 437 events. 233/437 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1800 event pairs, 61 based on Foata normal form. 37/460 useless extension candidates. Maximal degree in co-relation 1166. Up to 140 conditions per place. [2023-08-31 23:42:16,607 INFO L137 encePairwiseOnDemand]: 229/235 looper letters, 37 selfloop transitions, 7 changer transitions 19/65 dead transitions. [2023-08-31 23:42:16,607 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 65 transitions, 336 flow [2023-08-31 23:42:16,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:42:16,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:42:16,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 659 transitions. [2023-08-31 23:42:16,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4673758865248227 [2023-08-31 23:42:16,611 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 659 transitions. [2023-08-31 23:42:16,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 659 transitions. [2023-08-31 23:42:16,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:42:16,611 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 659 transitions. [2023-08-31 23:42:16,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 109.83333333333333) internal successors, (659), 6 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:42:16,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:42:16,617 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:42:16,617 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 86 flow. Second operand 6 states and 659 transitions. [2023-08-31 23:42:16,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 65 transitions, 336 flow [2023-08-31 23:42:16,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 65 transitions, 330 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-31 23:42:16,620 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 136 flow [2023-08-31 23:42:16,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=136, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2023-08-31 23:42:16,621 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2023-08-31 23:42:16,621 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 136 flow [2023-08-31 23:42:16,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:42:16,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:42:16,622 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:42:16,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-31 23:42:16,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:42:16,832 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:42:16,832 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:42:16,833 INFO L85 PathProgramCache]: Analyzing trace with hash 326720129, now seen corresponding path program 1 times [2023-08-31 23:42:16,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:42:16,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [954294208] [2023-08-31 23:42:16,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:42:16,834 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:42:16,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:42:16,835 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:42:16,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-31 23:42:16,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:42:16,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:42:16,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:42:17,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:42:17,007 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:42:17,007 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:42:17,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [954294208] [2023-08-31 23:42:17,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [954294208] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:42:17,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:42:17,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:42:17,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410708228] [2023-08-31 23:42:17,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:42:17,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:42:17,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:42:17,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:42:17,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:42:17,044 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 235 [2023-08-31 23:42:17,045 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 136 flow. Second operand has 6 states, 6 states have (on average 101.5) internal successors, (609), 6 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-31 23:42:17,045 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:42:17,045 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 235 [2023-08-31 23:42:17,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:42:17,293 INFO L130 PetriNetUnfolder]: 143/275 cut-off events. [2023-08-31 23:42:17,293 INFO L131 PetriNetUnfolder]: For 269/269 co-relation queries the response was YES. [2023-08-31 23:42:17,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 808 conditions, 275 events. 143/275 cut-off events. For 269/269 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 998 event pairs, 56 based on Foata normal form. 10/280 useless extension candidates. Maximal degree in co-relation 799. Up to 108 conditions per place. [2023-08-31 23:42:17,295 INFO L137 encePairwiseOnDemand]: 229/235 looper letters, 34 selfloop transitions, 10 changer transitions 10/56 dead transitions. [2023-08-31 23:42:17,295 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 56 transitions, 334 flow [2023-08-31 23:42:17,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:42:17,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:42:17,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 749 transitions. [2023-08-31 23:42:17,298 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4553191489361702 [2023-08-31 23:42:17,298 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 749 transitions. [2023-08-31 23:42:17,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 749 transitions. [2023-08-31 23:42:17,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:42:17,298 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 749 transitions. [2023-08-31 23:42:17,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 107.0) internal successors, (749), 7 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:42:17,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:42:17,303 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:42:17,303 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 136 flow. Second operand 7 states and 749 transitions. [2023-08-31 23:42:17,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 56 transitions, 334 flow [2023-08-31 23:42:17,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 56 transitions, 298 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-08-31 23:42:17,306 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 138 flow [2023-08-31 23:42:17,307 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=138, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2023-08-31 23:42:17,307 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2023-08-31 23:42:17,307 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 28 transitions, 138 flow [2023-08-31 23:42:17,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.5) internal successors, (609), 6 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-31 23:42:17,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:42:17,308 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] [2023-08-31 23:42:17,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-31 23:42:17,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:42:17,518 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:42:17,519 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:42:17,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1341965006, now seen corresponding path program 1 times [2023-08-31 23:42:17,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:42:17,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [177333216] [2023-08-31 23:42:17,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:42:17,520 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:42:17,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:42:17,521 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:42:17,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-31 23:42:17,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:42:17,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:42:17,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:42:17,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:42:17,661 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:42:17,661 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:42:17,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [177333216] [2023-08-31 23:42:17,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [177333216] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:42:17,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:42:17,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:42:17,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153276452] [2023-08-31 23:42:17,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:42:17,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:42:17,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:42:17,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:42:17,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:42:17,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 235 [2023-08-31 23:42:17,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 28 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:42:17,673 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:42:17,673 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 235 [2023-08-31 23:42:17,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:42:17,810 INFO L130 PetriNetUnfolder]: 198/365 cut-off events. [2023-08-31 23:42:17,811 INFO L131 PetriNetUnfolder]: For 423/423 co-relation queries the response was YES. [2023-08-31 23:42:17,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1090 conditions, 365 events. 198/365 cut-off events. For 423/423 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1539 event pairs, 18 based on Foata normal form. 0/363 useless extension candidates. Maximal degree in co-relation 1080. Up to 224 conditions per place. [2023-08-31 23:42:17,813 INFO L137 encePairwiseOnDemand]: 232/235 looper letters, 55 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-08-31 23:42:17,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 58 transitions, 410 flow [2023-08-31 23:42:17,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:42:17,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:42:17,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 456 transitions. [2023-08-31 23:42:17,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4851063829787234 [2023-08-31 23:42:17,816 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 456 transitions. [2023-08-31 23:42:17,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 456 transitions. [2023-08-31 23:42:17,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:42:17,816 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 456 transitions. [2023-08-31 23:42:17,817 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 114.0) internal successors, (456), 4 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-31 23:42:17,819 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:42:17,819 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:42:17,819 INFO L175 Difference]: Start difference. First operand has 44 places, 28 transitions, 138 flow. Second operand 4 states and 456 transitions. [2023-08-31 23:42:17,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 58 transitions, 410 flow [2023-08-31 23:42:17,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 58 transitions, 330 flow, removed 24 selfloop flow, removed 6 redundant places. [2023-08-31 23:42:17,822 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 113 flow [2023-08-31 23:42:17,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2023-08-31 23:42:17,823 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2023-08-31 23:42:17,823 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 113 flow [2023-08-31 23:42:17,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:42:17,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:42:17,824 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] [2023-08-31 23:42:17,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-31 23:42:18,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:42:18,040 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:42:18,040 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:42:18,040 INFO L85 PathProgramCache]: Analyzing trace with hash -946602512, now seen corresponding path program 2 times [2023-08-31 23:42:18,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:42:18,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [788884401] [2023-08-31 23:42:18,041 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 23:42:18,041 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:42:18,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:42:18,042 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:42:18,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-31 23:42:18,146 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:42:18,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:42:18,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-31 23:42:18,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:42:18,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:42:18,391 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:42:18,391 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:42:18,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [788884401] [2023-08-31 23:42:18,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [788884401] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:42:18,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:42:18,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:42:18,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935643688] [2023-08-31 23:42:18,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:42:18,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:42:18,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:42:18,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:42:18,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:42:18,443 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 235 [2023-08-31 23:42:18,444 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 113 flow. Second operand has 7 states, 7 states have (on average 103.57142857142857) internal successors, (725), 7 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:42:18,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:42:18,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 235 [2023-08-31 23:42:18,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:42:18,662 INFO L130 PetriNetUnfolder]: 206/423 cut-off events. [2023-08-31 23:42:18,663 INFO L131 PetriNetUnfolder]: For 318/318 co-relation queries the response was YES. [2023-08-31 23:42:18,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1207 conditions, 423 events. 206/423 cut-off events. For 318/318 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1831 event pairs, 23 based on Foata normal form. 1/422 useless extension candidates. Maximal degree in co-relation 1198. Up to 152 conditions per place. [2023-08-31 23:42:18,665 INFO L137 encePairwiseOnDemand]: 229/235 looper letters, 57 selfloop transitions, 6 changer transitions 0/66 dead transitions. [2023-08-31 23:42:18,666 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 66 transitions, 393 flow [2023-08-31 23:42:18,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:42:18,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:42:18,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 755 transitions. [2023-08-31 23:42:18,668 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45896656534954405 [2023-08-31 23:42:18,668 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 755 transitions. [2023-08-31 23:42:18,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 755 transitions. [2023-08-31 23:42:18,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:42:18,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 755 transitions. [2023-08-31 23:42:18,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 107.85714285714286) internal successors, (755), 7 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:42:18,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:42:18,673 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:42:18,673 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 113 flow. Second operand 7 states and 755 transitions. [2023-08-31 23:42:18,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 66 transitions, 393 flow [2023-08-31 23:42:18,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 66 transitions, 390 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:42:18,676 INFO L231 Difference]: Finished difference. Result has 48 places, 31 transitions, 136 flow [2023-08-31 23:42:18,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=40, 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=7, PETRI_FLOW=136, PETRI_PLACES=48, PETRI_TRANSITIONS=31} [2023-08-31 23:42:18,677 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places. [2023-08-31 23:42:18,677 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 31 transitions, 136 flow [2023-08-31 23:42:18,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 103.57142857142857) internal successors, (725), 7 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:42:18,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:42:18,678 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] [2023-08-31 23:42:18,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-08-31 23:42:18,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:42:18,888 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:42:18,888 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:42:18,889 INFO L85 PathProgramCache]: Analyzing trace with hash 285529442, now seen corresponding path program 3 times [2023-08-31 23:42:18,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:42:18,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [962887842] [2023-08-31 23:42:18,889 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 23:42:18,889 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:42:18,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:42:18,890 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:42:18,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-31 23:42:18,979 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-31 23:42:18,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:42:18,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:42:18,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:42:19,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:42:19,022 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:42:19,022 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:42:19,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [962887842] [2023-08-31 23:42:19,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [962887842] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:42:19,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:42:19,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:42:19,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600622929] [2023-08-31 23:42:19,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:42:19,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:42:19,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:42:19,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:42:19,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:42:19,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 235 [2023-08-31 23:42:19,038 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 31 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:42:19,038 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:42:19,038 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 235 [2023-08-31 23:42:19,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:42:19,186 INFO L130 PetriNetUnfolder]: 342/696 cut-off events. [2023-08-31 23:42:19,186 INFO L131 PetriNetUnfolder]: For 676/676 co-relation queries the response was YES. [2023-08-31 23:42:19,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2229 conditions, 696 events. 342/696 cut-off events. For 676/676 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3441 event pairs, 104 based on Foata normal form. 1/695 useless extension candidates. Maximal degree in co-relation 2218. Up to 316 conditions per place. [2023-08-31 23:42:19,191 INFO L137 encePairwiseOnDemand]: 231/235 looper letters, 55 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2023-08-31 23:42:19,191 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 60 transitions, 384 flow [2023-08-31 23:42:19,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:42:19,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:42:19,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 453 transitions. [2023-08-31 23:42:19,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4819148936170213 [2023-08-31 23:42:19,193 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 453 transitions. [2023-08-31 23:42:19,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 453 transitions. [2023-08-31 23:42:19,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:42:19,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 453 transitions. [2023-08-31 23:42:19,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:42:19,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:42:19,197 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:42:19,197 INFO L175 Difference]: Start difference. First operand has 48 places, 31 transitions, 136 flow. Second operand 4 states and 453 transitions. [2023-08-31 23:42:19,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 60 transitions, 384 flow [2023-08-31 23:42:19,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 60 transitions, 376 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:42:19,203 INFO L231 Difference]: Finished difference. Result has 49 places, 32 transitions, 144 flow [2023-08-31 23:42:19,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=144, PETRI_PLACES=49, PETRI_TRANSITIONS=32} [2023-08-31 23:42:19,206 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 9 predicate places. [2023-08-31 23:42:19,206 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 32 transitions, 144 flow [2023-08-31 23:42:19,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:42:19,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:42:19,207 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] [2023-08-31 23:42:19,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-08-31 23:42:19,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:42:19,420 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:42:19,421 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:42:19,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1295372140, now seen corresponding path program 4 times [2023-08-31 23:42:19,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:42:19,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1354499355] [2023-08-31 23:42:19,422 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 23:42:19,422 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:42:19,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:42:19,423 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-31 23:42:19,460 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-31 23:42:19,543 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 23:42:19,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-31 23:42:19,543 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:42:19,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:42:19,653 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-31 23:42:19,653 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:42:19,654 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-31 23:42:19,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-31 23:42:19,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-31 23:42:19,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-31 23:42:19,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-31 23:42:19,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-31 23:42:19,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-31 23:42:19,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-31 23:42:19,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-31 23:42:19,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-31 23:42:19,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-31 23:42:19,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-31 23:42:19,657 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-31 23:42:19,671 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-31 23:42:19,871 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-31 23:42:19,871 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2023-08-31 23:42:19,876 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:42:19,876 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:42:19,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:42:19 BasicIcfg [2023-08-31 23:42:19,927 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:42:19,927 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:42:19,928 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:42:19,928 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:42:19,928 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:42:07" (3/4) ... [2023-08-31 23:42:19,930 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:42:19,930 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:42:19,931 INFO L158 Benchmark]: Toolchain (without parser) took 13625.69ms. Allocated memory was 75.5MB in the beginning and 151.0MB in the end (delta: 75.5MB). Free memory was 51.5MB in the beginning and 48.4MB in the end (delta: 3.1MB). Peak memory consumption was 79.5MB. Max. memory is 16.1GB. [2023-08-31 23:42:19,931 INFO L158 Benchmark]: CDTParser took 0.98ms. Allocated memory is still 60.8MB. Free memory was 38.9MB in the beginning and 38.8MB in the end (delta: 81.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:42:19,932 INFO L158 Benchmark]: CACSL2BoogieTranslator took 561.17ms. Allocated memory is still 75.5MB. Free memory was 51.3MB in the beginning and 49.8MB in the end (delta: 1.5MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. [2023-08-31 23:42:19,932 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.91ms. Allocated memory is still 75.5MB. Free memory was 49.8MB in the beginning and 47.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:42:19,932 INFO L158 Benchmark]: Boogie Preprocessor took 31.18ms. Allocated memory is still 75.5MB. Free memory was 47.1MB in the beginning and 45.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:42:19,933 INFO L158 Benchmark]: RCFGBuilder took 696.11ms. Allocated memory is still 75.5MB. Free memory was 45.0MB in the beginning and 31.3MB in the end (delta: 13.7MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. [2023-08-31 23:42:19,933 INFO L158 Benchmark]: TraceAbstraction took 12275.91ms. Allocated memory was 75.5MB in the beginning and 151.0MB in the end (delta: 75.5MB). Free memory was 30.5MB in the beginning and 48.4MB in the end (delta: -17.9MB). Peak memory consumption was 58.5MB. Max. memory is 16.1GB. [2023-08-31 23:42:19,933 INFO L158 Benchmark]: Witness Printer took 3.07ms. Allocated memory is still 151.0MB. Free memory is still 48.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:42:19,935 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.98ms. Allocated memory is still 60.8MB. Free memory was 38.9MB in the beginning and 38.8MB in the end (delta: 81.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 561.17ms. Allocated memory is still 75.5MB. Free memory was 51.3MB in the beginning and 49.8MB in the end (delta: 1.5MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.91ms. Allocated memory is still 75.5MB. Free memory was 49.8MB in the beginning and 47.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.18ms. Allocated memory is still 75.5MB. Free memory was 47.1MB in the beginning and 45.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 696.11ms. Allocated memory is still 75.5MB. Free memory was 45.0MB in the beginning and 31.3MB in the end (delta: 13.7MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. * TraceAbstraction took 12275.91ms. Allocated memory was 75.5MB in the beginning and 151.0MB in the end (delta: 75.5MB). Free memory was 30.5MB in the beginning and 48.4MB in the end (delta: -17.9MB). Peak memory consumption was 58.5MB. Max. memory is 16.1GB. * Witness Printer took 3.07ms. Allocated memory is still 151.0MB. Free memory is still 48.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.2s, 124 PlacesBefore, 40 PlacesAfterwards, 116 TransitionsBefore, 31 TransitionsAfterwards, 1996 CoEnabledTransitionPairs, 7 FixpointIterations, 47 TrivialSequentialCompositions, 62 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 116 TotalNumberOfCompositions, 5360 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2612, independent: 2439, independent conditional: 0, independent unconditional: 2439, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1106, independent: 1067, independent conditional: 0, independent unconditional: 1067, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2612, independent: 1372, independent conditional: 0, independent unconditional: 1372, dependent: 134, dependent conditional: 0, dependent unconditional: 134, unknown: 1106, unknown conditional: 0, unknown unconditional: 1106] , Statistics on independence cache: Total cache size (in pairs): 111, Positive cache size: 95, Positive conditional cache size: 0, Positive unconditional cache size: 95, 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: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L833] 0 pthread_t t2345; [L834] FCALL, FORK 0 pthread_create(&t2345, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2345, ((void *)0), P0, ((void *)0))=-1, t2345={-6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L835] 0 pthread_t t2346; [L836] FCALL, FORK 0 pthread_create(&t2346, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2346, ((void *)0), P1, ((void *)0))=0, t2345={-6:0}, t2346={-10:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L776] 2 x$w_buff1 = x$w_buff0 [L777] 2 x$w_buff0 = 1 [L778] 2 x$w_buff1_used = x$w_buff0_used [L779] 2 x$w_buff0_used = (_Bool)1 [L780] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L780] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L781] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L782] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L783] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L784] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L785] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L837] 0 pthread_t t2347; [L838] FCALL, FORK 0 pthread_create(&t2347, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2347, ((void *)0), P2, ((void *)0))=1, t2345={-6:0}, t2346={-10:0}, t2347={-2:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L788] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L805] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L808] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L746] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L751] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 1 x$flush_delayed = weak$$choice2 [L754] 1 x$mem_tmp = x [L755] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L756] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L757] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L758] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L759] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L761] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 __unbuffered_p0_EAX = x [L763] 1 x = x$flush_delayed ? x$mem_tmp : x [L764] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L811] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L812] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L813] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L814] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L815] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L842] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L842] RET 0 assume_abort_if_not(main$tmp_guard0) [L844] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L845] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L846] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L847] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L848] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2345={-6:0}, t2346={-10:0}, t2347={-2:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L851] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] - UnprovableResult [Line: 19]: 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: 831]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 838]: 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: 834]: 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: 836]: 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, 145 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: 12.1s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 261 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 210 mSDsluCounter, 96 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 91 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 908 IncrementalHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 5 mSDtfsCounter, 908 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=8, InterpolantAutomatonStates: 38, 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.3s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 123 NumberOfCodeBlocks, 123 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 429 SizeOfPredicates, 11 NumberOfNonLiveVariables, 937 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-31 23:42:19,957 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