./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_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/safe002_power.opt_pso.oepc_pso.opt_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 390a12f9f7a5c311c1cdcecac54987f654ebac30db2fbb7661324a5599d93cf6 --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:28:44,674 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:28:44,676 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:28:44,705 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:28:44,707 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:28:44,710 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:28:44,712 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:28:44,714 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:28:44,716 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:28:44,720 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:28:44,722 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:28:44,724 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:28:44,724 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:28:44,726 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:28:44,728 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:28:44,731 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:28:44,732 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:28:44,733 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:28:44,735 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:28:44,740 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:28:44,741 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:28:44,742 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:28:44,744 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:28:44,745 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:28:44,752 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:28:44,752 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:28:44,752 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:28:44,754 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:28:44,755 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:28:44,755 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:28:44,756 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:28:44,762 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:28:44,763 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:28:44,764 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:28:44,765 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:28:44,766 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:28:44,766 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:28:44,766 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:28:44,767 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:28:44,767 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:28:44,768 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:28:44,769 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:28:44,807 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:28:44,808 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:28:44,809 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:28:44,809 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:28:44,810 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:28:44,810 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:28:44,810 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:28:44,811 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:28:44,811 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:28:44,811 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:28:44,812 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:28:44,812 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:28:44,812 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:28:44,812 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:28:44,812 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:28:44,813 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:28:44,813 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:28:44,813 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:28:44,813 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:28:44,813 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:28:44,814 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:28:44,814 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:28:44,814 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:28:44,814 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:28:44,814 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:28:44,815 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:28:44,815 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:28:44,815 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:28:44,815 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 23:28:44,815 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 23:28:44,816 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:28:44,816 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:28:44,816 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:28:44,816 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:28:44,816 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 -> 390a12f9f7a5c311c1cdcecac54987f654ebac30db2fbb7661324a5599d93cf6 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:28:45,130 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:28:45,153 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:28:45,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:28:45,156 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:28:45,157 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:28:45,158 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2023-08-31 23:28:46,445 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:28:46,684 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:28:46,684 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2023-08-31 23:28:46,694 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1b306491/a4aeb9b9a1c44532a242fee7df2400b0/FLAG3121f3263 [2023-08-31 23:28:46,712 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1b306491/a4aeb9b9a1c44532a242fee7df2400b0 [2023-08-31 23:28:46,715 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:28:46,716 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:28:46,718 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:28:46,718 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:28:46,730 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:28:46,731 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:28:46" (1/1) ... [2023-08-31 23:28:46,732 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@feb18e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:28:46, skipping insertion in model container [2023-08-31 23:28:46,732 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:28:46" (1/1) ... [2023-08-31 23:28:46,738 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:28:46,787 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:28:46,955 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/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i[1019,1032] [2023-08-31 23:28:47,157 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:28:47,166 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:28:47,178 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/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i[1019,1032] [2023-08-31 23:28:47,243 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:28:47,279 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:28:47,280 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:28:47,286 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:28:47,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:28:47 WrapperNode [2023-08-31 23:28:47,286 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:28:47,287 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:28:47,287 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:28:47,288 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:28:47,293 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:28:47" (1/1) ... [2023-08-31 23:28:47,316 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:28:47" (1/1) ... [2023-08-31 23:28:47,341 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2023-08-31 23:28:47,344 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:28:47,345 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:28:47,345 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:28:47,345 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:28:47,351 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:28:47" (1/1) ... [2023-08-31 23:28:47,351 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:28:47" (1/1) ... [2023-08-31 23:28:47,354 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:28:47" (1/1) ... [2023-08-31 23:28:47,354 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:28:47" (1/1) ... [2023-08-31 23:28:47,360 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:28:47" (1/1) ... [2023-08-31 23:28:47,362 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:28:47" (1/1) ... [2023-08-31 23:28:47,363 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:28:47" (1/1) ... [2023-08-31 23:28:47,380 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:28:47" (1/1) ... [2023-08-31 23:28:47,384 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:28:47,384 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:28:47,385 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:28:47,385 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:28:47,385 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:28:47" (1/1) ... [2023-08-31 23:28:47,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:28:47,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:28:47,433 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:28:47,454 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:28:47,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 23:28:47,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:28:47,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:28:47,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:28:47,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:28:47,469 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:28:47,469 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:28:47,469 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:28:47,470 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:28:47,470 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:28:47,470 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:28:47,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 23:28:47,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:28:47,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:28:47,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:28:47,472 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:28:47,658 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:28:47,660 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:28:47,937 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:28:48,059 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:28:48,059 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:28:48,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:28:48 BoogieIcfgContainer [2023-08-31 23:28:48,061 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:28:48,063 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:28:48,063 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:28:48,065 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:28:48,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:28:46" (1/3) ... [2023-08-31 23:28:48,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5507d3a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:28:48, skipping insertion in model container [2023-08-31 23:28:48,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:28:47" (2/3) ... [2023-08-31 23:28:48,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5507d3a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:28:48, skipping insertion in model container [2023-08-31 23:28:48,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:28:48" (3/3) ... [2023-08-31 23:28:48,068 INFO L112 eAbstractionObserver]: Analyzing ICFG safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2023-08-31 23:28:48,082 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:28:48,082 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-31 23:28:48,083 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:28:48,149 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:28:48,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 117 transitions, 249 flow [2023-08-31 23:28:48,224 INFO L130 PetriNetUnfolder]: 2/114 cut-off events. [2023-08-31 23:28:48,224 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:28:48,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-08-31 23:28:48,230 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 117 transitions, 249 flow [2023-08-31 23:28:48,234 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 114 transitions, 237 flow [2023-08-31 23:28:48,237 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:28:48,245 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 114 transitions, 237 flow [2023-08-31 23:28:48,249 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 114 transitions, 237 flow [2023-08-31 23:28:48,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 237 flow [2023-08-31 23:28:48,288 INFO L130 PetriNetUnfolder]: 2/114 cut-off events. [2023-08-31 23:28:48,289 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:28:48,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-08-31 23:28:48,294 INFO L119 LiptonReduction]: Number of co-enabled transitions 1996 [2023-08-31 23:28:51,854 INFO L134 LiptonReduction]: Checked pairs total: 4759 [2023-08-31 23:28:51,855 INFO L136 LiptonReduction]: Total number of compositions: 116 [2023-08-31 23:28:51,872 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:28:51,877 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;@18cb0ecc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:28:51,877 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-31 23:28:51,879 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:28:51,879 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:28:51,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:28:51,879 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:28:51,880 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:28:51,883 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:28:51,884 INFO L85 PathProgramCache]: Analyzing trace with hash 506, now seen corresponding path program 1 times [2023-08-31 23:28:51,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:28:51,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062550771] [2023-08-31 23:28:51,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:28:51,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:28:52,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:28:52,049 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:28:52,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:28:52,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062550771] [2023-08-31 23:28:52,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062550771] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:28:52,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:28:52,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:28:52,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498773414] [2023-08-31 23:28:52,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:28:52,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:28:52,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:28:52,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:28:52,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:28:52,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 233 [2023-08-31 23:28:52,083 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 71 flow. Second operand has 2 states, 2 states have (on average 105.5) internal successors, (211), 2 states have internal predecessors, (211), 0 states have call successors, (0), 0 states 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:28:52,083 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:28:52,083 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 233 [2023-08-31 23:28:52,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:28:52,421 INFO L130 PetriNetUnfolder]: 1277/1906 cut-off events. [2023-08-31 23:28:52,421 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-08-31 23:28:52,426 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 122. Compared 8746 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:28:52,435 INFO L137 encePairwiseOnDemand]: 226/233 looper letters, 22 selfloop transitions, 0 changer transitions 0/24 dead transitions. [2023-08-31 23:28:52,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 24 transitions, 101 flow [2023-08-31 23:28:52,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:28:52,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:28:52,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 239 transitions. [2023-08-31 23:28:52,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5128755364806867 [2023-08-31 23:28:52,447 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 239 transitions. [2023-08-31 23:28:52,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 239 transitions. [2023-08-31 23:28:52,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:28:52,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 239 transitions. [2023-08-31 23:28:52,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 119.5) internal successors, (239), 2 states have internal predecessors, (239), 0 states have call successors, (0), 0 states 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:28:52,456 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 states 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:28:52,457 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 states 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:28:52,459 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 71 flow. Second operand 2 states and 239 transitions. [2023-08-31 23:28:52,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 24 transitions, 101 flow [2023-08-31 23:28:52,462 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:28:52,463 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 54 flow [2023-08-31 23:28:52,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, 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:28:52,467 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -8 predicate places. [2023-08-31 23:28:52,468 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 54 flow [2023-08-31 23:28:52,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 105.5) internal successors, (211), 2 states have internal predecessors, (211), 0 states have call successors, (0), 0 states 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:28:52,468 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:28:52,468 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-31 23:28:52,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 23:28:52,469 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:28:52,469 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:28:52,469 INFO L85 PathProgramCache]: Analyzing trace with hash 480379875, now seen corresponding path program 1 times [2023-08-31 23:28:52,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:28:52,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267867757] [2023-08-31 23:28:52,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:28:52,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:28:52,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:28:52,814 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:28:52,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:28:52,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267867757] [2023-08-31 23:28:52,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267867757] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:28:52,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:28:52,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:28:52,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602699331] [2023-08-31 23:28:52,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:28:52,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:28:52,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:28:52,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:28:52,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:28:52,826 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 233 [2023-08-31 23:28:52,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states 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:28:52,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:28:52,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 233 [2023-08-31 23:28:52,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:28:53,046 INFO L130 PetriNetUnfolder]: 999/1556 cut-off events. [2023-08-31 23:28:53,047 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:28:53,049 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 7286 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:28:53,054 INFO L137 encePairwiseOnDemand]: 230/233 looper letters, 31 selfloop transitions, 2 changer transitions 2/37 dead transitions. [2023-08-31 23:28:53,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 37 transitions, 152 flow [2023-08-31 23:28:53,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:28:53,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:28:53,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2023-08-31 23:28:53,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4978540772532189 [2023-08-31 23:28:53,060 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 348 transitions. [2023-08-31 23:28:53,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 348 transitions. [2023-08-31 23:28:53,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:28:53,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 348 transitions. [2023-08-31 23:28:53,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states 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:28:53,067 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states 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:28:53,067 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states 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:28:53,067 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 54 flow. Second operand 3 states and 348 transitions. [2023-08-31 23:28:53,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 37 transitions, 152 flow [2023-08-31 23:28:53,068 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:28:53,069 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 54 flow [2023-08-31 23:28:53,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, 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:28:53,070 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -7 predicate places. [2023-08-31 23:28:53,070 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 54 flow [2023-08-31 23:28:53,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states 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:28:53,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:28:53,071 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:28:53,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 23:28:53,071 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:28:53,073 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:28:53,074 INFO L85 PathProgramCache]: Analyzing trace with hash 935227555, now seen corresponding path program 1 times [2023-08-31 23:28:53,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:28:53,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896945972] [2023-08-31 23:28:53,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:28:53,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:28:53,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:28:53,379 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:28:53,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:28:53,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896945972] [2023-08-31 23:28:53,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896945972] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:28:53,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:28:53,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:28:53,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671060549] [2023-08-31 23:28:53,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:28:53,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:28:53,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:28:53,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:28:53,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:28:53,394 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 233 [2023-08-31 23:28:53,395 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states 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:28:53,395 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:28:53,395 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 233 [2023-08-31 23:28:53,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:28:53,724 INFO L130 PetriNetUnfolder]: 2171/3248 cut-off events. [2023-08-31 23:28:53,724 INFO L131 PetriNetUnfolder]: For 173/173 co-relation queries the response was YES. [2023-08-31 23:28:53,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6743 conditions, 3248 events. 2171/3248 cut-off events. For 173/173 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 16100 event pairs, 709 based on Foata normal form. 0/3158 useless extension candidates. Maximal degree in co-relation 6739. Up to 1850 conditions per place. [2023-08-31 23:28:53,742 INFO L137 encePairwiseOnDemand]: 225/233 looper letters, 34 selfloop transitions, 7 changer transitions 0/41 dead transitions. [2023-08-31 23:28:53,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 41 transitions, 180 flow [2023-08-31 23:28:53,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:28:53,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:28:53,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 333 transitions. [2023-08-31 23:28:53,744 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47639484978540775 [2023-08-31 23:28:53,744 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 333 transitions. [2023-08-31 23:28:53,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 333 transitions. [2023-08-31 23:28:53,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:28:53,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 333 transitions. [2023-08-31 23:28:53,745 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states 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:28:53,748 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states 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:28:53,748 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states 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:28:53,749 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 54 flow. Second operand 3 states and 333 transitions. [2023-08-31 23:28:53,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 41 transitions, 180 flow [2023-08-31 23:28:53,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 41 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:28:53,751 INFO L231 Difference]: Finished difference. Result has 34 places, 28 transitions, 104 flow [2023-08-31 23:28:53,751 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, 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=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=34, PETRI_TRANSITIONS=28} [2023-08-31 23:28:53,752 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -6 predicate places. [2023-08-31 23:28:53,755 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 104 flow [2023-08-31 23:28:53,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states 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:28:53,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:28:53,755 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:28:53,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 23:28:53,756 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:28:53,756 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:28:53,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1072718450, now seen corresponding path program 1 times [2023-08-31 23:28:53,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:28:53,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934656582] [2023-08-31 23:28:53,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:28:53,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:28:53,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:28:53,994 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:28:53,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:28:53,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934656582] [2023-08-31 23:28:53,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934656582] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:28:53,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:28:53,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:28:53,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506163429] [2023-08-31 23:28:53,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:28:53,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:28:53,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:28:53,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:28:53,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:28:54,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 233 [2023-08-31 23:28:54,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states 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:28:54,014 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:28:54,014 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 233 [2023-08-31 23:28:54,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:28:54,388 INFO L130 PetriNetUnfolder]: 2117/3167 cut-off events. [2023-08-31 23:28:54,388 INFO L131 PetriNetUnfolder]: For 1502/1502 co-relation queries the response was YES. [2023-08-31 23:28:54,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8304 conditions, 3167 events. 2117/3167 cut-off events. For 1502/1502 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 15402 event pairs, 268 based on Foata normal form. 12/3179 useless extension candidates. Maximal degree in co-relation 8299. Up to 1625 conditions per place. [2023-08-31 23:28:54,407 INFO L137 encePairwiseOnDemand]: 225/233 looper letters, 46 selfloop transitions, 11 changer transitions 0/57 dead transitions. [2023-08-31 23:28:54,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 57 transitions, 314 flow [2023-08-31 23:28:54,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:28:54,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:28:54,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 441 transitions. [2023-08-31 23:28:54,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47317596566523606 [2023-08-31 23:28:54,411 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 441 transitions. [2023-08-31 23:28:54,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 441 transitions. [2023-08-31 23:28:54,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:28:54,411 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 441 transitions. [2023-08-31 23:28:54,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 0 states 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:28:54,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states 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:28:54,414 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states 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:28:54,415 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 104 flow. Second operand 4 states and 441 transitions. [2023-08-31 23:28:54,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 57 transitions, 314 flow [2023-08-31 23:28:54,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 57 transitions, 288 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:28:54,423 INFO L231 Difference]: Finished difference. Result has 38 places, 36 transitions, 180 flow [2023-08-31 23:28:54,423 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=180, PETRI_PLACES=38, PETRI_TRANSITIONS=36} [2023-08-31 23:28:54,425 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2023-08-31 23:28:54,425 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 36 transitions, 180 flow [2023-08-31 23:28:54,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states 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:28:54,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:28:54,426 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:28:54,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 23:28:54,426 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:28:54,426 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:28:54,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1072716223, now seen corresponding path program 1 times [2023-08-31 23:28:54,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:28:54,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712242869] [2023-08-31 23:28:54,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:28:54,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:28:54,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:28:54,743 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:28:54,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:28:54,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712242869] [2023-08-31 23:28:54,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712242869] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:28:54,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:28:54,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:28:54,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36871691] [2023-08-31 23:28:54,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:28:54,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:28:54,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:28:54,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:28:54,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:28:54,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 233 [2023-08-31 23:28:54,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 36 transitions, 180 flow. Second operand has 6 states, 6 states have (on average 92.66666666666667) internal successors, (556), 6 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:54,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:28:54,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 233 [2023-08-31 23:28:54,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:28:55,373 INFO L130 PetriNetUnfolder]: 1875/2950 cut-off events. [2023-08-31 23:28:55,373 INFO L131 PetriNetUnfolder]: For 2569/2610 co-relation queries the response was YES. [2023-08-31 23:28:55,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8099 conditions, 2950 events. 1875/2950 cut-off events. For 2569/2610 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 15757 event pairs, 520 based on Foata normal form. 180/3086 useless extension candidates. Maximal degree in co-relation 8092. Up to 2096 conditions per place. [2023-08-31 23:28:55,391 INFO L137 encePairwiseOnDemand]: 226/233 looper letters, 43 selfloop transitions, 6 changer transitions 18/75 dead transitions. [2023-08-31 23:28:55,392 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 75 transitions, 482 flow [2023-08-31 23:28:55,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:28:55,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:28:55,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 595 transitions. [2023-08-31 23:28:55,394 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42560801144492133 [2023-08-31 23:28:55,394 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 595 transitions. [2023-08-31 23:28:55,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 595 transitions. [2023-08-31 23:28:55,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:28:55,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 595 transitions. [2023-08-31 23:28:55,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 99.16666666666667) internal successors, (595), 6 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:55,399 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states 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:28:55,399 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states 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:28:55,400 INFO L175 Difference]: Start difference. First operand has 38 places, 36 transitions, 180 flow. Second operand 6 states and 595 transitions. [2023-08-31 23:28:55,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 75 transitions, 482 flow [2023-08-31 23:28:55,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 75 transitions, 482 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:28:55,409 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 206 flow [2023-08-31 23:28:55,409 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=206, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2023-08-31 23:28:55,410 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places. [2023-08-31 23:28:55,410 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 206 flow [2023-08-31 23:28:55,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.66666666666667) internal successors, (556), 6 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:55,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:28:55,411 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:28:55,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 23:28:55,411 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:28:55,411 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:28:55,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1105464401, now seen corresponding path program 1 times [2023-08-31 23:28:55,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:28:55,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448010761] [2023-08-31 23:28:55,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:28:55,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:28:55,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:28:55,601 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:28:55,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:28:55,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448010761] [2023-08-31 23:28:55,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448010761] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:28:55,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:28:55,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:28:55,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266443305] [2023-08-31 23:28:55,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:28:55,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:28:55,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:28:55,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:28:55,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:28:55,623 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 233 [2023-08-31 23:28:55,625 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 206 flow. Second operand has 5 states, 5 states have (on average 99.2) internal successors, (496), 5 states have internal predecessors, (496), 0 states have call successors, (0), 0 states 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:28:55,625 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:28:55,625 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 233 [2023-08-31 23:28:55,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:28:56,061 INFO L130 PetriNetUnfolder]: 2499/3758 cut-off events. [2023-08-31 23:28:56,061 INFO L131 PetriNetUnfolder]: For 4634/4634 co-relation queries the response was YES. [2023-08-31 23:28:56,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11230 conditions, 3758 events. 2499/3758 cut-off events. For 4634/4634 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 18790 event pairs, 535 based on Foata normal form. 69/3827 useless extension candidates. Maximal degree in co-relation 11220. Up to 2252 conditions per place. [2023-08-31 23:28:56,105 INFO L137 encePairwiseOnDemand]: 225/233 looper letters, 59 selfloop transitions, 11 changer transitions 0/70 dead transitions. [2023-08-31 23:28:56,106 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 70 transitions, 474 flow [2023-08-31 23:28:56,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:28:56,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:28:56,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 545 transitions. [2023-08-31 23:28:56,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4678111587982833 [2023-08-31 23:28:56,108 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 545 transitions. [2023-08-31 23:28:56,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 545 transitions. [2023-08-31 23:28:56,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:28:56,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 545 transitions. [2023-08-31 23:28:56,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 0 states have call successors, (0), 0 states 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:28:56,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states 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:28:56,112 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states 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:28:56,112 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 206 flow. Second operand 5 states and 545 transitions. [2023-08-31 23:28:56,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 70 transitions, 474 flow [2023-08-31 23:28:56,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 70 transitions, 450 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-08-31 23:28:56,132 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 282 flow [2023-08-31 23:28:56,132 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=282, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2023-08-31 23:28:56,133 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2023-08-31 23:28:56,133 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 282 flow [2023-08-31 23:28:56,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.2) internal successors, (496), 5 states have internal predecessors, (496), 0 states have call successors, (0), 0 states 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:28:56,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:28:56,133 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:28:56,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-31 23:28:56,134 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:28:56,134 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:28:56,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1074158643, now seen corresponding path program 1 times [2023-08-31 23:28:56,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:28:56,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11554709] [2023-08-31 23:28:56,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:28:56,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:28:56,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:28:56,430 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:28:56,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:28:56,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11554709] [2023-08-31 23:28:56,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11554709] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:28:56,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:28:56,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:28:56,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149446536] [2023-08-31 23:28:56,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:28:56,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:28:56,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:28:56,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:28:56,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:28:56,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 233 [2023-08-31 23:28:56,617 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 282 flow. Second operand has 7 states, 7 states have (on average 86.57142857142857) internal successors, (606), 7 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:56,617 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:28:56,617 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 233 [2023-08-31 23:28:56,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:28:57,171 INFO L130 PetriNetUnfolder]: 2145/3249 cut-off events. [2023-08-31 23:28:57,171 INFO L131 PetriNetUnfolder]: For 6211/6211 co-relation queries the response was YES. [2023-08-31 23:28:57,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10396 conditions, 3249 events. 2145/3249 cut-off events. For 6211/6211 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 15731 event pairs, 580 based on Foata normal form. 155/3404 useless extension candidates. Maximal degree in co-relation 10385. Up to 1493 conditions per place. [2023-08-31 23:28:57,186 INFO L137 encePairwiseOnDemand]: 225/233 looper letters, 39 selfloop transitions, 7 changer transitions 52/98 dead transitions. [2023-08-31 23:28:57,186 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 98 transitions, 765 flow [2023-08-31 23:28:57,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:28:57,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:28:57,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 751 transitions. [2023-08-31 23:28:57,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4028969957081545 [2023-08-31 23:28:57,189 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 751 transitions. [2023-08-31 23:28:57,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 751 transitions. [2023-08-31 23:28:57,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:28:57,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 751 transitions. [2023-08-31 23:28:57,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 93.875) internal successors, (751), 8 states have internal predecessors, (751), 0 states have call successors, (0), 0 states 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:28:57,194 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 233.0) internal successors, (2097), 9 states have internal predecessors, (2097), 0 states have call successors, (0), 0 states 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:28:57,194 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 233.0) internal successors, (2097), 9 states have internal predecessors, (2097), 0 states have call successors, (0), 0 states 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:28:57,195 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 282 flow. Second operand 8 states and 751 transitions. [2023-08-31 23:28:57,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 98 transitions, 765 flow [2023-08-31 23:28:57,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 98 transitions, 752 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:28:57,211 INFO L231 Difference]: Finished difference. Result has 56 places, 34 transitions, 242 flow [2023-08-31 23:28:57,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=242, PETRI_PLACES=56, PETRI_TRANSITIONS=34} [2023-08-31 23:28:57,212 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 16 predicate places. [2023-08-31 23:28:57,212 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 34 transitions, 242 flow [2023-08-31 23:28:57,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 86.57142857142857) internal successors, (606), 7 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:57,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:28:57,213 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:28:57,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-31 23:28:57,213 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:28:57,213 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:28:57,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1722959402, now seen corresponding path program 1 times [2023-08-31 23:28:57,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:28:57,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893320911] [2023-08-31 23:28:57,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:28:57,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:28:57,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:28:57,341 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:28:57,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:28:57,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893320911] [2023-08-31 23:28:57,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893320911] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:28:57,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:28:57,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:28:57,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218742070] [2023-08-31 23:28:57,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:28:57,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:28:57,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:28:57,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:28:57,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:28:57,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 233 [2023-08-31 23:28:57,354 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 34 transitions, 242 flow. Second operand has 4 states, 4 states have (on average 103.25) internal successors, (413), 4 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:57,354 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:28:57,354 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 233 [2023-08-31 23:28:57,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:28:57,669 INFO L130 PetriNetUnfolder]: 1539/2380 cut-off events. [2023-08-31 23:28:57,670 INFO L131 PetriNetUnfolder]: For 4845/4845 co-relation queries the response was YES. [2023-08-31 23:28:57,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7793 conditions, 2380 events. 1539/2380 cut-off events. For 4845/4845 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 11132 event pairs, 462 based on Foata normal form. 42/2422 useless extension candidates. Maximal degree in co-relation 7777. Up to 1005 conditions per place. [2023-08-31 23:28:57,684 INFO L137 encePairwiseOnDemand]: 229/233 looper letters, 60 selfloop transitions, 10 changer transitions 0/70 dead transitions. [2023-08-31 23:28:57,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 70 transitions, 580 flow [2023-08-31 23:28:57,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:28:57,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:28:57,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 558 transitions. [2023-08-31 23:28:57,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47896995708154505 [2023-08-31 23:28:57,687 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 558 transitions. [2023-08-31 23:28:57,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 558 transitions. [2023-08-31 23:28:57,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:28:57,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 558 transitions. [2023-08-31 23:28:57,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 0 states have call successors, (0), 0 states 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:28:57,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states 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:28:57,691 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states 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:28:57,691 INFO L175 Difference]: Start difference. First operand has 56 places, 34 transitions, 242 flow. Second operand 5 states and 558 transitions. [2023-08-31 23:28:57,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 70 transitions, 580 flow [2023-08-31 23:28:57,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 70 transitions, 518 flow, removed 10 selfloop flow, removed 8 redundant places. [2023-08-31 23:28:57,717 INFO L231 Difference]: Finished difference. Result has 52 places, 37 transitions, 275 flow [2023-08-31 23:28:57,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=275, PETRI_PLACES=52, PETRI_TRANSITIONS=37} [2023-08-31 23:28:57,718 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 12 predicate places. [2023-08-31 23:28:57,718 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 37 transitions, 275 flow [2023-08-31 23:28:57,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.25) internal successors, (413), 4 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:57,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:28:57,719 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:28:57,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-31 23:28:57,719 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:28:57,720 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:28:57,720 INFO L85 PathProgramCache]: Analyzing trace with hash 51961319, now seen corresponding path program 1 times [2023-08-31 23:28:57,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:28:57,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007275306] [2023-08-31 23:28:57,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:28:57,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:28:57,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:28:57,873 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:28:57,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:28:57,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007275306] [2023-08-31 23:28:57,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007275306] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:28:57,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:28:57,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:28:57,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227629186] [2023-08-31 23:28:57,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:28:57,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:28:57,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:28:57,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:28:57,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:28:57,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 233 [2023-08-31 23:28:57,886 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 37 transitions, 275 flow. Second operand has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 0 states have call successors, (0), 0 states 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:28:57,886 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:28:57,886 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 233 [2023-08-31 23:28:57,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:28:58,165 INFO L130 PetriNetUnfolder]: 1518/2350 cut-off events. [2023-08-31 23:28:58,165 INFO L131 PetriNetUnfolder]: For 4367/4367 co-relation queries the response was YES. [2023-08-31 23:28:58,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7723 conditions, 2350 events. 1518/2350 cut-off events. For 4367/4367 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 11191 event pairs, 392 based on Foata normal form. 9/2359 useless extension candidates. Maximal degree in co-relation 7707. Up to 1499 conditions per place. [2023-08-31 23:28:58,179 INFO L137 encePairwiseOnDemand]: 225/233 looper letters, 50 selfloop transitions, 14 changer transitions 0/64 dead transitions. [2023-08-31 23:28:58,179 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 64 transitions, 507 flow [2023-08-31 23:28:58,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:28:58,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:28:58,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 441 transitions. [2023-08-31 23:28:58,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47317596566523606 [2023-08-31 23:28:58,181 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 441 transitions. [2023-08-31 23:28:58,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 441 transitions. [2023-08-31 23:28:58,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:28:58,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 441 transitions. [2023-08-31 23:28:58,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 0 states 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:28:58,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states 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:28:58,186 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states 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:28:58,186 INFO L175 Difference]: Start difference. First operand has 52 places, 37 transitions, 275 flow. Second operand 4 states and 441 transitions. [2023-08-31 23:28:58,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 64 transitions, 507 flow [2023-08-31 23:28:58,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 64 transitions, 500 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:28:58,197 INFO L231 Difference]: Finished difference. Result has 57 places, 39 transitions, 355 flow [2023-08-31 23:28:58,197 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=355, PETRI_PLACES=57, PETRI_TRANSITIONS=39} [2023-08-31 23:28:58,198 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 17 predicate places. [2023-08-31 23:28:58,198 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 39 transitions, 355 flow [2023-08-31 23:28:58,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 0 states have call successors, (0), 0 states 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:28:58,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:28:58,199 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:28:58,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-31 23:28:58,199 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:28:58,200 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:28:58,200 INFO L85 PathProgramCache]: Analyzing trace with hash 85653261, now seen corresponding path program 1 times [2023-08-31 23:28:58,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:28:58,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953615542] [2023-08-31 23:28:58,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:28:58,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:28:58,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:28:58,676 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:28:58,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:28:58,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953615542] [2023-08-31 23:28:58,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953615542] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:28:58,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:28:58,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:28:58,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514806985] [2023-08-31 23:28:58,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:28:58,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 23:28:58,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:28:58,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 23:28:58,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-31 23:28:58,868 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 233 [2023-08-31 23:28:58,869 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 39 transitions, 355 flow. Second operand has 8 states, 8 states have (on average 87.5) internal successors, (700), 8 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:58,869 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:28:58,869 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 233 [2023-08-31 23:28:58,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:28:59,451 INFO L130 PetriNetUnfolder]: 2134/3460 cut-off events. [2023-08-31 23:28:59,451 INFO L131 PetriNetUnfolder]: For 12896/12957 co-relation queries the response was YES. [2023-08-31 23:28:59,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12635 conditions, 3460 events. 2134/3460 cut-off events. For 12896/12957 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 19493 event pairs, 1260 based on Foata normal form. 156/3571 useless extension candidates. Maximal degree in co-relation 12617. Up to 1623 conditions per place. [2023-08-31 23:28:59,473 INFO L137 encePairwiseOnDemand]: 224/233 looper letters, 57 selfloop transitions, 16 changer transitions 21/103 dead transitions. [2023-08-31 23:28:59,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 103 transitions, 1062 flow [2023-08-31 23:28:59,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:28:59,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:28:59,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 752 transitions. [2023-08-31 23:28:59,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4034334763948498 [2023-08-31 23:28:59,476 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 752 transitions. [2023-08-31 23:28:59,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 752 transitions. [2023-08-31 23:28:59,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:28:59,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 752 transitions. [2023-08-31 23:28:59,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 94.0) internal successors, (752), 8 states have internal predecessors, (752), 0 states have call successors, (0), 0 states 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:28:59,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 233.0) internal successors, (2097), 9 states have internal predecessors, (2097), 0 states have call successors, (0), 0 states 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:28:59,481 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 233.0) internal successors, (2097), 9 states have internal predecessors, (2097), 0 states have call successors, (0), 0 states 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:28:59,481 INFO L175 Difference]: Start difference. First operand has 57 places, 39 transitions, 355 flow. Second operand 8 states and 752 transitions. [2023-08-31 23:28:59,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 103 transitions, 1062 flow [2023-08-31 23:28:59,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 103 transitions, 1042 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:28:59,498 INFO L231 Difference]: Finished difference. Result has 69 places, 55 transitions, 534 flow [2023-08-31 23:28:59,499 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=534, PETRI_PLACES=69, PETRI_TRANSITIONS=55} [2023-08-31 23:28:59,499 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 29 predicate places. [2023-08-31 23:28:59,499 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 55 transitions, 534 flow [2023-08-31 23:28:59,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 87.5) internal successors, (700), 8 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:59,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:28:59,500 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:28:59,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-31 23:28:59,500 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:28:59,501 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:28:59,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1732520826, now seen corresponding path program 1 times [2023-08-31 23:28:59,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:28:59,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453487123] [2023-08-31 23:28:59,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:28:59,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:28:59,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:28:59,656 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:28:59,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:28:59,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453487123] [2023-08-31 23:28:59,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453487123] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:28:59,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:28:59,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:28:59,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409404279] [2023-08-31 23:28:59,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:28:59,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:28:59,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:28:59,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:28:59,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:28:59,668 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 233 [2023-08-31 23:28:59,669 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 55 transitions, 534 flow. Second operand has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:28:59,669 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:28:59,669 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 233 [2023-08-31 23:28:59,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:29:00,057 INFO L130 PetriNetUnfolder]: 1469/2550 cut-off events. [2023-08-31 23:29:00,058 INFO L131 PetriNetUnfolder]: For 11925/11987 co-relation queries the response was YES. [2023-08-31 23:29:00,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9964 conditions, 2550 events. 1469/2550 cut-off events. For 11925/11987 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 15314 event pairs, 275 based on Foata normal form. 288/2829 useless extension candidates. Maximal degree in co-relation 9939. Up to 1682 conditions per place. [2023-08-31 23:29:00,076 INFO L137 encePairwiseOnDemand]: 227/233 looper letters, 82 selfloop transitions, 7 changer transitions 14/112 dead transitions. [2023-08-31 23:29:00,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 112 transitions, 1225 flow [2023-08-31 23:29:00,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:29:00,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:29:00,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 554 transitions. [2023-08-31 23:29:00,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4755364806866953 [2023-08-31 23:29:00,078 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 554 transitions. [2023-08-31 23:29:00,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 554 transitions. [2023-08-31 23:29:00,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:29:00,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 554 transitions. [2023-08-31 23:29:00,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 0 states have call successors, (0), 0 states 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:29:00,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states 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:29:00,082 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states 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:29:00,082 INFO L175 Difference]: Start difference. First operand has 69 places, 55 transitions, 534 flow. Second operand 5 states and 554 transitions. [2023-08-31 23:29:00,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 112 transitions, 1225 flow [2023-08-31 23:29:00,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 112 transitions, 1223 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-31 23:29:00,096 INFO L231 Difference]: Finished difference. Result has 74 places, 61 transitions, 586 flow [2023-08-31 23:29:00,096 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=586, PETRI_PLACES=74, PETRI_TRANSITIONS=61} [2023-08-31 23:29:00,097 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 34 predicate places. [2023-08-31 23:29:00,097 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 61 transitions, 586 flow [2023-08-31 23:29:00,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:00,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:29:00,097 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:29:00,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-31 23:29:00,098 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:29:00,098 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:29:00,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1957898809, now seen corresponding path program 1 times [2023-08-31 23:29:00,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:29:00,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996916289] [2023-08-31 23:29:00,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:29:00,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:29:00,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:29:00,301 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:29:00,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:29:00,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996916289] [2023-08-31 23:29:00,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996916289] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:29:00,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:29:00,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:29:00,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499061764] [2023-08-31 23:29:00,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:29:00,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:29:00,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:29:00,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:29:00,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:29:00,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 233 [2023-08-31 23:29:00,315 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 61 transitions, 586 flow. Second operand has 5 states, 5 states have (on average 102.8) internal successors, (514), 5 states have internal predecessors, (514), 0 states have call successors, (0), 0 states 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:29:00,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:29:00,316 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 233 [2023-08-31 23:29:00,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:29:00,644 INFO L130 PetriNetUnfolder]: 990/1849 cut-off events. [2023-08-31 23:29:00,644 INFO L131 PetriNetUnfolder]: For 8613/8644 co-relation queries the response was YES. [2023-08-31 23:29:00,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8658 conditions, 1849 events. 990/1849 cut-off events. For 8613/8644 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 11388 event pairs, 88 based on Foata normal form. 167/2007 useless extension candidates. Maximal degree in co-relation 8630. Up to 668 conditions per place. [2023-08-31 23:29:00,656 INFO L137 encePairwiseOnDemand]: 227/233 looper letters, 90 selfloop transitions, 13 changer transitions 23/135 dead transitions. [2023-08-31 23:29:00,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 135 transitions, 1496 flow [2023-08-31 23:29:00,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:29:00,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:29:00,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 772 transitions. [2023-08-31 23:29:00,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4733292458614347 [2023-08-31 23:29:00,660 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 772 transitions. [2023-08-31 23:29:00,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 772 transitions. [2023-08-31 23:29:00,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:29:00,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 772 transitions. [2023-08-31 23:29:00,662 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 110.28571428571429) internal successors, (772), 7 states have internal predecessors, (772), 0 states have call successors, (0), 0 states 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:29:00,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states 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:29:00,665 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states 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:29:00,665 INFO L175 Difference]: Start difference. First operand has 74 places, 61 transitions, 586 flow. Second operand 7 states and 772 transitions. [2023-08-31 23:29:00,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 135 transitions, 1496 flow [2023-08-31 23:29:00,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 135 transitions, 1485 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-31 23:29:00,679 INFO L231 Difference]: Finished difference. Result has 81 places, 67 transitions, 663 flow [2023-08-31 23:29:00,680 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=663, PETRI_PLACES=81, PETRI_TRANSITIONS=67} [2023-08-31 23:29:00,682 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 41 predicate places. [2023-08-31 23:29:00,682 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 67 transitions, 663 flow [2023-08-31 23:29:00,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.8) internal successors, (514), 5 states have internal predecessors, (514), 0 states have call successors, (0), 0 states 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:29:00,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:29:00,682 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:29:00,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-31 23:29:00,683 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:29:00,683 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:29:00,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1881013081, now seen corresponding path program 1 times [2023-08-31 23:29:00,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:29:00,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004293589] [2023-08-31 23:29:00,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:29:00,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:29:00,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:29:00,897 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:29:00,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:29:00,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004293589] [2023-08-31 23:29:00,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004293589] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:29:00,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:29:00,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:29:00,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491430718] [2023-08-31 23:29:00,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:29:00,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:29:00,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:29:00,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:29:00,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:29:00,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 233 [2023-08-31 23:29:00,913 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 67 transitions, 663 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:29:00,913 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:29:00,913 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 233 [2023-08-31 23:29:00,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:29:01,273 INFO L130 PetriNetUnfolder]: 1249/2300 cut-off events. [2023-08-31 23:29:01,273 INFO L131 PetriNetUnfolder]: For 12825/12825 co-relation queries the response was YES. [2023-08-31 23:29:01,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12448 conditions, 2300 events. 1249/2300 cut-off events. For 12825/12825 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 13730 event pairs, 346 based on Foata normal form. 14/2314 useless extension candidates. Maximal degree in co-relation 12418. Up to 1016 conditions per place. [2023-08-31 23:29:01,290 INFO L137 encePairwiseOnDemand]: 225/233 looper letters, 85 selfloop transitions, 13 changer transitions 30/128 dead transitions. [2023-08-31 23:29:01,290 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 128 transitions, 1415 flow [2023-08-31 23:29:01,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:29:01,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:29:01,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 539 transitions. [2023-08-31 23:29:01,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46266094420600856 [2023-08-31 23:29:01,292 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 539 transitions. [2023-08-31 23:29:01,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 539 transitions. [2023-08-31 23:29:01,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:29:01,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 539 transitions. [2023-08-31 23:29:01,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 0 states have call successors, (0), 0 states 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:29:01,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states 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:29:01,296 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states 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:29:01,296 INFO L175 Difference]: Start difference. First operand has 81 places, 67 transitions, 663 flow. Second operand 5 states and 539 transitions. [2023-08-31 23:29:01,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 128 transitions, 1415 flow [2023-08-31 23:29:01,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 128 transitions, 1326 flow, removed 32 selfloop flow, removed 2 redundant places. [2023-08-31 23:29:01,335 INFO L231 Difference]: Finished difference. Result has 86 places, 62 transitions, 665 flow [2023-08-31 23:29:01,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=633, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=665, PETRI_PLACES=86, PETRI_TRANSITIONS=62} [2023-08-31 23:29:01,337 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 46 predicate places. [2023-08-31 23:29:01,337 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 62 transitions, 665 flow [2023-08-31 23:29:01,338 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:29:01,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:29:01,338 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:29:01,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-31 23:29:01,338 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:29:01,339 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:29:01,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1727502805, now seen corresponding path program 1 times [2023-08-31 23:29:01,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:29:01,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583049846] [2023-08-31 23:29:01,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:29:01,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:29:01,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:29:01,998 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:29:01,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:29:01,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583049846] [2023-08-31 23:29:01,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583049846] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:29:01,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:29:01,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-31 23:29:02,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223986806] [2023-08-31 23:29:02,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:29:02,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 23:29:02,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:29:02,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 23:29:02,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-08-31 23:29:02,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 233 [2023-08-31 23:29:02,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 62 transitions, 665 flow. Second operand has 9 states, 9 states have (on average 85.88888888888889) internal successors, (773), 9 states have internal predecessors, (773), 0 states have call successors, (0), 0 states 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:29:02,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:29:02,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 233 [2023-08-31 23:29:02,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:29:02,672 INFO L130 PetriNetUnfolder]: 634/1303 cut-off events. [2023-08-31 23:29:02,672 INFO L131 PetriNetUnfolder]: For 8117/8127 co-relation queries the response was YES. [2023-08-31 23:29:02,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6806 conditions, 1303 events. 634/1303 cut-off events. For 8117/8127 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 7502 event pairs, 340 based on Foata normal form. 15/1306 useless extension candidates. Maximal degree in co-relation 6773. Up to 605 conditions per place. [2023-08-31 23:29:02,683 INFO L137 encePairwiseOnDemand]: 224/233 looper letters, 66 selfloop transitions, 15 changer transitions 25/115 dead transitions. [2023-08-31 23:29:02,683 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 115 transitions, 1414 flow [2023-08-31 23:29:02,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:29:02,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:29:02,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 731 transitions. [2023-08-31 23:29:02,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39216738197424894 [2023-08-31 23:29:02,686 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 731 transitions. [2023-08-31 23:29:02,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 731 transitions. [2023-08-31 23:29:02,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:29:02,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 731 transitions. [2023-08-31 23:29:02,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 91.375) internal successors, (731), 8 states have internal predecessors, (731), 0 states have call successors, (0), 0 states 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:29:02,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 233.0) internal successors, (2097), 9 states have internal predecessors, (2097), 0 states have call successors, (0), 0 states 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:29:02,691 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 233.0) internal successors, (2097), 9 states have internal predecessors, (2097), 0 states have call successors, (0), 0 states 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:29:02,691 INFO L175 Difference]: Start difference. First operand has 86 places, 62 transitions, 665 flow. Second operand 8 states and 731 transitions. [2023-08-31 23:29:02,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 115 transitions, 1414 flow [2023-08-31 23:29:02,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 115 transitions, 1387 flow, removed 11 selfloop flow, removed 4 redundant places. [2023-08-31 23:29:02,711 INFO L231 Difference]: Finished difference. Result has 90 places, 64 transitions, 732 flow [2023-08-31 23:29:02,712 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=732, PETRI_PLACES=90, PETRI_TRANSITIONS=64} [2023-08-31 23:29:02,712 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 50 predicate places. [2023-08-31 23:29:02,712 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 64 transitions, 732 flow [2023-08-31 23:29:02,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 85.88888888888889) internal successors, (773), 9 states have internal predecessors, (773), 0 states have call successors, (0), 0 states 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:29:02,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:29:02,713 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:29:02,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-31 23:29:02,713 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:29:02,714 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:29:02,714 INFO L85 PathProgramCache]: Analyzing trace with hash -788134331, now seen corresponding path program 2 times [2023-08-31 23:29:02,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:29:02,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608620937] [2023-08-31 23:29:02,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:29:02,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:29:02,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:29:03,765 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:29:03,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:29:03,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608620937] [2023-08-31 23:29:03,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608620937] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:29:03,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:29:03,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-31 23:29:03,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796822099] [2023-08-31 23:29:03,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:29:03,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-31 23:29:03,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:29:03,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-31 23:29:03,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-08-31 23:29:04,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 233 [2023-08-31 23:29:04,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 64 transitions, 732 flow. Second operand has 10 states, 10 states have (on average 89.7) internal successors, (897), 10 states have internal predecessors, (897), 0 states have call successors, (0), 0 states 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:29:04,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:29:04,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 233 [2023-08-31 23:29:04,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:29:04,586 INFO L130 PetriNetUnfolder]: 835/1733 cut-off events. [2023-08-31 23:29:04,586 INFO L131 PetriNetUnfolder]: For 11333/11355 co-relation queries the response was YES. [2023-08-31 23:29:04,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9312 conditions, 1733 events. 835/1733 cut-off events. For 11333/11355 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 11094 event pairs, 403 based on Foata normal form. 42/1758 useless extension candidates. Maximal degree in co-relation 9276. Up to 842 conditions per place. [2023-08-31 23:29:04,600 INFO L137 encePairwiseOnDemand]: 225/233 looper letters, 71 selfloop transitions, 13 changer transitions 43/133 dead transitions. [2023-08-31 23:29:04,600 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 133 transitions, 1669 flow [2023-08-31 23:29:04,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 23:29:04,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 23:29:04,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 860 transitions. [2023-08-31 23:29:04,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4101096804959466 [2023-08-31 23:29:04,604 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 860 transitions. [2023-08-31 23:29:04,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 860 transitions. [2023-08-31 23:29:04,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:29:04,604 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 860 transitions. [2023-08-31 23:29:04,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 95.55555555555556) internal successors, (860), 9 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:04,609 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 233.0) internal successors, (2330), 10 states have internal predecessors, (2330), 0 states have call successors, (0), 0 states 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:29:04,609 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 233.0) internal successors, (2330), 10 states have internal predecessors, (2330), 0 states have call successors, (0), 0 states 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:29:04,609 INFO L175 Difference]: Start difference. First operand has 90 places, 64 transitions, 732 flow. Second operand 9 states and 860 transitions. [2023-08-31 23:29:04,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 133 transitions, 1669 flow [2023-08-31 23:29:04,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 133 transitions, 1617 flow, removed 15 selfloop flow, removed 6 redundant places. [2023-08-31 23:29:04,632 INFO L231 Difference]: Finished difference. Result has 94 places, 53 transitions, 594 flow [2023-08-31 23:29:04,633 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=594, PETRI_PLACES=94, PETRI_TRANSITIONS=53} [2023-08-31 23:29:04,633 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 54 predicate places. [2023-08-31 23:29:04,633 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 53 transitions, 594 flow [2023-08-31 23:29:04,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 89.7) internal successors, (897), 10 states have internal predecessors, (897), 0 states have call successors, (0), 0 states 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:29:04,634 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:29:04,634 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:29:04,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-31 23:29:04,634 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:29:04,634 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:29:04,635 INFO L85 PathProgramCache]: Analyzing trace with hash 709597443, now seen corresponding path program 3 times [2023-08-31 23:29:04,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:29:04,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960657444] [2023-08-31 23:29:04,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:29:04,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:29:04,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:29:04,920 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:29:04,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:29:04,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960657444] [2023-08-31 23:29:04,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960657444] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:29:04,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:29:04,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:29:04,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796648594] [2023-08-31 23:29:04,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:29:04,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:29:04,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:29:04,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:29:04,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:29:05,036 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 233 [2023-08-31 23:29:05,037 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 53 transitions, 594 flow. Second operand has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:05,037 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:29:05,037 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 233 [2023-08-31 23:29:05,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:29:05,291 INFO L130 PetriNetUnfolder]: 615/1285 cut-off events. [2023-08-31 23:29:05,292 INFO L131 PetriNetUnfolder]: For 7552/7563 co-relation queries the response was YES. [2023-08-31 23:29:05,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6673 conditions, 1285 events. 615/1285 cut-off events. For 7552/7563 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 7772 event pairs, 330 based on Foata normal form. 21/1297 useless extension candidates. Maximal degree in co-relation 6637. Up to 1163 conditions per place. [2023-08-31 23:29:05,301 INFO L137 encePairwiseOnDemand]: 228/233 looper letters, 28 selfloop transitions, 6 changer transitions 26/63 dead transitions. [2023-08-31 23:29:05,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 63 transitions, 792 flow [2023-08-31 23:29:05,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:29:05,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:29:05,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 577 transitions. [2023-08-31 23:29:05,303 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4127324749642346 [2023-08-31 23:29:05,303 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 577 transitions. [2023-08-31 23:29:05,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 577 transitions. [2023-08-31 23:29:05,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:29:05,304 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 577 transitions. [2023-08-31 23:29:05,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 96.16666666666667) internal successors, (577), 6 states have internal predecessors, (577), 0 states have call successors, (0), 0 states 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:29:05,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states 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:29:05,309 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 233.0) internal successors, (1631), 7 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states 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:29:05,309 INFO L175 Difference]: Start difference. First operand has 94 places, 53 transitions, 594 flow. Second operand 6 states and 577 transitions. [2023-08-31 23:29:05,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 63 transitions, 792 flow [2023-08-31 23:29:05,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 63 transitions, 701 flow, removed 10 selfloop flow, removed 14 redundant places. [2023-08-31 23:29:05,324 INFO L231 Difference]: Finished difference. Result has 83 places, 36 transitions, 292 flow [2023-08-31 23:29:05,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=292, PETRI_PLACES=83, PETRI_TRANSITIONS=36} [2023-08-31 23:29:05,325 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 43 predicate places. [2023-08-31 23:29:05,325 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 36 transitions, 292 flow [2023-08-31 23:29:05,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:05,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:29:05,326 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:29:05,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-31 23:29:05,326 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:29:05,327 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:29:05,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1394314709, now seen corresponding path program 2 times [2023-08-31 23:29:05,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:29:05,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932425399] [2023-08-31 23:29:05,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:29:05,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:29:05,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:29:05,869 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:29:05,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:29:05,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932425399] [2023-08-31 23:29:05,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932425399] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:29:05,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:29:05,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:29:05,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360828338] [2023-08-31 23:29:05,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:29:05,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:29:05,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:29:05,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:29:05,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:29:05,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 233 [2023-08-31 23:29:05,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 36 transitions, 292 flow. Second operand has 7 states, 7 states have (on average 101.28571428571429) internal successors, (709), 7 states have internal predecessors, (709), 0 states have call successors, (0), 0 states 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:29:05,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:29:05,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 233 [2023-08-31 23:29:05,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:29:06,088 INFO L130 PetriNetUnfolder]: 214/469 cut-off events. [2023-08-31 23:29:06,088 INFO L131 PetriNetUnfolder]: For 1832/1836 co-relation queries the response was YES. [2023-08-31 23:29:06,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2162 conditions, 469 events. 214/469 cut-off events. For 1832/1836 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2264 event pairs, 24 based on Foata normal form. 17/486 useless extension candidates. Maximal degree in co-relation 2131. Up to 265 conditions per place. [2023-08-31 23:29:06,092 INFO L137 encePairwiseOnDemand]: 227/233 looper letters, 40 selfloop transitions, 9 changer transitions 20/72 dead transitions. [2023-08-31 23:29:06,092 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 72 transitions, 655 flow [2023-08-31 23:29:06,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:29:06,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:29:06,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 740 transitions. [2023-08-31 23:29:06,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4537093807480074 [2023-08-31 23:29:06,094 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 740 transitions. [2023-08-31 23:29:06,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 740 transitions. [2023-08-31 23:29:06,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:29:06,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 740 transitions. [2023-08-31 23:29:06,096 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:29:06,099 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states 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:29:06,099 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states 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:29:06,099 INFO L175 Difference]: Start difference. First operand has 83 places, 36 transitions, 292 flow. Second operand 7 states and 740 transitions. [2023-08-31 23:29:06,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 72 transitions, 655 flow [2023-08-31 23:29:06,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 72 transitions, 555 flow, removed 18 selfloop flow, removed 22 redundant places. [2023-08-31 23:29:06,103 INFO L231 Difference]: Finished difference. Result has 65 places, 38 transitions, 268 flow [2023-08-31 23:29:06,103 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=268, PETRI_PLACES=65, PETRI_TRANSITIONS=38} [2023-08-31 23:29:06,104 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 25 predicate places. [2023-08-31 23:29:06,104 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 38 transitions, 268 flow [2023-08-31 23:29:06,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 101.28571428571429) internal successors, (709), 7 states have internal predecessors, (709), 0 states have call successors, (0), 0 states 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:29:06,104 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:29:06,105 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:29:06,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-31 23:29:06,105 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:29:06,105 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:29:06,105 INFO L85 PathProgramCache]: Analyzing trace with hash 2145041145, now seen corresponding path program 1 times [2023-08-31 23:29:06,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:29:06,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835421556] [2023-08-31 23:29:06,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:29:06,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:29:06,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:29:06,301 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:29:06,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:29:06,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835421556] [2023-08-31 23:29:06,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835421556] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:29:06,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:29:06,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:29:06,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13099110] [2023-08-31 23:29:06,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:29:06,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:29:06,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:29:06,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:29:06,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:29:06,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 233 [2023-08-31 23:29:06,316 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 38 transitions, 268 flow. Second operand has 6 states, 6 states have (on average 102.66666666666667) internal successors, (616), 6 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:06,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:29:06,317 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 233 [2023-08-31 23:29:06,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:29:06,429 INFO L130 PetriNetUnfolder]: 122/278 cut-off events. [2023-08-31 23:29:06,430 INFO L131 PetriNetUnfolder]: For 635/637 co-relation queries the response was YES. [2023-08-31 23:29:06,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1250 conditions, 278 events. 122/278 cut-off events. For 635/637 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1109 event pairs, 14 based on Foata normal form. 22/298 useless extension candidates. Maximal degree in co-relation 1229. Up to 96 conditions per place. [2023-08-31 23:29:06,432 INFO L137 encePairwiseOnDemand]: 227/233 looper letters, 40 selfloop transitions, 10 changer transitions 9/62 dead transitions. [2023-08-31 23:29:06,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 62 transitions, 560 flow [2023-08-31 23:29:06,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:29:06,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:29:06,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 745 transitions. [2023-08-31 23:29:06,436 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45677498467198036 [2023-08-31 23:29:06,436 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 745 transitions. [2023-08-31 23:29:06,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 745 transitions. [2023-08-31 23:29:06,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:29:06,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 745 transitions. [2023-08-31 23:29:06,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 106.42857142857143) internal successors, (745), 7 states have internal predecessors, (745), 0 states have call successors, (0), 0 states 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:29:06,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states 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:29:06,442 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 233.0) internal successors, (1864), 8 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states 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:29:06,442 INFO L175 Difference]: Start difference. First operand has 65 places, 38 transitions, 268 flow. Second operand 7 states and 745 transitions. [2023-08-31 23:29:06,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 62 transitions, 560 flow [2023-08-31 23:29:06,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 62 transitions, 479 flow, removed 31 selfloop flow, removed 6 redundant places. [2023-08-31 23:29:06,445 INFO L231 Difference]: Finished difference. Result has 66 places, 38 transitions, 263 flow [2023-08-31 23:29:06,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=233, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=263, PETRI_PLACES=66, PETRI_TRANSITIONS=38} [2023-08-31 23:29:06,446 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 26 predicate places. [2023-08-31 23:29:06,446 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 38 transitions, 263 flow [2023-08-31 23:29:06,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.66666666666667) internal successors, (616), 6 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:06,446 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:29:06,446 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:29:06,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-31 23:29:06,447 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-08-31 23:29:06,447 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:29:06,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1814091829, now seen corresponding path program 1 times [2023-08-31 23:29:06,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:29:06,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973492271] [2023-08-31 23:29:06,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:29:06,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:29:06,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:29:06,484 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:29:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:29:06,543 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-31 23:29:06,544 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:29:06,545 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-31 23:29:06,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-31 23:29:06,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-31 23:29:06,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-31 23:29:06,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-31 23:29:06,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-31 23:29:06,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-31 23:29:06,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-31 23:29:06,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-31 23:29:06,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-31 23:29:06,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-31 23:29:06,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-31 23:29:06,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-31 23:29:06,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-31 23:29:06,549 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:29:06,553 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:29:06,554 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:29:06,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:29:06 BasicIcfg [2023-08-31 23:29:06,614 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:29:06,615 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:29:06,615 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:29:06,615 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:29:06,616 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:28:48" (3/4) ... [2023-08-31 23:29:06,618 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:29:06,618 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:29:06,618 INFO L158 Benchmark]: Toolchain (without parser) took 19901.92ms. Allocated memory was 77.6MB in the beginning and 507.5MB in the end (delta: 429.9MB). Free memory was 52.9MB in the beginning and 191.4MB in the end (delta: -138.4MB). Peak memory consumption was 292.4MB. Max. memory is 16.1GB. [2023-08-31 23:29:06,618 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 58.7MB. Free memory is still 36.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:29:06,619 INFO L158 Benchmark]: CACSL2BoogieTranslator took 568.54ms. Allocated memory is still 77.6MB. Free memory was 52.8MB in the beginning and 49.6MB in the end (delta: 3.3MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2023-08-31 23:29:06,619 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.74ms. Allocated memory is still 77.6MB. Free memory was 49.6MB in the beginning and 47.1MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-31 23:29:06,619 INFO L158 Benchmark]: Boogie Preprocessor took 39.27ms. Allocated memory is still 77.6MB. Free memory was 47.1MB in the beginning and 45.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:29:06,619 INFO L158 Benchmark]: RCFGBuilder took 676.59ms. Allocated memory is still 77.6MB. Free memory was 45.3MB in the beginning and 34.9MB in the end (delta: 10.4MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2023-08-31 23:29:06,620 INFO L158 Benchmark]: TraceAbstraction took 18551.60ms. Allocated memory was 77.6MB in the beginning and 507.5MB in the end (delta: 429.9MB). Free memory was 34.0MB in the beginning and 191.4MB in the end (delta: -157.4MB). Peak memory consumption was 271.9MB. Max. memory is 16.1GB. [2023-08-31 23:29:06,620 INFO L158 Benchmark]: Witness Printer took 2.77ms. Allocated memory is still 507.5MB. Free memory is still 191.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:29:06,621 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.19ms. Allocated memory is still 58.7MB. Free memory is still 36.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 568.54ms. Allocated memory is still 77.6MB. Free memory was 52.8MB in the beginning and 49.6MB in the end (delta: 3.3MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.74ms. Allocated memory is still 77.6MB. Free memory was 49.6MB in the beginning and 47.1MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.27ms. Allocated memory is still 77.6MB. Free memory was 47.1MB in the beginning and 45.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 676.59ms. Allocated memory is still 77.6MB. Free memory was 45.3MB in the beginning and 34.9MB in the end (delta: 10.4MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. * TraceAbstraction took 18551.60ms. Allocated memory was 77.6MB in the beginning and 507.5MB in the end (delta: 429.9MB). Free memory was 34.0MB in the beginning and 191.4MB in the end (delta: -157.4MB). Peak memory consumption was 271.9MB. Max. memory is 16.1GB. * Witness Printer took 2.77ms. Allocated memory is still 507.5MB. Free memory is still 191.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: 3.6s, 122 PlacesBefore, 40 PlacesAfterwards, 114 TransitionsBefore, 31 TransitionsAfterwards, 1996 CoEnabledTransitionPairs, 6 FixpointIterations, 49 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 116 TotalNumberOfCompositions, 4759 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2404, independent: 2263, independent conditional: 0, independent unconditional: 2263, dependent: 141, dependent conditional: 0, dependent unconditional: 141, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1112, independent: 1071, independent conditional: 0, independent unconditional: 1071, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2404, independent: 1192, independent conditional: 0, independent unconditional: 1192, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 1112, unknown conditional: 0, unknown unconditional: 1112] , Statistics on independence cache: Total cache size (in pairs): 110, Positive cache size: 93, Positive conditional cache size: 0, Positive unconditional cache size: 93, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 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_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 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; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L829] 0 pthread_t t1828; [L830] FCALL, FORK 0 pthread_create(&t1828, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1828, ((void *)0), P0, ((void *)0))=-2, t1828={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] [L831] 0 pthread_t t1829; [L832] FCALL, FORK 0 pthread_create(&t1829, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1829, ((void *)0), P1, ((void *)0))=-1, t1828={5:0}, t1829={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] [L833] 0 pthread_t t1830; [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 1 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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] [L784] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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] [L834] FCALL, FORK 0 pthread_create(&t1830, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1830, ((void *)0), P2, ((void *)0))=0, t1828={5:0}, t1829={6:0}, t1830={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L801] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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] [L804] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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=2] [L744] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 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) [L752] 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)) [L753] 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)) [L754] 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)) [L755] 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)) [L756] 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)) [L757] 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)) [L758] 1 __unbuffered_p0_EBX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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=2] [L787] 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) [L788] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] 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 [L790] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] 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=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$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=2] [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 2 return 0; [L807] 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) [L808] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] 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 [L810] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] 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=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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=2] [L814] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L816] 3 return 0; [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 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) [L841] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L842] 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 [L843] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L844] 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=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1828={5:0}, t1829={6:0}, t1830={3: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=2] [L847] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L849] 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=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=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=2] - 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: 827]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 832]: 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: 830]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 143 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 18.4s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1334 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1021 mSDsluCounter, 524 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 447 mSDsCounter, 180 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4389 IncrementalHoareTripleChecker+Invalid, 4569 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 180 mSolverCounterUnsat, 77 mSDtfsCounter, 4389 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=732occurred in iteration=14, InterpolantAutomatonStates: 102, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 254 NumberOfCodeBlocks, 254 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 216 ConstructedInterpolants, 0 QuantifiedInterpolants, 3025 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-31 23:29:06,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_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 390a12f9f7a5c311c1cdcecac54987f654ebac30db2fbb7661324a5599d93cf6 --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:29:08,635 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:29:08,638 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:29:08,679 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:29:08,681 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:29:08,684 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:29:08,686 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:29:08,688 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:29:08,690 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:29:08,695 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:29:08,696 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:29:08,698 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:29:08,698 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:29:08,700 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:29:08,701 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:29:08,705 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:29:08,705 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:29:08,707 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:29:08,708 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:29:08,721 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:29:08,722 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:29:08,723 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:29:08,724 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:29:08,725 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:29:08,728 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:29:08,728 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:29:08,729 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:29:08,730 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:29:08,731 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:29:08,731 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:29:08,732 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:29:08,738 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:29:08,739 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:29:08,740 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:29:08,741 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:29:08,741 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:29:08,742 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:29:08,742 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:29:08,742 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:29:08,743 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:29:08,744 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:29:08,745 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:29:08,779 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:29:08,780 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:29:08,781 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:29:08,781 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:29:08,782 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:29:08,782 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:29:08,783 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:29:08,783 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:29:08,783 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:29:08,783 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:29:08,784 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:29:08,784 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:29:08,784 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:29:08,785 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:29:08,785 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:29:08,785 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:29:08,785 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:29:08,785 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:29:08,785 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:29:08,786 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:29:08,786 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-31 23:29:08,786 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-31 23:29:08,786 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:29:08,786 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:29:08,787 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:29:08,787 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:29:08,787 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:29:08,787 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:29:08,787 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:29:08,788 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:29:08,788 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-31 23:29:08,788 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-31 23:29:08,788 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:29:08,789 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:29:08,789 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:29:08,789 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-31 23:29:08,789 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:29:08,789 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 -> 390a12f9f7a5c311c1cdcecac54987f654ebac30db2fbb7661324a5599d93cf6 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:29:09,092 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:29:09,113 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:29:09,115 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:29:09,116 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:29:09,116 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:29:09,118 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2023-08-31 23:29:10,247 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:29:10,501 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:29:10,502 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2023-08-31 23:29:10,514 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dfd416a6/414b2e289f414bca919dc0909d3eca46/FLAG7eb765535 [2023-08-31 23:29:10,529 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dfd416a6/414b2e289f414bca919dc0909d3eca46 [2023-08-31 23:29:10,532 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:29:10,533 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:29:10,534 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:29:10,534 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:29:10,537 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:29:10,537 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:29:10" (1/1) ... [2023-08-31 23:29:10,538 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4956696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:29:10, skipping insertion in model container [2023-08-31 23:29:10,538 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:29:10" (1/1) ... [2023-08-31 23:29:10,544 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:29:10,580 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:29:10,712 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/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i[1019,1032] [2023-08-31 23:29:10,867 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:29:10,886 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:29:10,902 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/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i[1019,1032] [2023-08-31 23:29:10,963 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:29:11,013 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:29:11,013 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:29:11,019 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:29:11,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:29:11 WrapperNode [2023-08-31 23:29:11,020 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:29:11,021 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:29:11,021 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:29:11,021 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:29:11,028 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:29:11" (1/1) ... [2023-08-31 23:29:11,063 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:29:11" (1/1) ... [2023-08-31 23:29:11,100 INFO L138 Inliner]: procedures = 179, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2023-08-31 23:29:11,100 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:29:11,102 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:29:11,102 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:29:11,102 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:29:11,109 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:29:11" (1/1) ... [2023-08-31 23:29:11,110 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:29:11" (1/1) ... [2023-08-31 23:29:11,122 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:29:11" (1/1) ... [2023-08-31 23:29:11,123 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:29:11" (1/1) ... [2023-08-31 23:29:11,134 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:29:11" (1/1) ... [2023-08-31 23:29:11,145 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:29:11" (1/1) ... [2023-08-31 23:29:11,148 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:29:11" (1/1) ... [2023-08-31 23:29:11,155 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:29:11" (1/1) ... [2023-08-31 23:29:11,159 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:29:11,162 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:29:11,162 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:29:11,162 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:29:11,163 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:29:11" (1/1) ... [2023-08-31 23:29:11,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:29:11,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:29:11,198 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:29:11,221 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:29:11,239 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:29:11,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:29:11,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:29:11,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:29:11,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-31 23:29:11,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-31 23:29:11,240 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:29:11,240 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:29:11,240 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:29:11,241 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:29:11,241 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:29:11,241 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:29:11,241 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:29:11,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:29:11,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:29:11,243 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:29:11,386 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:29:11,388 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:29:11,826 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:29:11,955 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:29:11,955 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:29:11,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:29:11 BoogieIcfgContainer [2023-08-31 23:29:11,957 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:29:11,959 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:29:11,959 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:29:11,961 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:29:11,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:29:10" (1/3) ... [2023-08-31 23:29:11,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71b346a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:29:11, skipping insertion in model container [2023-08-31 23:29:11,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:29:11" (2/3) ... [2023-08-31 23:29:11,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71b346a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:29:11, skipping insertion in model container [2023-08-31 23:29:11,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:29:11" (3/3) ... [2023-08-31 23:29:11,964 INFO L112 eAbstractionObserver]: Analyzing ICFG safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2023-08-31 23:29:11,979 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:29:11,980 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-31 23:29:11,980 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:29:12,057 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:29:12,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 118 transitions, 251 flow [2023-08-31 23:29:12,156 INFO L130 PetriNetUnfolder]: 2/115 cut-off events. [2023-08-31 23:29:12,156 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:29:12,161 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 79 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:29:12,162 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 118 transitions, 251 flow [2023-08-31 23:29:12,165 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 115 transitions, 239 flow [2023-08-31 23:29:12,169 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:29:12,185 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 115 transitions, 239 flow [2023-08-31 23:29:12,189 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 115 transitions, 239 flow [2023-08-31 23:29:12,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 239 flow [2023-08-31 23:29:12,227 INFO L130 PetriNetUnfolder]: 2/115 cut-off events. [2023-08-31 23:29:12,228 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:29:12,233 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 79 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:29:12,236 INFO L119 LiptonReduction]: Number of co-enabled transitions 1996 [2023-08-31 23:29:18,089 INFO L134 LiptonReduction]: Checked pairs total: 4791 [2023-08-31 23:29:18,090 INFO L136 LiptonReduction]: Total number of compositions: 113 [2023-08-31 23:29:18,102 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:29:18,108 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;@72766cb3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:29:18,108 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-31 23:29:18,110 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:29:18,110 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:29:18,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:29:18,111 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:29:18,111 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:29:18,115 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:29:18,116 INFO L85 PathProgramCache]: Analyzing trace with hash 505, now seen corresponding path program 1 times [2023-08-31 23:29:18,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:29:18,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [297765721] [2023-08-31 23:29:18,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:29:18,127 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:29:18,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:29:18,131 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:29:18,132 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:29:18,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:29:18,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-31 23:29:18,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:29:18,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:29:18,200 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:29:18,201 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:29:18,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [297765721] [2023-08-31 23:29:18,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [297765721] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:29:18,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:29:18,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:29:18,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691701841] [2023-08-31 23:29:18,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:29:18,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:29:18,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:29:18,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:29:18,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:29:18,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 231 [2023-08-31 23:29:18,236 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:29:18,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:29:18,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 231 [2023-08-31 23:29:18,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:29:18,646 INFO L130 PetriNetUnfolder]: 1093/1718 cut-off events. [2023-08-31 23:29:18,646 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-08-31 23:29:18,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3395 conditions, 1718 events. 1093/1718 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 8355 event pairs, 1093 based on Foata normal form. 0/1506 useless extension candidates. Maximal degree in co-relation 3384. Up to 1623 conditions per place. [2023-08-31 23:29:18,659 INFO L137 encePairwiseOnDemand]: 224/231 looper letters, 21 selfloop transitions, 0 changer transitions 0/24 dead transitions. [2023-08-31 23:29:18,659 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 24 transitions, 99 flow [2023-08-31 23:29:18,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:29:18,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:29:18,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 240 transitions. [2023-08-31 23:29:18,673 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5194805194805194 [2023-08-31 23:29:18,674 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 240 transitions. [2023-08-31 23:29:18,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 240 transitions. [2023-08-31 23:29:18,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:29:18,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 240 transitions. [2023-08-31 23:29:18,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 120.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 0 states 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:29:18,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:18,690 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:18,692 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 71 flow. Second operand 2 states and 240 transitions. [2023-08-31 23:29:18,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 24 transitions, 99 flow [2023-08-31 23:29:18,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 24 transitions, 96 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:29:18,701 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 54 flow [2023-08-31 23:29:18,702 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, 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:29:18,706 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -8 predicate places. [2023-08-31 23:29:18,707 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 54 flow [2023-08-31 23:29:18,708 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:29:18,708 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:29:18,708 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-31 23:29:18,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-08-31 23:29:18,916 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:29:18,917 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:29:18,918 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:29:18,918 INFO L85 PathProgramCache]: Analyzing trace with hash 479516000, now seen corresponding path program 1 times [2023-08-31 23:29:18,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:29:18,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [920075239] [2023-08-31 23:29:18,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:29:18,919 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:29:18,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:29:18,920 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:29:18,926 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:29:19,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:29:19,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:29:19,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:29:19,040 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:29:19,040 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:29:19,040 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:29:19,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [920075239] [2023-08-31 23:29:19,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [920075239] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:29:19,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:29:19,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:29:19,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412794861] [2023-08-31 23:29:19,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:29:19,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:29:19,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:29:19,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:29:19,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:29:19,050 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 231 [2023-08-31 23:29:19,051 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:29:19,051 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:29:19,052 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 231 [2023-08-31 23:29:19,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:29:19,326 INFO L130 PetriNetUnfolder]: 855/1356 cut-off events. [2023-08-31 23:29:19,326 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:29:19,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2681 conditions, 1356 events. 855/1356 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 6306 event pairs, 237 based on Foata normal form. 0/1288 useless extension candidates. Maximal degree in co-relation 2678. Up to 1027 conditions per place. [2023-08-31 23:29:19,334 INFO L137 encePairwiseOnDemand]: 228/231 looper letters, 29 selfloop transitions, 2 changer transitions 2/36 dead transitions. [2023-08-31 23:29:19,335 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 36 transitions, 146 flow [2023-08-31 23:29:19,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:29:19,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:29:19,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 349 transitions. [2023-08-31 23:29:19,342 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5036075036075036 [2023-08-31 23:29:19,342 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 349 transitions. [2023-08-31 23:29:19,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 349 transitions. [2023-08-31 23:29:19,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:29:19,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 349 transitions. [2023-08-31 23:29:19,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:19,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states 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:29:19,348 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states 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:29:19,348 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 54 flow. Second operand 3 states and 349 transitions. [2023-08-31 23:29:19,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 36 transitions, 146 flow [2023-08-31 23:29:19,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 36 transitions, 146 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:29:19,350 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 54 flow [2023-08-31 23:29:19,350 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, 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:29:19,351 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -7 predicate places. [2023-08-31 23:29:19,351 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 54 flow [2023-08-31 23:29:19,351 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:29:19,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:29:19,352 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:29:19,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-08-31 23:29:19,561 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:29:19,561 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:29:19,562 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:29:19,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1991591211, now seen corresponding path program 1 times [2023-08-31 23:29:19,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:29:19,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [358522509] [2023-08-31 23:29:19,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:29:19,563 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:29:19,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:29:19,565 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:29:19,568 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:29:19,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:29:19,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:29:19,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:29:19,684 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:29:19,685 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:29:19,685 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:29:19,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [358522509] [2023-08-31 23:29:19,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [358522509] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:29:19,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:29:19,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:29:19,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137335400] [2023-08-31 23:29:19,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:29:19,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:29:19,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:29:19,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:29:19,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:29:19,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 231 [2023-08-31 23:29:19,706 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 0 states have call successors, (0), 0 states 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:29:19,706 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:29:19,706 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 231 [2023-08-31 23:29:19,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:29:19,920 INFO L130 PetriNetUnfolder]: 494/853 cut-off events. [2023-08-31 23:29:19,921 INFO L131 PetriNetUnfolder]: For 65/65 co-relation queries the response was YES. [2023-08-31 23:29:19,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1779 conditions, 853 events. 494/853 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4060 event pairs, 102 based on Foata normal form. 64/876 useless extension candidates. Maximal degree in co-relation 1775. Up to 533 conditions per place. [2023-08-31 23:29:19,925 INFO L137 encePairwiseOnDemand]: 225/231 looper letters, 28 selfloop transitions, 4 changer transitions 19/54 dead transitions. [2023-08-31 23:29:19,926 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 54 transitions, 230 flow [2023-08-31 23:29:19,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:29:19,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:29:19,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 543 transitions. [2023-08-31 23:29:19,928 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4701298701298701 [2023-08-31 23:29:19,928 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 543 transitions. [2023-08-31 23:29:19,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 543 transitions. [2023-08-31 23:29:19,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:29:19,929 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 543 transitions. [2023-08-31 23:29:19,930 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.6) internal successors, (543), 5 states have internal predecessors, (543), 0 states have call successors, (0), 0 states 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:29:19,932 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states 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:29:19,933 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states 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:29:19,933 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 54 flow. Second operand 5 states and 543 transitions. [2023-08-31 23:29:19,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 54 transitions, 230 flow [2023-08-31 23:29:19,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 54 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:29:19,935 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 86 flow [2023-08-31 23:29:19,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, 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:29:19,936 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2023-08-31 23:29:19,936 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 86 flow [2023-08-31 23:29:19,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 0 states have call successors, (0), 0 states 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:29:19,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:29:19,937 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:29:19,949 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:29:20,146 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:29:20,146 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:29:20,147 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:29:20,147 INFO L85 PathProgramCache]: Analyzing trace with hash -195887596, now seen corresponding path program 1 times [2023-08-31 23:29:20,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:29:20,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1101324806] [2023-08-31 23:29:20,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:29:20,148 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:29:20,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:29:20,151 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:29:20,153 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:29:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:29:20,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:29:20,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:29:20,269 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:29:20,269 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:29:20,270 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:29:20,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1101324806] [2023-08-31 23:29:20,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1101324806] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:29:20,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:29:20,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:29:20,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268238305] [2023-08-31 23:29:20,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:29:20,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:29:20,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:29:20,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:29:20,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:29:20,294 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 231 [2023-08-31 23:29:20,295 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:20,295 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:29:20,295 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 231 [2023-08-31 23:29:20,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:29:20,507 INFO L130 PetriNetUnfolder]: 224/427 cut-off events. [2023-08-31 23:29:20,507 INFO L131 PetriNetUnfolder]: For 138/138 co-relation queries the response was YES. [2023-08-31 23:29:20,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1138 conditions, 427 events. 224/427 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1781 event pairs, 60 based on Foata normal form. 37/450 useless extension candidates. Maximal degree in co-relation 1131. Up to 137 conditions per place. [2023-08-31 23:29:20,509 INFO L137 encePairwiseOnDemand]: 225/231 looper letters, 36 selfloop transitions, 7 changer transitions 19/65 dead transitions. [2023-08-31 23:29:20,510 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 65 transitions, 334 flow [2023-08-31 23:29:20,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:29:20,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:29:20,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 652 transitions. [2023-08-31 23:29:20,512 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4704184704184704 [2023-08-31 23:29:20,512 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 652 transitions. [2023-08-31 23:29:20,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 652 transitions. [2023-08-31 23:29:20,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:29:20,513 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 652 transitions. [2023-08-31 23:29:20,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 108.66666666666667) internal successors, (652), 6 states have internal predecessors, (652), 0 states have call successors, (0), 0 states 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:29:20,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 231.0) internal successors, (1617), 7 states have internal predecessors, (1617), 0 states have call successors, (0), 0 states 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:29:20,518 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 231.0) internal successors, (1617), 7 states have internal predecessors, (1617), 0 states have call successors, (0), 0 states 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:29:20,518 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 86 flow. Second operand 6 states and 652 transitions. [2023-08-31 23:29:20,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 65 transitions, 334 flow [2023-08-31 23:29:20,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 65 transitions, 328 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-31 23:29:20,521 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 136 flow [2023-08-31 23:29:20,521 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, 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:29:20,522 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2023-08-31 23:29:20,522 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 136 flow [2023-08-31 23:29:20,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:20,522 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:29:20,522 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:29:20,537 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:29:20,732 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:29:20,732 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:29:20,733 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:29:20,733 INFO L85 PathProgramCache]: Analyzing trace with hash -2107610359, now seen corresponding path program 1 times [2023-08-31 23:29:20,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:29:20,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [457927263] [2023-08-31 23:29:20,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:29:20,734 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:29:20,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:29:20,735 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:29:20,738 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:29:20,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:29:20,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:29:20,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:29:20,897 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:29:20,897 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:29:20,897 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:29:20,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [457927263] [2023-08-31 23:29:20,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [457927263] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:29:20,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:29:20,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:29:20,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877518486] [2023-08-31 23:29:20,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:29:20,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:29:20,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:29:20,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:29:20,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:29:20,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 231 [2023-08-31 23:29:20,926 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 136 flow. Second operand has 6 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 0 states have call successors, (0), 0 states 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:29:20,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:29:20,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 231 [2023-08-31 23:29:20,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:29:21,164 INFO L130 PetriNetUnfolder]: 143/275 cut-off events. [2023-08-31 23:29:21,164 INFO L131 PetriNetUnfolder]: For 269/269 co-relation queries the response was YES. [2023-08-31 23:29:21,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 807 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 1007 event pairs, 56 based on Foata normal form. 10/280 useless extension candidates. Maximal degree in co-relation 798. Up to 108 conditions per place. [2023-08-31 23:29:21,166 INFO L137 encePairwiseOnDemand]: 225/231 looper letters, 33 selfloop transitions, 10 changer transitions 10/56 dead transitions. [2023-08-31 23:29:21,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 56 transitions, 332 flow [2023-08-31 23:29:21,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:29:21,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:29:21,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 741 transitions. [2023-08-31 23:29:21,169 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4582560296846011 [2023-08-31 23:29:21,169 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 741 transitions. [2023-08-31 23:29:21,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 741 transitions. [2023-08-31 23:29:21,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:29:21,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 741 transitions. [2023-08-31 23:29:21,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 105.85714285714286) internal successors, (741), 7 states have internal predecessors, (741), 0 states have call successors, (0), 0 states 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:29:21,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 231.0) internal successors, (1848), 8 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states 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:29:21,175 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 231.0) internal successors, (1848), 8 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states 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:29:21,175 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 136 flow. Second operand 7 states and 741 transitions. [2023-08-31 23:29:21,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 56 transitions, 332 flow [2023-08-31 23:29:21,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 56 transitions, 296 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-08-31 23:29:21,179 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 138 flow [2023-08-31 23:29:21,179 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, 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:29:21,180 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2023-08-31 23:29:21,180 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 28 transitions, 138 flow [2023-08-31 23:29:21,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 0 states have call successors, (0), 0 states 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:29:21,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:29:21,181 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:29:21,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-08-31 23:29:21,390 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:29:21,390 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:29:21,391 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:29:21,391 INFO L85 PathProgramCache]: Analyzing trace with hash 112324889, now seen corresponding path program 1 times [2023-08-31 23:29:21,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:29:21,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [273506368] [2023-08-31 23:29:21,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:29:21,391 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:29:21,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:29:21,394 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:29:21,395 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:29:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:29:21,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:29:21,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:29:21,533 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:29:21,533 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:29:21,533 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:29:21,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [273506368] [2023-08-31 23:29:21,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [273506368] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:29:21,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:29:21,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:29:21,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233112596] [2023-08-31 23:29:21,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:29:21,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:29:21,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:29:21,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:29:21,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:29:21,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 231 [2023-08-31 23:29:21,552 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 28 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states 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:29:21,553 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:29:21,553 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 231 [2023-08-31 23:29:21,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:29:21,697 INFO L130 PetriNetUnfolder]: 303/542 cut-off events. [2023-08-31 23:29:21,698 INFO L131 PetriNetUnfolder]: For 585/585 co-relation queries the response was YES. [2023-08-31 23:29:21,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1580 conditions, 542 events. 303/542 cut-off events. For 585/585 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2180 event pairs, 59 based on Foata normal form. 0/541 useless extension candidates. Maximal degree in co-relation 1570. Up to 249 conditions per place. [2023-08-31 23:29:21,700 INFO L137 encePairwiseOnDemand]: 226/231 looper letters, 53 selfloop transitions, 4 changer transitions 0/58 dead transitions. [2023-08-31 23:29:21,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 58 transitions, 394 flow [2023-08-31 23:29:21,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:29:21,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:29:21,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 450 transitions. [2023-08-31 23:29:21,703 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.487012987012987 [2023-08-31 23:29:21,703 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 450 transitions. [2023-08-31 23:29:21,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 450 transitions. [2023-08-31 23:29:21,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:29:21,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 450 transitions. [2023-08-31 23:29:21,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:21,706 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 231.0) internal successors, (1155), 5 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states 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:29:21,706 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 231.0) internal successors, (1155), 5 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states 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:29:21,707 INFO L175 Difference]: Start difference. First operand has 44 places, 28 transitions, 138 flow. Second operand 4 states and 450 transitions. [2023-08-31 23:29:21,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 58 transitions, 394 flow [2023-08-31 23:29:21,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 58 transitions, 318 flow, removed 24 selfloop flow, removed 6 redundant places. [2023-08-31 23:29:21,717 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 128 flow [2023-08-31 23:29:21,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, 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=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2023-08-31 23:29:21,719 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2023-08-31 23:29:21,719 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 128 flow [2023-08-31 23:29:21,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states 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:29:21,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:29:21,720 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:29:21,733 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:29:21,930 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:29:21,930 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:29:21,931 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:29:21,931 INFO L85 PathProgramCache]: Analyzing trace with hash 432757459, now seen corresponding path program 2 times [2023-08-31 23:29:21,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:29:21,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1993276584] [2023-08-31 23:29:21,931 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 23:29:21,931 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:29:21,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:29:21,933 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:29:21,936 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:29:22,032 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:29:22,033 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:29:22,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:29:22,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:29:22,089 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:29:22,090 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:29:22,090 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:29:22,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1993276584] [2023-08-31 23:29:22,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1993276584] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:29:22,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:29:22,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:29:22,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307181467] [2023-08-31 23:29:22,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:29:22,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:29:22,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:29:22,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:29:22,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:29:22,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 231 [2023-08-31 23:29:22,106 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states 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:29:22,106 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:29:22,106 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 231 [2023-08-31 23:29:22,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:29:22,268 INFO L130 PetriNetUnfolder]: 398/729 cut-off events. [2023-08-31 23:29:22,269 INFO L131 PetriNetUnfolder]: For 535/535 co-relation queries the response was YES. [2023-08-31 23:29:22,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2175 conditions, 729 events. 398/729 cut-off events. For 535/535 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3195 event pairs, 126 based on Foata normal form. 1/730 useless extension candidates. Maximal degree in co-relation 2166. Up to 438 conditions per place. [2023-08-31 23:29:22,273 INFO L137 encePairwiseOnDemand]: 226/231 looper letters, 49 selfloop transitions, 4 changer transitions 0/54 dead transitions. [2023-08-31 23:29:22,273 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 54 transitions, 327 flow [2023-08-31 23:29:22,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:29:22,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:29:22,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 446 transitions. [2023-08-31 23:29:22,275 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48268398268398266 [2023-08-31 23:29:22,275 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 446 transitions. [2023-08-31 23:29:22,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 446 transitions. [2023-08-31 23:29:22,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:29:22,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 446 transitions. [2023-08-31 23:29:22,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 0 states 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:29:22,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 231.0) internal successors, (1155), 5 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states 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:29:22,279 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 231.0) internal successors, (1155), 5 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states 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:29:22,279 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 128 flow. Second operand 4 states and 446 transitions. [2023-08-31 23:29:22,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 54 transitions, 327 flow [2023-08-31 23:29:22,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 54 transitions, 324 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:29:22,284 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 143 flow [2023-08-31 23:29:22,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=143, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2023-08-31 23:29:22,286 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2023-08-31 23:29:22,286 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 143 flow [2023-08-31 23:29:22,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states 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:29:22,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:29:22,286 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:29:22,299 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:29:22,496 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:29:22,497 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:29:22,497 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:29:22,497 INFO L85 PathProgramCache]: Analyzing trace with hash 631977517, now seen corresponding path program 3 times [2023-08-31 23:29:22,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:29:22,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1603490412] [2023-08-31 23:29:22,498 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 23:29:22,498 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:29:22,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:29:22,499 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:29:22,501 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:29:22,592 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-31 23:29:22,592 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:29:22,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:29:22,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:29:22,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:29:22,623 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:29:22,623 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:29:22,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1603490412] [2023-08-31 23:29:22,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1603490412] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:29:22,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:29:22,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:29:22,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475027837] [2023-08-31 23:29:22,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:29:22,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:29:22,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:29:22,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:29:22,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:29:22,635 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 231 [2023-08-31 23:29:22,636 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 143 flow. Second operand has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states 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:29:22,636 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:29:22,636 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 231 [2023-08-31 23:29:22,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:29:22,869 INFO L130 PetriNetUnfolder]: 545/1040 cut-off events. [2023-08-31 23:29:22,870 INFO L131 PetriNetUnfolder]: For 918/918 co-relation queries the response was YES. [2023-08-31 23:29:22,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3121 conditions, 1040 events. 545/1040 cut-off events. For 918/918 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 5407 event pairs, 144 based on Foata normal form. 1/1041 useless extension candidates. Maximal degree in co-relation 3111. Up to 463 conditions per place. [2023-08-31 23:29:22,876 INFO L137 encePairwiseOnDemand]: 227/231 looper letters, 78 selfloop transitions, 5 changer transitions 0/84 dead transitions. [2023-08-31 23:29:22,876 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 84 transitions, 532 flow [2023-08-31 23:29:22,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:29:22,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:29:22,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 563 transitions. [2023-08-31 23:29:22,878 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48744588744588746 [2023-08-31 23:29:22,878 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 563 transitions. [2023-08-31 23:29:22,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 563 transitions. [2023-08-31 23:29:22,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:29:22,879 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 563 transitions. [2023-08-31 23:29:22,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:22,882 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states 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:29:22,882 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states 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:29:22,882 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 143 flow. Second operand 5 states and 563 transitions. [2023-08-31 23:29:22,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 84 transitions, 532 flow [2023-08-31 23:29:22,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 84 transitions, 526 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:29:22,889 INFO L231 Difference]: Finished difference. Result has 48 places, 34 transitions, 165 flow [2023-08-31 23:29:22,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=165, PETRI_PLACES=48, PETRI_TRANSITIONS=34} [2023-08-31 23:29:22,890 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places. [2023-08-31 23:29:22,890 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 34 transitions, 165 flow [2023-08-31 23:29:22,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states 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:29:22,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:29:22,891 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:29:22,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-08-31 23:29:23,101 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:29:23,101 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:29:23,102 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:29:23,102 INFO L85 PathProgramCache]: Analyzing trace with hash -848942909, now seen corresponding path program 4 times [2023-08-31 23:29:23,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:29:23,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [326016943] [2023-08-31 23:29:23,103 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 23:29:23,103 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:29:23,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:29:23,104 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:29:23,107 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:29:23,202 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 23:29:23,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:29:23,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-31 23:29:23,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:29:23,386 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:29:23,387 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:29:23,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:29:23,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [326016943] [2023-08-31 23:29:23,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [326016943] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:29:23,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:29:23,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:29:23,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923115663] [2023-08-31 23:29:23,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:29:23,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:29:23,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:29:23,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:29:23,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:29:23,409 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 231 [2023-08-31 23:29:23,410 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 34 transitions, 165 flow. Second operand has 6 states, 6 states have (on average 103.0) internal successors, (618), 6 states have internal predecessors, (618), 0 states have call successors, (0), 0 states 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:29:23,410 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:29:23,410 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 231 [2023-08-31 23:29:23,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:29:23,719 INFO L130 PetriNetUnfolder]: 611/1330 cut-off events. [2023-08-31 23:29:23,720 INFO L131 PetriNetUnfolder]: For 1396/1396 co-relation queries the response was YES. [2023-08-31 23:29:23,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4199 conditions, 1330 events. 611/1330 cut-off events. For 1396/1396 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 8674 event pairs, 81 based on Foata normal form. 1/1330 useless extension candidates. Maximal degree in co-relation 4187. Up to 526 conditions per place. [2023-08-31 23:29:23,728 INFO L137 encePairwiseOnDemand]: 224/231 looper letters, 77 selfloop transitions, 9 changer transitions 0/92 dead transitions. [2023-08-31 23:29:23,728 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 92 transitions, 609 flow [2023-08-31 23:29:23,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:29:23,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:29:23,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 755 transitions. [2023-08-31 23:29:23,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46691403834260975 [2023-08-31 23:29:23,731 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 755 transitions. [2023-08-31 23:29:23,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 755 transitions. [2023-08-31 23:29:23,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:29:23,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 755 transitions. [2023-08-31 23:29:23,742 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:29:23,744 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 231.0) internal successors, (1848), 8 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states 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:29:23,745 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 231.0) internal successors, (1848), 8 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states 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:29:23,745 INFO L175 Difference]: Start difference. First operand has 48 places, 34 transitions, 165 flow. Second operand 7 states and 755 transitions. [2023-08-31 23:29:23,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 92 transitions, 609 flow [2023-08-31 23:29:23,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 92 transitions, 602 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-31 23:29:23,757 INFO L231 Difference]: Finished difference. Result has 57 places, 41 transitions, 214 flow [2023-08-31 23:29:23,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=214, PETRI_PLACES=57, PETRI_TRANSITIONS=41} [2023-08-31 23:29:23,758 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 17 predicate places. [2023-08-31 23:29:23,758 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 41 transitions, 214 flow [2023-08-31 23:29:23,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.0) internal successors, (618), 6 states have internal predecessors, (618), 0 states have call successors, (0), 0 states 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:29:23,759 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:29:23,759 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:29:23,771 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:29:23,968 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:29:23,969 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:29:23,969 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:29:23,969 INFO L85 PathProgramCache]: Analyzing trace with hash 218791323, now seen corresponding path program 5 times [2023-08-31 23:29:23,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:29:23,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [763535942] [2023-08-31 23:29:23,970 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-31 23:29:23,970 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:29:23,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:29:23,971 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:29:23,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-08-31 23:29:24,070 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:29:24,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:29:24,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-31 23:29:24,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:29:24,292 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:29:24,292 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:29:24,292 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:29:24,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [763535942] [2023-08-31 23:29:24,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [763535942] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:29:24,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:29:24,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:29:24,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144397859] [2023-08-31 23:29:24,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:29:24,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:29:24,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:29:24,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:29:24,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:29:24,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 231 [2023-08-31 23:29:24,342 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 41 transitions, 214 flow. Second operand has 7 states, 7 states have (on average 102.57142857142857) internal successors, (718), 7 states have internal predecessors, (718), 0 states have call successors, (0), 0 states 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:29:24,342 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:29:24,342 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 231 [2023-08-31 23:29:24,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:29:24,670 INFO L130 PetriNetUnfolder]: 647/1474 cut-off events. [2023-08-31 23:29:24,671 INFO L131 PetriNetUnfolder]: For 2084/2117 co-relation queries the response was YES. [2023-08-31 23:29:24,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5409 conditions, 1474 events. 647/1474 cut-off events. For 2084/2117 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 10040 event pairs, 97 based on Foata normal form. 33/1506 useless extension candidates. Maximal degree in co-relation 5393. Up to 566 conditions per place. [2023-08-31 23:29:24,681 INFO L137 encePairwiseOnDemand]: 225/231 looper letters, 60 selfloop transitions, 10 changer transitions 0/76 dead transitions. [2023-08-31 23:29:24,681 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 76 transitions, 527 flow [2023-08-31 23:29:24,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:29:24,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:29:24,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 746 transitions. [2023-08-31 23:29:24,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4613481756338899 [2023-08-31 23:29:24,684 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 746 transitions. [2023-08-31 23:29:24,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 746 transitions. [2023-08-31 23:29:24,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:29:24,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 746 transitions. [2023-08-31 23:29:24,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 106.57142857142857) internal successors, (746), 7 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:29:24,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 231.0) internal successors, (1848), 8 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states 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:29:24,689 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 231.0) internal successors, (1848), 8 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states 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:29:24,689 INFO L175 Difference]: Start difference. First operand has 57 places, 41 transitions, 214 flow. Second operand 7 states and 746 transitions. [2023-08-31 23:29:24,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 76 transitions, 527 flow [2023-08-31 23:29:24,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 76 transitions, 526 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:29:24,703 INFO L231 Difference]: Finished difference. Result has 64 places, 43 transitions, 255 flow [2023-08-31 23:29:24,704 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=255, PETRI_PLACES=64, PETRI_TRANSITIONS=43} [2023-08-31 23:29:24,704 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 24 predicate places. [2023-08-31 23:29:24,704 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 43 transitions, 255 flow [2023-08-31 23:29:24,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.57142857142857) internal successors, (718), 7 states have internal predecessors, (718), 0 states have call successors, (0), 0 states 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:29:24,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:29:24,705 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:29:24,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-08-31 23:29:24,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:29:24,915 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:29:24,915 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:29:24,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1110557623, now seen corresponding path program 6 times [2023-08-31 23:29:24,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:29:24,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [207827856] [2023-08-31 23:29:24,916 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-31 23:29:24,916 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:29:24,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:29:24,917 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:29:24,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-08-31 23:29:25,039 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2023-08-31 23:29:25,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-31 23:29:25,039 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:29:25,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:29:25,184 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-31 23:29:25,184 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:29:25,185 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-08-31 23:29:25,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-08-31 23:29:25,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-08-31 23:29:25,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-08-31 23:29:25,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-08-31 23:29:25,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-08-31 23:29:25,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-08-31 23:29:25,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-08-31 23:29:25,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-08-31 23:29:25,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-08-31 23:29:25,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-08-31 23:29:25,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-08-31 23:29:25,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-08-31 23:29:25,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-08-31 23:29:25,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:29:25,398 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1] [2023-08-31 23:29:25,402 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:29:25,402 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:29:25,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:29:25 BasicIcfg [2023-08-31 23:29:25,475 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:29:25,475 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:29:25,475 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:29:25,475 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:29:25,476 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:29:11" (3/4) ... [2023-08-31 23:29:25,478 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:29:25,478 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:29:25,479 INFO L158 Benchmark]: Toolchain (without parser) took 14945.77ms. Allocated memory was 83.9MB in the beginning and 148.9MB in the end (delta: 65.0MB). Free memory was 62.2MB in the beginning and 47.5MB in the end (delta: 14.7MB). Peak memory consumption was 80.1MB. Max. memory is 16.1GB. [2023-08-31 23:29:25,482 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 62.9MB. Free memory was 40.9MB in the beginning and 40.8MB in the end (delta: 97.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:29:25,483 INFO L158 Benchmark]: CACSL2BoogieTranslator took 486.44ms. Allocated memory is still 83.9MB. Free memory was 62.2MB in the beginning and 58.6MB in the end (delta: 3.7MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. [2023-08-31 23:29:25,483 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.77ms. Allocated memory is still 83.9MB. Free memory was 58.6MB in the beginning and 56.1MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-31 23:29:25,483 INFO L158 Benchmark]: Boogie Preprocessor took 59.33ms. Allocated memory is still 83.9MB. Free memory was 56.1MB in the beginning and 54.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:29:25,483 INFO L158 Benchmark]: RCFGBuilder took 795.70ms. Allocated memory is still 83.9MB. Free memory was 54.0MB in the beginning and 38.9MB in the end (delta: 15.1MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. [2023-08-31 23:29:25,484 INFO L158 Benchmark]: TraceAbstraction took 13516.06ms. Allocated memory was 83.9MB in the beginning and 148.9MB in the end (delta: 65.0MB). Free memory was 38.2MB in the beginning and 47.5MB in the end (delta: -9.3MB). Peak memory consumption was 55.1MB. Max. memory is 16.1GB. [2023-08-31 23:29:25,484 INFO L158 Benchmark]: Witness Printer took 2.90ms. Allocated memory is still 148.9MB. Free memory is still 47.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:29:25,485 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 62.9MB. Free memory was 40.9MB in the beginning and 40.8MB in the end (delta: 97.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 486.44ms. Allocated memory is still 83.9MB. Free memory was 62.2MB in the beginning and 58.6MB in the end (delta: 3.7MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.77ms. Allocated memory is still 83.9MB. Free memory was 58.6MB in the beginning and 56.1MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.33ms. Allocated memory is still 83.9MB. Free memory was 56.1MB in the beginning and 54.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 795.70ms. Allocated memory is still 83.9MB. Free memory was 54.0MB in the beginning and 38.9MB in the end (delta: 15.1MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. * TraceAbstraction took 13516.06ms. Allocated memory was 83.9MB in the beginning and 148.9MB in the end (delta: 65.0MB). Free memory was 38.2MB in the beginning and 47.5MB in the end (delta: -9.3MB). Peak memory consumption was 55.1MB. Max. memory is 16.1GB. * Witness Printer took 2.90ms. Allocated memory is still 148.9MB. Free memory is still 47.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.9s, 123 PlacesBefore, 40 PlacesAfterwards, 115 TransitionsBefore, 31 TransitionsAfterwards, 1996 CoEnabledTransitionPairs, 6 FixpointIterations, 48 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 113 TotalNumberOfCompositions, 4791 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2552, independent: 2405, independent conditional: 0, independent unconditional: 2405, dependent: 147, dependent conditional: 0, dependent unconditional: 147, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1095, independent: 1053, independent conditional: 0, independent unconditional: 1053, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2552, independent: 1352, independent conditional: 0, independent unconditional: 1352, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 1095, unknown conditional: 0, unknown unconditional: 1095] , Statistics on independence cache: Total cache size (in pairs): 109, Positive cache size: 93, Positive conditional cache size: 0, Positive unconditional cache size: 93, 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_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 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; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L829] 0 pthread_t t1828; [L830] FCALL, FORK 0 pthread_create(&t1828, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1828, ((void *)0), P0, ((void *)0))=0, t1828={-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] [L831] 0 pthread_t t1829; [L832] FCALL, FORK 0 pthread_create(&t1829, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1829, ((void *)0), P1, ((void *)0))=1, t1828={-6:0}, t1829={-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] [L833] 0 pthread_t t1830; [L834] FCALL, FORK 0 pthread_create(&t1830, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1830, ((void *)0), P2, ((void *)0))=2, t1828={-6:0}, t1829={-10:0}, t1830={-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=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] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 1 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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] [L784] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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] [L801] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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] [L804] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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=2] [L744] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 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) [L752] 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)) [L753] 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)) [L754] 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)) [L755] 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)) [L756] 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)) [L757] 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)) [L758] 1 __unbuffered_p0_EBX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L787] 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) [L788] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] 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 [L790] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] 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=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$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=2] [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 2 return 0; [L807] 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) [L808] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] 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 [L810] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] 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=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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=2] [L814] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L816] 3 return 0; [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 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) [L841] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L842] 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 [L843] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L844] 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=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1828={-6:0}, t1829={-10:0}, t1830={-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=2] [L847] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L849] 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=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=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=2] - 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: 827]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 832]: 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: 830]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 144 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 360 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 279 mSDsluCounter, 159 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 125 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1181 IncrementalHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 34 mSDtfsCounter, 1181 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 144 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=255occurred in iteration=10, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 163 NumberOfCodeBlocks, 163 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 133 ConstructedInterpolants, 0 QuantifiedInterpolants, 604 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1245 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-31 23:29:25,515 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